Play alone or together - Truthful and efficient routing in wireless ad hoc networks with selfish nodes

2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems

Volumn , Issue , 2004, Pages 457-465

  Cai, Jianfeng ^a   Pooch, Udo ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MINIMUM TRANSMISSION POWER (MTP); MOBILE AD HOC NETWORKS (MANET); TRANSMISSION POWER RECURSIVE AUCTION MECHANISM (TEAM); WIRELESS AD HOC NETWORKS;

COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; GAME THEORY; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK PROTOCOLS; PACKET NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 20344408510     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. ns notes and documentations. http://www.isi.edu/vint/nsnam/.
2. CMU monarch extensions to ns. http://www.monarch.cs.cmu.edu/.
3. L. Anderegg and S. Eidenbenz. Ad hoc-vcg: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. In Proc. of the 9th annual international conference on mobile computing and networking, pages 245-259, San Diego, CA, Sep 2003.
4. L. Buttyan and J.-P. Hubaux. Nuglets: a virtual currency to stimulate cooperation in self-organized mobile ad hoc networks. In technical report DSC/2001/001, Lausanne, Jan 2001. Swiss Federal Institue of Technology.
5. B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris. Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. In Proceedings of the 7th ACM International Conference on Mobile Computing and Networking, pages 85-96, Rome, Italy, July 2001.
6. E. H. Clarke. Multipart pricing of public goods. Public Choice, 11:17-33, 1971.
7. S. Das, C. Perkins, and E. Royer. Ad hoc on demand distance vector (aodv) routing. Mobile Ad-hoc Network(MANET) Working Group, IETF, Jan 2002.
8. J. Dorsey. Game-theoretic resource allocation in mobile ad hoc networks. Doctoral thesis prospectus, Carnegie Mellon University, 2001.
9. L. M. Feeney and M. Nilsson. Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In Proc. of IEEE INFOCOM, number 1, pages 1548-1557, Anchorage, AK, US, April 2001.
10. J. Feigenbaum, C. Papadimistriou, and S. Shenker. Sharing the cost of multicast transmissions. Journal of Computer and System Sciences, 63(1):21-41, 2001.
11. J. feigenbaum and S. Shenker. Distributed algorithmic mechanism design: recent results and future directions. Invited talk in DIAL-M'02, Sep 2002.
12. J. Gomez, A. Campbel, M. Naghshineh, and C.Bisdikian. Conserving transmission power in wireless ad hoc networks. In Proceedings of 9th International Conference on Network Protocols (ICNP2001), pages 11-14, Riverside, CA, Nov 11-14 2001.
13. T. Groves. Incentives in teams. Econometrica, 41:617-631, 1973.
14. D. Johnson, D. Maltz, Y. Hu, and J. Jetcheva. The dynamic source routing prtocol for mobile ad hoc networks. IEEE internet draft, March 2001.
15. C. E. Jones, K. M. Sivalingam, P. Agrawal, and J.-C. Chen. A survey of energy efficient network protocols for wireless networks. Wireless Networks, 7(4):343-358, 2001.
16. R. Kravets and P. Krishnan. Application-driven power management for mobile communication. In Proc. of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, pages 263-277, Dallas, TX, October 1998.
17. X.-Y. Li, P.-J. Wan, Y. Wang, and C.-W. Yi. Fault tolerant deployment and topology control in wireless networks. In Proc. of the 4th ACM international symposium on Mobile ad hoc networking and computing, pages 117-128, Annapolis, Maryland, June 2003.
18. E. L. Lloyd, R. Liu, M. V. Marathe, R. Ramanathan, and S. Ravi. Algorithmic aspects of topology control problems for ad hoc networks. In Proc of the 3rd ACM Internatin Symposium on Mobile Ad hoc Networking and Computing, pages 123-134, Lausanne, Switzerland, June 2002.
19. S. Marti, T. J. Giuli, K. Lai, and M. Baker. Mitigating routing misbehavior in mobile ad hoc networks. In Proc. of the 6th annual ACM/IEEE International Conference on Mobile Computing and Networking, pages 255-265, Boston, Massachusetts, August 2000.
20. N. Nisan and A. Ronen. Algorithmic mechanism design. Games and Economic Bahavior, 35:166-196, 2001.
21. P. Papadimitratos and Z. J. Mass. Secure routing for mobile ad hoc networks. In Proc. of SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS02), San Antonio, January 2002.
22. D. C. Parkes. Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency. PhD thesis, University of Pennsylvania, May 2001.
23. T. S. Rappaport. Wireless Communication: Principles and Practice. Prentice Hall, 1996.
24. V. Rodoplu and T. H. Meng. Minimum energy mobile wireless networks. In Proc. of IEEE International Conference on Communications, ICC'98, volume 3, pages 1633-639, Atlanta, GA, June 1998.
25. T. Roughgraden. How unfair is optimal routing. In Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pages 203-204, San Francisco, CA, Jan 2002.
26. N. Salem, L. Buttyan, J. Hubaux, and M. Jakobsson. A charging and rewarding scheme for packet forwarding in multi-hop cellular networks. In Proc. of the 4th ACM/SIGMOBILE MobiHoc, pages 13-24, Annapolis, Maryland, June 2003.
27. S. Singh, M. Woo, and C. Raghavendra. Power-aware routing in mobile ad hoc networks. In Proc. of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, pages 181-190, Dallas, TX, October 1998.
28. L. Thomas. Games, theory and applications. Ellis Horwood Limited, England, 1984.
29. W. Vickrey. Counterspeculation, auctions and competitive sealed tenders. Journal of Finance, 16:8-37, 1961.
30. R. Wattenhofer, L. Li, V. Bahl, and Y. Wang. Distributed topology control for power efficient operation in multihop wireless ad hoc networks. In Proceedings of IEEE INFOCOM, pages 1388-1397, April 2001.
31. Y. Xu, J. Heidenmann, and D. Estrin. Geography-informed energy conservation for ad hoc routing. In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking, pages 70-84, Rome, Italy, July 2001.
32. S. Yi, P. Naldurg, and R. Kravets. Security-aware ad hoc routing for wireless networks. Technical Report UIUCDCS-R-2001-2241, University of Illinois at Urbana-Champaign, August 2001.
33. S. Zhong, Y. R. Yang, and J. Chen. Sprite: A simple, cheat-proof, credit-based system for mobile ad hoc networks. In Procs of INFOCOM 2003, pages 1987-1997, March 2003.