D2D Spectrum Research Articles

A Reinforcement Learning Approach for D2D Spectrum Sharing in Wireless Industrial URLLC Networks

A Reinforcement Learning Approach for D2D Spectrum Sharing in Wireless Industrial URLLC Networks

A deep reinforcement learning-based D2D spectrum allocation underlaying a cellular network

A deep reinforcement learning-based D2D spectrum allocation underlaying a cellular network

D2D Spectrum Efficiency Optimization Algorithm for Many-to-One Reusing Scenarios

D2D Spectrum Efficiency Optimization Algorithm for Many-to-One Reusing Scenarios

Deep Reinforcement Learning-Based Dynamic Spectrum Access for D2D Communication Underlay Cellular Networks

This letter investigates a deep reinforcement learning (DRL)-based spectrum access scheme for device-to-device (D2D) communication underlay cellular networks. Specifically, cellular users (CUEs) and D2D pairs attempt to access the time slots (TSs) of a shared spectrum, and TSs are dynamically scheduled to CUEs in different frames. Based on the DRL theory, D2D pairs can be seen as a centralized agent which aims to learn an optimal spectrum access strategy to maximize the sum throughput without any prior information. In particular, with different locations of CUEs, the spectrum access manners for D2D communication are changed to ensure the communication quality of CUEs at the cell edge. Then, a double deep Q-network (DDQN) based D2D spectrum access (D <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sup> SA) algorithm is proposed, which makes D2D pairs learn to decide whether to access the spectrum in different TSs. Moreover, to ensure the fairness of resource allocation among D2D pairs, we improve the proposed algorithm and incorporate fairness into the objective function. Simulation results show that our proposed algorithm can achieve an optimal sum throughput close to the theoretical upper bound, where the performance is significantly improved compared to the scheme based on base station cooperation.

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.

Enabling Security-Aware D2D Spectrum Resource Sharing for Connected Autonomous Vehicles

With the emergence of automated driving technology, wireless demand for secure information exchange among automated vehicles has increased dramatically. To this end, we design a security-aware dynamic device-to-device (D2D) spectrum resource sharing mechanism to enhance the security of vehicular D2D communications with the improved spectrum efficiency. Considering both resource block (RB) sharing and power control, we model this joint D2D spectrum resource sharing process as a weighted bipartite graph matching problem whose weights are obtained through deriving the closed-form solutions of power control in an algebraic method. Then, the global optimal solutions of the matching problem are obtained by using the Hungarian algorithm. Furthermore, a security-aware RB and power allocation (SA-RBPA) mechanism compatible with existing cellular networks is proposed for the small cell base station applications. Extensive simulation results have shown that, compared with existing approaches that consider RB reusing strategy or power control scheme optimization alone, the SA-RBPA scheme is able to realize a better spectrum efficiency and security performance.

D2D Communication for Enabling Internet-of-Things: Outage Probability Analysis

This paper considers an analytical approach to evaluate the outage behavior of the device-to-device (D2D) communication, which is underlaid with cellular networks, as an enabling technology for Internet-of-Things (IoTs). In such an architecture, a group of IoT devices (IoTDs) communicate with an IoT gateway by reusing the resources of cellular users (CUEs) to enhance the spectral efficiency of the fifth-generation networks. Two interference management schemes are widely used in the literature for the sharing of D2D spectrum, namely the fixed-power margin (FPM) and the cooperative pairing (CooP) schemes. We investigate and compare the performance of the two schemes from the perspective of outage probability (OP). While satisfying the minimal performance of the system, the OP of an arbitrary pair (i.e., one IoTD and one CUE) under both schemes are derived in closed form in terms of hyper-geometric functions via the Mellin transform technique. Moreover, for the CooP scheme, an iterative alternating Dinkelbach algorithm is proposed as an outage-optimal power allocation scheme. Analytical and simulation results reveal that the CooP scheme is the outage optimum for the high SNR regime while the FPM scheme is the optimal one for the low SNR regime. Simulation results also show that the suitable power margin of the FPM scheme lies in between 2 and 3 dB. Under these two interference management schemes, the accuracy of the analytical results is verified through numerical simulation and it turns out that these are well matched.

LADTRAM: A Coalition Funded Framework for Localized Advertisements Over D2D

One of the goals of third generation partnership project (3GPP) is to deploy device to device (D2D) proximity services in both commercial and public safety settings. Furthermore, as the mobile market is nearing saturation, service providers (SPs) are searching for additional sources of revenue. Commercial D2D can make use of a SP's unused/underutilized spectrum, yet there are few feasible economic models for deploying commercial D2D services. In this paper, we present Localized Advertisements over D2D specTrum Reuse coAlition fraMework, which is a feasible economic model for deploying a localized advertisement coalition-based D2D service that exploits spectrum leasing and reuse. D2D Ad stations, i.e., user equipments, interested in providing the D2D service form a coalition in order to share spectrum allocated by the SP. Using game theory we design an incentive compatible resource determination mechanism and auction. In the auction localized advertisers compete for resources. We show that our auction approximates the profit performance characteristics of the vickrey clarke groves auction, yet runs in P-time. In addition, we show that with proper planning, the D2D Ad stations can be deployed in a manner such that they can fully exploit the spectrum in the subsector formed by the desired cell size. Our proposed framework enables advertisers to indirectly fund the D2D Advertisement service, while also permitting the SP the ability to profit from leasing their unused spectrum to commercial D2D services.

