欢迎访问中国科学院大学学报,今天是

中国科学院大学学报 ›› 2007, Vol. 24 ›› Issue (4): 401-407.DOI: 10.7523/j.issn.2095-6134.2007.4.001

• 论文 •    下一篇

多源单汇无线传感器网络的局部路由算法

孙波 高随祥 迟 锐 黄 菲   

  1. 中国科学院研究生院 数学科学学院
  • 收稿日期:1900-01-01 修回日期:1900-01-01 发布日期:2007-07-15

Algorithms for Localized Routing in Many-to-One Wireless Sensor Networks

SUN Bo, GAO Sui-Xiang, CHI Rui, HUANG Fei   

  1. Department of Mathematics, Graduate University of Chinese Academy of Sciences
  • Received:1900-01-01 Revised:1900-01-01 Published:2007-07-15

摘要: 无线传感器网络节点有着严格的能量限制,目前已有的许多路由协议假定了节点知道网络的全局信息或者让节点根据路由表进行路由。这些方式均会使网络产生较多的通信负荷,增大能量开销。结合多源单汇路由的特点,本文提出了几种局部路由算法。该算法中,节点仅根据目标节点与邻居节点的地理位置、剩余能量等信息,决定下一跳节点,最终建立到达目的节点的路径。本文首次引入了带约束后跳发射的思想,并将这种后跳发射与已有的算法相结合得到新的后跳路由算法。计算机仿真实验表明,在有数据融合的网络中,带约束的后跳-为难度路由算法使得网络的生存时间最长,较其余算法增加了网络11%和14%的工作周期数。最后又将局部路由算法进行合理改进,得到最小化平均为难度的算法,应用于无数据融合的网络中,效果很好。

关键词: 传感器网络, 局部路由, 算法

Abstract: In wireless sensor networks, sensors are severely constrained by the amount of battery power. In most existing protocols, nodes are assumed to have the global information of networks, which will cost too much energy expenditure. In this article, several localized routing algorithms are proposed for the many-to-one routing. When routing, nodes make routing decisions solely on the information of their neighbors and destination. Besides, the concept of constrained backward transmission is proposed by the first time. We combine the idea of backward transmission with existing localized algorithms. Simulation experiments show that the backward minimizing reluctance algorithm performs effectively in terms of extending the lifetime of networks, which prolongs at least 12% and 16% rounds than others. At last, algorithms are adapted to the networks where nodes can not fuse data, the average-reluctance routing algorithm works efficiently.

Key words: wireless sensor networks, localized routing, algorithm

中图分类号: