| 三维无线移动传感器网络k-覆盖研究 |
| |
| 引用本文： | 刘春梅.三维无线移动传感器网络k-覆盖研究[J].现代电子技术,2012,35(1):52-54,58. |
| |
| 作者姓名： | 刘春梅 |
| |
| 作者单位： | 长江大学文理学院,湖北荆州,434020 |
| |
| 摘 要： | 考虑移动传感器的移动会大量消耗能量且比较昂贵,使用密度为O（k）的移动传感器来满足网络k-覆盖的密度需求,并给出了网络要达到k-覆盖传感器需移动的最大距离的一个界O（（log L）1/3）;建立了三维网络传感器移动数学模型,将传感器重新部署问题转化为最大网络流问题,用分布式重新部署算法仿真证明了其有效性。
|
| 关 键 词： | 无线传感器网络 k-覆盖 最大移动距离 最大网络流算法 |
The K-coverage of three-dimensional wireless mobile sensor network |
| |
| LIU Chun-mei.The K-coverage of three-dimensional wireless mobile sensor network[J].Modern Electronic Technique,2012,35(1):52-54,58. |
| |
| Authors: | LIU Chun-mei |
| |
| Affiliation: | LIU Chun-mei(Yangtze University College of Arts and Science,Jingzhou 434020,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | wireless sensor network k-coverage maximum moving distance maximum network flow algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
