计算机工程 ›› 2010, Vol. 36 ›› Issue (1): 91-93,9.doi: 10.3969/j.issn.1000-3428.2010.01.032

• 网络与通信 • 上一篇    下一篇

基于Voronoi图的移动单元节点调度算法

于瑞云1,王兴伟2   

  1. (1. 东北大学计算中心,沈阳 110004;2. 东北大学信息科学与工程学院,沈阳 110004)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-01-05 发布日期:2010-01-05

Voronoi Diagram-based Mobile Element Schedule Algorithm

YU Rui-yun1, WANG Xing-wei2   

  1. (1. Computing Center, Northeastern University, Shenyang 110004; 2. College of Information Science and Engineering, Northeastern University, Shenyang 110004)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-01-05 Published:2010-01-05

摘要: 在稀疏无线传感器网络中,移动单元节点常被用于数据采集和转发。基于Voronoi图设计一条尽可能短的移动单元节点数据采集路径。在该路径中,移动单元节点被调度去访问一个Voronoi节点子集,在给定通信半径内,该节点子集能覆盖所有传感器节点。仿真实验结果表明,通过连接Voronoi节点子集而形成的优化路径能有效缩短移动单元节点的行进路径长度。

关键词: 稀疏无线传感器网络, Voronoi图, 移动单元节点, 数据采集

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.

Key words: sparse wireless sensor networks, Voronoi diagram, Mobile Element(ME), data collection

中图分类号: