Energy-Efficient Matching for Resource Allocation in D2D Enabled Cellular Networks

Energy-efficiency (EE) is critical for device-to-device (D2D) enabled cellular networks due to limited battery capacity and severe co-channel interference. In this paper, we address the EE optimization problem by adopting a stable matching approach. The NP-hard joint resource allocation problem is formulated as a one-to-one matching problem under two-sided preferences, which vary dynamically with channel states and interference levels. A game-theoretic approach is employed to analyze the interactions and correlations among user equipments (UEs), and an iterative power allocation algorithm is developed to establish mutual preferences based on nonlinear fractional programming. We then employ the Gale-Shapley (GS) algorithm to match D2D pairs with cellular UEs (CUs), which is proved to be stable and weak Pareto optimal. We provide a theoretical analysis and description for implementation details and algorithmic complexity. We also extend the algorithm to address scalability issues in large-scale networks by developing tie-breaking and preference deletion based matching rules. Simulation results validate the theoretical analysis and demonstrate that significant performance gains of average EE and matching satisfactions can be achieved by the proposed algorithm

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

Relay Assisted Device to Device Communication Underlaying Cellular Networks

Device-to-Device (D2D) communication underlaying cellular networks is a latest technology of advanced wireless communication which allows two nearby devices to communicate without assistance of Base Station (BS) in cellular network. Device-to-Device (D2D) communication improves Spectral Eciency , Energy Eciency ,link reliability and overall system throughput by permitting nearby devices to communicate directly in licensed spectrum.In this thesis , two device discovery protocols are presented ,one reactive protocol and other proactive protocol which helps in discovering the D2D pairs which intend to communicate with each other.In addition, we propose a mode selection algorithm that decides the mode in which the devices can communicate either through traditional cellular mode or D2D mode. This optimum mode selection maximizes the overall throughput. The benets of D2D communication are limited practically when the distance between D2D users is long and poor channel environment between the D2D users. To overcome these drawbacks, a relay-assisted D2D communication is introduced where additional relay mode is proposed along with existing modes (i.e) cellular mode and D2D mode. A joint mode and relay selection scheme based on Hungarian algorithm is proposed to improve the overall system throughput. The Hungarian algorithm proposed, selects a suitable communication mode for each transmission and also select the relay device that acts as a relay between transmitting user and receiving user for relay mode communication.D2D devices sharing the same spectrum with cellular users results in interference, which requires to be managed in the resource allocation algorithm. A graph theory based resource allocation method for D2D users is proposed to improve the overall system capacity and extend the network coverage area

Sum Rate Maximization and Consistency in D2D Communication Based on ACO and Game Theory

Cellular network is the most popular network setup among today’s wireless communication systems. The primary resource in a cellular system is the spectrum for communication, and owing to the rising number of cellular users, the spectrum that is currently accessible from different service providers is depleting quickly. The resource or channel allocation is the most hindering task in cellular networks. Many efforts have been taken by many researchers to allocate the resources properly in order to increase the channel utilization and it is found that one effective method for reusing the channels inside a cell is device to device (D2D) communication. D2D communication was first developed in order to achieve the fundamental goals of fast data rates, widespread coverage with little latency, energy efficiency, and low per-information transmission costs. The dynamic behaviour of this network set-up again increases the risk of different types of interferences, which is another issue faced by the researchers. In this paper an effort is taken to understand and solve various aspects of channel allocation and Cellular networks have incorporated interference management in D2D communication especially. The two major issues of allocation of resource and management of interference in D2D communication is addressed here. This paper considers the meta heuristic algorithm namely Ant Colony Optimization (ACO) for resource allocation issue and interference management. The sum rate maximization is achieved through Game theory along with the concept of resource exchange in turn to increase the consistency of D2D communication setup. The results demonstrate that our algorithm can significantly increase the sum rate of D2D pairs when compared to other algorithms suggested by related works