A reputation system for wireless mesh networks using network coding

Using network coding, wireless mesh networks can significantly improve their performance. However, since many wireless mesh networks have user contributed devices as their nodes, to guarantee the cooperation of such selfish nodes is a highly challenging problem. In this paper, we study how to stimulate selfish nodes to cooperate in wireless mesh networks using network coding. We propose a simple, practical reputation system that rewards cooperative behavior in routing and packet forwarding and penalizes non-cooperative behavior. Simulation results verify that our reputation system is very efficient and that it effectively stimulates cooperation.

[1]  Pietro Michiardi,et al.  Simulation-based analysis of security exposures in mobile ad hoc networks , 2002 .

[2]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[3]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[4]  Robert Tappan Morris,et al.  Architecture and evaluation of an unplanned 802.11b mesh network , 2005, MobiCom '05.

[5]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[7]  J.-P. Hubaux,et al.  Enforcing service availability in mobile ad-hoc WANs , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[8]  Sheng Zhong,et al.  INPAC: An Enforceable Incentive Scheme for Wireless Networks using Network Coding , 2010, 2010 Proceedings IEEE INFOCOM.

[9]  Jochen Mundinger,et al.  Reputation in self-organized communication systems and beyond , 2006 .

[10]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[11]  Muriel Médard,et al.  Symbol-level network coding for wireless mesh networks , 2008, SIGCOMM '08.

[12]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.

[13]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[14]  Stephan Eidenbenz,et al.  Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents , 2003, MobiCom '03.

[15]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[16]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[17]  Jean-Yves Le Boudec,et al.  Self-policing mobile ad hoc networks by reputation systems , 2005, IEEE Communications Magazine.

[18]  Ratul Mahajan,et al.  Sustaining cooperation in multi-hop wireless networks , 2005, NSDI.

[19]  Fan Wu,et al.  Incentive-compatible opportunistic routing for wireless networks , 2008, MobiCom '08.

[20]  Robert Tappan Morris,et al.  ExOR: opportunistic multi-hop routing for wireless networks , 2005, SIGCOMM '05.

[21]  Sachin Katti,et al.  Trading structure for randomness in wireless opportunistic routing , 2007, SIGCOMM 2007.

[22]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[23]  S. Buchegger,et al.  A Robust Reputation System for Mobile Ad-hoc Networks , 2003 .