CFP last date
20 June 2024
Reseach Article

Optimized Solutions for Routing Issue in IEEE 802.11 based Wireless Mesh Networks using Cooperative Game Theory and Bargaining Solutions

Published on None 2011 by Raveenpal Kaur, Gurpal Singh
Evolution in Networks and Computer Communications
Foundation of Computer Science USA
ENCC - Number 3
None 2011
Authors: Raveenpal Kaur, Gurpal Singh

Raveenpal Kaur, Gurpal Singh . Optimized Solutions for Routing Issue in IEEE 802.11 based Wireless Mesh Networks using Cooperative Game Theory and Bargaining Solutions. Evolution in Networks and Computer Communications. ENCC, 3 (None 2011), 24-28.

author = { Raveenpal Kaur, Gurpal Singh },
title = { Optimized Solutions for Routing Issue in IEEE 802.11 based Wireless Mesh Networks using Cooperative Game Theory and Bargaining Solutions },
journal = { Evolution in Networks and Computer Communications },
issue_date = { None 2011 },
volume = { ENCC },
number = { 3 },
month = { None },
year = { 2011 },
issn = 0975-8887,
pages = { 24-28 },
numpages = 5,
url = { /specialissues/encc/number3/3733-encc022/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
%0 Special Issue Article
%1 Evolution in Networks and Computer Communications
%A Raveenpal Kaur
%A Gurpal Singh
%T Optimized Solutions for Routing Issue in IEEE 802.11 based Wireless Mesh Networks using Cooperative Game Theory and Bargaining Solutions
%J Evolution in Networks and Computer Communications
%@ 0975-8887
%N 3
%P 24-28
%D 2011
%I International Journal of Computer Applications

Routing is a major issue in the Wireless Mesh Networks. Game theory can be one of the solutions to this problem. The outcomes of the game theory can be sometimes not Pareto-optimal for the leader follower approach, so cooperative solution can be used to enhance the optimality of the solution or make them Pareto optimal. In this paper we presented an analytical model to inculcate the concept of bargaining and cooperation. This is done by associating the channel with various levels of QOS, so that the user can negotiate with the manager for different types of applications according to their QOS requirement. This proposed model can increase the throughput of the network also./p>

  1. Mehran Abolhasan, Tadeusz Wysocki and Eryk Dutkiewicz, “A review of routing protocols for mobile ad hoc networks”, Journal of Ad Hoc Networks, Elsevier Press, Volume-2, No. 1, pp. 1-22, 2004.
  2. F.Ahourai, M.Tabandeh,M.Jahed, B.Afsari "A Fair Routing Algorithm for Wireless Mesh Networks Based on Game Theory" in ICN,2009 Eighth International Conference on Networks, pp. 144-149 , 2009.
  3. Ian F.Akyildizz, Xudong Wang, Weilin Wang, "Wireless Mesh Networks : A Survey" In Computer Networks and ISDN Systems, volume 47, 2005.
  4. Rainer Baumann, Simon Heimlicher, Vincent Lenders, Martin May, “Routing Packets into Wireless Mesh Networks” in Proceedings of The IEEE third Conference on Wireless and Mobile Computing, Networking and Communication,(WiMOB 2007), pp.38-45, 2007.
  5. Ishita Bhakta"Incorporating QoS Awareness in Routing Metrics for Wireless Mesh Networks" in Proceedings of the World Congress on Engineering, Vol 1, London, U.K, 2010.
  6. Miguel Elias M. Campista"Routing Metrics and Protocols for Wireless Mesh Networks" IEEE Network, volume-22, No.1, pp. 6-12, 2008.
  7. Xi-Ren Cao, Hong-Xia Shen, Rodolfo Milito and and Patrica Wirth, “Internet Pricing With a Game Theorectic Approach: Concepts and Examples” , IEEE, pp. 208-216, 2002.
  8. T. Clausen, P. Jacquet, “Optimized Link State Routing Protocol(OLSR), RFC 3626, 2003.
  9. Douglas S. J. De Couto, Daniel Aguayo, John Bicket, Robert Morris, "A High-Throughput Path Metric for Multi-Hop Wireless Routing" In ACM MobiCom ’03, San Diego, California, USA, 2003.
  10. R. Duncan and Howard Raiffa “ Games and Decisions, introduction and critical survey” Harvard University Press,1989.
  11. Pedro Miguel Esposito, Miguel Elias M.Campista et al, “Implementing the Expected Transmission Time metrics for OLSR Wireless Mesh Network” IEEE Journal on selected areas, 2008.
  12. Mark Felegyhazi, jean-pierre hubaux, “Game Theory in Wireless Networks: A tutorial”, EPFL-Switzerland, EPFL Technical Report:LCA-Report-2006-002,2006.
  13. David B. Johnson, David A. Maltz and Yih-Chun Hu, “The dynamic source routing protocol for mobile ad hoc networks for Ipv4”, RFC 4728, 2007.
  14. Seongkwan kim, Okhwan Lee, Sunghyun Choi and Sung-ju Lee, “An optimal Route Construction in Wireless Mesh Networks” ,IITa-2008,Korea,2008.
  15. Juha Leino “Applications of Game Theory in Ad Hoc Networks” , Master thesis in Department of Engineering Physics and Mathematics, Helsinki University of Technology, 2003.
  16. Allen B. MacKenzie and Luiz A. DaSilva, “ Game Theory for Wireless Engineers”, Morgan & Claypool Publishers, First Edition , 2006.
  17. M. Michalak and T. Braun, “Common gateway architecture for mobile ad-hoc networks,” in WONS ’05: Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services (WONS’05). Washington, DC, USA: IEEE Computer Society, pp. 70–75, 2005.
  18. Mohammad Naserian, Kemal Tepe , “Game theoretic approach in routing protocol for wireless ad hoc networks”, Sciencedirect, Ad Hoc Networks 7, pp. 569–578, 2009.
  19. John Von Newmann and Oskar Morgenstern “ Theory of Games and Economics Behavior”, Princeton University Press, 1953.
  20. N. Nikaein, H. Laboid and C. Bonnet, “Distributed Dynamic routing algorithm (DDR) formobile ad hoc networks”, Proceedings of the First IEEE Annual Workshop on Mobile Ad Hoc Networking and Computing (MobiHOC 2000), Boston, USA, 2000.
  21. Richard Draves, J. Padhye, B.Zill," Comparison of Routing Metrics for Static Multi-Hop Wireless Networks", In ACM SIGCOMM, Portland, Oregon, USA,2004.
  22. C. E. Perkins and Pravin Bhagwat, “Highly Dynamic Destination Sequenced Distance Vector (DSDV) Routing for mobile computers”, ACM Conference on Communications Architectures, Protocols and Applications (SIGCOMM), London, pp 234-244, 1994.
  23. C.E. Perkins, Belding-Royer and S. Das, “Ad hoc on demand distance vector (AODV)routing”, RFC 3561, 2003.
  24. R. Ramanathan and J. Redi “ A brief overview of Ad Hoc networks: Challenges and directions” In Communication Magazine, IEEE, volume-30, 2002.
  25. Kaur, Raveenpal, Singh Gurpal, “ Game theoretic approach to routing in 802.11 based wireless mesh networks”, In ETNCC-2011, Udaipur, pp. 76, 2011.
  26. A. E. Roth, Axiomatic Models of Bargaining. New York:Wiley, 1979.
  27. Angelos N. Rouskas , Anastasios A. Kikilis, Stilianos S. Ratsiatos, A game theoretical formulation of integrated admission control and pricing in wireless networks, European Journal of Operational Research 191 (2008) 1175–1188
  28. Hassan Sinky, Bechir Hamdaoui, “Implementation and performance measurement and analysis of OLSR protocol” in the proceedings of the 6th International Wireless Communication and Mobile Computing Conference(ACM),Oregon, USA, pp.286-290,2010.
  29. V. Srivastava, J. Neel, A. MacKenzie, R. Menon, L.A. DaSilva, J. Hicks, J.H. Reed and R. Gilles, “Using Game Theory to Analyze Wireless Ad Hoc Networks,” IEEE Communications Surveys and Tutorials, vol. 7, no. 4, pp. 46-56, 2005.
  30. W. Thomson, “Nash’s bargaining solution and utilitarian choice rules,” Econometrica, vol. 49, no. 2, pp. 535–538, 1981.
  31. Liqiang Zhao and Jie Zhang, ‘Using Incompletely Cooperative Game theory in Wireless Mesh Networks” , IEEE Network, Volume-22, No.1, pp. 39-44, 2008.
Index Terms

Computer Science
Information Sciences


Bargaining solutions cooperative game Leader-follower game Pareto-solutions Quality of service