三维无线移动传感器网络k-覆盖研究

摘要

Considering the mobile sensor is expensive and consumes a lot of energy on moving. A part of mobile sensor with density of O(k) was used to meet the demand of k-coverage of three dimensional network. To achieve k- coverage,it received the maximum moving distance for mobile sensor is O((log L)1/3) in a network with a size of L. At last, it established a mathematical mobility model for mobile sensors, and converted the sensor redeployment for k-coverage into maximum network flow problem. It is verified through experimental simulation by distributed relocation algorithm.%考虑移动传感器的移动会大量消耗能量且比较昂贵,使用密度为O(k)的移动传感器来满足网络k-覆盖的密度需求,并给出了网络要达到k-覆盖传感器需移动的最大距离的一个界O(logL)1/3)；建立了三维网络传感器移动数学模型,将传感器重新部署问题转化为最大网络流问题,用分布式重新部署算法仿真证明了其有效性.