基于准格型策略的无线传感网协作覆盖算法

刘志; 裘正定

doi:10.3724/SP.J.1146.2009.01420

基于准格型策略的无线传感网协作覆盖算法

doi: 10.3724/SP.J.1146.2009.01420

刘志,
裘正定

基金项目:

国家973规划基金(2007CB307100)资助课题

计量
- 文章访问数: 3236
- HTML全文浏览量: 100
- PDF下载量: 691
- 被引次数: 0
出版历程
- 收稿日期: 2009-11-02
- 修回日期: 2010-02-15
- 刊出日期: 2010-10-19

Quasi-grid Based Cooperative Coverage Algorithm for Wireless Sensor Networks

摘要

摘要: 该文提出了一种基于准格型策略的无线传感网协作覆盖QGCC(Quasi-Grid based Cooperative Coverage)算法，通过在随机分布节点中构造准格型结构并结合协作感测模型，减少活动节点数量，延长覆盖周期。QGCC设计了低复杂度的分布式虚拟网格确定方法及能量高效的节点调度策略，定义了不规则度指标以分析网络的不规则程度对覆盖性能的影响。仿真实验表明，相比于参照算法，QGCC能够较大程度地减少活动节点的数量，大幅延长网络的覆盖周期；此外，该算法的覆盖周期和节点密度具有近似线性的关系，且比参考算法具有更大的斜率，说明其对冗余节点具有更高的利用效率。
- 无线传感器网络 /
- 准格型策略 /
- 虚拟网格 /
- 协作覆盖
Abstract: A new algorithm named QGCC (Quasi-Grid based Cooperative Coverage) is proposed in this paper, which employs virtual quasi-grid structure and cooperative sensing model to reduce the number of active nodes, and to prolong the coverage lifetime. In QGCC, a low-complexity distributed method is designed to determine the vertexes of grid, and an energy efficient node scheduling scheme is presented. QGCC also introduces a new metric named irregularity to analyze the impact of the deviation between keeper and its ideal vertex. Simulations show that, compared to the reference algorithms, QGCC can efficiently reduce the number of active nodes, and prolong the coverage lifetime. Another notable feature of QGCC is that, the coverage lifetime is approximate linear related to the number of nodes, which means this algorithm can make good use of redundant nodes.
- Wireless Sensor Networks (WSN) /
- Quasi-grid strategy /
- Virtual grid /
- Cooperative coverage

HTML全文

参考文献(1)

Kershner R. The number of circles covering a set[J].American Journal of Mathematics.1939, 61(3):665-671[2]Wang Y C, Hu C C, and Tseng Y C. Efficient placement and dispatch of sensors in a wireless sensor network[J].IEEE Transactions on Mobile Computing.2008, 7(2):262-274[3]Bai X L, Yun Z Q, and Xuan D, et al.. Deploying four-connectivity and full-coverage wireless sensor networks[C].IEEE INFOCOM 2008, Phoenix AZ, USA, Apr. 15-17, 2008: 906-914.[4]Liu X W and Haenggi M. Toward quasiregular sensor networks: topology control algorithms for improved energy efficiency[J].IEEE Transactions on Parallel and Distributed Systems.2006, 17(9):975-986[5]Zhang H H, Hou J C. Maintaining sensing coverage and connectivity in large sensor networks[J]. Ad hoc and Sensor Networks, 2005, 1(1/2): 89-124.[6]Ammari H M and Das S K. Joint k-coverage, duty-cycling, and geographic forwarding in wireless sensor networks[C]. IEEE Symposium on Computers and Communications, Sousse, Tunisia, Jul. 5-8, 2009: 487-492.[7]Ammari H M and Das S K. Clustering-based minimum energy wireless m-connected k-covered sensor networks[J].Lecture Notes in Computer Science.2008, 4913:1-16[8]Jiang J R and Sung T M. Energy-efficient coverage and connectivity maintenance for wireless sensor networks[J]. Journal of Networks, 2009, 4(6): 403-410.[9]Yang B W and Yu H Y. An energy efficient cooperative density control algorithm in large wireless sensor networks[C]. Wireless Communications and Networking Conference 2007, Hong Kong, China, Mar. 11-15, 2007: 4105-4109.[10]Xing G L, Wang X R, and Zhang Y F, et al.. Integrated coverage and connectivity configuration for energy conservation in sensor networks[J].ACM Transactions on Sensor Networks (TOSN.2005, 1(1):36-72[11]Olveczky P C and Thorvaldsen S. Formal modeling and analysis of wireless sensor network algorithms in real-time maude[J].Lecture Notes in Computer Science.2007, 4468:122-140

施引文献

资源附件(0)

访问统计