Abstract
In this paper, we consider the selfish routing problem in non- cooperative wireless mesh networks where the capacity can be improved by transmitting over multiple radios simultaneously using orthogonal channels. The problem is that there are some agents who are in charge of their transmissions and each of them is selfish to minimize its own transmission cost without considering the overall performance of the network. But the embarrassment in wireless mesh networks is that the selfish agents perhaps may cause interference for the non-cooperation. We think that the game theoretic tools are helpful for the selfish agents to make feasible choices. We yield a sufficient condition of the existence of pure strategy Nash equilibrium in our Strong Transmission Game and prove it in this paper. Some simulations reveal the feasibility of our game theoretic approach.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bruno, R., Conti, M., Gregori, E.: Mesh Networks: Commodity Mulithop Ad Hoc Networks. IEEE Communications Magazine, 123–131 (2005)
Chaska wireless technologies, http://www.chaska.net/
Alicherry, M., Bhatia, R., Li, L.E.: Joint Channel Assignment and Routing for Throughput Optimization in Multi-radio Wireless Mesh Networks. In: MOBICOM, pp. 58–72 (2005)
Draves, R., Padhye, J., Zill, B.: Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks. In: MOBICOM, pp. 114–128 (2004)
Papadimitriou, C.: Algorithms, games, and the internet. In: STOC (2001)
IEEE 802.16-2004.: Part 16: Air Interface for Fixed Broadband Wireless Access Systems (2004)
Koutsoupias, E., Papadimitriou, C.H.: Worst-case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999)
Roughgarden, T., Tardos, É.: How Bad is Selfish Routing? J. ACM 49, 236–259 (2002)
Boulogue, T., Altman, E.: Competitive Routing in Multicast. Networks 46, 22–35 (2005)
Vetta, A.: Nash Equilibria in Competitive Societies, with Applications to Facility Locations, Traffic Routing and Auctions. In: FOCS (2002)
Goemans, M.X., Liy, L.E., Mirrokni, V.S., Thottan, M.: Market Sharing Games Applied to Content Distribution in Ad-Hoc Networks. In: MOBIHOC, pp. 55–66 (2004)
Wang, W., Li, X., Wang, Y.: Truthful Multicast Routing in Selfish Wireless Networks. In: MOBICOM, pp. 245–259 (2004)
Anderegg, L., Eidenbenz, S.: Ad hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad hoc Networks with Selfish Agents. In: MOBICOM, pp. 245–259 (2003)
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: MOBICOM, pp. 117–131 (2005)
Tang, J., Xue, G., Zhang, W.: Interference-Aware Topology Control and QoS Routing in Multi-Channel Wireless Mesh Networks. In: MOBIHOC, pp. 68–77 (2005)
Ramanathan, S., Lloyd, E.L.: Scheduling Algorithms for Multihop Radio Networks. IEEE/ACM Transactions on Networking 1, 166–177 (1993)
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 8, 50–65 (2004)
Deng, X., Papadimitriou, C.H., Safra, S.: On the Complexity of Equilibria. In: STOC, pp. 67–71 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, Y., Xiao, J., Xiong, N., Yang, L.T. (2006). Interference-Aware Selfish Routing in Multi-ratio Multi-channel Wireless Mesh Networks. In: Yang, L.T., Jin, H., Ma, J., Ungerer, T. (eds) Autonomic and Trusted Computing. ATC 2006. Lecture Notes in Computer Science, vol 4158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839569_12
Download citation
DOI: https://doi.org/10.1007/11839569_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38619-3
Online ISBN: 978-3-540-38622-3
eBook Packages: Computer ScienceComputer Science (R0)