Energy-Efficient Bandwidth and Power Allocation for Multi-Homing Networks

• Published in: IEEE transactions on signal processing Vol. 63; no. 7; pp. 1684 - 1699
• Main Authors: Vu, Quang-Doanh, Tran, Le-Nam, Juntti, Markku, Hong, Een-Kee
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.04.2015; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: ADMM; Algorithms; Bandwidth; branch and bound; Efficiency; energy-efficiency; greedy algorithm; Heuristic; Joints; Links; Maximization; mixed integer nonlinear program; multi-homing networks; Networks; Optimization; Quality of service architectures; Radio access networks; Resource allocation; Resource management; Signal processing algorithms; sparsity-inducing norm; Studies; Wireless communication; Wireless LAN
• ISSN: 1053-587X; 1941-0476
• DOI: 10.1109/TSP.2015.2399863

This paper investigates resource allocation for multi-homing networks where users can simultaneously transmit data to multiple radio access networks (RANs) using multiple air interfaces. We aim at optimally assigning the bandwidth and power to each user-RAN connection so as to maximize energy-efficiency of the entire network subject to user specific QoS requirements as well as the available resource budgets. First, we study the problem of resource allocation for scenarios where the connections between the users and the RANs are predefined, which naturally leads to a fractional program. To obtain the optimal solution efficiently and facilitate distributed implementations, we further equivalently transform the design problem into a convex program using a parameter-free approach and develop a decentralized algorithm based on the alternating direction method of multipliers. Second, we investigate the problem of joint link selection and resource allocation for energy-efficiency maximization. The problem is cast as a mixed integer nonlinear convex program for which we particularize the branch and bound method to find an optimal solution. Then, two suboptimal low-complexity designs are proposed: the first one is based on greedy algorithm, which gradually maximizes the virtual link energy-efficiency; the other one is based on the concept of sparsity-inducing norm. Simulation results are presented to demonstrate the potential gains in terms of energy-efficiency of the proposed methods.