Skip to main content

Equilibria in Topology Control Games for Ad Hoc Networks

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

Abstract

We study topology control problems in ad hoc networks where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other work on this topic, we assume that the network nodes are owned by different entities, whose only goal is to maximize their own utility that they get out of the network without considering the overall performance of the network. Game theory is the appropriate tool to study such selfish nodes: we define several topology control games in which the nodes need to choose power levels in order to connect to other nodes in the network to reach their communication partners while at the same time minimizing their costs. We study Nash equilibria and show that—among the games we define—these can only be guaranteed to exist if each network node is required to be connected to all other nodes (we call this the Strong Connectivity Game). For a variation called Connectivity Game, where each node is only required to be connected (possibly via intermediate nodes) to a given set of nodes, we show that Nash equilibria do not necessarily exist. We further study how to find Nash equilibria with incentive-compatible algorithms and compare the cost of Nash equilibria to the cost of a social optimum, which is a radius assignment that minimizes the total cost in a network where nodes cooperate. We also study variations of the games; one where nodes not only have to be connected, but k-connected, and one that we call the Reachability Game, where nodes have to reach as many other nodes as possible, while keeping costs low. We extend our study of the Strong Connectivity Game and the Connectivity Game to wireless networks with directional antennas and wireline networks, where nodes need to choose neighbors to which they will pay a link. Our work is a first step towards game-theoretic analyses of topology control in wireless and wireline networks.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. L. Anderegg and S. Eidenbenz, Ad hoc-VCG: A truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents, in: Proceedings of the Ninth Annual International Conference on Mobile Computing and Networking (MOBICOM) (San Diego, CA, 2003) pp. 245–259.

  2. E. Ansheleich, A. Dasgupta, E. Tardos and T. Wexler, Near-optimal network design with selfish agents, in: Proceedings of the 35th Symposium on Theory of Computing (2003) pp. 511–520.

  3. M. Beckmann, C.B. McGuire and C.B. Winsten. Studies in the Economics of Transportation. (Yale University Press, 1956).

  4. L. Buttyan and J. Hubaux, Stimulating Cooperation in self-organizing mobile ad hoc networks, ACM/Kluwer Mobile Networks and Applications (MONET) 8(5) (2003) 579–592.

    Article  Google Scholar 

  5. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Annals of Mathematical Statistics 23 (1952) 493–509.

    MATH  MathSciNet  Google Scholar 

  6. S.C. Dafermos and F.T. Sparrow, The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards, Series B 73B(2) (1969) 91–118.

    MathSciNet  Google Scholar 

  7. S. Doshi, S. Bhandare, and T. Brown, An On-demand minimum energy routing protocol for a wireless ad hoc network, in: ACM Mobile Computing and Communications Review 6(3) (2002).

  8. S. Eidenbenz, V.S. Anil Kumar and S. Zust. Equilibria in topology control games for ad hoc networks, in: Proceedings in DIALM-POMC Mobicom, (San Diego, CA, 2003) 2–11.

  9. A. Fabrikant, A. Luthra, E. Maneva, C. Papadimitriou and S. Shenker, On a network creation game, in: Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing (PODC) (2003) pp. 347–351.

  10. G.N. Frederickson and J. Jájá, On the relationship between the biconnectivity augmentation and traveling salesman problems, Theoretical Comput. Sci. 19 (1982) 189–201.

    Article  Google Scholar 

  11. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. (Freeman, San Francisco, 1979).

    Google Scholar 

  12. M. T. Hajiaghayi, N. Immorlica and V. S. Mirrokni. Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks, in: Proceedings of the Ninth Annual International Conference on Mobile Computing and Networking (MOBICOM) (San Diego, CA, 2003) pp. 300–312.

  13. L.M. Kirousis, E. Kranakis, D. Krizanc and A. Pelc, Power consumption in packet radio networks, Theoretical Computer Science 243 (2000) 289–305.

    Article  MathSciNet  Google Scholar 

  14. S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, J. Algorithms 21 (1996) 434–450.

    Article  MathSciNet  Google Scholar 

  15. A. Mas-Collel, W. Whinston and J. Green, Microeconomic Theory. (Oxford University Press, 1994).

  16. C. Perkins, Ad hoc networking: An introduction, in: C. Perkins, ed. Ad Hoc Networking (2001) pp. 314–318.

  17. R. Rajaraman, Topology control and routing in ad hoc networks: A survey. SIGACT News 33 (2002) 60–73.

    Article  Google Scholar 

  18. T. Roughgarden, Selfish Routing. Ph.D. Thesis, Cornell University (2002).

  19. T. Roughgarden, Designing networks for selfish users is hard, in: Proceedings of the 42nd Symposium on the Foundations of Computer Science (2001) pp 472–481.

  20. R. Roychoudhury, X. Yang, R. Ramanathan and N. Vaidya, Using directional antennas for medium access control in ad hoc networks, in: Proceedings of the Eighth Annual International Conference on Mobile Computing and Networking (MOBICOM) (2002) pp. 59–70.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stephan Eidenbenz.

Additional information

A preliminary version of this paper appeared in DIALM-POMC ’03 [8].

Stephan Eidenbenz is a technical staff member in Discrete Simulation Sciences (CCS-5) at Los Alamos National Laboraotry. He received his Ph.D. in Computer Science from the Swiss Federal Institute of Technology, Zurich, Switzerland in 2000. Stephan’s research covers areas in approximability, algorithms, computational geometry, computational biology, large-scale discrete simulation, selfish networking, efficient networking, protocol design and optimization.

V. S. Anil Kumar is currently an Assistant Professor in the Dept. of Computer Science and a Senior Research Associate at Virginia Bioinformatics Institute, Virginia Tech. Prior to this, he was a technical staff member in Los Alamos National Laboratory. He received a Ph.D. in Computer Science from the Indian Institute of Science in 1999. His research interests include approximation algorithms, mobile computing, combinatorial optimization and simulation of large socio-technical systems.

Sibylle Zust received her Masters degree in mathematics from ETH Zurich in Switzerland in 2002. She wrote her diploma thesis at the University of Copenhagen in Denmark. Sibylle Zust spent two and a half years (2002–2005) as a graduate research assistant at the Los Alamos National Laboratory in New Mexico, USA, where she worked on algorithmic aspects of game theory and scheduling problems. She now works for an insurance company in Zurich, Switzerland.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eidenbenz, S., Anil Kumar, V.S. & Zust, S. Equilibria in Topology Control Games for Ad Hoc Networks. Mobile Netw Appl 11, 143–159 (2006). https://doi.org/10.1007/s11036-005-4468-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-005-4468-y

Keywords