WSNs中基于Voronoi图的分布式覆盖协议

Distributed Coverage Protocol Based on Voronoi Diagram in Wireless Sensor Networks

研究网络随机部署情况下的覆盖问题,提出基于Voronoi图的分布式覆盖协议。采用分布式节点冗余判断算法来判断传感器节点自身的冗余性,据此对节点进行相应的职能调度。当网络中节点的通信半径大于或等于其感应半径的2倍时,该协议能达到网络完全覆盖及连通的要求。通过该协议的推广,满足了覆盖度动态变化的要求,保证网络的k-度覆盖。

This paper focuses on the coverage issue in randomly deployed Wireless Sensor Networks（WSNs） and proposes a Voronoi diagram-based distributed coverage protocol. The protocol adopts a distributed eligibility algorithm for detecting redundancy of sensor nodes and scheduling their duties accordingly. It can achieve both coverage and connectivity when the communication range of sensor nodes is at least twice the sensing range of sensor nodes. It is extended to maintain k-coverage to handle the case of dynamic change of coverage degree.