检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:侯贵升[1] 吴晓蓓[1] 黄成[1] 徐志良[1]
机构地区:[1]南京理工大学自动化学院,江苏南京210094
出 处:《传感器与微系统》2012年第9期123-125,128,共4页Transducer and Microsystem Technologies
基 金:教育部博士点基金资助项目(20113219110028)
摘 要:针对传统地理路由存在的路由空洞问题,提出一种新的路由算法:基于标号的贪婪转发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.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.170