On the credit evolution of credit-based incentive protocols in wireless mesh networks

In designing wireless mesh networks (WMNs), incentive mechanisms are often needed so to encourage nodes to relay or forward packets for other nodes. However, there is a lack of fundamental understanding on the interactions between the incentive mechanisms and the underlying protocols (e.g., shortest-path routing, ETX routing or back-pressure scheduling), and whether integration of these protocols will lead to a robust network, i.e., networks can sustain a given traffic workload. The objective of this paper is to present a general mathematical framework via stochastic difference equations to model the interaction of incentive mechanisms and various underlying protocols. We first present a credit evolution model to quantify the expected credit variation of each node in WMN, then use the norm of the expected credits variation to quantify the credit disparity. We also propose the use of differentiated pricing and show how it can achieve credit equality among nodes, resulting in a more robust network under different traffic loading. Our analytical framework can help researchers to model other incentive/routing protocols so to analyze the robustness of the underlying networks.

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

[2]  John C. S. Lui,et al.  A Mathematical Framework for Analyzing Adaptive Incentive Protocols in P2P Networks , 2012, IEEE/ACM Transactions on Networking.

[3]  Athanasios D. Panagopoulos,et al.  A survey on game theory applications in wireless networks , 2010, Comput. Networks.

[4]  Xiaojun Lin,et al.  The impact of imperfect scheduling on cross-Layer congestion control in wireless networks , 2006, IEEE/ACM Transactions on Networking.

[5]  Dharma P. Agrawal,et al.  Selfishness in mesh networks: wired multihop MANETs , 2008, IEEE Wireless Communications.

[6]  Sheng Zhong,et al.  A reputation system for wireless mesh networks using network coding , 2011, J. Netw. Comput. Appl..

[7]  Prasanna Chaporkar,et al.  Throughput Guarantees Through Maximal Scheduling in Wireless Networks , 2008 .

[8]  E. S. Gopi,et al.  Probability And Random Process , 2007 .

[9]  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).

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

[11]  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).

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

[13]  Hongying Liu,et al.  Analyzing credit evolution for credit-based incentive schemes in wireless mesh networks , 2011, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[14]  Giuseppe Di Battista,et al.  26 Computer Networks , 2004 .

[15]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[16]  Lei Ying,et al.  On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

[17]  Joseph Y. Halpern,et al.  Efficiency and nash equilibria in a scrip system for P2P networks , 2006, EC '06.

[18]  Xuemin Shen,et al.  PIS: A Practical Incentive System for Multihop Wireless Networks , 2010, IEEE Transactions on Vehicular Technology.

[19]  Xiaoheng Deng,et al.  An Enforceable Incentive Scheme in Wireless Multi-path Inter-session Network Coding Game , 2012, J. Networks.

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

[21]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[22]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..

[23]  Sheng Zhong,et al.  On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques , 2005, MobiCom '05.

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

[25]  M. Mézard,et al.  Wealth condensation in a simple model of economy , 2000, cond-mat/0002374.

[26]  R. Srikant,et al.  DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks , 2007, MobiCom '07.

[27]  Carolyn M. Moehling,et al.  Rising Inequality: Trends In The Distribution Of Wealth In Industrializing New England , 2001 .

[28]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

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

[30]  John C. S. Lui,et al.  Analysis of Adaptive Incentive Protocols for P2P Networks , 2009, IEEE INFOCOM 2009.

[31]  Levente Buttyán,et al.  Enforcing service availability in mobile ad-hoc WANs , 2000, MobiHoc.

[32]  R. E. Wheeler Statistical distributions , 1983, APLQ.

[33]  Yasir Saleem,et al.  Network Simulator NS-2 , 2015 .

[34]  Xuemin Shen,et al.  Stimulating Cooperation in Multi-hop Wireless Networks Using Cheating Detection System , 2010, 2010 Proceedings IEEE INFOCOM.

[35]  Levente Buttyán,et al.  Nash equilibria of packet forwarding strategies in wireless ad hoc networks , 2006, IEEE Transactions on Mobile Computing.

[36]  Balaji Prabhakar,et al.  The throughput of data switches with and without speedup , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).