D2D-enabled Cellular Networks Research Articles

Outage Probability Analysis for D2D-Enabled Heterogeneous Cellular Networks with Exclusion Zone: A Stochastic Geometry Approach

Outage Probability Analysis for D2D-Enabled Heterogeneous Cellular Networks with Exclusion Zone: A Stochastic Geometry Approach

On Covert Rate in Full-Duplex D2D-Enabled Cellular Networks with Spectrum Sharing and Power Control

On Covert Rate in Full-Duplex D2D-Enabled Cellular Networks with Spectrum Sharing and Power Control

Mode Selection and Resource Allocation for SWIPT NOMA based Three-tier HetNets

In next-generation heterogeneous networks, device-to-device communications are a key enabler to support a wider and diverse range of applications. They play an important role to guarantee the performance and quality of service requirements for the future ultra-dense networks. D2D-enabled cellular networks allow user equipment to communicate directly without any or with a partial association with macro base stations or with small base stations. In this paper, we propose a distance-based dynamic approach to minimize the interference and to guarantee QoS for diverse types of users equipment, such as macro user, small user and D2D user. The mode selection is used for minimize the interference and to guarantee QoS for both cellular and D2D communication links. Moreover, we investigated hybrid simultaneous wireless information and power transfer to achieve the higher data rates while guaranteeing the minimum harvested energy. Additionally, our scheme employs a transmit antenna selection criterion to exploit the spatial diversity gain of a multiple antennas for small base station. Results obtained show that coverage probability is improved in macro and small base stations links, when compared with traditional neighbor-based methods, we validate the theoretical findings and demonstrate that significant performance gain over orthogonal multiple access scheme in terms of spectral efficiency can be achieved by the proposed algorithms in a SWIPT-enabled NOMA system where we show the energy efficiency.

Resource Allocation and Mode Selection in 5G Networks Based on Energy Efficient Game Theory Approach

With the advent of next-generation cellular networks, energy efficiency is becoming increasingly important. To tackle this issue, this paper investigates energy efficiency in D2D-enabled heterogeneous cellular networks. Boosting the longterm energy efficiency of wireless 5G communication networks is being explored through mode selection and resource allocation. The study proposed a three-stage process for energy-efficient mode selection and resource allocation. The process starts with cellular users who switch to D2D emitting a beacon and cellular users within close proximity reacting to it. A proposed auction mechanism will be enacted inside the group in the second state ( in this paper, the group size will be four). Next, each cellular user was classified according to SINR values, distance, and battery life, so that they could dynamically transition between standard cellular mode and D2D mode. For stage three, direct-hop hybrid D2D communication, we developed a TAMM double auction game model that efficiently splits resources. To identify the true bidders in our game model, we compute the median and mode values of the ASK and BID values received by both seller and buyer cellular users. A simulation study shows that the proposed method is energy-efficient in a heterogeneous network enabled by D2D.

A matching-theoretic approach to resource allocation in D2D-enabled downlink NOMA cellular networks

This paper investigates the resource allocation problem in non-orthogonal multiple-access (NOMA) cellular networks underlaid with OMA-based device-to-device (D2D) communication. This network architecture enjoys the intrinsic features of NOMA and D2D communications; namely, spectral efficiency, massive connectivity, and low-latency. Despite these indispensable features, the combination of NOMA and D2D communications exacerbates the resource allocation problem in cellular networks due to the tight coupling among their constraints and conflict over access to shared resources. The aim of our work is to maximize the downlink network sum-rate, while meeting the minimum rate requirements of the cellular tier and underlay D2D communication, and incorporating interference management as well as other practical constraints. To this end, many-to-many matching and difference-of-convex programming are employed to develop a holistic sub-channels and power allocation algorithmic solution. In addition to analyzing the properties of the proposed solution, its performance is benchmarked against an existing solution and the traditional OMA-based algorithm. The proposed solution demonstrates superiority in terms of network sum-rate, users’ connectivity, minimum rate satisfaction, fairness, and interference management, while maintaining acceptable computational complexity.

A Dynamic Algorithm for Interference Management in D2D-Enabled Heterogeneous Cellular Networks: Modeling and Analysis.

