Title :
Iterative multiuser resource allocation for inhome Power Line Communications
Author :
Biagi, Mauro ; Polli, Valentina
Author_Institution :
Dept. of Inf., Electron. & Telecommun. Eng. (DIET), Sapienza Univ. of Rome, Rome, Italy
Abstract :
In a multiuser scenario, the bit-loading, which has proven decisive in resource optimization for Power Line Communications (PLCs), has to be coupled with channel assignment to fully exploit its potential. Unfortunately, finding the most performing combination of channel and power allocation leads to integer (or mixed) programming problems, which are known to be NP-hard. To overcome the complexity of the resulting optimization problem, in this paper we propose an iterative solution that is able to guarantee both fairness and Quality of Service (QoS) to the users when the overall power consumption of the system is bounded and each subchannel emission is limited. This solution embeds a Connection Admission Control (CAC) that allows to leave out badly-connected users that otherwise would negatively affect the comprehensive system performance. Numerical results compare the presented resource allocation with the common greedy-based single user approach.
Keywords :
carrier transmission on power lines; channel allocation; integer programming; iterative methods; optimisation; quality of service; resource allocation; telecommunication congestion control; NP-hard problems; bit loading; channel assignment; connection admission control; greedy-based single user approach; in-home power line communications; integer programming; iterative multiuser resource allocation; mixed programming; quality of service; resource optimization; Admission control; Gain; Noise; Power line communications; Resource management; System performance; Power Line Communications; Quality of Service; bit-loading; goodput; multicarrier; multiuser resource allocation;
Conference_Titel :
Power Line Communications and Its Applications (ISPLC), 2011 IEEE International Symposium on
Conference_Location :
Udine
Print_ISBN :
978-1-4244-7751-7
Electronic_ISBN :
978-1-4244-7749-4
DOI :
10.1109/ISPLC.2011.5764428