| 三维空间实现全覆盖的传感节点优化分布算法 |
| |
| 引用本文： | 王亚丽,周运. 三维空间实现全覆盖的传感节点优化分布算法[J]. 河南师范大学学报(自然科学版), 2012, 40(3): 166-169 |
| |
| 作者姓名： | 王亚丽 周运 |
| |
| 作者单位： | 河南师范大学 计算机与信息技术学院,河南新乡,453007 |
| |
| 基金项目： | 河南省教育厅自然科学基础研究计划 |
| |
| 摘 要： | 针对无线传感网中重要的覆盖问题,已有多种算法来解决这个问题.通过分析这些算法,提出了一种三维空间下的基于网格点的随机算法的改进算法.算法分为两个阶段,初始阶段采用随机算法获得一个初始部署集以实现完全覆盖,在此基础上对初始部署集进行优化,达到在满足完全覆盖的前提下部署集的最小化.实验结果显示了算法在实现最大覆盖的基础上部署集优于已提出的贪心算法和线性规划算法.
|
| 关 键 词： | 传感网络 覆盖 部署集 随机分布 三维空间 |
Optimal Sensor Distribution Algorithm Achieveing Full Coverage in 3D Space |
| |
| WANG Ya-li , ZHOU Yun. Optimal Sensor Distribution Algorithm Achieveing Full Coverage in 3D Space[J]. Journal of Henan Normal University(Natural Science), 2012, 40(3): 166-169 |
| |
| Authors: | WANG Ya-li ZHOU Yun |
| |
| Affiliation: | (College of Computer and Information Technology,Henan Normal University,Xinxiang 453007,China) |
| |
| Abstract: | This paper has studied crucial coverage problem of wireless sensor networks.At present,there are many solutions to solve the problem.Through analysis of the algorithms,proposed a random optimal distribution algorithm in 3D wireless sensor networks.The algorithm consists of initial deployment and optimal deployment.Initial deployment has obtained a initial deployment set which can cover 100% monited area by random algorithm.Then optimized initial deployment set in order to minimize it.The results indicate that proposed algorithm is superior to LIP algorithm and greedy algorithm. |
| |
| Keywords: | sensor network coverage deployment set random distribution 3D space |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