To supporting a wider and diverse range of applications, device-to-device (D2D) communication is a key enabler in heterogeneous cellular networks (HetCNets). It plays an important role in fulfilling the performance and quality of service (QoS) requirements for 5G networks and beyond. D2D-enabled cellular networks enable user equipment (UE) to communicate directly, without any or with a partial association with base stations (eNBs). Interference management is one of the critical and complex issues in D2D-enabled HetCNets. Despite the wide adoption of D2D communications, there are very few researchers addressing the problems of mode selection (MS), as well as resource allocation for mutual interference in three-tier cellular networks. In this paper, we first identify and analyze three key factors, namely outage probability, signal-to-interference and noise ratio (SINR), and cell density that influence the performance of D2D-enabled HetCNets. We then propose a dynamic algorithm based on a distance-based approach to minimize the interference and to guarantee QoS for both cellular and D2D communication links. Results obtained show that outage probability is improved by 35% and 49% in eNB and SCeNB links, respectively, when compared with traditional neighbor-based methods. The findings reported in this paper provide some insights into interference management in D2D communications that can help network researchers and engineers contribute to further developing next-generation cellular networks.

Uplink performance analysis in D2D-enabled cellular networks with clustered users

Uplink performance analysis in D2D-enabled cellular networks with clustered users

Downlink Performance Analysis in D2D-Enabled Cellular Networks with Clustered Users

Downlink Performance Analysis in D2D-Enabled Cellular Networks with Clustered Users

Fast Channel Allocation for Ultra-dense D2D-enabled Cellular Network with Interference Constraint in Underlaying Mode

Fast Channel Allocation for Ultra-dense D2D-enabled Cellular Network with Interference Constraint in Underlaying Mode

Secrecy capacity and energy efficiency in D2D-enabled cellular networks

Device-to-device (D2D) communication is introduced in cellular networks to allow devices in close proximity to communicate directly with each other, freeing up spectral and other system resources. We propose a scheme that promotes the coexistence of cellular users (CUs) and D2D users (DUs). DUs are allowed to access the CU channel for D2D communications, enhancing the spectral efficiency. On the other hand, DU is expected to protect the secrecy of CU’s data by transmitting artificial noise to jam any potential eavesdroppers near the CU link, which may include other DUs. This enhances the cellular secrecy capacity at the expense of DU’s energy, which motivates us to assess the CU’s secrecy capacity and DU’s energy efficiency of this scheme. We have identified the causes and conditions of increased energy efficiency under certain secrecy capacity requirement, e.g. an optimal DU’s sensing duration that results in maximal energy efficiency. Such information is important for the planning of an efficient access control and scheduling scheme for the DU links in cellular networks.

Synchronization Techniques in “Device to Device- and Vehicle to Vehicle-Enabled” Cellular Networks: A survey

Device-to-Device (D2D) communication is introduced for cellular networks allowing User Equipments (UEs) to communicate directly in close physical proximity. In traditional cellular networks, time synchronization is performed by the network infrastructure equipment to address the challenges of coordinating independent clocks and tasks of UEs to communicate with each other. These challenges are more critical in D2D as the network has no central point to coordinate UEs. The aim of this paper is twofold: (i) reviewing synchronization standards and techniques for D2D-enabled cellular networks and (ii) discussing different scenarios and contemporary cellular network generations. We review the main signals, channels, and entities used by D2D-enabled cellular networks for synchronization procedures in different scenarios. Moreover, we focus on the synchronization in Vehicle-to-Vehicle (V2V) and Vehicle-to-Everything (V2X). Finally, we conduct a literature study on effective proposed synchronization techniques in D2D and vehicular communications to highlight recent advances and provide future directions.

A Survey and Future Directions on Clustering: From WSNs to IoT and Modern Networking Paradigms

Many Internet of Things (IoT) networks are created as an overlay over traditional ad-hoc networks such as Zigbee. Moreover, IoT networks can resemble ad-hoc networks over networks that support device-to-device (D2D) communication, e.g., D2D-enabled cellular networks and WiFi-Direct. In these <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ad-hoc</i> types of IoT networks, efficient <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">topology management</i> is a crucial requirement, and in particular in massive scale deployments. Traditionally, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">clustering</i> has been recognized as a common approach for topology management in ad-hoc networks, e.g., in Wireless Sensor Networks (WSNs). Topology management in WSNs and ad-hoc IoT networks has many design commonalities as both need to transfer data to the destination hop by hop. Thus, WSN clustering techniques can presumably be applied for topology management in ad-hoc IoT networks. This requires a comprehensive study on WSN clustering techniques and investigating their applicability to ad-hoc IoT networks. In this article, we conduct a survey of this field based on the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">objectives</i> for clustering, such as reducing energy consumption and load balancing, as well as the network properties relevant for efficient clustering in IoT, such as network heterogeneity and mobility. Beyond that, we investigate the advantages and challenges of clustering when IoT is integrated with modern computing and communication technologies such as Blockchain, Fog/Edge computing, and 5G. This survey provides useful insights into research on IoT clustering, allows broader understanding of its design challenges for IoT networks, and sheds light on its future applications in modern technologies integrated with IoT.

