Abstract
The problem of finding an optimal power vector for maximizing the number of supported links (i.e., links who may obtain their desired target-SINRs) in wireless networks is generally NP-hard. Recently, distributed power-control algorithm with temporary removal and feasibility check (DFC) has been proposed in which if the system is infeasible (i.e., the target-SINRs of all links may not be simultaneously reachable), some of the unsupported links are hardly removed (by stopping power transmission) aiming at the maximum number of supported links. DFC has been designed based on the single-cell CDMA network model and therefore, not taking the interference variations from other cells into account, its performance can be shown to degrade for multi-cell or ad-hoc networks. In this paper, we propose high-performance power control algorithm with feasibility check (HFC) for wireless networks in which, aiming at the minimal number of removed links, each non-supported link is removed from the set of active links in favour of others. While finding a Pareto and energy efficient power/SINR vector for a general model of a wireless network has been an open problem so far, we specially show that the fixed-points of HFC are Pareto-efficient, meaning that no link is unnecessarily removed.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call