dc.contributor.author |
Kastrinogiannis, T |
en |
dc.contributor.author |
Papavassiliou, S |
en |
dc.date.accessioned |
2014-03-01T01:30:46Z |
|
dc.date.available |
2014-03-01T01:30:46Z |
|
dc.date.issued |
2009 |
en |
dc.identifier.issn |
0140-3664 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/19628 |
|
dc.subject |
QoS |
en |
dc.subject |
Real-time services |
en |
dc.subject |
Utility-based resource allocation |
en |
dc.subject |
Wireless networks |
en |
dc.subject.classification |
Computer Science, Information Systems |
en |
dc.subject.classification |
Engineering, Electrical & Electronic |
en |
dc.subject.classification |
Telecommunications |
en |
dc.subject.other |
Beamforming |
en |
dc.subject.other |
Code division multiple access |
en |
dc.subject.other |
Game theory |
en |
dc.subject.other |
Information services |
en |
dc.subject.other |
Planning |
en |
dc.subject.other |
Power control |
en |
dc.subject.other |
Quality of service |
en |
dc.subject.other |
Real time systems |
en |
dc.subject.other |
Resource allocation |
en |
dc.subject.other |
Signal to noise ratio |
en |
dc.subject.other |
Allocation processes |
en |
dc.subject.other |
Balanced systems |
en |
dc.subject.other |
CDMA networks |
en |
dc.subject.other |
Cdma wireless networks |
en |
dc.subject.other |
Degree of satisfactions |
en |
dc.subject.other |
Existence and uniquenesses |
en |
dc.subject.other |
In channels |
en |
dc.subject.other |
Iterative algorithms |
en |
dc.subject.other |
Maximum powers |
en |
dc.subject.other |
Modeling and simulations |
en |
dc.subject.other |
Nash equilibrium points |
en |
dc.subject.other |
Non-cooperative games |
en |
dc.subject.other |
Power allocations |
en |
dc.subject.other |
Power consumptions |
en |
dc.subject.other |
QoS |
en |
dc.subject.other |
Qos constraints |
en |
dc.subject.other |
Real-time services |
en |
dc.subject.other |
Throughput performances |
en |
dc.subject.other |
Uplink power controls |
en |
dc.subject.other |
Utility functions |
en |
dc.subject.other |
Utility-based resource allocation |
en |
dc.subject.other |
Wireless networks |
en |
dc.title |
Game theoretic distributed uplink power control for CDMA networks with real-time services |
en |
heal.type |
journalArticle |
en |
heal.identifier.primary |
10.1016/j.comcom.2008.11.010 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1016/j.comcom.2008.11.010 |
en |
heal.language |
English |
en |
heal.publicationDate |
2009 |
en |
heal.abstract |
In this paper, the issue of efficient power allocation in the uplink of CDMA wireless networks supporting real-time services with various QoS constraints, is addressed. Within the proposed framework, utility functions are adopted to reflect a user's degree of satisfaction with respect to its actual throughput requirements satisfaction and respective power consumption. The corresponding problem is formulated as a non-cooperative game where users aim selfishly at maximizing their utility-based performance under the imposed limitations. The existence and uniqueness of a Nash equilibrium point of the proposed Uplink Power Control (UK) game is proven, at which all users have attained a targeted SINR threshold value or transmit with their maximum power, leading essentially to an SINR-balanced system. Moreover, a distributed iterative algorithm for reaching UPC game's equilibrium is provided. The properties of equilibrium in a pure optimization theoretical framework are studied, and the tradeoffs between users' overall throughput performance and real-time services' QoS requirements satisfaction, in channel aware resource allocation processes, are revealed and quantified. Through modeling and simulation the efficacy of the introduced framework and proposed UPC algorithm are demonstrated and evaluated. (C) 2008 Elsevier B.V. All rights reserved, |
en |
heal.publisher |
ELSEVIER SCIENCE BV |
en |
heal.journalName |
Computer Communications |
en |
dc.identifier.doi |
10.1016/j.comcom.2008.11.010 |
en |
dc.identifier.isi |
ISI:000263449100016 |
en |
dc.identifier.volume |
32 |
en |
dc.identifier.issue |
2 |
en |
dc.identifier.spage |
376 |
en |
dc.identifier.epage |
385 |
en |