Advertisement

Multi-agent Based Selfish Routing for Multi-channel Wireless Mesh Networks

  • Yanxiang He
  • Jun Xiao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4088)

Abstract

Agent based systems are being used to solve problems ranging from Web search strategies to autonomous robots.In this paper we discuss a multi-agent based selfish routing problem in multi-channel wireless mesh networks. In this selfish routing, k pairs of source-sink (destination) pairs are managed by k different intelligent agents. All the agents are selfish; each agent’s goal is to minimize its own cost without considering the overall performance of the network. Meanwhile, the agents are rational, they always meet the embarrassment that whether they face the probability of causing interference for routing flow by a short cut or they route flow by a longer way steadily. We introduce the game theoretic tools to direct the agents to make feasible choices. We yield a sufficient condition of the existence of pure strategy Nash equilibria and proof it in this paper (we call this the Strong Transmission Game). Some simulations reveal the feasibility of our proposition.

Keywords

Multi-Agent Wireless Mesh Networks Game Theory Nash Equilibrium Selfish Routing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    IEEE 802.16-2004 Part 16: Air Interface for Fixed Broadband Wireless Access Systems (October 2004)Google Scholar
  2. 2.
    Papadimitriou, C.: Algorithms, games, and the internet. In: Proceedings of the 33rd Annual Symposium on the Theory of Computing (2001)Google Scholar
  3. 3.
    Yaïche, H., Mazumdar, R.R., Rosenberg, C.: A Game Theoretic Framework for Bandwidth Allocation and Pricing in Broadband Networks. IEEE/ACM Transaction on Networking 8(5), 667–678 (2000)CrossRefGoogle Scholar
  4. 4.
    Alicherry, M., Bhatia, R., Li, L(E.): Joint Channel Assignment and Routing for Throughput Optimization in Multi-radio Wireless Mesh Networks. In: Proceedings of ACM MOBICOM, pp. 58–72 (2005)Google Scholar
  5. 5.
    Draves, R., Padhye, J., Zill, B.: Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks. In: Proceedings of ACM MOBICOM, pp. 114–128 (2004)Google Scholar
  6. 6.
    Vetta, A.: Nash Equilibria in Competitive Societies, with Applications to Facility Locations, Traffic Routing and Auctions. In: Proceeding of IEEE FOCS (2002)Google Scholar
  7. 7.
    Koutsoupias, E., Papadimitriou, C.H.: Worst-case Equilibria. In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pp. 404–413 (1999)Google Scholar
  8. 8.
    Roughgarden, T., Tardos, É.: How Bad is Selfish Routing? Journal of the ACM 49(2), 236–259 (2002)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination Mechanisms. In: Proceedings of the 31st International Colloquium on Automata, Languages, and Programming (ICALP), July 2004, Turku, Finland, pp. 345–357 (2004)Google Scholar
  10. 10.
    Deng, X., Papadimitriou, C.H., Safra, S.: On the Complexity of Equilibria. In: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, pp. 67–71 (2002)Google Scholar
  11. 11.
    Nash Jr., J.F.: Non-cooperative Game. Annual of Mathematics 54(2), 286–295 (1951)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Kearns, M., Littman, M.L., Singh, S.: Graphical Models for Game Theory. In: Proceedings of the Conference on Uncertainty in Artificial Intelligence, pp. 253–260 (2001)Google Scholar
  13. 13.
    Howson Jr., J.T.: Equilibria of polymatrix games. Management Science 18, 312–318 (1972)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Boulogue, T., Altman, E.: Competitive Routing in Multicast. Networks 46(1), 22–35 (2005)CrossRefMathSciNetGoogle Scholar
  15. 15.
    Goemans, M.X., Liy, L(E.), Mirrokni, V.S., Thottan, M.: Market Sharing Games Applied to Content Distribution in Ad-Hoc Networks. In: Proceedings of ACM MOBIHOC, pp. 55–66 (2004)Google Scholar
  16. 16.
    Czumaj, A., Vocking, B.: Tight Bounds for Worst-case Equilibria. In: Proceedings of SODA, pp. 413–420 (2002)Google Scholar
  17. 17.
    Gairing, M., Lucking, T., Mavronicolas, M., Monien, B.: Computing Nash Equilibria for Scheduling on Restricted Parallel Links. In: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, pp. 613–622 (2004)Google Scholar
  18. 18.
    Koutsoupias, E., Papadimitriou, C.: Worst-case Equilibria. In: Proceedings of STACS, pp. 404–413 (1999)Google Scholar
  19. 19.
    Christos, H.: Papadimitriou. Computing Correlated Equilibria in Multi-Player Games. In: Proceedings of the 35th Annual ACM Symposium on the Theory of Computing, pp. 49–56 (2005)Google Scholar
  20. 20.
    Wang, W., Li, X., Wang, Y.: Truthful Multicast Routing in Selfish Wireless Networks. In: Proceedings of ACM MOBICOM, pp. 245–259 (2004)Google Scholar
  21. 21.
    Anderegg, L., Eidenbenz, S.: Ad hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad hoc Networks with Selfish Agents. In: Proceedings of ACM MOBICOM, pp. 245–259 (2003)Google Scholar
  22. 22.
    Zhong, S., Li, L(E.), Liu, Y.G., Yang, Y.R.: On Designing Incentive-Compatible Routing and Forwarding Protocols in Wireless Ad-Hoc Networks-An Integrated Approach Using Game Theoretical and Cryptographic Techniques. In: Proceedings of ACM MOBICOM, pp. 117–131 (2005)Google Scholar
  23. 23.
    Thangiah, S.R., Shmygelska, O., Mennell, W.: An Agent Architecture for Vehicle Routing Problems. In: Proceedings of the 2001 ACM symposium on Applied computting, March 2001, pp. 517–521 (2001)Google Scholar
  24. 24.
    Wolpert, D.H., Kirshner, S., Merz, C.J., Tumer, K.: Adaptivity in Agent-Based Routing for Data Networks. In: Proceedings of the fourth international conference on Autonomous agents, pp. 396–403Google Scholar
  25. 25.
    Ramanathan, S., Lloyd, E.L.: Scheduling Algorithms for Multihop Radio Networks. IEEE/ACM Transactions on Networking 1(2), 166–177 (1993)CrossRefGoogle Scholar
  26. 26.
    Raniwala, A., Gopalan, K., Chiueh, T.-c.: Centralized Channel Assignment and Routing Algorithms for Multi-Channel Wireless Mesh Networks. ACM Mobile Computing and Communication Review (MC2R) 8(2), 50–65 (2004)CrossRefGoogle Scholar
  27. 27.
    Kramer, K.H., Minar, N., Maes, P.: Tutorial: Mobile Software Agents for Dynamic Routing. ACM SIGMOBILE Mobile Computing and Communications Review 3(2), 12–16 (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yanxiang He
    • 1
  • Jun Xiao
    • 1
  1. 1.College of ComputerWuhan UniversityWuhanP.R. China

Personalised recommendations