您的位置：首页 > 论文页面
一种无线传感网的三维k覆盖算法
发表时间：2012-10-31 浏览量：1259 下载量：298
| 全部作者： | 方钰，左伟 |
| 作者单位： | 同济大学电子与信息工程学院 |
| 摘 要： | 为保证无线传感网（wireless sensor network, WSN）在三维空间中的鲁棒性，提出一种在大规模三维环境中WSN的k覆盖控制算法，目标环境可以是一定程度上不规则的空间。对三维空间按一定粒度以点的形式进行剖分，用迭代贪心的启发式方法确定传感器在点分之后空间中的位置，每一步迭代完成一个传感器节点的放置，直到所有划分点被k覆盖。仿真算例表明：此算法可以快速、有效地解决大规模、不规则目标区域中的k覆盖问题，在相同覆盖目标下，与随机策略的算法相比，具有明显的优越性。 |
| 关 键 词： | 计算机应用；无线传感网；三维空间；k覆盖 |
| Title： | A three-dimensional k-coverage algorithm for wireless sensor networks |
| Author： | FANG Yu, ZUO Wei |
| Organization： | School of Electronics and Information, Tongji University |
| Abstract： | For ensuring robustness of wireless sensor networks (WSN) in three-dimensional space, this paper presented a k-coverage algorithm in large-scale three-dimensional wireless sensor networks and the target environment could be irregular to a certain extent. Firstly, the three-dimensional target environment was divided into the form of points according to a certain granularity. And then, the position of sensors in the processed space was determined with the iterative greedy heuristic method. The placement of a sensor node was completed after each iteration until the all granularity points could be k-covered. The simulation examples showed that this algorithm could solve the problems of large and irregular target area k-coverage quickly and efficiently. When comparing with the algorithm of random strategy, under the same coverage target, this algorithm had obvious advantages. |
| Key words： | computer application; wireless sensor network; three-dimensional space; k-coverage |
| 发表期数： | 2012年10月第20期 |
| 引用格式： | 方钰，左伟. 一种无线传感网的三维k覆盖算法[J]. 中国科技论文在线精品论文，2012，5（20）：1975-1981. |
0
评论数 0请您登录
暂无评论
下载全文
多维论文