| 摘要: |
| 覆盖与连通问题是无线传感器网络的基本问题.研究考虑连通性的概率覆盖增强算法,构建覆盖空洞的修补半径,提出了移动距离和修补半径的关系模型.通过这个关系模型,移动节点在修补圆上选择保持连通的修补位置;根据这个移动距离和空洞面积,移动节点进一步创建空洞的优先级,选择优先级最高的空洞进行修补,节能而高效地实现覆盖增强.仿真结果表明,所提出的算法既能得到较高的覆盖率,又能保证整个网络的连通性. |
| 关键词: 分布式的概率空洞修补算法 覆盖空洞 连通空洞 联合感知概率 修补半径 移动距离 优先级 |
| DOI：10.13328/j.cnki.jos.004837 |
| 分类号: |
| 基金项目:国家科技支撑计划(2012BAD10B01) |
|
| Algorithm for Enhancing Probabilistic Coverage in Wireless Sensor Network |
|
FAN Xing-Gang, YANG Jing-Jing, WANG Heng
|
|
School of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310023, China
|
| Abstract: |
| Coverage and connectivity are basic problems in WSN. This paper studies distributed coverage and connection hole repairing scheme (DHCRS) based on the probabilistic sensing model in hybrid WSN. This method detects probabilistic coverage holes and builds the model of their repairing radius. It also creates relationship model between the repairing radius and the repairing displacement of mobile sensor. This displacement not only determines the priority of the hole with its area, but also confirms the destination of mobile sensor in repairing circle of coverage hole. Once mobile node moved to this location, coverage hole simultaneously satisfy minimum detection probability and connectivity. Each mobile sensor repairs the hole of the highest priority. Simulation results show the proposed algorithm effectively obtains better probabilistic coverage rate and maintains the network connectivity at the same time. |
| Key words: DHCRS coverage hole connection hole joint detection probability repairing radius displacement priority |
