By Topic

Pareto and Energy-Efficient Distributed Power Control With Feasibility Check in Wireless Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mehdi Rasti ; Department of Electronics and Computer Engineering, Shiraz University of Technology, Shiraz, Iran ; Ahmad R. Sharafat ; Jens Zander

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.

Published in:

IEEE Transactions on Information Theory  (Volume:57 ,  Issue: 1 )