Ning Li
Jennifer C. Hou
ABSTRACT
Topology control algorithms usually reduce the number of links in a wireless network, which in turn decreases the degree of connectivity. The resulting network topology is more susceptible to system faults such as node failures and departures. In this paper, we consider k-vertex connectivity of a wireless network. We first present a centralized algorithm, Fault-tolerant Global Spanning Subgraph (FGSSk), which preserves k-vertex connectivity. FGSSk is min-max optimal, i.e., FGSSk minimizes the maximum transmission power used in the network, among all algorithms that preserve k-vertex connectivity. Based on FGSSk, we propose a localized algorithm, Fault-tolerant Local Spanning Subgraph (FLSSk). It is proved that FLSSk preserves k-vertex connectivity while maintaining bi-directionality of the network, and FLSSk is min-max optimal among all strictly localized algorithms. We then relax several widely used assumptions for topology control to enhance the practicality of FGSSk and FLSSk. Simulation results show that FLSSk is more power-efficient than other existing distributed/localized topology control algorithms.
- M. Bahramgiri, M. Hajiaghayi, and V. S. Mirrokni. Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks. In Proc. Eleventh International Conference on Computer Communications and Networks (ICCCN), pages 392--397, Oct. 2002.Google Scholar
Cross Ref
- G. D. Battista, R. Tamassia, and L. Vismara. Output-sensitive reporting of disjoint paths. Algorithmica, 23(4):302--340, 1999.Google ScholarCross Ref
- C. Bettstetter. On the minimum node degree and connectivity of a wireless multihop network. In Proc. ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), pages 80--91, Lausanne, Switzerland, June 2002. Google ScholarDigital Library
- S. A. Borbash and E. H. Jennings. Distributed topology control algorithm for multihop wireless networks. In Proc. International Joint Conference on Neural Networks, (IJCNN '02), pages 355--360, Honolulu, HI, USA, May 2002.Google ScholarCross Ref
- S. Even and R. E. Tarjan. Network flow and testing graph connectivity. SIAM Journal on Computing, 4:507--518, 1975.Google ScholarDigital Library
- M. Hajiaghayi, N. Immorlica, and V. S. Mirrokni. Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. In Proc. ACM International Conference on Mobile Computing and Networking (MOBICOM), pages 300--312, San Diego, CA, USA, Sept. 2003. Google ScholarDigital Library
- T. He, C. Huang, B. M. Blum, J. A. Stankovic, and T. Abdelzaher. Range-free localization schemes for large scale sensor networks. In Proc. ACM International Conference on Mobile Computing and Networking (MOBICOM), pages 81--95, San Diego, CA, USA, Sept. 2003. Google ScholarDigital Library
- V. Kawadia and P. Kumar. Power control and clustering in ad hoc networks. In Proc. IEEE INFOCOM 2003, volume~1, pages 459--469, San Francisco, CA, USA, Apr. 2003.Google Scholar
- S. Khuller. Approximation algorithms for finding highly connected subgraphs. In D. S. Hochbaum, editor, Approximation algorithms for NP-hard problems. PWS Publishing Company, Boston, MA, 1996. Google ScholarDigital Library
- J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48--50, 1956.Google ScholarCross Ref
- 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. In Proc. ACM Symposium on Principles of Distributed Computing (PODC), pages 264--273, Newport, RI, USA, Aug. 2001. Google ScholarDigital Library
- N. Li and J. C. Hou. Topology control in heterogeneous wireless networks: problems and solutions. In Proc. IEEE INFOCOM 2004, Hong Kong, China, Mar. 2004 (the version in the conference proceedings has a technical error, and an updated version of the paper appears as a technical report at Department of Computer Science, University of Illinois at Urbana Champaign, Technical Report No. UIUCDCS-R-2004-2412, Mar 2004).Google Scholar
- N. Li, J. C. Hou, and L. Sha. Design and analysis of an MST-based topology control algorithm. In Proc. IEEE INFOCOM 2003, volume~3, pages 1702--1712, San Francisco, CA, USA, Apr. 2003.Google ScholarCross Ref
- X.-Y. Li, G. Calinescu, and P.-J. Wan. Distributed construction of planar spanner and routing for ad hoc networks. In Proc. IEEE INFOCOM 2002, volume~3, pages 1268--1277, New York, NY, USA, June 2002.Google Scholar
- X.-Y. Li, P.-J. Wan, Y. Wang, and C.-W. Yi. Fault tolerant deployment and topology control in wireless networks. In Proc. ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), pages 117--128, Annapolis, MD, USA, June 2003. Google ScholarDigital Library
- S. McCanne and S. Floyd. ns Network Simulator. http://www.isi.edu/nsnam/ns/.Google Scholar
- 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. In Proc. European Wireless 2002, Next Generation Wireless Networks: Technologies, Protocols, Services and Applications, pages 156--162, Florence, Italy, Feb. 2002.Google Scholar
- M. D. Penrose. On k-connecitivity for a geometric random graph. Random Structures and Algorithms, 15(2):145--164, 1999. Google ScholarDigital Library
- R. Ramanathan and R. Rosales-Hain. Topology control of multihop wireless networks using transmit power adjustment. In Proc. IEEE INFOCOM 2000, volume~2, pages 404--413, Tel Aviv, Israel, Mar. 2000.Google ScholarCross Ref
- V. Rodoplu and T. H. Meng. Minimum energy mobile wireless networks. IEEE J. Select. Areas Commun., 17(8):1333--1344, Aug. 1999. Google ScholarDigital Library
- H.-Y. Tyan. Design, realization and evaluation of a component-based software architecture for network simulation. PhD thesis, The Ohio State University, Columbus, OH, USA, 2001. Also see http://www.j-sim.org. Google ScholarDigital Library
Index Terms
- FLSS: a fault-tolerant topology control algorithm for wireless networks
Recommendations
Fault tolerant deployment and topology control in wireless networks
MobiHoc '03: Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computingThis paper investigate fault tolerance for wireless ad hoc networks. We consider a large-scale of wireless networks whose nodes are distributed randomly in a unit-area square region. Given n wireless nodes V, each with transmission range rn, the ...
Localized topology control algorithms for heterogeneous wireless networks
Most existing topology control algorithms assume homogeneous wireless networks with uniform maximal transmission power, and cannot be directly applied to heterogeneous wireless networks where the maximal transmission power of each node may be different. ...
Fault tolerant deployment and topology control in wireless ad hoc networks: Research Articles
Performance Evaluation of Wireless NetworksWe consider a large-scale of wireless ad hoc networks whose nodes are distributed randomly in a two-dimensional region Ω (more specifically, a unit square). Given n wireless nodes V, each with transmission range rn, the wireless networks are often ...
Comments