Resource allocation and dynamic power control for D2D communication underlaying uplink multi-cell networks

Underlaying device-to-device (D2D) communication is suggested as a promising technology for the next generation cellular networks (5G), where users in close proximity can transmit directly to one another bypassing the base station. However, when D2D communications underlay cellular networks, the potential gain from resource sharing is highly determined by how the interference is managed. In order to mitigate the resource reuse interference between D2D user equipment and cellular user equipment in a multi-cell environment, we propose a resource allocation scheme and dynamic power control for D2D communication underlaying uplink cellular network. Specifically, by introducing the fractional frequency reuse (FFR) principle into the multi-cell architecture, we divide the cellular network into inner region and outer region. Combined with resource partition method, we then formulate the optimization problem so as to maximize the total throughput. However, due to the coupled relationship between resource allocation and power control scheme, the optimization problem is NP-hard and combinational. In order to minimize the interference caused by D2D spectrum reuse, we solve the overall throughput optimization problem by dividing the original problem into two sub-problems. We first propose a heuristic resource pairing algorithm based on overall interference minimization. Then with reference to uplink fractional power control (FPC), a dynamic power control method is proposed. By introducing the interference constraint, we use a lower bound of throughput as a cost function and solve the optimal power allocation problem based on dual Lagrangian decomposition method. Simulation results demonstrate that the proposed algorithm achieves efficient performance compared with existing methods.

Enhanced Physical Layer Security in D2D Spectrum Sharing Networks

In this letter, the issue of security for device-to-device (D2D) underlaying cellular networks is considered. The cellular communication is overheard by randomly distributed eavesdroppers. By sharing the spectrum between D2D users and cellular users, the interference generated by D2D users is used as a source of jamming to confuse the eavesdroppers. We first derive the connection probability of the D2D links and the secrecy outage probability of the cellular link based on stochastic geometry tools. We then propose a joint guard zone and threshold-based access control scheme for the D2D users to maximize the achievable secrecy throughput. Moreover, when only the selection threshold is considered, a closed-form expression of the optimal selection threshold is derived. Simulation results show that improved secrecy throughput can be achieved by allowing the transmission of the D2D users.

The Throughput-Outage Tradeoff of Wireless One-Hop Caching Networks

We consider a wireless device-to-device (D2D) network where the nodes have pre-cached information from a library of available files. Nodes request files at random. If the requested file is not in the on-board cache, then it is downloaded from some neighboring node via one-hop "local" communication. An outage event occurs when a requested file is not found in the neighborhood of the requesting node, or if the network admission control policy decides not to serve the request. We characterize the optimal throughput-outage tradeoff in terms of tight scaling laws for various regimes of the system parameters, when both the number of nodes and the number of files in the library grow to infinity. Our analysis is based on Gupta and Kumar {\em protocol model} for the underlying D2D wireless network, widely used in the literature on capacity scaling laws of wireless networks without caching. Our results show that the combination of D2D spectrum reuse and caching at the user nodes yields a per-user throughput independent of the number of users, for any fixed outage probability in $(0,1)$. This implies that the D2D caching network is "scalable": even though the number of users increases, each user achieves constant throughput. This behavior is very different from the classical Gupta and Kumar result on ad-hoc wireless networks, for which the per-user throughput vanishes as the number of users increases. Furthermore, we show that the user throughput is directly proportional to the fraction of cached information over the whole file library size. Therefore, we can conclude that D2D caching networks can turn "memory" into "bandwidth" (i.e., doubling the on-board cache memory on the user devices yields a 100\% increase of the user throughout).

Spectrum Sharing for Device-to-Device Communication in Cellular Networks

This paper addresses two fundamental and interrelated issues in device-to-device (D2D) enhanced cellular networks. The first issue is how D2D users should access spectrum, and we consider two choices: overlay (orthogonal spectrum between D2D and cellular UEs) and underlay (non-orthogonal). The second issue is how D2D users should choose between communicating directly or via the base station, a choice that depends on distance between the potential D2D transmitter and receiver. We propose a tractable hybrid network model where the positions of mobiles are modeled by random spatial Poisson point process, with which we present a general analytical approach that allows a unified performance evaluation for these questions. Then, we derive analytical rate expressions and apply them to optimize the two D2D spectrum sharing scenarios under a weighted proportional fair utility function. We find that as the proportion of potential D2D mobiles increases, the optimal spectrum partition in the overlay is almost invariant (when D2D mode selection threshold is large) while the optimal spectrum access factor in the underlay decreases. Further, from a coverage perspective, we reveal a tradeoff between the spectrum access factor and the D2D mode selection threshold in the underlay: as more D2D links are allowed (due to a more relaxed mode selection threshold), the network should actually make less spectrum available to them to limit their interference.