Abstract
In this paper, we develop a highly efficient two-tier technique for jointly optimizing the routes, the subcarrier schedules, the time-shares, and the power allocations in device-to-device communication networks with thousands of randomly dropped wireless nodes. The network is first divided into a set of non-overlapping sub-networks, each with its own regional controller. The role of such a controller is to optimize the sub-network within its region and to act as an interface between nodes communicating across regions. The first tier of the proposed technique uses a novel approach for splitting a set of highly non-convex constraints into effectively two sets of convex ones and optimization proceeds by using two loops: an outer loop for iterating between the power allocations and the subcarrier schedules, and an inner loop for iterating between the two sides of the split constraints. In the second tier, a technique analogous to the one used in the first tier is applied to the network composed of the regional controllers. Optimization in this tier is performed by a global controller. The proposed technique is capable of efficiently optimizing networks with tens of thousands of nodes and with significantly better performance than existing joint design techniques, which can only optimize networks with a few tens of nodes.
Highlights
The soon-to-be-standardized fifth-generation (5G) wireless networks will support device-to-device (D2D) communications in order to provide ubiquitous and reliable high-rate connectivity between a massive number of wireless communication devices [1], [2]
Fixed relaying, which involves the deployment of low-power base stations (BSs) to assist cellular communications, has been extensively studied in the literature, e.g., [3], [4] and it has already been included in the fourth-generation (4G) Long Term Evolution (LTE)-Advanced standard
The power allocations are set to some fixed values and this causes the joint optimization of subcarrier schedules and routes to assume the form of an efficiently solvable linear program (LP)
Summary
The soon-to-be-standardized fifth-generation (5G) wireless networks will support device-to-device (D2D) communications in order to provide ubiquitous and reliable high-rate connectivity between a massive number of wireless communication devices [1], [2]. In addition to determining the power allocated for each transmission, resource-efficient communication between source-destination pairs in D2D networks requires judicious choice of the relaying nodes, the data routes, the subcarrier schedules and the fraction of time during which a subcarrier is assigned to a particular link. The goal of this paper is to develop a joint optimization framework and a computationally efficient technique for designing wireless D2D communication networks with potentially tens of thousands of nodes. The power allocations are set to some fixed values and this causes the joint optimization of subcarrier schedules and routes to assume the form of an efficiently solvable linear program (LP).
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
