On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks - An integrated approach using game theoretical and cryptographic techniques

Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM

Volumn , Issue , 2005, Pages 117-131

  Zhong, Sheng ^a   Li, Li ^b   Liu, Yanbin Grace ^c   Yang, Yang Richard ^d  

^a the State University of New York   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c University of Texas at Austin   (United States)

^d Yale University   (United States)

Author keywords

Game theory; Incentives; Mechanism design; Security; Wireless ad hoc network

Indexed keywords

INCENTIVES; MECHANISM DESIGN; WIRELESS AD-HOC NETWORKS;

COMPUTER SIMULATION; CRYPTOGRAPHY; GAME THEORY; PACKET NETWORKS; ROUTERS; SECURITY SYSTEMS; WIRELESS TELECOMMUNICATION SYSTEMS;

NETWORK PROTOCOLS;

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

References (47)

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 International Conference on Mobile Computing and Networking (Mobicom), San Diego, CA, Sept. 2003.
2. H. Balakrishnan and R. Katz. Explicit loss notification and wireless web performance. In Proceedings of IEEE Globecom Internet Mini-Conference, 1998.
3. S. Buchegger and J.-Y. Le Boudec. Nodes bearing grudges: Towards routing security, fairness, and robustness in mobile ad hoc networks. In Proceedings of the Tenth Euromicro Workshop on Parallel, Distributed and Network-based Processing, 2002.
4. S. Buchegger and J.-Y. Le Boudec. Performance analysis of the CONFIDANT protocol: Cooperation of nodes - fairness in dynamic ad-hoc networks. In Proceedings of the Third ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Lausanne, Switzerland, June 2002.
5. L. Buttyan and J. P. Hubaux. Enforcing service availability in mobile ad-hoc WANs. In Proceedings of the First ACM Workshop on Mobile Ad Hoc Networking and Computing (MobiHoc), Boston, Massachusetts, Aug. 2000.
6. L. Buttyan and J. P. Hubaux. Stimulating cooperation in self-organizing mobile ad hoc networks. ACM Journal for Mobile Networks (MONET), special issue on Mobile Ad Hoc Networks, summer 2002.
7. M. Cagalj, S. Ganeriwal, I. Aad, and J. P. Hubaux. On selfish behavior in csma/ca networks. In Proceedings of IEEE INFOCOM, Miami, Florida, USA, March 2005.
8. Cisco Systems Inc. Data sheet for cisco aironet, 2004.
9. E. Clarke. Multipart pricing of public goods. Public Choice, 11:17-33, 1971.
10. D. D. Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless routing. In Proceedings of the Ninth International Conference on Mobile Computing and Networking (Mobicom), San Diego, CA, Sept. 2003.
11. J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker. A BGP-based mechanism for lowest-cost routing. In Proceedings of the 21st Symposium on Principles of Distributed Computing, Monterey, CA, July 2002.
12. J. Feigenbaum, C. Papadimitriou, and S. Shenker. Sharing the cost of multicast transmissions. Journal of Computer and System Sciences (Special issue on Internet Algorithms), 63:21-41, 2001.
13. J. Feigenbaum and S. Shenker. Distributed algorithmic mechanism design: Recent results and future directions. In Proceedings of the Sixth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, ACM Press, Sept. 2002.
14. J. Feigenbaum and S. Shenker. Incentives and Internet algorithms. Tutorial given at PODC 2003. Available at http://www.cs.yale.edu/~jf/PODC03.ppt, July 2003.
15. M. Felegyhazi, L. Buttyan, and J. P. Hubaux. Equilibrium analysis of packet forwarding strategies in wireless ad hoc networks - the static case. In Proceedings of Personal Wireless Communications (PWC), Venice, Italy, 2003.
16. D. Ganesan, B. Krishnamachari, A. Woo, D. Culler, D. Estrin, and S. Wicker. Complex behavior at scale: An experimental study of low-power wireless sensor networks. Technical Report UCLA/CSD-TR 02-0013, Computer Science Department, UCLA, July 2002.
17. GloMoSim. http://pel.cs.ucla.edu/projects/glomosim/.
18. M. Goemans, L. E. Li, V. S. Mirrokni, and M. Thottan. Market sharing games applied to content distribution in ad-hoc networks. In Proceedings of the Fifth ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), New York, NY, USA, 2004.
19. O. Goldreich. Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press, Aug. 2001.
20. T. Groves. Incentives in teams. Econometrica, 41:617-663, 1973.
21. J. Hershberger and S. Suri. Vickrey prices and shortest paths: What is an edge worth? In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, Nevada, Oct. 2001.
22. E. Huang, J. Crowcroft, and I. Wassell. Rethinking incentives for mobile ad hoc networks. In Proceedings of ACM SIGCOMM Workshop on Practice and Theory of Incentives and Game Theory in Networked Systems, Portland, OR, Sept. 2004.
23. M. Jakobsson. Ripping coins for a fair exchange. In Advances in cryptology, EUROCRYPT, 1995.
24. M. Jakobsson, J. P. Hubaux, and L. Buttyan. A micropayment scheme encouraging collaboration in multi-hop cellular networks. In Proceedings of Financial Crypto, La Guadeloupe, Jan. 2003.
25. A. Konrad, B. Zhao, A. Joseph, and R. Ludwig. Explicit loss notification and wireless web performance. In Proceedings the Fourth ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems, Rome, Italy, July 2001.
26. D. M. Kreps. Game Theory and Economic Modeling. Oxford Press, 1991.
27. Y.-B. Lin and I. Chlamtac. Wireless and Mobile Network Architectures. John Wiley and Sons, 2000.
28. H. Luo, R. Ramjee, P. Sinha, L. Li, and S. Lu. UCAN: A unified cellular and ad-hoc network architecture. In Proceedings of the Ninth International Conference on Mobile Computing and Networking (Mobicom), San Diego, CA, Sept. 2003.
29. R. Mahajan, M. Rodrig, D. Wetherall, and J. Zahorjan. Experiences applying game theory to system design. In Proceedings of ACM SIGCOMM Workshop on Practice and Theory of Incentives and Game Theory in Networked Systems, Portland, OR, Sept. 2004.
30. S. Marti, T. Giuli, K. Lai, and M. Baker. Mitigating routing misbehavior in mobile ad hoc networks. In Proceedings of the Sixth International Conference on Mobile Computing and Networking (Mobicom), Boston, MA, Aug. 2000.
31. P. Michiardi and R. Molva. Core: A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc network. In Proceedings of Communications and Multimedia Security Conference (CMS), Portoroz, Sept. 2002.
32. N. Nisan and A. Ronen. Computationally feasible VCG mechanisms. In Proceedings of the ACM Symposium on Electronic Commerce (EC), Minneapolis, MN, Oct. 2000.
33. N. Nisan and A. Ronen, Algorithmic mechanism design. Games and Economic Behavior, 35:166-196, 2001.
34. M. J. Osborne and A. Rubenstein. A Course in Game Theory. The MIT Press, 1994.
35. C. Papadimitriou. Algorithms, games, and the Internet. In Proceedings of the 33rd Annual Symposium on Theory of Computing, Heraklion, Crete, Greece, July 2001.
36. C. Perkins. Ad Hoc Networking. Addison-Wesley, 2000.
37. T. Rappaport. Wireless Communications: Principles and Practice. Prentice Hall, 2nd edition, Dec. 2001.
38. I. Ray and I. Ray. Fair exchange in e-commerce. SIGecom Exchange, 3(2):9-17, 2002.
39. N. B. Salem, L. Buttyan, J. P. Hubaux, and M. Jakobsson. A charging and rewarding scheme for packet forwarding in multi-hop cellular networks. In Proceedings of the Fourth ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Annapolis, MD, June 2003.
40. V. Srinivasan, P. Nuggehalli, C.-F. Chiasserini, and R. Rao. Cooperation in wireless ad hoc networks. In Proceedings of IEEE INFOCOM, San Francisco, CA, Apr. 2003.
41. D. R. Stinson. Cryptography: Theory and Practice. CRC Press, 1995.
42. C.-K. Toh. Ad Hoc Mobile Wireless Networks: Protocols and Systems. Prentice Hall PTR, 2001.
43. W. Vickrey. Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance, 16:8-37, 1961.
44. W. Wang, X.-Y. Li, and Y. Wang. Truthful multicast in selfish wireless networks. In Proceedings of the Tenth International Conference on Mobile Computing and Networking (Mobicom), Philadelphia, PA, Sept. 2004.
45. A. Woo and D. Culler. Taming the underlying challenges of reliable multihop routing in sensor networks. In Proceedings of the First ACM Conference on Embedded Networked Sensor Systems (SenSys), Los Angles, CA, Nov. 2003.
46. J. Zhao and R. Govindan. Understanding packet delivery performance in dense wireless sensor networks. In Proceedings of the First ACM Conference on Embedded Networked Sensor Systems (SenSys), Los Angles, CA, Nov. 2003.
47. S. Zhong, J. Chen, and Y. R. Yang. Sprite, a simple, cheat-proof, credit-based system for mobile ad-hoc networks. In Proceedings of IEEE INFOCOM, San Francisco, CA, Apr. 2003.