Game-theoretic approach for QoS-aware resource competition in wireless networks

Authors:
Qinghe Du;Xi Zhang
Affiliations:
Networking and Information Systems Laboratory, Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX;Networking and Information Systems Laboratory, Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX
Venue:
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Year:
2009

Citing 12
Cited 0

Performance Guarantees in Communication Networks

Performance Guarantees in Communication Networks
Convex Optimization

Convex Optimization
Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
Effective capacity: a wireless link model for support of quality of service

IEEE Transactions on Wireless Communications
Quality-of-Service Driven Power and Rate Adaptation over Wireless Links

IEEE Transactions on Wireless Communications
Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities

IEEE Transactions on Information Theory
Asymptotically optimal water-filling in vector multiple-access channels

IEEE Transactions on Information Theory
Iterative water-filling for Gaussian vector multiple-access channels

IEEE Transactions on Information Theory
The Water-Filling Game in Fading Multiple-Access Channels

IEEE Transactions on Information Theory
Cross-layer-based modeling for quality of service guarantees in mobile wireless networks

IEEE Communications Magazine
Distributed multiuser power control for digital subscriber lines

IEEE Journal on Selected Areas in Communications
Non-Cooperative Resource Competition Game by Virtual Referee in Multi-Cell OFDMA Networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a game-theoretic framework for quality-of-service (QoS) aware resource competition among coexisting wireless links in mobile wireless networks. The senders of wireless links use the constant transmit power and then the wireless resources of interest is characterized by time-slot length. Multiple wireless links will use the limited wireless resources through a time-slot competition game. In particular, the senders of all links are game players. They are selfish, yet rational, and aim at using the minimum time-slot consumptions to satisfy the specified statistical delay-QoS constraint under the given traffic load. We mainly focus on the two-link cases and derive the Nash equilibrium. Simulation results are presented to show the impact of QoS requirements and channel conditions on this time-slot competition game. Moreover, simulations demonstrate that the time-slot consumptions of the game-theoretic approach are very close to the single-link lower-bound.