Achieving log-utility fairness in cdma systems via majorization theory
IEEE Communications Letters
A game-theoretic approach for distributed power control in interference relay channels
IEEE Transactions on Wireless Communications
Joint network-wide opportunistic scheduling and power control in multi-cell networks
IEEE Transactions on Wireless Communications
Adaptive multi-pattern reuse in multi-cell networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Maximizing the sum rate in symmetric networks of interfering links
IEEE Transactions on Information Theory
Multi-cell MIMO cooperative networks: a new look at interference
IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
IEEE Transactions on Wireless Communications
Multi-cell Optimal Downlink Beamforming Algorithm with Per-base Station Power Constraints
Wireless Personal Communications: An International Journal
On downlink capacity of cellular data networks with WLAN/WPAN relays
IEEE/ACM Transactions on Networking (TON)
A Cooperative Differential Game of Transmission Power Control in Wireless Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.07 |
We consider allocating the transmit powers for a wireless multi-link (N-link) system, in order to maximize the total system throughput under interference and noise impairments, and short term power constraints. Employing dynamic spectral reuse, we allow for centralized control. In the two-link case, the optimal power allocation then has a remarkably simple nature termed binary power control: depending on the noise and channel gains, assign full power to one link and minimum to the other, or full power on both. Binary power control (BPC) has the advantage of leading towards simpler or even distributed power control algorithms. For N>2 we propose a strategy based on checking the corners of the domain resulting from the power constraints to perform BPC. We identify scenarios in which binary power allocation can be proven optimal also for arbitrary N. Furthermore, in the general setting for N>2, simulations demonstrate that a throughput performance with negligible loss, compared to the best non-binary scheme found by geometric programming, can be obtained by BPC. Finally, to reduce the complexity of optimal binary power allocation for large networks, we provide simple algorithms achieving 99% of the capacity promised by exhaustive binary search.