摘要
节能是无线传感器网络研究的重要课题。基于最大覆盖集问题,研究网络节能策略。首先,提出了基于令牌分发的分布式的路径收集机制,Sink节点可获得与每一传感节点的最多K条路径,可调节参数K实现算法性能与网络通信开销的均衡;然后,以精选的路径信息为根据,提出迭代优化的覆盖集构造机制,每一轮覆盖集构造时,尽可能使其节点数最少;最后,对本文提出的节能策略与算法进行仿真实验。仿真实验表明,本算法表现好于其它两算法,并且分析了算法参数对实验结果的影响。
Energy conservation in wireless sensor networks is an important research subject. In this paper, we studied energy conservation in wireless sensor networks based on the maximum cover sets problem. First, the distributed token-based mechanism was proposed for the collection of the path be-tween a sink and a sensor. Through the mechanism, sink nodes can collect at most K paths for each sensor, and the parameter K can be adjusted to make a balance between algorithm performance and communication overhead. Then, based on the selected paths, an iterative optimization mechanism was presented to find a cover set of the network while using the number of sensors as small as possible. Finally, simulation work was done to evaluate the proposed energy-saving strategies and algorithms. Simulation results show that the proposed algorithm performs better than the other two algorithms. Moreover, experimental analysis shows that algorithm parameters have the impact on the experimental results.
出处
《计算机工程与科学》
CSCD
北大核心
2013年第4期47-52,共6页
Computer Engineering & Science
基金
国家自然科学基金资助项目(61103202)
教育部博士点新教师类基金资助项目(20110162120046)
关键词
无线传感器网络
节能
覆盖集
节点组织
wireless sensor network energy conservation
cover set
node organization
