一种无线传感网络的三维K覆盖算法
首发时间:2012-03-14
摘要:为了保证无线传感网在三维空间中鲁棒性,本文提出了一种在大规模三维环境中无线传感网络k覆盖控制算法,目标环境可以是一定程度上不规则的空间。对三维空间按一定粒度以点的形式进行剖分,用迭代的贪婪的启发式方法确定传感器在点分之后的空间中的位置,每一步迭代完成一个传感器节点的放置,直到所有划分点被k覆盖。仿真算例表明,此算法可以快速、有效的解决大规模、不规则目标区域中的k覆盖问题,并与随机策略的算法相比,达到相同的覆盖目的有着明显的优越性。
For information in English, please click here
A Three-dimensional K-coverage Algorithm for Wireless Sensor Networks
Abstract:IFor ensuring robustness of wireless sensor networks in three-dimensional space, this paper presents a k-coverage algorithm in large-scale three-dimensional wireless sensor networks and the target environment can be irregular to a certain extent. Firstly, the three-dimensional target environment is divided in the form of points according to a certain granularity. And then, determine the position of sensors in the processed space with the iterative greedy heuristic method. After each iteration, complete the placement of a sensor node until the all granularity points can be k-covered . From the simulation examples we can see that this algorithm can solve large and irregular target area k-coverage problem quickly and efficiently, and compare with the algorithm of random strategy, the former has obvious advantages to achieve the same target.
Keywords: computer application technoledge WSN three-dimensional space k-coverage
论文图表:
引用
No.****
同行评议
共计0人参与
勘误表
一种无线传感网络的三维K覆盖算法
评论
全部评论0/1000