Energy-Efficient Mode Selection and Resource Allocation for D2D-Enabled Heterogeneous Networks: A Deep Reinforcement Learning Approach

Improving energy efficiency has shown increasing importance in designing future cellular system. In this work, we consider the issue of energy efficiency in D2D-enabled heterogeneous cellular networks. Specifically, communication mode selection and resource allocation are jointly considered with the aim to maximize the energy efficiency in the long term. And an Markov decision process (MDP) problem is formulated, where each user can switch between traditional cellular mode and D2D mode dynamically. We employ deep deterministic policy gradient (DDPG), a model-free deep reinforcement learning algorithm, to solve the MDP problem in continuous state and action space. The architecture of proposed method consists of one actor network and one critic network. The actor network uses deterministic policy gradient scheme to generate deterministic actions for agent directly, and the critic network employs value function based Q networks to evaluate the performance of the actor network. Simulation results show the convergence property of proposed algorithm and the effectiveness in improving the energy efficiency in a D2D-enabled heterogeneous network.

Bayesian Coalition Game for Overlay D2D Spectrum Sharing in Cellular Networks

In this paper, we present a Bayesian coalition game model for spectrum sharing in order to increase the overall spectrum resource capacity in a cellular network with device-to-device (D2D) communication capabilities. The coalition game is used to enforce cooperation among D2Ds competing for the use of the limited spectrum resource. In this paper, D2D users can access the network in an overlaid mode and share their allocated sub-bands with other D2D users using the proposed game which enables coalition formation that guarantee an optimal rate for all users in the network. The paper establishes sufficient conditions needed for stability in the coalitions formed and present simulation results to show that it is possible to increase the overall capacity of the D2D-enabled cellular network without reducing the performance of the licensed cellular users using the proposed game. D2D spectrum sharing using our proposed algorithm was compared with spectrum sharing using the random pairing method to validate our game model. Results show that there was a 44% and 36% increase in cell sum-rate, when our proposed sub-band allocation game was deployed compared to the random pairing method, for the 50 and 100 cells respectively. The proposed sub-band allocation game also performed better with an increased number of users in the network because of the effective coordination offered by the algorithm.Keywords— Cellular, coalition game, D2D, overlay, spectrum.

Joint Mode Selection and Power Control for Interference Management in D2D-Enabled Heterogeneous Cellular Networks

Interference is one of the most critical issues in the device-to-device (D2D)-enabled heterogeneous cellular networks (HetCNets) due to the coexistence of D2D pairs and various types of cellular user equipments (UEs) that operate in the same spectrum. In this paper, an interference management scheme of joint mode selection and power control is proposed to solve the issue in D2D-enabled HetCNets. In the scheme, we present power control with interference limited area (PC-ILA) in which power control is utilized to adjust the ILA dynamically. Furthermore, according to different ILA, users can select different communication modes to solve the problem of spectrum resource waste caused by a single communication mode. Numerical simulation results are provided to demonstrate the feasibility of the proposed scheme and its superiority over other schemes. Moreover, the proposed mode selection method achieves superior performance compared with existing well-known methods.

Many-to-many matching for social-aware minimized redundancy caching in D2D-enabled cellular networks

To relieve the heavy data transmission pressure caused by duplicate requests from user equipments (UEs) on base stations (BSs), edge caching is envisioned as an effective method to help BSs for traffic offloading. In D2D networks, pre-cache the various files for mobile users is a crucial issue to improve the network performance. Therefore, an effective cache placement scheme is necessary to reduce cache redundancy and capacity waste. In this paper, the cache placement problem is investigated for cache redundancy reduction. Considering that users’ mobility has a non-negligible impact on the system performance, we model the users’ mobility as a continuous-time Markov chain (CTMC) in which the user’s encounter probability is estimated using the historical contact time and inter-contact time among users. Then, the contact intensity and the interest similarity are modeled to represent social relationship intensity among users. Integrating the users’ mobility with the social relationship, a social relationship graph is constructed. Subsequently, we formulate the file placement problem as a many-to-many matching problem and we propose a novel file placement algorithm to make decisions on cache placement based on the social relationship graph with low computational complexity and low caching redundancy. Simulation results show that the proposed algorithm can achieve better performance compared with the existing caching placement schemes under the limited storage capacity.

