Open AccessPower saving transmission in interference networks
Author(s) -
Madani Najmeh,
Azmi Paeiz
Publication year - 2017
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2016.1278
Subject(s) - mathematical optimization , transmission (telecommunications) , interference (communication) , power control , computer science , power (physics) , scale (ratio) , constraint (computer aided design) , function (biology) , algorithm , mathematics , telecommunications , channel (broadcasting) , physics , geometry , quantum mechanics , evolutionary biology , biology
This study proposes a power control scheme to obtain minimum aggregate power in a system composing of interfering links ( N ‐link) while a target sum‐rate is met. The authors develop an analytical framework for two interfering links which results in the optimal transmission policy. For N > 2, they propose a suboptimal solution based on successive convex approximation for low‐complexity (SCALE) algorithm. They modify the SCALE algorithm to converge to a point satisfying Karush–Kuhn–Tucker conditions when high signal‐to‐noise‐and‐interference approximation of rate function is not valid. They also provide a suboptimal solution based on the geometric programming. They perform numerical evaluations in a dense interference environment and compare the performance of the modified SCALE with that of the SCALE algorithm. They also compare the performance of proposed power control with that of sum‐rate maximisation of interfering links, in which the individual power constraint on each user is considered. The simulation results indicate that the modified SCALE performs better than the SCALE algorithm. The results also demonstrate that the proposed power control can save power comparing to the sum‐rate maximisation in most considered cases.