By Topic

Distributed Uplink Power Control with Soft Removal for 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

2 Author(s)
Mehdi Rasti ; Department of Electrical Engineering, Shiraz University of Technology, Shiraz, Iran. Prior to this, he was with the Department of Electrical and Computer Engineering, Tarbiat Modares Univesity, Tehran, Iran ; Ahmad R. Sharafat

In the well-known distributed target-SIR-tracking power control algorithm (TPC), when the system is infeasible (a constrained power vector does not exist to attain target-SIRs), all non-supported users (those who cannot obtain their target-SIRs) transmit at their maximum power. Such users inefficiently consume their energy, and cause interference to others, which increases the number of non-supported users. To deal with this, some non-supported users should decrease their transmit power (the gradual removal problem). We present a distributed power control scheme with gradual soft removal, by which either TPC or OPC (opportunistic power control) is used, depending on whether the ratio of interference-to-path-gain is below or above a threshold that is chosen by each user in a distributed manner. We show that our algorithm converges to a unique fixed-point in both feasible and infeasible systems, and that when the system is infeasible, it results in less outage with significantly less consumed power, as compared to TPC. We also provide a game theoretic analysis of our algorithm by introducing a new pricing when users are selfish. As our algorithm is fully distributed and requires only local information, it can be applied to both cellular and ad hoc networks. Simulation results confirm our analysis.

Published in:

IEEE Transactions on Communications  (Volume:59 ,  Issue: 3 )