loading...
An Efficient Topology Maintenance Algorithm Based on Shortest Path Tree for Wireless Sensor Networks
Dalian, China December 05-December 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.81Sixth International Conference on Par ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Zhong Shen, Yilin Chang, Xin Zhang, Can Cui, "An Efficient Topology Maintenance Algorithm Based on Shortest Path Tree for Wireless Sensor Networks," Parallel and Distributed Computing Applications and Technologies, International Conference on, pp. 288-292, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/PDCAT.2005.81,
author = {Zhong Shen and Yilin Chang and Xin Zhang and Can Cui},
title = {An Efficient Topology Maintenance Algorithm Based on Shortest Path Tree for Wireless Sensor Networks},
journal ={Parallel and Distributed Computing Applications and Technologies, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2405-2},
pages = {288-292},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.81},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing Applications and Technologies, International Conference on
TI - An Efficient Topology Maintenance Algorithm Based on Shortest Path Tree for Wireless Sensor Networks
SN - 0-7695-2405-2
SP288
EP292
A1 - Zhong Shen,
A1 - Yilin Chang,
A1 - Xin Zhang,
A1 - Can Cui,
PY - 2005
KW - null
VL - 0
JA - Parallel and Distributed Computing Applications and Technologies, International Conference on
ER -
 
Zhong Shen, Xidian University, China
Yilin Chang, Xidian University, China
Xin Zhang, Xidian University, China
Can Cui, Xidian University, China
The topology of a wireless sensor network has a significant effect on the network performance. Although topology control algorithms can optimize the network topology, the resultant topology is usually changeable. In this paper, we focus on how to maintain the network connectivity while reducing the maintenance overhead as some nodes fail. A distributed topology maintenance algorithm based on the shortest path tree is proposed. In this algorithm, nodes in immediate surroundings of a faulty node are first triggered to respond, and if they couldn?t ensure that the network is connected, the other related nodes are further triggered. Simulation results show that the proposed scheme can efficiently maintain the network connectivity with significant reduction in the overhead for topology maintenance.
Citation:
Zhong Shen, Yilin Chang, Xin Zhang, Can Cui, "An Efficient Topology Maintenance Algorithm Based on Shortest Path Tree for Wireless Sensor Networks," pdcat, pp.288-292, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.