东北大学学报(自然科学版) ›› 2009, Vol. 30 ›› Issue (12): 1718-1722.DOI: -

• 论著 • 上一篇    下一篇

传感器网络中基于加权Voronoi图的能量均衡数据采集算法

于瑞云;王兴伟;易秀双;   

  1. 东北大学软件学院;东北大学信息科学与工程学院;东北大学计算中心;
  • 收稿日期:2013-06-22 修回日期:2013-06-22 出版日期:2009-12-15 发布日期:2013-06-22
  • 通讯作者: Yu, R.-Y.
  • 作者简介:-
  • 基金资助:
    国家高技术研究发展计划项目(2006AA01Z214);;

Energy-balancing data collection based on the multiplicatively weighted voronoi diagram in sensor networks

Yu, Rui-Yun (1); Wang, Xing-Wei (2); Yi, Xiu-Shuang (3)   

  1. (1) School of Software, Northeastern University, Shenyang 110004, China; (2) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China; (3) Computing Center, Northeastern University, Shenyang 110004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2009-12-15 Published:2013-06-22
  • Contact: Yu, R.-Y.
  • About author:-
  • Supported by:
    -

摘要: 基于乘法加权Voronoi图在稀疏无线传感器网络中设计了一条优化的数据采集路径.在这个优化路径中,移动采集节点访问一个虚拟Voronoi图的节点子集进行数据收集.这个Voronoi图节点子集是通过精心设计的迭代过程生成的,在给定通信半径内,能够覆盖所有的传感器节点,同时考虑了传感器节点的能量均衡消耗.连接Voronoi节点子集形成的优化路径缩短了数据采集路径的长度,从而缩短了数据采集时延.通过调整虚拟Voronoi图的覆盖系数,可实现满足不同要求的综合考虑时延与能量消耗的折中方案.

关键词: 无线传感器网络, 加权Voronoi图, 移动采集节点, 能量均衡, 数据采集

Abstract: Based on the multiplicatively weighted Voronoi diagram, an optimized path is designed to acquire data in sparse sensor networks. In the path, the data acquisition is implemented via the mobile acquiring nodes to visit a vertex subset of the virtual Voronoi diagram which is constructed through an iterative virtual site insertion process. The vertex subset covers all sensor nodes in a given transmission radius with the balanced energy consumption taken into consideration. The optimized path concatenating the vertex subset is much shorter than that generated by sensor nodes, thus reduces the time delay in data acquisition. A trade-off between time delay and energy consumption is implemented to meet different requirements by adjusting the coverage coefficient of virtual Voronoi diagram.

中图分类号: