Equilibria in Topology Control Games for Ad Hoc Networks

Proceedings of the Joint Workshop on Foundations of Mobile Computing

Volumn , Issue , 2003, Pages 2-11

  Eidenbenz, Stephan ^a   Anil Kumar, V S ^a   Zust, Sibylle ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Ad Hoc Networks; Game Theory; Nash Equilibrium; Topology Control

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK TOPOLOGY; GAME THEORY; OPTIMIZATION; POLYNOMIALS; RANDOM PROCESSES; THEOREM PROVING; VECTORS;

POLYNOMIAL-TIME ALGORITHMS; TOPOLOGY CONTROL GAMES;

COMPUTER NETWORKS;

EID: 1642356902     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/941079.941081     Document Type: Conference Paper

References (16)

1. L. Anderegg, S. Eidenbenz. Ad hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks with Selfish Agents. Proceedings of Mobicom, 2003.
2. E. Ansheleich, A. Dasgupta, E. Tardos, and T. Wexler. Near-optimal network design with selfish agents. Proceedings of the Symposium on Theory of Computing, 2003.
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; Accepted for publication in ACM/Kluwer Mobile Networks and Applications MONET), October 2003, Vol. 8 No. 5.
5. 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, 73 B(2), pp 91-118, 1969.
6. S. Doshi, S. Bhandare, T. Brown. An On-demand minimum energy routing protocol for a wireless ad hoc network; in: ACM Mobile Computing and Communications Review, vol. 6, no. 3, July 2002.
7. A. Fabrikant, A. Luthra, E. Maneva, S. Papadimitriou, and S. Shenker. On a network creation game.
8. J. Freebersyer and B. Leiner. A DoD perspective on mobile ad hoc networks. In C. Perkins, ed. Ad Hoc Networking, pp 314-318, 2001.
9. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness; Freeman, San Fransisco, 1979.
10. L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power consumption in packet radio networks, Theoretical Computer Science 243 (2000) pp 289-305.
11. R. Motwani and P. Raghavan. Randomized Algorithms, Cambridge University Press, 1995.
12. A. Mas-Collel, W. Whinston, and J. Green. Microeconomic Theory. Oxford University Press, 1994.
13. C. Perkins. Ad hoc networking: an introduction. In C. Perkins, ed. Ad Hoc Networking, pp 314-318, 2001.
14. R. Rajaraman. Topology control and routing in ad hoc networks: a survey. SIGACT News 33:60-73, June 2002.
15. T. Roughgarden. Selfish Routing. Ph.D. Thesis, Cornell University, 2002.
16. T. Roughgarden. Designing networks for selfish users is hard. In Proceedings of the 42nd Symposium on the Foundations of Computer Science, pp 472-481, 2001.