摘要
针对传统地理路由存在的路由空洞问题,提出一种新的路由算法:基于标号的贪婪转发LBGF算法。算法将网络中的节点组织为一个带环树,在构建树的同时,父节点依据子节点的位置信息为其分配隐含节点间亲缘关系的标号,从而形成一个树型标号系统,并设计相应的贪婪转发算法。分析与仿真结果表明:相对于GPSR,LBGF算法具有空洞避免、容错性强、通信与存储开销低、计算简便等优点,适于节点稀疏或障碍物较多的无线传感器网络。
Aiming at routing hole problem existing, in the traditional geographic routing, a novel label-based greedy forwarding（LBGF） algorithm is proposed. This algorithm organizes nodes in the network as a ringed tree. While building the tree, a label implying relative relationships between nodes is assigned by the parent node for the child node, depending on its location, thereby a tree-label system is formed, and based on the system, the corresponding greedy forwarding algorithm is designed. Analysis and simulation results show that LBGF has many advantages such as hole-avoidance, stronger fault-tolerance, lower communication and storage cost, simple computation, and so on, compared with GPSR. So it is suitable for WSNs whose nodes are sparse, or in which there are many obstacles.
出处
《传感器与微系统》
CSCD
北大核心
2012年第9期123-125,128,共4页
Transducer and Microsystem Technologies
基金
教育部博士点基金资助项目(20113219110028)
关键词
无线传感器网络
贪婪转发
标号
路由
wireless sensor networks （WSNs）
greedy forwarding
label
routing
