摘要
针对无线传感器网络的冗余覆盖问题,在K-覆盖判定算法和部分冗余覆盖算法基础上,提出一种可调冗余覆盖算法。该算法遵循覆盖最大化原则,能降低网络能耗。在可调冗余覆盖算法处理后的高效网络中,给出结合最短路径和最小生成树的最短路径树算法,在网络中构建若干棵以Sink节点为根的最短路径树,进一步降低网络能耗。仿真结果表明,在随机部署网络中,当规定网络覆盖冗余度为2时,2种算法平均可降低能耗20.27%左右。
Aiming at the problem of redundant coverage of the nodes in Wireless Sensor Network（WSN）,an adjustable redundant covering algorithm is proposed based on K-coverage determination algorithm and partial redundancy covering algorithm.The algorithm follows the principle of maximizing coverage of the network while reducing energy consumption.After the efficient network is processed with the adjustable redundant covering algorithm,an energy-saving routing algorithm combined with the shortest path and the minimum spanning tree is posed.This algorithm constructs a number of shortest path trees to the Sink node for the root in the network,which reduce the energy consumption of network.Simulation results show that when the coverage redundancy is set for two,the two algorithms can reduce about 20.27% the energy consumption in the randomly deployed network.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第23期86-88,92,共4页
Computer Engineering
基金
国家自然科学基金资助项目(60873047)
江苏省自然科学基金资助项目(BK2008154)
关键词
无线传感器网络
覆盖算法
冗余覆盖
节能路由
最短路径树
Wireless Sensor Network（WSN）
coverage algorithm
redundant coverage
energy efficient routing
shortest path tree
