摘要
针对无线传感网络(WSNs)如何以最少的传感节点实现目标覆盖和网络连通问题,提出基于目标覆盖感知的节点部署算法(Target Coverage Aware-based Node Placement,TCA-NP)。TCA-NP算法将节点部署问题具体化两个子问题:目标覆盖(Target Covering,TC)和网络连通(Network Connectivity,NC)。具体而言,对于TC问题,通过k-means簇算法将所有目标划分不同簇,然后将传感节点放置最优位置,进而实现最优的覆盖;对于NC问题,引用贪婪算法计算部署中继节点的位置。实验数据表明,与同类算法相比,提出的TCA-NP算法所需的节点数大大低于其它算法。
Aiming at the problem of how to achieve target coverage and network connectivity with the least sensor nodes in wireless sensor networks( WSNs),Target Coverage Aware-based Node Placement( TCA-NP) algorithm is proposed. Specially,We formulate the problem as two sub-problems. The first one( named as TC) is for placing sensor nodes to cover all targets and the second one( named as NC) is for placing relay nodes to connect sensor nodes to the sinks. For TC problem,TCA-NP exploits k-means clustering algorithm,specifically,the targets are clustered into groups,sensor nodes are placed at appropriate locations to achieve the full coverage;For NC problem,TCA-NP used greedy algorithm to solve it.The experiment results show that the number of nodes required by the proposed TCA-NP algorithm is much lower than that of other algorithms.
作者
符春
FU Chun(Changsha Social Work College,school of software,Changsha 410004,China)
出处
《中国电子科学研究院学报》
北大核心
2019年第10期1027-1031,1061,共6页
Journal of China Academy of Electronics and Information Technology
基金
湖南省教育科研项目(15C0082)
湖南省教育改革研究项目(ZJGB2019008)
关键词
无线传感网络
目标覆盖
网络连通
K-均值
贪婪算法
Wireless Sensor Networks
Target Coverage
Network Connectivity
k-means
Greedy Algorithm
