A joint selfish routing and channel assignment game in wireless mesh networks

Authors:
Jun Xiao;Naixue Xiong;Laurence T. Yang;Y. He
Affiliations:
Computer Science and Technology Department, East China Normal University, Shanghai 200241, China;School of Information Science, Japan Advanced Institute of Science and Technology (JAIST), Japan;Department of Computer Science, St. Francis Xavier University, Antigonish, Canada B2G 2W5;Computer School, Wuhan University, Wuhan 430079, China
Venue:
Computer Communications
Year:
2008

Citing 22
Cited 3

Scheduling algorithms for multihop radio networks

IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband 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)
A New Multi-Channel MAC Protocol with On-Demand Channel Assignment for Multi-Hop Mobile Ad Hoc Networks

ISPAN '00 Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks
On selfish routing in internet-like environments

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
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
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks

ACM SIGMOBILE Mobile Computing and Communications Review
The complexity of pure Nash equilibria

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
Wireless mesh networks: a survey

Computer Networks and ISDN Systems
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
Component based channel assignment in single radio, multi-channel ad hoc networks

Proceedings of the 12th annual international conference on Mobile computing and networking
OURS: optimal unicast routing systems in non-cooperative wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Settling the Complexity of Two-Player Nash Equilibrium

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks

Proceedings of the 13th annual ACM 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

Wireless multihoming modeled as a multi-WLAN game

Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Ad hoc multi-WLAN: a game-theoretic model of correlated play

WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Game theoretic approach in routing protocol for cooperative wireless sensor networks

ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part II

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper designs a routing and channel assignment game -Strong Transmission Game in non-cooperative wireless mesh networks. Due to the nature of mesh routers (relay nodes), i.e., they are dedicated and have sufficient power supply, this game consists of only service requestors. Our main contributions in this paper are as follows: (1) We prove that there always exists a pure strategy Nash Equilibrium in the game and the optimal solution of our game is a Nash Equilibrium as well. (2) The price of anarchy is proved to be O(n^2). (3) Furthermore, our heuristic algorithms are introduced to approach the equilibrium state in the sense of the optimal routing and channel assignment response of every requestor, while the decisions from other agents are fixed. To evaluate our scheme, substantial simulation results are presented and the conclusion is twofold: (1) Our proposal is not far from the optimal. (2) Even performance gains can be expected, as compared with off-the-shelf techniques.