一种基于最短路径树的无线Ad hoc网络拓扑维护算法  

A Topology Maintenance Algorithm Based on Shortest Path Tree for Wireless Ad hoc Networks

作　　者：沈中[1] 常义林[1] 崔灿[1] 张新[1] 

机构地区：[1]西安电子科技大学综合业务网国家重点实验室,西安710071

出　　处：《电子与信息学报》2007年第2期323-327,共5页Journal of Electronics & Information Technology

基　　金：综合业务网理论与关键技术国家重点实验室基金(00JS63.2.1.DZ01)资助课题

摘　　要：该文主要研究了无线Ad hoc网络中节点失效的情况下,如何维护网络的连通性和拓扑的性能,并且尽可能地降低拓扑维护的开销。提出了基于最短路径树的拓扑维护算法。该算法在拓扑变化时首先触发失效节点的邻节点响应(即重新运行拓扑控制算法),在不增加额外通信开销的情况下,响应的节点根据相互发送的Hello分组来判断网络是否连通;如果不能确定网络是连通的,再触发失效节点的其它可达邻近节点响应。仿真研究表明,算法显著地减少了拓扑维护的开销,维护后的拓扑结构在功率有效性和功率扩展因子等方面也取得了好的性能。This paper focuses on how to maintain the wireless network connectivity and performance while reducing the maintenance overhead as some nodes fail. A topology maintenance algorithm based on the shortest path tree is proposed. In this algorithm, the neighbors of a faulty node are first triggered to respond （i.e., rerun the topology control algorithm）. Without extra communication overhead, each responding node determines the network connectivity by the contents of Hello messages sent by its neighbors. If the responding nodes could not ensure that the network is connected, the other reachable nodes from the fault node are further triggered. Simulation results show that the proposed scheme can efficiently maintain the network connectivity with low overhead and achieve acceptable performance in terms of both power efficiency and power stretch factor.

关 键 词：无线AD HOC网络 拓扑维护 拓扑控制 

分 类 号：TN915.07[电子电信—通信与信息系统]