节点文献
无交集节点分组实现多重覆盖的算法
Solution for multi-coverage based on disjoint-subsets division
【摘要】 为了监测某些关键区域,通常采用传感器节点的冗余布置。分析了如何利用冗余节点以提升网络服务时间,以提高服务质量这一问题。研究了冗余布置条件下的实现多重覆盖这一服务要求,提出了一个基于分组覆盖的多重覆盖解决方案,设计了分组算法。实验结果表明,该分组算法比随机选择分组算法能有效的增加所得组数,它延长网络生存时间,提高服务质量。
【Abstract】 In order to detect some critical area,it will deploy a large number of sensors.How to make use of the redundancy to prolong the survivable time of networks.This is also a critical aspect on deal with the power-constrained wireless sensor and improves the QoS of the network.A solution is proposed to cope with these requirements,and an algorithm to obtain more disjoint-subsets than a random select method is given.Simulation results are presented to verify the new method achieves a significant time prolonging of the network.
【关键词】 无线传感器网络;
服务时间;
冗余布置;
多重覆盖;
无交集划分;
【Key words】 wireless sensor networks; server time; redundant deployment; multi-coverage; disjoint division;
【Key words】 wireless sensor networks; server time; redundant deployment; multi-coverage; disjoint division;
- 【文献出处】 计算机工程与设计 ,Computer Engineering and Design , 编辑部邮箱 ,2008年18期
- 【分类号】TN929.5;TP212.9
- 【被引频次】1
- 【下载频次】57