Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Pareto and Energy-Efficient Distributed Power Control with Feasibility Check in Wireless Networks
Department of Electrical Engineering, Shiraz University of Technology, Shiraz, Iran.
Department of Electrical and Computer Engineering, Tarbiat Modares Univesity, Tehran, Iran.
KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS. KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth. (Radio Communication Systems)ORCID iD: 0000-0003-4986-6123
2011 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 57, no 1, 245-255 p.Article in journal (Refereed) Published
Abstract [en]

We formally define the gradual removal problem in wireless networks, where the smallest number of users should be removed due to infeasibility of the target-SIR requirements for all users, and present a distributed power-control algorithm with temporary removal and feasibility check (DFC) to address it. The basic idea is that any transmitting user whose required transmit power for reaching its target-SIR exceeds its maximum power is temporarily removed, but resumes its transmission if its required transmit power goes below a given threshold obtained in a distributed manner. This enables users to check the feasibility of system in a distributed manner. The existence of at least one fixed-point in DFC is guaranteed, and at each equilibrium, all transmitting users reach their target-SIRs consuming the minimum aggregate transmit power. Furthermore, in contrast to the existing algorithms, no user is unnecessarily removed by DFC, i.e., DFC is Pareto and energy-efficient. We also show that when target-SIRs are the same for all users, DFC minimizes the outage probability. Simulation results confirm our analytical developments and show that DFC significantly outperforms the existing schemes in addressing the gradual removal problem in terms of convergence, outage probability, and power consumption.

Place, publisher, year, edition, pages
IEEE , 2011. Vol. 57, no 1, 245-255 p.
Keyword [en]
Distributed feasibility check, gradual removal problem, Pareto and energy-efficient distributed power control, wireless networks
National Category
Computer and Information Science
Research subject
SRA - ICT
Identifiers
URN: urn:nbn:se:kth:diva-31091DOI: 10.1109/TIT.2010.2090210ISI: 000285842100016Scopus ID: 2-s2.0-78650919709OAI: oai:DiVA.org:kth-31091DiVA: diva2:402521
Funder
ICT - The Next Generation
Note
QC 20110317Available from: 2011-03-08 Created: 2011-03-08 Last updated: 2017-12-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Zander, Jens

Search in DiVA

By author/editor
Zander, Jens
By organisation
Communication Systems, CoSCenter for Wireless Systems, Wireless@kth
In the same journal
IEEE Transactions on Information Theory
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 92 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf