Game theory for routing modeling in communication networks - A survey

Journal of Communications and Networks

Volumn 10, Issue 3, 2008, Pages 268-286

  Pavlidou, Fotini Niovi ^a   Koltsidas, Georgios ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

Ad hoc networks; Game theory; Kayesian games; Nash equilibrium; Network routing; Price of anarchy; Routing modeling; Sensor networks

Indexed keywords

AD HOC NETWORKS; NETWORK ROUTING; SENSOR NETWORKS;

AD-HOC NETWORKS; ANALYTICAL TOOL; COMMUNICATIONS NETWORKS; KAYESIAN GAME; MULTIPLE DOMAINS; NASH EQUILIBRIA; PERFORMANCE; PRICE OF ANARCHY; ROUTING MODEL; SENSORS NETWORK;

GAME THEORY;

EID: 78649472752     PISSN: 12292370     EISSN: None     Source Type: Journal    
DOI: 10.1109/JCN.2008.6388348     Document Type: Article

References (54)

1. I. Von Neumann and O. Morgenstern. Theory of Claim's and Economic behavior. Princeton I'niversity Press. 1944.
2. F. Altman, T. Boulogne and L. Wynter. "A survey on networking games in telecommunications." Coinptit, and Operations Research, vol. 33, pp. 286-31 1. Feb. 2006.
3. V. Snvastava, J. Neel, A. B. MacKenzie, R. Menon, L. A. Da Silva, J. E. Hicks, I. H. Reed, and R. P. Gilles. "Using game theory to analyze wireless ad hoc networks." IEEE Coimmtn. Surveys This., vol. 7. pp. 46-56, Forth Quarter 2005.
4. Y Yoo and D. I. Agrawal. "Why does it pay to hesellish mamanel, " IEEE Wireless Commun. Man. vol. 6. pp. 7-47. Dec. 2006.
5. K. Mandalas, D. Flitaiiis, C. I. Marias, and P. Georgiadis. "A survey of several cooperation enforcement schemes tor manets." in Pine. 5th ISSPIT W, ( Athens. Greece), pp. 466-471. Dec. 2005.
6. R. B. Mverson. Game Theory: Analysis of Contrite. Harvard University Press. 1991.
7. A. Orda, R. Rom and N. Shimkm. "Competitive routing in multi-user communication networks." IEEE/ACM Trans., Netw.. vol. 1. pp. 510-521, Oct.1993.
8. F. Altman, T. Basar, T. Jimenez, and N. Slumkin. "Competitive routing in networks with polynomial cost." IEEE Trans. Autoni. Control, vol. 47. pp. 2, Jan. 2002.
9. I. Sahin and M A. Simaan. "A tow and routing control policy tor communication networks with multiple competitive users." J. Eianklin Institute. vol. 343. pp. 168. Oct. 2006.
10. IF Man, Y Li, and J. Xluiang. "Analysis of a multi-stream Qos game for multi path rowing." in Proc. ICME 2007. (Beijing. China), pp. 1083-1086. July 2007.
11. I. Man and Y Li. "A game theoretic approach to multi stream Qos routing." in Proc. ICME 2007, San Francisco CA. CSAI. pp. 1-5. Nov. 2006.
12. K. Yamaoka and Y Nakai. "A packet touting method based on game theory." IEICE Commun. vol. 81. pp. 89-96. Dec. 1998.
13. R. Banner and A. Orda. "Bottleneck routing games m communication networks." IEEE.I. Set. Areas Commun. vol. 25, pp. 17 -07. Aug. 2007.
14. F. Koutsoupias and C. Papadunitilou. "Worst case equilibria." in Proc 16th STACS'99. Mar. 1999. pp. 404-419.
15. I. Roughgaiden and F lardos. "How bad is sellish routing" J. ACM. vol. 4, pp. 216-251. Mar. 2002.
16. T. Roughgarden. "The price of anarchy is independent of the network topology, " J. Compul. Syst. Sciences, vol. 67, pp. 341-364, Sept. 2003.
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 STQC2004. (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 IOCS 2004, (Rome, Italy), Oct. 17-19 2004, pp. 295-304.
20. S. H. Rhee and T. Konstantopoulos, "Optima! flow control and capacity allocation in multi- service networks, " in Proc. of 37th CDC9H, (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.
22. D. Acemoglu and R. Johari, "Partially optimal routing." IEEE J. Set Areas Commun., vol. 25, pp. 1148-1160, Aug. 2007.
23. R. J. La and V. Anantharam, "Optimal routing control: Repeated game approach." IEEE Trans. Autom. Control, vol. 47, pp. 437-450, Mar. 2002.
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. Nuggehaili, 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 hex; networks: A formal description of selfishness, " in Proc. 1st WiUpt 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 Compul. vol. 5. pp. 463-476. May 2006.
31. M. Felegyhazi. J.-P. Hubaux, and L. Buttyan, "Equilibrium analysis of packet forwarding strategies in wireless ad hoc networks - The dynamiccase, " 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 peration in mobile ad hoc networks." in Proc. 6lh IFIP/CMS 2002. vol. 228, (Portoroz, Slovenia). Sept. 26-27 2002, pp. 107-121.
35. C. E. Bolton and A. Ockenfels, "Ere: A theory of equity, reciprocity, and competition." The American Economic Review, vol. 90. pp. 166 -193, 2000.
36. F. Milan, J. J. Jaramillo and R. Srikant, "Achieving cooperation in multi- hop 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.
38. E. Altman, A. A. Kherani, P. Michiardi, and R. Molva, "Non-cooperative forwarding in ad-hoc networks." Lecture Notev 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 A1NA 2007, (GinoWan. Okinawa. Japan). Mar. 2007. pp. 1062-1069.
40. R. Kannan, L. Ray, R. Kalidindi and S. Iyengar, "Max-min length-energy- constrained 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 1CCT 2006. (Guilin. China). Nov, 27-30 2006, pp. 1- 5.
42. O. 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 for warding 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. Da Silva, "Equilibria for node participation in ad hoc networks - An imperfect monitoring approach, " in Proc. IEEE ICC (Istanbul, Turkey), June 11-15 2006. pp. 3850-3855.
46. R. Kannan and S. S. Iyengar, "Game-theoretic models for reliable path- length and energy-constrained routing with data aggregation in wireless sensor networks, " IEEE J. Sel. Areas Commun., vol. 22. pp. 1141-1150. Aug. 2004.
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 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 veg auctions can hardly be applied to the pricing of inter-domain and ad hoc networks, " in Proc. 3rd NG1 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.