Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Game Theory for Routing Modeling in Communication Networks - A Survey

  • Pavlidou, Fotini-Niovi (Department of Electrical and Computer Engineering, Faculty of Engineering, Aristotle University) ;
  • Koltsidas, Georgios (Department of Electrical and Computer Engineering, Faculty of Engineering, Aristotle University)
  • Published : 2008.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this work, we review the routing models that use game theoretical methodologies. A very common assumption in the analysis and development of networking algorithms is the full cooperation of the participating nodes. Most of the analytical tools are based on this assumption. However, the reality may differ considerably. The existence of multiple domains belonging to different authorities or even the selfishness of the nodes themselves could result in a performance that significantly deviates from the expected one. Even though it is known to be extensively used in the fields of economics and biology, game theory has attracted the interest of researchers in the field of communication networking as well. Nowadays, game theory is used for the analysis and modeling of protocols in several layers, routing included. This review aims at providing an elucidation of the terminology and principles behind game theory and the most popular and recent routing models. The examined networks are both the traditional networks where latency is of paramount importance and the emerging ad hoc and sensor networks, where energy is the main concern.

Keywords

References

  1. J. von Neumann and O. Morgenstern, Theory of Games and Economic behavior. Princeton University Press, 1944.
  2. E. Altman, T. Boulogne, R. E. Azouzi, T. Jimenez, and L. Wynter, "A survey on networking games in telecommunications," Comput. and Operations Research, vol. 33, pp. 286-311, Feb. 2006. https://doi.org/10.1016/j.cor.2004.06.005
  3. V. Srivastava, J. Neel, A. B. MacKenzie, R. Menon, L. A. DaSilva, J. E. Hicks, J. H. Reed, and R. P. Gilles, "Using game theory to analyze wireless ad hoc networks," IEEE Commun. Surveys Tuts., vol. 7, pp. 46-56, Forth Quarter 2005.
  4. Y. Yoo and D. P. Agrawal, "Why does it pay to be selfish in a manet?," IEEE Wireless Commun. Mag., vol. 6, pp. 87-97, Dec. 2006.
  5. K. Mandalas, D. Flitzanis, G. F. Marias, and P. Georgiadis, "A survey of several cooperation enforcement schemes for manets," in Proc. 5th ISSPIT 2005, (Athens, Greece), pp. 466-471, Dec. 2005.
  6. R. B. Myerson, Game Theory: Analysis of Conflict. Harvard University Press, 1991.
  7. A. Orda, R. Rom, and N. Shimkin, "Competitive routing in multi-user communication networks," IEEE/ACM Trans. Netw., vol. 1, pp. 510-521, Oct. 1993. https://doi.org/10.1109/90.251910
  8. E. Altman, T. Basar, T. Jimenez, and N. Shimkin, "Competitive routing in networks with polynomial cost," IEEE Trans. Autom. Control, vol. 47, pp. 92-96, Jan. 2002. https://doi.org/10.1109/9.981725
  9. I. Sahin and M. A. Simaan, "A flow and routing control policy for communication networks with multiple competitive users," J. Franklin Institute, vol. 343, pp. 168-180, Oct. 2006. https://doi.org/10.1016/j.jfranklin.2005.11.001
  10. H. Man, Y. Li, and X. Zhuang, "Analysis of a multi-stream qos game for multi-path routing," in Proc. ICME 2007, (Beijing, China), pp. 1083- 1086, July 2007.
  11. H. Man and Y. Li, "A game theoretic approach to multi-stream qos routing," in Proc. IEEE GLOBECOM 2006, (San Francisco, CA, USA), pp. 1- 5, Nov. 2006.
  12. K. Yamaoka and Y. Sakai, "A packet routing method based on game theory," IEICE Commun., vol. 81, pp. 89-96, Dec. 1998.
  13. R. Banner and A. Orda, "Bottleneck routing games in communication networks," IEEE J. Sel. Areas Commun., vol. 25, pp. 1173-1179, Aug. 2007. https://doi.org/10.1109/JSAC.2007.070811
  14. E. Koutsoupias and C. Papadimitriou, "Worst case equilibria," in Proc. 16th STACS'99, (Trier, Germany), Mar. 4-6 1999, pp. 404-419.
  15. T. Roughgarden and E. Tardos, "How bad is selfish routing?," J. ACM, vol. 49, pp. 236-259, Mar. 2002. https://doi.org/10.1145/506147.506153
  16. T. Roughgarden, "The price of anarchy is independent of the network topology," J. Comput. Syst. Sciences, vol. 67, pp. 341-364, Sept. 2003. https://doi.org/10.1016/S0022-0000(03)00044-8
  17. B. Awerbuch, Y. Azar, and A. Epstein, "The price of routing unsplittable flow," in Proc. 37th STOC 2005, (Baltimore, MD, USA), May 22-24 2005, pp. 57-66.
  18. E. Anshelevich, A. Dasgupta, E. Tardos, and T. Wexler, "Near-optimal network design with selfish agents," in Proc. 36th STOC 2004, (San Diego, CA, USA), June 9-11 2004, pp. 511-520.
  19. E. Anshelevich, A. Dasguptay, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden, "The price of stability for network design with fair cost allocation," in Proc. 45th FOCS 2004, (Rome, Italy), Oct. 17-19 2004, pp. 295-304.
  20. S. H. Rhee and T. Konstantopoulos, "Optimal flow control and capacity allocation in multi- service networks," in Proc. of 37th CDC'98, (Tampa, Florida, USA), Dec. 16-18 1998, pp. 1662-1667.
  21. E. Altman, T. Basear, and R. Srikant, "Nash equilibria for combined flow control and routing in networks: Asymptotic behavior for a large number of users," IEEE Trans. Autom. Control, vol. 47, pp. 917-930, Aug. 2002. https://doi.org/10.1109/TAC.2002.1008358
  22. D. Acemoglu and R. Johari, "Partially optimal routing," IEEE J. Sel. Areas Commun., vol. 25, pp. 1148-1160, Aug. 2007. https://doi.org/10.1109/JSAC.2007.070809
  23. R. J. La and V. Anantharam, "Optimal routing control: Repeated game approach," IEEE Trans. Autom. Control, vol. 47, pp. 437-450, Mar. 2002. https://doi.org/10.1109/9.989076
  24. S. Fischer and B. Vocking, "Evolutionary game theory with applications to adaptive routing," in Proc. ECCS 2005, (Paris, France), Nov. 2005.
  25. V. Srinivasan, P. Nuggehalli, C. F. Chiasserini, and R. R. Rao, "Cooperation in wireless ad hoc networks," in Proc. IEEE INFOCOM 2003, (San Francisco, CA, USA), Mar 2003.
  26. R. Axelrod, The Evolution of Cooperation. New York: Basic Books, 1984.
  27. A. Urpi, M. Bonuccelli, and S. Giordano, "Modeling cooperation in mobile ad hoc networks: A formal description of selfishness," in Proc. 1st WiOpt 2003, (Sophia-Antipolis, France), Mar. 2003.
  28. P. Nurmi, "Modelling routing in wireless ad hoc networks with dynamic bayesian games," in Proc. 1st SECON 2004, (Santa Clara, CA, USA), Oct. 2004, pp. 63-70.
  29. P. Nurmi, "Modeling energy constrained routing in selfish ad hoc networks," in Proc. GameNets 2006, (Pisa, Italy), Oct. 14 2006.
  30. M. Felegyhazi, J.-P. Hubaux, and L. Buttyan, "Nash equilibria of packet forwarding strategies in wireless ad hoc networks," IEEE Trans. Mobile Comput., vol. 5, pp. 463-476, May 2006. https://doi.org/10.1109/TMC.2006.68
  31. M. Felegyhazi, J.-P. Hubaux, and L. Buttyan, "Equilibrium analysis of packet forwarding strategies in wireless ad hoc networks - the dynamic case," Tech. Rep. 2003.
  32. I. Zakiuddina, T. Hawkins, and N. Moffat, "Towards a game theoretic understanding of ad-hoc routing," Electronic Notes in Theoretical Computer Science, vol. 11, pp. 67-92, Dec. 2005.
  33. P. Michiardi and R. Molva, "Analysis of cooperation strategies in mobile ad hoc networks with imperfect monitoring," Institut Eurecom, Sophia- Antipolis, Research Rep. RR-04-099, Feb. 2004.
  34. P. Michiardi and R. Molva, "Core: A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks," in Proc. 6th IFIP/CMS 2002, vol. 228, (Portoroz, Slovenia), Sept. 26-27 2002, pp. 107-121.
  35. G. E. Bolton and A. Ockenfels, "Erc: A theory of equity, reciprocity, and competition," The American Economic Review, vol. 90, pp. 166-193, 2000. https://doi.org/10.1257/aer.90.1.166
  36. F. Milan, J. J. Jaramillo, and R. Srikant, "Achieving cooperation in multihop wireless networks of selfish nodes," in Proc. GameNets 2006, (Pisa, Italy), Oct. 14 2006.
  37. J. Wu and R. Axelrod, "How to cope with noise in the iterated prisoner's dilemma," J. Conflict Resolution, vol. 39, pp. 183-189, Mar. 1995. https://doi.org/10.1177/0022002795039001008
  38. E. Altman, A. A. Kherani, P. Michiardi, and R. Molva, "Non-cooperative forwarding in ad-hoc networks," Lecture Notes on Computer Science, vol. 3462/2005, pp. 486-498, May 2005.
  39. L. Yan, S. Hailes, and L. Capra, "Analysis of packet relaying models and incentive strategies in wireless ad hoc networks with game theory," in Proc. 22nd AINA 2007, (GinoWan, Okinawa, Japan), Mar. 2007, pp. 1062- 1069.
  40. R. Kannan, L. Ray, R. Kalidindi, and S. Iyengar, "Max-min length-energyconstrained routing in wireless sensor networks," Proc. 1st EWSN 2004, Jan. 19-21 2004, pp. 234-249.
  41. J. Pengt, W. Zhe, Y. Yujie, and W. Shu, "Cooperative packet forwarding in wireless sensor networks," in Proc. 10th ICCT 2006, (Guilin, China), Nov. 27-30 2006, pp. 1-5.
  42. G. V. Crosby and N. Pissinou, "Evolution of cooperation in multi-class wireless sensor networks," in Proc. 32nd LCN 2007, (Dublin, Ireland), Oct. 2007, pp. 489-495.
  43. M. Felegyhazi, J.-P. Hubaux, and L. Buttyaan, "Cooperative packet forwarding in multi-domain sensor networks," in Proc. 3rd PerCom 2005, (Kauai, Hawaii, USA), Mar. 8-12 2005, pp. 345-349.
  44. Z. Ji, W. Yu, and K. J. R. Liu, "Cooperation enforcement in autonomous manets under noise and imperfect observation," in Proc. 3rd SECON 2006, (Reston, VA, USA), Sept. 25-28 2006, pp. 1-5.
  45. V. Srivastava and L. A. DaSilva, "Equilibria for node participation in ad hoc networks - an imperfect monitoring approach," in Proc. IEEE ICC 2006, (Istanbul, Turkey), June 11-15 2006, pp. 3850-3855.
  46. R. Kannan and S. S. Iyengar, "Game-theoretic models for reliable pathlength and energy-constrained routing with data aggregation in wireless sensor networks," IEEE J. Sel. Areas Commun., vol. 22, pp. 1141-1150, Aug. 2004. https://doi.org/10.1109/JSAC.2004.830937
  47. V. Krishna, Auction Theory. Academic Press, 2002.
  48. L. Anderegg and S. Eidenbenz, "Ad hoc-vcg: A truthful and costefficient routing protocol for mobile ad hoc networks with selfish agents," in Proc. ACM Mobicom 2003, (San Diego, CA, USA), Sept. 2003, pp. 245-259.
  49. Z. Wu, Z. Chen, L. Xu, and F. Guo, "Routing protocols based on double auction for ad hoc networks," in Proc. NAS 2007), (Guilin, China), July 2007, pp. 55-61.
  50. K. Tei, H. Muto, Y. Fukazawa, and S. Honiden, "Introducing auction scheme to route allocation to prolong the lifetime of ad-hoc networks," in Proc. CIMCA-IAWTIC 2006, (Sydney, Australia), Nov. 2006, p. 201.
  51. P. Maille and B. Tuffin, "Why vcg auctions can hardly be applied to the pricing of inter-domain and ad hoc networks," in Proc. 3rd NGI 2007, (Trondheim, Norway), May 2007, pp. 36-39.
  52. Y. Xi and E. M. Yeh, "Pricing, competition, and routing for selfish and strategic nodes in multi-hop relay networks," in Proc. IEEE INFOCOM 2008, (Phoenix, AZ, USA), Apr. 2008, pp. 2137-2145.
  53. S.-K. Ng and W. K. Seah, "Game-theoretic model for collaborative protocols in selfish, tariff-free, multihop wireless networks," in Proc. 27th INFOCOM 2008, (Phoenix, AZ, USA), Apr. 2008, pp. 762-770.
  54. M. Naserian and K. Tepe, "Game theoretic approach in routing protocol for wireless ad hoc networks," Ad Hoc Networks, accepted for publication, 2008.