北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2013, Vol. 36 ›› Issue (5): 51-55.doi: 10.13190/j.jbupt.2013.05.011

• 论文 • 上一篇    下一篇

移动Sink环境下的无线传感器网络数据收集节能算法

丁杰, 刘丹谱   

  1. 北京邮电大学 网络体系构建与融合北京市重点实验室, 北京 100876
  • 收稿日期:2012-11-15 出版日期:2013-10-31 发布日期:2013-08-09
  • 作者简介:丁杰(1979-),男,博士生,E-mail:xueyuanding@126.com;刘丹谱(1972-),女,教授,博士生导师.
  • 基金资助:

    北京市自然科学基金项目(4122034);国家自然科学基金项目(61171107,61271257);国家高技术研究发展计划项目(2011AA100706);中央高校基本科研业务费专项资金项目(G470519)

Energy Saving Algorithm for Data Collection of Wireless Sensor Networks in Mobile Sink Environments

DING Jie, LIU Dan-pu   

  1. Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2012-11-15 Online:2013-10-31 Published:2013-08-09

摘要:

针对存在汇聚节点和移动sink场景下的数据收集问题,提出了一种联合考虑汇聚节点选取、普通节点到汇聚节点路由以及移动sink路径的启发式数据收集算法。应用图论对网络进行建模,采用最小连通支配集作为初始种子汇聚节点集,通过迭代确定最终的汇聚节点集、对汇聚节点集的最短遍历路径和普通节点到汇聚节点的最短路由。该算法在保证数据时延要求的条件下,减少了传感器节点到汇聚节点的数据传输,从而节省能耗。

关键词: 无线传感器网络, 移动sink, 汇聚节点, 旅行商算法

Abstract:

For data collection in the presence of mobile sink and rendezvous points, a heuristic scheme is proposed jointly considering rendezvous selection, routing from sensors to rendezvous points and mobile sink path scheduling. The graph theory is used to model the network, and the minimum connected dominating set is selected as the initial rendezvous set. The final rendezvous set, the shortest path of mobile sink and the shortest route between sensors and rendezvous points are acquired through iteration procedure. The algorithm can reduce the data transmission from sensor nodes to rendezvous with guarantee of latency, thereby saving energy.

Key words: wireless sensor networks, mobile sink, rendezvous point, algorithm for traveling salesman problem

中图分类号: