Optimal gateway selection in multi-domain wireless networks: A potential game perspective

Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM

Volumn , Issue , 2011, Pages 325-336

  Song, Yang ^a   Wong, Starsky H Y ^a   Lee, Kang Won ^a  

^a IBM RESEARCH   (United States)

Author keywords

gateway selection; mixing time analysis; potential games

Indexed keywords

COALITION NETWORKS; CONVERGENCE SPEED; GATEWAY NODES; GATEWAY SELECTION; INTERDOMAIN COMMUNICATION; MIXING TIME ANALYSIS; MULTI DOMAINS; MULTIPLE DOMAINS; MULTIPLE-GROUP; OTHER APPLICATIONS; POTENTIAL GAMES; PRICE OF STABILITY; SINGLE DOMAINS; WIRELESS LINK;

CONVERGENCE OF NUMERICAL METHODS; LEARNING ALGORITHMS; MOBILE COMPUTING; OPTIMIZATION; TELECOMMUNICATION SYSTEMS;

GATEWAYS (COMPUTER NETWORKS);

EID: 80053603420     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2030613.2030650     Document Type: Conference Paper

References (43)

1. A. Adya, P. Bahl, J. Padhye, A. Wolman, and L. Zhou. A multi-radio unification protocol for IEEE 802.11 wireless networks. Broadnets, 2004.
2. S. Ahmad, C. Tekin, M. Liu, J. Huang, and Y.Wu. Spectrum sharing as network congestion games. in submission, http://www.eecs.umich.edu/~mingyan/pub/ SCG-10.pdf.
3. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden. The price of stability for network design with fair cost allocation. IEEE FOCS, 2004.
4. G. Arslan, F. Demirkol, and Y. Song. Equilibrium efficiency improvement in MIMO interference systems: A decentralized stream control approach. IEEE Transactions on Wireless Communications, 2007.
5. G. Arslan, J. Marden, and J. Shamma. Autonomous vehicle-target assignment: A game theoretical formulation. ASME Journal of Dynamic Systems, Measurement and Control, pages 584-596, 2007. (Pubitemid 47549395)
6. S. Boyd, P. Diaconis, and L. Xiao. Fastest mixing markov chain on a graph. SIAM Review, 46:667-689, 2004. (Pubitemid 40072140)
7. I. Broustis, K. Papagiannaki, S. Krishnamurthy, M. Faloutsos, and V. Mhatre. Measurement-driven guidelines for 802.11 WLAN design. IEEE/ACM Transactions on Networking, 2010.
8. C.-K. Chau, J. Crowcroft, K.-W. Lee, and S. H. Y. Wong. Inter-domain routing for mobile ad hoc networks. ACM MobiArch, 2008.
9. J. Cheeger. A lower bound for the smallest eigenvalue of the laplacian. Problems in analysis, pages 195-199, 1970.
10. F. Chuang. Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, 1997.
11. D. D. Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless routing. ACM MobiCom, 2003.
12. A. Cvetkovski and M. Crovella. Hyperbolic embedding and routing for dynamic graphs. IEEE INFOCOM, 2009.
13. P. Diaconis and L. Saloff-Coste. What do we know about the metropolis algorithm? Journal of Computer and System Sciences, 57:20-36, 1998. (Pubitemid 128428155)
14. Q. Dong, S. Banerjee, M. Adler, and A. Misra. Minimum energy reliable paths using unreliable wireless links. ACM MobiHoc, 2005.
15. R. Draves, J. Padhye, and B. Zill. Routing in multi-radio, multi-hop wireless mesh networks. ACM MobiCom, 2004.
16. A. Durresi, M. Durresi, and L. Barolli. Heterogeneous multi domain network architecture for military communications. Proceedings of the Third International Conference on Complex, Intelligent and Software Intensive Systems, 2009.
17. N. Feamster, H. Balakrishnan, and J. Rexford. Some foundational problems in interdomain routing. ACM SIGCOMM HotNets Workshop, 2004.
18. M. Goemans, L. Li, V. Mirrokni, and M. Thottan. Market sharing games applied to content distribution in ad-hoc networks. ACM MobiHoc, 2004.
19. T. Griffin, A. Jaggard, and V. Ramachandran. Design principles of policy languages for path vector protocols. SIGCOMM, 2003.
20. T. He, K.-W. Lee, N. Sofra, and K. Leung. Utility-based gateway deployment for supporting multi-domain DTNs. IEEE SECON, 2010.
21. R. Horn and C. Johnson. Matrix Analysis. Cambridge University Press, 1986.
22. R. Kleinberg. Geographic routing using hyperbolic space. IEEE INFOCOM, 2007.
23. E. Koutsoupias and C. H. Papadimitriou. Worst-case equilibria. STACS, 1999.
24. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. Geometric ad-hoc routing: Of theory and practice. PODC, 2003.
25. F. Li, Y. Wang, X.-Y. Li, A. Nusairat, and Y. Wu. Gateway placement for throughput optimization in wireless mesh networks. ACM/Springer Mobile Networks and Applications, 2008.
26. J. Marden, G. Arslan, and J. Shamma. Cooperative control and potential games. IEEE Transactions on Systems, Man and Cybernetics. Part B: Cybernetics, 2009.
27. J. Marden and M. Effros. The price of selfishness in network coding. NetCod, 2009.
28. J. Marden and J. Shamma. Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation. in submission, http://ecee.colorado.edu/marden/publications.html.
29. A. Mei and J. Stefa. Routing in outer space: Fair traffic load in multi-hop wireless networks. ACM MobiHoc, 2008.
30. D. Monderer and L. Shapley. Potential games. Journal of Games and Economic Behavior, 14:124-143, 1996. (Pubitemid 126164246)
31. A. Montanari and A. Saberi. Convergence to equilibrium in local interaction games. IEEE FOCS, 2009.
32. R. Montenegro and P. Tetali. Mathematical Aspects of Mixing Times in Markov Chains. NOW Publisher, 2005.
33. P. Panagopoulou and P. Spirakis. A game theoretic approach for efficient graph coloring. Lecture Notes in Computer Science, 2008.
34. F. Papadopoulos, D. Krioukov, M. Boguna, and A. Vahdat. Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces. IEEE INFOCOM, 2010.
35. V. Ramasubramanian, Z. J. Haas, and E. G. Sirer. SHARP: A hybrid adaptive routing protocol for mobile ad hoc networks. ACM MobiHoc, 2003.
36. V. Reddy, S. Shakkottai, A. Sprintson, and N. Gautam. Multipath wireless network coding: A population game perspective. IEEE INFOCOM, 2010.
37. T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of the ACM, 49:236-259, 2002. (Pubitemid 44159321)
38. G. Scutari, S. Barbarossa, and D. P. Palomar. Potential games: A framework for vector power control problems with coupled constraints. IEEE ICASSP, 2006.
39. D. Shah and J. Shin. Dynamics in congestion games. ACM SIGMETRICS, 2010.
40. Y. Song, C. Zhang, and Y. Fang. Throughput maximization in multi-channel wireless mesh access networks. IEEE ICNP, 2007.
41. Y. Song, C. Zhang, Y. Fang, and Z. Niu. Energy-conserving scheduling in multi-hop wireless networks with time-varying channels. IEEE INFOCOM, 2010.
42. W. Xu and J. Rexford. MIRO:multi-path interdomain routing. SIGCOMM, 2006.
43. X. Xu, S. Tang, X. Mao, and X.-Y. Li. Distributed gateway placement for cost minimization in wireless mesh networks. IEEE ICDCS, 2010.