|
|
|
| A Topology Maintenance Algorithm Based on Shortest Path Tree for Wireless Ad hoc Networks |
| Shen Zhong; Chang Yi-lin; Cui Can; Zhang Xin |
| National Key Lab of Integrated Service Network, Xidian University, Xi’an 710071, China |
|
|
|
|
Abstract 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.
|
|
Received: 30 May 2005
|
|
|
|
|
|
|
|
|
2007, Vol. 29 
