A game approach for multi-channel allocation in multi-hop wireless networks

Authors:
Lin Gao;Xinbing Wang
Affiliations:
Shanghai Jiao Tong University, Shanghai, China;Shanghai Jiao Tong University, Shanghai, China
Venue:
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Year:
2008

Citing 13
Cited 8

Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Multiple Access in Ad-Hoc Wireless LANs with Noncooperative Stations

NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
On spectrum sharing games

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A Multi-Radio Unification Protocol for IEEE 802.11 Wireless Networks

BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Towards truthful mechanisms for binary demand games: a general framework

Proceedings of the 6th ACM conference on Electronic commerce
Wireless mesh networks: a survey

Computer Networks and ISDN Systems
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
Weighted coloring based channel assignment for WLANs

ACM SIGMOBILE Mobile Computing and Communications Review
Underground structure monitoring with wireless sensor networks

Proceedings of the 6th international conference on Information processing in sensor networks
Rendered path: range-free localization in anisotropic sensor networks with holes

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Graph labeling and radio channel assignment

Journal of Graph Theory
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey

IEEE Communications Surveys & Tutorials
Performance analysis of the IEEE 802.11 distributed coordination function

IEEE Journal on Selected Areas in Communications

A learning-based channel allocation protocol for multi-radio wireless mesh networks

INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
A non-cooperative game-theoretic approach to channel assignment in multi-channel multi-radio wireless networks

Wireless Networks
A new joint strategy of radio channel allocation and power control for wireless mesh networks

Computer Communications
Editorial: Profit-based scheduling and channel allocation for multi-item requests in real-time on-demand data broadcast systems

Data & Knowledge Engineering
Large-scale access scheduling in wireless mesh networks using social centrality

Journal of Parallel and Distributed Computing
SAFE: a strategy-proof auction mechanism for multi-radio, multi-channel spectrum allocation

WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
A semi-dynamic, game based and interference aware channel assignment for multi-radio multi-channel wireless mesh networks

International Journal of Ad Hoc and Ubiquitous Computing
A truthful auction mechanism for channel allocation in multi-radio, multi-channel non-cooperative wireless networks

Personal and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Channel allocation was extensively investigated in the framework of cellular networks, but it was rarely studied in the wireless ad-hoc networks, especially in the multi-hop ad-hoc networks. In this paper, we study the competitive multi-radio channel allocation problem in multi-hop wireless networks in detail. We model the channel allocation problem as a static cooperative game, in which some players collaborate to achieve high date rate. We propose the min-max coalition-proof Nash equilibrium (MMCPNE) channel allocation scheme in the game, which is aiming to max the achieved date rates of communication links. We study the existence of MMCPNE and prove the necessary conditions for MMCPNE. Furthermore, we propose several algorithms that enable the selfish players to converge to MMCPNE. Simulation results show that MMCPNE outperforms CPNE and NE schemes in terms of achieved data rates of the multi-hop links due to cooperation gain.