Joint rate and power allocation in spectrum sharing networks with balanced QoS provisioning and power saving

Authors:
Yuan Wu;Danny H. K. Tsang
Affiliations:
Hong Kong University of Science and Technology;Hong Kong University of Science and Technology
Venue:
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Year:
2008

Citing 8
Cited 0

Convex Optimization

Convex Optimization
Allocating dynamic time-spectrum blocks in cognitive radio networks

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Optimal Linear Precoding Strategies for Wideband Noncooperative Systems Based on Game Theory—Part I: Nash Equilibria

IEEE Transactions on Signal Processing
Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems Based on Game Theory—Part II: Algorithms

IEEE Transactions on Signal Processing
Balancing transport and physical Layers in wireless multihop networks: jointly optimal congestion control and power control

IEEE Journal on Selected Areas in Communications
Distributed interference compensation for wireless networks

IEEE Journal on Selected Areas in Communications
Spectrum sharing for unlicensed bands

IEEE Journal on Selected Areas in Communications
Convergence of Iterative Waterfilling Algorithm for Gaussian Interference Channels

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the joint rate and multi-channel power allocations in spectrum sharing networks (SSNs) with balanced QoS provisioning and power saving. We formulate this cross layer problem as a non-cooperative game GJRPA in which each user aims to achieve its target data rate as exactly as possible and minimize its power consumption at the same time. We investigate the properties of Nash equilibrium (N.E.) for GJRPA, including its existence, and properties of QoS provisioning as well as power saving. With the decomposition technique, we propose a distributed algorithm to find the N.E. for GJRPA from any feasible initialization and provide a sufficient condition for its convergence. Simulation results are presented to show the validity of our proposed algorithm. Performance tradeoff between QoS provisioning and power saving are investigated via tuning the weighting factors. Besides, advantages of our GJRPA over conventional iterative water filling (IWF) are also analyzed.