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

Algorithms for localized routing in many-to-one wireless sensor networks

作　　者：孙波[1] 高随祥[1] 迟锐[1] 黄菲[1] 

机构地区：[1]中国科学院研究生院数学科学学院,北京100049

出　　处：《中国科学院研究生院学报》2007年第4期401-407,共7页Journal of the Graduate School of the Chinese Academy of Sciences

基　　金：国家自然科学基金项目(10171095;10671204)资助;国家863计划重大专项(2002AA103061)资助

摘　　要：无线传感器网络节点的能量有限性,使得路由的选取成为决定网络寿命的关键因素.目前已有的许多路由协议假定了节点知道网络的全局信息,或者让节点根据路由表进行路由.这些方式均会使网络产生较多的通信负荷,增大能量开销.本文结合多源单汇路由的特点,提出了几种局部路由算法.该算法中,节点仅根据目标节点与邻居节点的地理位置、剩余能量等信息,决定下一跳节点,最终建立到达目的节点的路径.首次引入了带约束后跳发射的思想,并将这种后跳发射与已有的算法相结合得到新的后跳路由算法.计算机仿真实验表明,在有数据融合的网络中,带约束的后跳-为难度路由算法使得网络的生存时间最长,较其余算法增加了网络11%和14%的工作周期数.最后又将局部路由算法进行合理改进,得到最小化平均为难度的算法,应用于无数据融合的网络中,效果很好.In wireless sensor networks, sensors are constrained by the amount of battery power, and routing protocols play important roles in networks lifetime. 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 for 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, and the average-reluctance routing algorithm works efficiently.

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

分 类 号：TP393[自动化与计算机技术—计算机应用技术]