INPAC: An enforceable incentive scheme for wireless networks using network coding

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Chen, Tingting ^a   Zhong, Sheng ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

BROADBAND NETWORK ACCESS; COMMUNICATION OVERHEADS; CRYPTOGRAPHIC TECHNIQUES; EVALUATION RESULTS; FORWARD PACKETS; FUNDAMENTAL PROBLEM; INCENTIVE COMPATIBILITY; INCENTIVE COMPATIBLE; INCENTIVE SCHEMES; NETWORK CODING; NEW TECHNOLOGIES; PACKET FORWARDING; ROUTING PROBLEMS; SELFISH NODE;

GAME THEORY; INFORMATION THEORY; NETWORK PROTOCOLS; TECHNOLOGY TRANSFER; WIRELESS MESH NETWORKS (WMN);

MESH NETWORKING;

EID: 77953313948     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462003     Document Type: Conference Paper

References (33)

1. S. Akl and P. Taylor. Cryptographic solution to a problem of access control in a hierarchy. ACM Trans. Computer Systems, 1(3):239-248, 1983.
2. I. F. Akyildiz and X. Wang. A survey on wireless mesh networks. IEEE Communications Magazine, 43(9), 2005.
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 Proceedings of ACM MOBICOM, 2003.
4. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of ACM CCS 1993, pages 62-73, 1993.
5. L. Buttyan and J. P. Hubaux. Enforcing service availability in mobile ad-hoc WANs. In Proceedings of ACM MOBIHOC, 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. S. Chachulski, M. Jennings, S. Katti, and D. Katabi. Trading structure for randomness in wireless opportunistic routing. In Proceedings of ACM SIGCOMM, 2007.
8. S. Chen, P. Lin, D. Huang, and S. R. Yang. A study on distributed/ centralized scheduling for wireless mesh network. In Proceedings of the 2006 International Conference on Wireless Communications and Mobile Computing, pages 599-604, 2006.
9. T. Chen and S. Zhong. Inpac: An enforceable incentive scheme for wireless networks using network coding. Technical report, SUNY Buffalo, Available: http://www.cse.buffalo.edu/tech-reports/2009-04.pdf, 2009.
10. W. Dai. Crypto++5.5.2. Available at http://www.eskimo.com/ weidai/cryptlib.html.
11. D. De Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless routing. In Proceedings of ACM MOBICOM, 2003.
12. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. Medard. Resilient network coding in the presence of byzantine adversaries. In Proceedings of IEEE INFOCOM, 2007.
13. M. Jakobsson, J. P. Hubaux, and L. Buttyan. A micropayment scheme encouraging collaboration in multi-hop cellular networks. In Proceedings of Financial Crypto 2003, La Guadeloupe, Jan. 2003.
14. J. J. Jaramillo and R. Srikant. Darwin: Distributed and adaptive reputation mechanism for wireless ad-hoc networks. In Proceedings of ACM MOBICOM, 2007.
15. S. Katti, S. Gollakota, and D. Katabi. Embracing wireless interference: Analog network coding. In Proceedings of ACM SIGCOMM, 2007.
16. S. Katti, D. Katabi, H. Balakrishnan, and M. Medard. Symbol-level network coding for wireless mesh networks. In Proceedings of ACM SIGCOMM, 2008.
17. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft. XORs in the air: Practical wireless network coding. In Proceedings of ACM SIGCOMM '06, Pisa, Italy, Sept. 2006.
18. X.-Y. Li, Y. Wu, P. Xu, G. Chen, and M. Li. Hidden information and actions in multi-hop wireless ad hoc networks. In Proceedings of ACM MOBIHOC, 2008.
19. http://madwifi.org.
20. S. Marti, T. Giuli, K. Lai, and M. Baker. Mitigating routing misbehavior in mobile ad hoc networks. In Proceedings of ACM MOBICOM, 2000.
21. Meraki Networks. http://meraki.com.
22. MuniWireless LLC. http://www.muniwireless.com.
23. M. J. Osborne and A. Rubenstein. A Course in Game Theory. The MIT Press, 1994.
24. Rutgers ORBIT project team. http://www.orbit-lab.org.
25. 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 ACM MOBIHOC, 2003.
26. http://www.read.cs.ucla.edu/click/.
27. W. Wan, X.-Y. Li, and Y. Wang. Truthful multicast in selfish wireless networks. In Proceedings of ACM MOBICOM, 2004.
28. W. Wang, S. Eidenbez, Y. Wang, and X.-Y. Li. OURS-optimal unicast routing systems in non-cooperative wireless networks multihop routing in sensor networks. In Proceedings of ACM MOBICOM.
29. F. Wu, T. Chen, S. Zhong, L. E. Li, and Y. R. Yang. Incentive compatible opportunistic routing for wireless networks. In Proceedings of ACM MOBICOM, 2008.
30. Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan. An efficient signature-based scheme for securing network coding against pollution attacks. In Proceedings of IEEE INFOCOM, 2008.
31. 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 '03, San Francisco, CA, Apr. 2003.
32. S. Zhong, L. Li, Y. Liu, and Y. R. Yang. On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks - an integrated approach using game theoretical and cryptographic techniques. In Proceedings of ACM MOBICOM, 2005.
33. S. Zhong and F. Wu. On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks. In Proceedings of ACM MOBICOM, 2007.