Skip to main content
SpringerLink
Log in

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected.

The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.

In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Althaus, G. Calinescu, I. Mandoiu, S. Prasad, N. Tchervenski and A. Zelikovsky, Power efficient range assignment in ad-hoc wireless networks, in: Proc. IEEE Wireless Communications and Networking Conference (2003) pp. 1889–1894.

  2. D.M. Blough, M. Leoncini, G. Resta and P. Santi, On the symmetric range assignment problem in wireless ad hoc networks, in: Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal (Aug. 2002) pp. 71–82.

  3. T. Calamoneri, and R. Petreschi, An efficient orthogonal grid drawing algorithm for cubic graphs, COCOON’95, Lectures Notes in Computer Science 959 (Springer-Verlag, 1995) pp. 31–40.

  4. G. Calinescu, I. Mandoiu, and A. Zelikovsky, Symmetric connectivity with minimum power consumption in radio networks, in: Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal (Aug. 2002) pp. 119–130.

  5. W.T. Chen and N.F. Huang, The strongly connecting problem on multihop packet radio networks, IEEE Transactions on Communications, 37(3) (1989) 293–295.

    Article  MathSciNet  Google Scholar 

  6. A. Clementi, P. Crescenzi, P. Penna, G. Rossi and P. Vocca, On the complexity of computing minimum energy consumption broadcast subgraphs, in: 18th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 2010 (2001) pp. 121–131.

  7. A. Clementi, P. Penna and R. Silvestri, On the power assignment problem in radio networks, Electronic Colloquium on Computational Complexity (ECCC), nr. 054 (2000). “The power range assignment problem in radio networks on the Plane,” in: Proc. 17th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1770 (2000) pp. 651–660.

  8. A. Clementi, G. Huiban, P. Penna, G. Rossi and Y.C. Verhoeven, Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks, in: 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (2002) pp. 23–38.

  9. R. Diestel, Graph Theory, 2nd edition, Graduate Texts in Mathematics, vol. 173 (Springer-Verlag, New York, Feb. 2000).

    Google Scholar 

  10. J. Edmonds, Edge-disjoint branchings, in Combinatorial Algorithms, R. Rustin (Ed.) (Algorithmics Press, New York, 1972) pp. 91–96.

    Google Scholar 

  11. J. Edmonds, Matroid intersection, Annals of Discrete Mathematics (4) (1979) 185–204.

  12. A. Frank and É. Tardos, An application of submodular flows, Linear Algebra and its Applications 114/115 (1989) 329–348.

    Article  MathSciNet  Google Scholar 

  13. H.N. Gabow, A matroid approach to finding edge connectivity and packing arborescences, in: Proc. 23rd ACM Symposium on Theory of Computing (May 1991) pp. 112–122.

  14. H.N. Gabow, A representation for crossing set families with applications to submodular flow problems, in: Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (Austin, TX, 1993) pp. 202–211.

  15. R. Gallager and P. Humblet and P. Spira, A distributed algorithm for minimum weight spanning trees, ACM Transactions on Programming Languages and Systems 5(1) (1983) 66–77.

    Article  Google Scholar 

  16. M.R. Garey, D.S. Johnson and R.E. Tarjan, The planar Hamiltonian circuit problem is NP-complete, SIAM J. Comput. 5 (1976) 704–714.

    Article  MathSciNet  Google Scholar 

  17. M. Hajiaghayi, N. Immorlica and V. Mirrokni, Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks, in:Proc. MobiCom 2003 (San Diego, CA, Sept. 2003) pp. 300–312.

  18. S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, Journal of Algorithms 21 (1996) 433–450.

    Article  MathSciNet  Google Scholar 

  19. S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, Journal of ACM 41(2) (1994) 214–235.

    Article  MathSciNet  Google Scholar 

  20. L.M. Kirousis, E. Kranakis, D. Krizanc and A. Pelc, Power consumption in packet radio networks, Theoretical Computer Science 243(1–2) (2000) 289–305. A preliminary version of this papers also appeared in Proc. 14th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 1200 (1997) pp. 363–374.

    Google Scholar 

  21. E.L. Lawler, Matroid intersection algorithms, Mathematical Programming 9 (1975) 31–56.

    Article  MATH  MathSciNet  Google Scholar 

  22. Y. Liu, P. Marchioro, and R. Petreschi, At most single bend embedding of cubic graphs, Applied Mathematics (Chin. Journ.) 9/B/2, (1994) pp. 127–142.

    MathSciNet  Google Scholar 

  23. E. Lloyd, R. Liu, M. Marathe, R. Ramanathan and S.S. Ravi, Algorithmic aspects of topology control problems for ad hoc networks, in: Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (Lausanne, Switzerland, June 2002) pp. 123–134.

    Google Scholar 

  24. T.S. Rappaport, Wireless Communications: Principles and Practices (Prentice Hall, 1996).

  25. R. Ramanathan and R. Rosales-Hain, Topology control of multihop wireless networks using transmit power adjustment, in: IEEE INFOCOM 2000, vol. 2 (2000) pp. 404–413.

  26. J.H. van Lint and R.M. Wilson, A Course in Combinatorics (Cambridge University Press, 1992).

  27. P.-J. Wan, G. Calinescu, X.-Y. Li and O. Frieder, Minimum energy broadcast routing in static ad hoc wireless networks, in: IEEE INFOCOM 2001, vol. 2 (2001) pp. 1162–1171.

  28. R.W. Whitty, Vertex-disjoint paths and edge-disjoint branchings in directed graphs, J. Graph Theory 11(3) (1987) 349–358.

    MATH  MathSciNet  Google Scholar 

  29. J.E. Wieselthier, G.D. Nguyen and A. Ephremides, On the construction of energy-efficient broadcast and multicast trees in wireless networks, in: IEEE INFOCOM 2000, vol. 2 (2000) pp. 585–594.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Illinois Institute of Technology, Chicago, IL, 60616, USA

    Gruia Calinescu & Peng-Jun Wan

Authors
  1. Gruia Calinescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peng-Jun Wan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gruia Calinescu.

Additional information

A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003).

Research performed in part while visiting the Max-Plank-Institut fur Informatik.

Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.

Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Calinescu, G., Wan, PJ. Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks. Mobile Netw Appl 11, 121–128 (2006). https://doi.org/10.1007/s11036-006-4466-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-006-4466-8

Keywords

Search

Navigation