An Incentive Mechanism Using Game Theory for Wireless Mesh Networks

Article Preview

Abstract:

Wireless mesh networks (WMNs) have attracted much attention in recent years. The main problems in WMNs are the unfairness in bandwidth sharing and potential selfish behavior. In this paper, an incentive-based pricing model is designed which follows the concepts of mechanism design in game theory to encourage nodes to relay packets for other nodes and therefore achieve fairness. In the pricing model, we consider the packet transmitting amounts, idle conditions and the special need of border nodes in the margin area. The incentive is the main feature of the model. We also discuss the model using mathematical analysis from various perspectives. The analysis shows that this model is highly effective in eliminating unfairness in the multi-hop transmission topology. This is achieved by allowing border mesh routers to receive a fair profit. This flexible pricing model is capable of encouraging packet forwarding. With the issue of unfairness resolved, WMNs can be expected to have a broader range of applications.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2694-2698

Citation:

Online since:

January 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Ashutosh Deepak Gore and Abhay Karandikar, Link: Scheduling Algorithms for Wireless Mesh Networks, IEEE Communication Surveys & Tutorials, Vol. 13, No. 2, Second Quarter (2011).

DOI: 10.1109/surv.2011.040510.00008

Google Scholar

[2] Lakshmi Santhanam, Bin Xie, and Dharma P. Agrawal: Selfishness in mesh networks: wired multihop MANETs, IEEE Wireless Communications, Volume: 15 Issue: 4, Aug (2008), pp.16-23.

DOI: 10.1109/mwc.2008.4599217

Google Scholar

[3] Nisan N. Ronen A: Algorithmic mechanism design, Games and Economic Behavior, (2001).

Google Scholar

[4] Eric S. Maskin: Mechanism Design: How to Implement Social Goals, Eric Maskin's Nobel Memorial Prize Lecture, (2008).

Google Scholar

[5] S. Zhong, Y. Yang, and J. Chen: Sprite: A Simple, Cheat Proof, Credit-Based System for Mobile MANETs, Proc. IEEE INFOCOM, (2003).

DOI: 10.1109/infcom.2003.1209220

Google Scholar

[6] S. Marti et al.,: Mitigating Router Misbehavior in Mobile MANETs, Proc. Mobi-Com, (2000).

Google Scholar

[7] S. Bansal and M. Baker: Observation-based Cooperation Enforcement in Ad Hoc Networks, Technical report, Stanford University, NI/0307012, (2003).

Google Scholar

[8] H. -Y. Wei and R. D. Gitlin: Incentive Mechanism Design for Selfish Hybrid Wireless Relay Networks, Proc. Mobile Networks and Apps., vol. 10, (2005) , p.929–37.

DOI: 10.1007/s11036-005-4449-1

Google Scholar

[9] Jeng-Farn Lee and Wen-Hsing Kuo: Fairness Provisioning in Multi-hop Wireless Backhaul Networks: Challenges and Solutions, Computer Communications, (2010).

DOI: 10.1016/j.comcom.2010.04.048

Google Scholar

[10] Tansu Alpcan and Lacra Pavel: Nash Equilibrium Design and Optimization, Proc. 1st Int. Conference on Games in Networks (GameNets2009), Istanbul, Turkey, May (2009).

Google Scholar