| 基于Voronoi图的移动单元节点调度算法 |
| |
| 引用本文： | 于瑞云,王兴伟.基于Voronoi图的移动单元节点调度算法[J].计算机工程,2010,36(1):91-93,9. |
| |
| 作者姓名： | 于瑞云 王兴伟 |
| |
| 作者单位： | 1. 东北大学计算中心,沈阳,110004
2. 东北大学信息科学与工程学院,沈阳,110004 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划)，国家自然科学基金 |
| |
| 摘 要： | 在稀疏无线传感器网络中，移动单元节点常被用于数据采集和转发。基于Voronoi图设计一条尽可能短的移动单元节点数据采集路径。在该路径中，移动单元节点被调度去访问一个Voronoi节点子集，在给定通信半径内，该节点子集能覆盖所有传感器节点。仿真实验结果表明，通过连接Voronoi节点子集而形成的优化路径能有效缩短移动单元节点的行进路径长度。
|
| 关 键 词： | 稀疏无线传感器网络 Voronoi图 移动单元节点 数据采集 |
| 修稿时间： | |
Voronoi Diagram-based Mobile Element Schedule Algorithm |
| |
| YU Rui-yun,WANG Xing-wei.Voronoi Diagram-based Mobile Element Schedule Algorithm[J].Computer Engineering,2010,36(1):91-93,9. |
| |
| Authors: | YU Rui-yun WANG Xing-wei |
| |
| Affiliation: | (1. Computing Center, Northeastern University, Shenyang 110004; 2. College of Information Science and Engineering, Northeastern University, Shenyang 110004) |
| |
| Abstract: | Mobile Element(ME) are usually exploited for collecting and relaying data in sparse wireless sensor networks. This paper proposes the Voronoi Diagram-based Mobile Element Schedule(VDMES) algorithm to construct the shortest possible path for ME data collection. ME are scheduled to visit a small subset of Voronoi vertices, which exactly covers all sensor nodes in a given transmission radius. Simulation experimental result shows that the path concatenating the Voronoi vertices is much shorter than that formed by regular sensor nodes. |
| |
| Keywords: | sparse wireless sensor networks Voronoi diagram Mobile Element(ME) data collection |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
