Skip to main content
SpringerLink
Log in

Approximating the Minimum Number of Maximum Power Users in Ad hoc Networks

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

Abstract

Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fundamental such property is that the network/graph be connected. For connectivity, prior work on topology control gave a polynomial time algorithm for minimizing the maximum power assigned to any node (such that the induced graph is connected). In this paper we study the problem of minimizing the number of maximum power nodes. After establishing that this minimization problem is NP-complete, we focus on approximation algorithms for graphs with symmetric power thresholds. We first show that the problem is reducible in an approximation preserving manner to the problem of assigning power values so that the sum of the powers is minimized. Using known results for that problem, this provides a family of approximation algorithms for the problem of minimizing the number of maximum power nodes with approximation ratios of 5/3 + ε for every ε > 0. Unfortunately, these algorithms, based on solving large linear programming problems, are not practical. The main results of this paper are practical algorithms with approximation ratios of 7/4 and 5/3 (exactly). In addition, we present experimental results, both on randomly generated networks, and on two networks derived from proximity data associated with the TRANSIMS project of Los Alamos National Labs. Finally, based on the reduction to the problem of minimizing the total power, we describe some additional results for minimizing the number of maximum power users, both for graph properties other than connectivity and for graphs with asymmetric power thresholds.

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. Zelikovksy, Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks, Private communication. (The paper is available from www.cs.iit.edu/~calinescu.)

  2. S. Arora and C. Lund, Hardness of approximations, in: Approximation Algorithms for NP-Hard Problems, D. Hochbaum (eds.), (PWS Publishing Company, Boston, MA, 1997).

    Google Scholar 

  3. W. Chen and N. Huang, The strongly connecting problem on multihop packet radio networks, IEEE Trans. Communication, 37(3) (1989) 293–295.

    Article  MathSciNet  Google Scholar 

  4. T. Cormen, C. Leiserson, R. Rivest and C. Stein, Introduction to Algorithms (MIT Press and McGraw-Hill, Cambridge, MA, 2000).

    Google Scholar 

  5. A.E.F. Clementi, P. Penna and R. Silvestri, Hardness results for the power range assignment problem in packet radio networks, in: Proc. Third International Workshop on Randomization and Approximation in Computer Science (APPROX 1999), Lecture Notes in Computer Science, vol. 1671 (Springer-Verlag, July 1999) pp. 195–208.

    Google Scholar 

  6. A.E.F. Clementi, P. Penna and R. Silvestri, The power range assignment problem in packet radio networks in the plane, in: Proc. 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000) (Feb. 2000) pp. 651–660.

  7. G. Calinescu and P.-J. Wan, Symmetric high connectivity with minimum total power consumption in multihop packet radio networks, in: Proc. International Conference on Ad hoc and Wireless Networks (ADHOC-NOW’03), Lecture Notes in CS, vol. 2865, S. Pierre, M. Barbeau and E. Kranakis (eds.) (Montreal, Canada, Oct. 2003) pp. 235–246.

    Google Scholar 

  8. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman and Co., San Francisco, CA, 1979).

    MATH  Google Scholar 

  9. L.M. Kirousis, E. Kranakis, D. Krizanc and A. Pelc, in: Power consumption in packet radio networks, in: Proc. 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS 97), Lecture Notes in Computer Science, vol. 1200 (Springer-Verlag, Feb. 1997) pp. 363–374. (Complete version under review for Theoretical Computer Science.)

    Article  MathSciNet  Google Scholar 

  10. S.O. Krumke, R. Liu, E.L. Lloyd, M.V. Marathe, R. Ramanathan and S.S. Ravi, Topology control problems under symmetric and asymmetric power thresholds, in: Proc. International Conference on Ad hoc and Wireless Networks (ADHOC-NOW’03), Lecture Notes in CS, vol. 2865, S. Pierre, M. Barbeau and E. Kranakis (eds.) (Montreal, Canada, Oct. 2003) pp. 187–198.

    Google Scholar 

  11. E. Lloyd, R. Liu, M. Marathe, R. Ramanathan and S.S. Ravi, Algorithmic aspects of topology control problems for ad hoc networks, in: Proc. Third ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (2002) pp. 123–134. (Complete version to appear in Mobile Networks and Applications.)

  12. L. Li, J.Y. Halpern, P. Bahl, Y. Wang and R. Wattenhofer, Analysis of cone-based distributed topology control algorithm for wireless multi-hop networks, in: Proc. ACM Principles of Distributed ComputingConference (PODC’01) (Aug. 2001) pp. 264–273.

  13. M.V. Marathe, R. Ravi, R. Sundaram, S.S. Ravi, D.J. Rosenkrantz and H.B. Hunt III, Bicriteria network design problems, Journal of Algorithms 28(1) (1998) 142–171.

    Article  MathSciNet  MATH  Google Scholar 

  14. T.S. Rappaport, Wireless Communications: Principles and Practice (Prentice-Hall, Inc., Englewood Cliffs, NJ, 1996).

    Google Scholar 

  15. V. Radoplu and T.H. Meng, Minimum energy mobile wireless networks, IEEE J. Selected Areas in Communications 17(8) (1999) 1333–1344.

    Google Scholar 

  16. E.M. Royer, P. Melliar-Smith and L. Moser, An analysis of the optimum node density for ad hoc mobile networks, in: Proc. IEEE Intl. Conf. on Communication (ICC’01) (Helsinki, Finland, June 2001) pp. 857–861.

  17. R. Ramanathan and R. Rosales-Hain, Topology control of multihop wireless networks using transmit power adjustment, in: Proc. IEEE INFOCOM 2000 (Tel Aviv, Israel, March 2000) pp. 404–413.

  18. H. Takagi, and L. Kleinrock, Optimal transmission ranges for randomly distributed packet radio terminals, IEEE Transactions on Communications, COM-32(3) (1984) 246–257. Also appears in Multiple Access Communications, Foundations for Emerging Technologies, Norman Abramson (Ed.) (IEEE Press, 1992) pp. 342–353.

    Article  Google Scholar 

  19. TRANSIMS. http://transims.tsasa.lanl.gov/

  20. R. Wattenhofer, L. Li, P. Bahl and Y. Wang, Distributed topology control for power efficient operation in multihop wireless ad hoc networks, in: Proc. IEEE INFOCOM 2001 (Anchorage, Alaska, April 2001) pp. 1388–1397.

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Sciences, University of Delaware, Newark, DE, 19716, USA

    Errol L. Lloyd & Rui Liu

  2. Department of Computer Science, University at Albany – SUNY, Albany, NY, 12222, USA

    S. S. Ravi

Authors
  1. Errol L. Lloyd
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rui Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. S. Ravi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Errol L. Lloyd.

Additional information

A preliminary version of this paper was presented at the ADHOC-NOW’04 conference in Vancouver, Canada, July 2004.

Prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U.S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes not withstanding any copyright notation thereon.

Errol L. Lloyd is a Professor of Computer and Information Sciences at the University of Delaware. Previously he served as a faculty member at the University of Pittsburgh and as Program Director for Computer and Computation Theory at the National Science Foundation. From 1994 to 1999 he was Chair of the Department of Computer and Information Sciences at the University of Delaware. Concurrently, from 1997 to 1999 he was Interim Director of the University of Delaware Center for Applied Science and Engineering in Rehabilitation. Professor Lloyd received undergraduate degrees in both Computer Science and Mathematics from Penn State University, and a Ph.D. in Computer Science from the Massachusetts Institute of Technology. His research expertise is in the design and analysis of algorithms, with a particular concentration on approximation algorithms. In 1989 Professor Lloyd received an NSF Outstanding Performance Award, and in 1994 he received the University of Delaware Faculty Excellence in Teaching Award.

Rui Liu received the B.S. degree in mathematics from Peking University, Beijing, China, in 1998, and the Ph.D. degree in Computer and Information Sciences from the University of Delaware in 2004. Since that time, he has been a Senior Associate Staff Scientist with Oracle|Retek. His research interests include design and analysis of algorithms for combinatorial optimization problems, and mobile computing.

S.S. Ravi received his Ph.D. in Computer Science from the University of Pittsburgh in 1984. Since that time, he has been on the computer science faculty at the University at Albany – State University of New York, where he is currently a Professor. His areas of interest include design and analysis of algorithms, mobile computing, data mining and fault-tolerant computing.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lloyd, E.L., Liu, R. & Ravi, S.S. Approximating the Minimum Number of Maximum Power Users in Ad hoc Networks. Mobile Netw Appl 11, 129–142 (2006). https://doi.org/10.1007/s11036-006-4467-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-006-4467-7

Keywords

Search

Navigation