This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Localized Fault-Tolerant Topology Control in Wireless Ad Hoc Networks
April 2006 (vol. 17 no. 4)
pp. 307-320
ASCII Text
x 
 
Ning Li, Jennifer C. Hou, "Localized Fault-Tolerant Topology Control in Wireless Ad Hoc Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 4, pp. 307-320, April, 2006.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2006.51,
author = {Ning Li and Jennifer C. Hou},
title = {Localized Fault-Tolerant Topology Control in Wireless Ad Hoc Networks},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {17},
number = {4},
issn = {1045-9219},
year = {2006},
pages = {307-320},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.51},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Localized Fault-Tolerant Topology Control in Wireless Ad Hoc Networks
IS - 4
SN - 1045-9219
SP307
EP320
EPD - 307-320
A1 - Ning Li,
A1 - Jennifer C. Hou,
PY - 2006
KW - Algorithm design and analysis
KW - fault tolerance
KW - localized algorithms
KW - topology control
KW - wireless ad hoc networks.
VL - 17
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
Ning Li, IEEE

Abstract—Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. As a result, the derived topology is more susceptible to node failures or departures. In this paper, we resolve this problem by enforcing k-vertex connectivity in the topology construction process. We propose a fully localized algorithm, Fault-tolerant Local Spanning Subgraph (FLSS), that can preserve k-vertex connectivity and is min-max optimal among all strictly localized algorithms (i.e., FLSS minimizes the maximum transmission power used in the network, among all strictly localized algorithms that preserve k-vertex connectivity). It can also be proved that FLSS outperforms two other existing localized algorithms in terms of reducing the transmission power. We also discuss how to relax several widely used assumptions in topology control to increase the practical utility of FLSS. Simulation results indicate that, compared with existing distributed/localized fault-tolerant topology control algorithms, FLSS not only has better power-efficiency, but also leads to higher network capacity. Moreover, FLSS is robust with respect to position estimation errors.

[1] N. Li and J.C. Hou, “FLSS: A Fault-Tolerant Topology Control Algorithm for Wireless Networks,” Proc. 10th ACM Int'l Conf. Mobile Computing and Networking (MOBICOM), pp. 275-286, Sept. 2004.
[2] C.E. Jones, K.M. Sivalingam, P. Agrawal, and J.C. Chen, “A Survey of Energy Efficient Network Protocols for Wireless Networks,” Wireless Networks, vol. 7, no. 4, pp. 343-358, Aug. 2001.
[3] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
[4] V. Rodoplu and T.H. Meng, “Minimum Energy Mobile Wireless Networks,” IEEE J. Selected Areas of Comm., vol. 17, no. 8, pp. 1333-1344, Aug. 1999.
[5] R. Ramanathan and R. Rosales-Hain, “Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment,” Proc. IEEE INFOCOM 2000, vol. 2, pp. 404-413, Mar. 2000.
[6] L. Li, J.Y. Halpern, P. Bahl, Y.-M. Wang, and R. Wattenhofer, “Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multi-Hop Networks,” Proc. ACM Symp. Principles of Distributed Computing (PODC), pp. 264-273, Aug. 2001.
[7] S. Narayanaswamy, V. Kawadia, R.S. Sreenivas, and P.R. Kumar, “Power Control in Ad-Hoc Networks: Theory, Architecture, Algorithm and Implementation of the COMPOW Protocol,” Proc. Conf. European Wireless 2002, Next Generation Wireless Networks: Technologies, Protocols, Services and Applications, pp. 156-162, Feb. 2002.
[8] V. Kawadia and P. Kumar, “Power Control and Clustering in Ad Hoc Networks,” Proc. IEEE INFOCOM 2003, vol. 1, pp. 459-469, Apr. 2003.
[9] S.A. Borbash and E.H. Jennings, “Distributed Topology Control Algorithm for Multihop Wireless Networks,” Proc. Int'l Joint Conf. Neural Networks (IJCNN '02), pp. 355-360, May 2002.
[10] X.-Y. Li, G. Calinescu, and P.-J. Wan, “Distributed Construction of Planar Spanner and Routing for Ad Hoc Networks,” Proc. IEEE INFOCOM 2002, pp. 1268-1277, June 2002.
[11] N. Li, J.C. Hou, and L. Sha, “Design and Analysis of an MST-Based Topology Control Algorithm,” IEEE Trans. Wireless Comm., vol. 4, no. 3, pp. 1195-1206, May 2005.
[12] N. Li and J.C. Hou, “Localized Topology Control Algorithms for Heterogeneous Wireless Networks,” IEEE/ACM Trans. Networking, 2005.
[13] C. Savarese, J.M. Rabaey, and J. Beutel, “Location in Distributed Ad-Hoc Wireless Sensor Networks,” Proc. IEEE Int'l Conf. Acoustics, Speech, and Signal Processing, vol. 4, pp. 2037-2040, May 2001.
[14] T. He, C. Huang, B.M. Blum, J.A. Stankovic, and T. Abdelzaher, “Range-Free Localization Schemes for Large Scale Sensor Networks,” Proc. Ninth ACM Int'l Conf. Mobile Computing and Networking (MOBICOM), pp. 81-95, Sept. 2003.
[15] S. Khuller, “Approximation Algorithms for Finding Highly Connected Subgraphs,” Approximation Algorithms for NP-Hard Problems, D.S. Hochbaum, ed., Boston: PWS Publishing Co., 1996.
[16] M. Hajiaghayi, N. Immorlica, and V.S. Mirrokni, “Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-Hop Networks,” Proc. Ninth ACM Int'l Conf. Mobile Computing and Networking (MOBICOM), pp. 300-312, Sept. 2003.
[17] M.D. Penrose, “On K-Connecitivity for a Geometric Random Graph,” Random Structures and Algorithms, vol. 15, no. 2, pp. 145-164, 1999.
[18] C. Bettstetter, “On the Minimum Node Degree and Connectivity of a Wireless Multihop Network,” Proc. Third ACM Symp. Mobile Ad Hoc Networking and Computing (MOBIHOC), pp. 80-91, June 2002.
[19] M. Bahramgiri, M. Hajiaghayi, and V.S. Mirrokni, “Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-Hop Networks,” Proc. 11th Int'l Conf. Computer Comm. and Networks (ICCCN), pp. 392-397, Oct. 2002.
[20] G. Calinescu and P.-J. Wan, “Range Assignment for High Connectivity in Wireless Ad Hoc Networks,” Proc. Second Int'l Conf. Ad-Hoc, Mobile, and Wireless Networks (ADHOC-NOW), pp. 235-246, Oct. 2003.
[21] X.-Y. Li, P.-J. Wan, Y. Wang, and C.-W. Yi, “Fault Tolerant Deployment and Topology Control in Wireless Networks,” Proc. Fourth ACM Symp. Mobile Ad Hoc Networking and Computing (MOBIHOC), pp. 117-128, June 2003.
[22] J.B. Kruskal, “On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem,” Proc. Am. Math. Soc., vol. 7, pp. 48-50, 1956.
[23] S. Even and R.E. Tarjan, “Network Flow and Testing Graph Connectivity,” SIAM J. Computing, vol. 4, pp. 507-518, 1975.
[24] S. McCanne and S. Floyd, “ns Network Simulator,” http://www.isi.edu/nsnamns/, 2006.
[25] J. Wu and F. Dai, “Mobility-Sensitive Topology Control in Mobile Ad Hoc Networks,” Proc. 18th Int'l Parallel and Distributed Processing Symp. (IPDPS '04), pp. 28-37, Apr. 2004.

Index Terms:
Algorithm design and analysis, fault tolerance, localized algorithms, topology control, wireless ad hoc networks.
Citation:
Ning Li, Jennifer C. Hou, "Localized Fault-Tolerant Topology Control in Wireless Ad Hoc Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 4, pp. 307-320, April 2006, doi:10.1109/TPDS.2006.51
Usage of this product signifies your acceptance of the Terms of Use.