摘要
已知数据收集协议中利用分簇技术可以提高无线传感器网络的可扩展性和鲁棒性。引入移动汇点(MS)漫游网络可以平衡网络节点间的能量消耗,提高网络通信效率。提出一种基于移动汇点的无线传感器网络数据收集协议,利用分簇技术生成通信半径相等的簇,由剩余能量相对充足的节点构成簇首。采用一种能量高效的分布式算法对由簇首构成的骨干网构建最小生成树,在此基础上借助解决旅行售货商问题(TSP)的思路,构建一条路径尽可能短的MS移动轨迹。模拟实验结果表明,该数据收集协议比同类模式产生了更短的移动轨迹,显著地延长了网络的存活时间。
Clustering in Wireless Sensor Networks (WSNs)provides scalability and robustness for the network. Recently, Sink mobility has been exploited to reduce and balance energy expenditure among sensors. We propose a solution for data collection with mobile sinks using clustering and traveling salesman problem (TSP)techniques. A distributed algorithm for clustering is presented, and then the MST ( Mobile Sink Trajectory) of cluster heads is computed,which is used as the underlying framework to generate a moving path. Simulation analysis shows that the length of sink trajectory is shorter than other similar schemes, and the network lifetime is improved greatly.
出处
《传感技术学报》
CAS
CSCD
北大核心
2012年第5期678-682,共5页
Chinese Journal of Sensors and Actuators
基金
浙江省教育厅科研项目(Y201017035)
关键词
无线传感器网络
移动汇点
分布式算法
最小生成树
哈密顿圈
wireless sensor network
mobile sink
distributed algorithms
minimum spanning tree
hamiltonion cycle