HKUST Institutional Repository >
Electronic and Computer Engineering >
ECE Conference Papers >
Please use this identifier to cite or link to this item:
|Title: ||Joint rate and power allocation in spectrum sharing networks with balanced QoS provisioning and power saving|
|Authors: ||Wu, Yuan|
Tsang, Danny H. K.
|Keywords: ||Spectrum sharing|
|Issue Date: ||2008 |
|Citation: ||Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, 28-31 July 2008, Hong Kong, article 31|
|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.|
|Rights: ||© ACM, 2008. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, 28-31 July 2008, Hong Kong, article 31.|
|Appears in Collections:||ECE Conference Papers|
Files in This Item:
All items in this Repository are protected by copyright, with all rights reserved.