Benchmarking Practical RRM Algorithms for D2D Communications in LTE Advanced

Device-to-device (D2D) communication integrated into cellular networks is a means to take advantage of the proximity of devices and allow for reusing cellular resources and thereby to increase the user bitrates and the system capacity. However, when D2D (in the 3rd Generation Partnership Project also called Long Term Evolution (LTE) Direct) communication in cellular spectrum is supported, there is a need to revisit and modify the existing radio resource management (RRM) and power control (PC) techniques to realize the potential of the proximity and reuse gains and to limit the interference at the cellular layer. In this paper, we examine the performance of the flexible LTE PC tool box and benchmark it against a utility optimal iterative scheme. We find that the open loop PC scheme of LTE performs well for cellular users both in terms of the used transmit power levels and the achieved signal-to-interference-and-noise-ratio (SINR) distribution. However, the performance of the D2D users as well as the overall system throughput can be boosted by the utility optimal scheme, because the utility maximizing scheme takes better advantage of both the proximity and the reuse gains. Therefore, in this paper we propose a hybrid PC scheme, in which cellular users employ the open loop path compensation method of LTE, while D2D users use the utility optimizing distributed PC scheme. In order to protect the cellular layer, the hybrid scheme allows for limiting the interference caused by the D2D layer at the cost of having a small impact on the performance of the D2D layer. To ensure feasibility, we limit the number of iterations to a practically feasible level. We make the point that the hybrid scheme is not only near optimal, but it also allows for a distributed implementation for the D2D users, while preserving the LTE PC scheme for the cellular users.Comment: 30 pages, submitted for review April-2013. See also: G. Fodor, M. Johansson, D. P. Demia, B. Marco, and A. Abrardo, A joint power control and resource allocation algorithm for D2D communications, KTH, Automatic Control, Tech. Rep., 2012, qC 20120910, http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-10205

Separation Framework: An Enabler for Cooperative and D2D Communication for Future 5G Networks

Soaring capacity and coverage demands dictate that future cellular networks need to soon migrate towards ultra-dense networks. However, network densification comes with a host of challenges that include compromised energy efficiency, complex interference management, cumbersome mobility management, burdensome signaling overheads and higher backhaul costs. Interestingly, most of the problems, that beleaguer network densification, stem from legacy networks' one common feature i.e., tight coupling between the control and data planes regardless of their degree of heterogeneity and cell density. Consequently, in wake of 5G, control and data planes separation architecture (SARC) has recently been conceived as a promising paradigm that has potential to address most of aforementioned challenges. In this article, we review various proposals that have been presented in literature so far to enable SARC. More specifically, we analyze how and to what degree various SARC proposals address the four main challenges in network densification namely: energy efficiency, system level capacity maximization, interference management and mobility management. We then focus on two salient features of future cellular networks that have not yet been adapted in legacy networks at wide scale and thus remain a hallmark of 5G, i.e., coordinated multipoint (CoMP), and device-to-device (D2D) communications. After providing necessary background on CoMP and D2D, we analyze how SARC can particularly act as a major enabler for CoMP and D2D in context of 5G. This article thus serves as both a tutorial as well as an up to date survey on SARC, CoMP and D2D. Most importantly, the article provides an extensive outlook of challenges and opportunities that lie at the crossroads of these three mutually entangled emerging technologies.Comment: 28 pages, 11 figures, IEEE Communications Surveys & Tutorials 201

Distributed power allocation for D2D communications underlaying/overlaying OFDMA cellular networks

The implementation of device-to-device (D2D) underlaying or overlaying pre-existing cellular networks has received much attention due to the potential of enhancing the total cell throughput, reducing power consumption and increasing the instantaneous data rate. In this paper we propose a distributed power allocation scheme for D2D OFDMA communications and, in particular, we consider the two operating modes amenable to a distributed implementation: dedicated and reuse modes. The proposed schemes address the problem of maximizing the users' sum rate subject to power constraints, which is known to be nonconvex and, as such, extremely difficult to be solved exactly. We propose here a fresh approach to this well-known problem, capitalizing on the fact that the power allocation problem can be modeled as a potential game. Exploiting the potential games property of converging under better response dynamics, we propose two fully distributed iterative algorithms, one for each operation mode considered, where each user updates sequentially and autonomously its power allocation. Numerical results, computed for several different user scenarios, show that the proposed methods, which converge to one of the local maxima of the objective function, exhibit performance close to the maximum achievable optimum and outperform other schemes presented in the literature

Efficiency Resource Allocation for Device-to-Device Underlay Communication Systems: A Reverse Iterative Combinatorial Auction Based Approach

Peer-to-peer communication has been recently considered as a popular issue for local area services. An innovative resource allocation scheme is proposed to improve the performance of mobile peer-to-peer, i.e., device-to-device (D2D), communications as an underlay in the downlink (DL) cellular networks. To optimize the system sum rate over the resource sharing of both D2D and cellular modes, we introduce a reverse iterative combinatorial auction as the allocation mechanism. In the auction, all the spectrum resources are considered as a set of resource units, which as bidders compete to obtain business while the packages of the D2D pairs are auctioned off as goods in each auction round. We first formulate the valuation of each resource unit, as a basis of the proposed auction. And then a detailed non-monotonic descending price auction algorithm is explained depending on the utility function that accounts for the channel gain from D2D and the costs for the system. Further, we prove that the proposed auction-based scheme is cheat-proof, and converges in a finite number of iteration rounds. We explain non-monotonicity in the price update process and show lower complexity compared to a traditional combinatorial allocation. The simulation results demonstrate that the algorithm efficiently leads to a good performance on the system sum rate.Comment: 26 pages, 6 fgures; IEEE Journals on Selected Areas in Communications, 201