Interference-aware selfish routing in multi-ratio multi-channel wireless mesh networks

Authors:
Yanxiang He;Jun Xiao;N. Xiong;Laurence T. Yang
Affiliations:
College of Computer, Wuhan University, Wuhan, China;College of Computer, Wuhan University, Wuhan, China;College of Computer, Wuhan University, Wuhan, China;Department of Computer Science, St. Francis Xavier University, Antigonish, Canada
Venue:
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Year:
2006

Citing 16
Cited 0

Scheduling algorithms for multihop radio networks

IEEE/ACM Transactions on Networking (TON)
Algorithms, games, and the internet

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
How bad is selfish routing?

Journal of the ACM (JACM)
On the complexity of equilibria

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents

Proceedings of the 9th annual international conference on Mobile computing and networking
Market sharing games applied to content distribution in ad-hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks

ACM SIGMOBILE Mobile Computing and Communications Review
Routing in multi-radio, multi-hop wireless mesh networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Truthful multicast routing in selfish wireless networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Competitive routing in multicast communications

Networks
Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques

Proceedings of the 11th annual international conference on Mobile computing and networking
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Mesh networks: commodity multihop ad hoc networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

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.