Semi-Decentralized Interference Aware Scheduling in D2D-Enabled Cellular Networks

We investigate the problem of semi-decentralized, interference aware scheduling in a cellular network with Device-to-Device (D2D) links. Our goal is an algorithm that allows optimal resource allocation and power control in spite of mutual interference from and to D2D links, as well as the creation of a reporting structure that is independent of the exact optimization goal and D2D modes. To achieve this, we formulate an interference aware scheduling problem with general rate-utility and generalized reuse constraints. By applying a Generalized Benders Decomposition, the problem is decomposed into two coupled sub-problems, a “primal” power control problem and a “master” scheduling problem, that can be dealt with independently. By this, we decouple the tedious power optimization from the scheduling part. We evaluate performance of the proposed structure analytically and find it to allow optimal scheduling independent of the used utility and D2D modes, provided that the master scheduling problem is solved optimally. Finally, we propose a solution for the master problem of weighted sum-rate maximization. Our simulations indicate that using the proposed scheme, D2D reuse can increase by an order of magnitude compared to the often targeted one-fold reuse, reaching a maximum of 31-fold frequency reuse in our set-ups. It is further capable of improving sum-rate performance by around 35% over existing works, while keeping signaling overhead and optimization delay at the same order of magnitude.

On social-aware data uploading study of D2D-enabled cellular networks

The data uploading study of device-to-device (D2D) enabled cellular networks is critical for supporting their applications. Available data uploading studies for D2D-enabled cellular networks mainly consider either the cooperative scenarios with full trust or no trust, where the devices in the network forward data with each other in full cooperative or noncooperative way, while largely neglecting the effect of human social relationships on the cooperation behaviors among the devices under real scenarios. As a first step to address this issue, this paper extends the previous works on cooperative D2D data uploading for cellular networks to a more real social network scenario and investigates social-aware data uploading in D2D-enable cellular networks. We first propose an incentive mechanism to compensate the resource consumption (e.g., energy, memory, and time spent) of devices on data uploading. With this incentive mechanism, the nearby devices can obtain rewards such that they are willing to construct a multi-hop D2D chain to assist the other devices for data uploading. To this end, we adopt coalitional game to formulate the D2D chain with careful consideration of social-aware data uploading, where each device acts as a player and the individual reward is modeled as the utility function. We further design a coalition formation algorithm with merge-and-split rules to determine the solution for formulated D2D chain. Extensive simulations are conducted to illustrate the performance improvement of our proposed scheme in comparison with that of other state-of-the-art schemes.

Secure Transmission Scheme Based on the Artificial Noise in D2D-Enabled Full-Duplex Cellular Networks

Secure Transmission Scheme Based on the Artificial Noise in D2D-Enabled Full-Duplex Cellular Networks

D2D-Enabled Mobile User Edge Caching: A Multi-Winner Auction Approach

In device-to-device (D2D)-enabled caching cellular networks, the user terminals (UTs) collaboratively store and share a large volume of popular contents from the base station (BS) for traffic offloading and delivery delay reduction. In this article, the multi-winner auction based caching placement in D2D-enabled caching cellular networks is investigated for UT edge caching incentive and content caching redundancy reduction. Firstly, a multi-winner once auction for UT edge caching is modeled which auctions multiple contents for multiple UTs. Then the optimization problem for content caching revenue maximization is formulated. Specifically, the "cache conflict" restriction relationship among UTs is used as one of the constraints in the problem to reduce the content caching redundancy in a UT movement scenario. The problem is solved by semidefinite programming (SDP) relaxation to obtain an approximate optimal caching placement. Moreover, the payment strategy of the auction is developed as a Nash bargaining game for personal profit fairness among the UTs who win the auction for content caching. Subsequently, a multi-winner once auction based caching (MOAC) placement algorithm is proposed. In addition, due to the high complexity of MOAC, we further propose a heuristic multi-winner repeated auction based caching placement (MRAC) algorithm, which can greatly reduce the complexity with only tiny performance loss. Simulation results show that the proposed algorithms can reduce the traffic load and average content access delay effectively compared with the existing caching placement algorithms.