Construction of low weighted and fault-tolerant topology for wireless ad hoc and sensor network Online publication date: Mon, 03-Feb-2014
by Hong Zeng; Jianhui Zhang; Guojun Dai
International Journal of Sensor Networks (IJSNET), Vol. 14, No. 4, 2013
Abstract: To preserve network connectivity is an important issue especially in wireless ad hoc and sensor networks (WASN), where wireless links are easy to be disturbed and tiny sensors are very easy to fail accidently. Therefore, it is necessary to design a fault-tolerant network. A feasible method is to construct a k-connected (k-vertex connected) topology. In this paper, we consider k-connectivity of wireless network and propose a simple global algorithm (GAFTk) which preserves the network k-connectivity and reduces the maximal transmission power (TP). The average degree expectation of the topology generated by GAFTk is O ((k + 3)²) and the expected weight is
Based on GAFTk, we further propose an efficient localised algorithm (LAFTk) which preserves k-vertex connectivity while maintaining bi-directionality of the network. In addition, both algorithms achieve significant reductions in energy consumption. Our simulation results show that GAFT/LAFT have better performance than some other current fault-tolerant protocols.O( (k+3)² ) 12(√πnnε)
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook