Smart Caching for QoS-Guaranteed Device-to-Device Content Delivery

Caching at user equipment(UE) provides a feasible way for device-to-device(D2D) content delivery among proximal users without deploying additional infrastructures. To support D2D content delivery for mobile traffics with quality-of-service(QoS) requirements, smart caching problem is essential to be solved especially when there is no prior knowledge on demands of proximal users. In this paper, impacts of Qo S requirements and limited caching capacity on UE caching are analyzed, respectively, based on which a caching scheme is proposed. With the proposed caching scheme, UE can determine whether caching a content or not intelligently to guarantee a content request via D2D communications in the network. Simulation results are presented which verify the analyzed influencing factors on D2D caching and the proposed QoS-provisioning caching scheme.

Resource allocation method for device-to-device communications in cellular networks

Based on the conflict graph model which is formulated as a binary integer optimization problem, a resource allocation method to support device-to-device （D2D） communications in ceUular networks is proposed. First, a frequency resource assignment algorithm is presented which assigns each D2D link one frequency resource block. For this algorithm, frequency resource blocks are assigned so that the frequency resource spatial reuse opportunities in the cellular networks can be fully exploited. Then a slot scheduling algorithm is presented which schedules time slots among D2D links assigned the same frequency resource block. For this algorithm, time slot resources are scheduled so that the proportional fairness among D2D links which are assigned the same frequency resource block can be achieved. The performance of the proposed method is evaluated via computer simulations. The simulation results show that the proposed method can well support D2D communications in cellular networks.

在LTE-Advanced网络下的Device-to-Device通信

Device-to-Device(D2D)通信是一种在系统的控制下,允许终端之间通过复用小区资源直接进行通信的新型技术,它能够增加蜂窝通信系统频谱效率,降低终端发射功率,在一定程度上解决无线通信系统频谱资源匮乏的问题。与其他应用于非许可频段的同类技术相比,D2D具有干扰可控等优点。文章对D2D技术原理进行了介绍,阐述了它应用的必要性和应用场景、它对比同类技术的优点,以及在应用中的关键问题。

Performance analysis of graph-based scheduling for device-to-device communications overlaying cellular networks

The performance of the graph-based scheduling for device-to-device communications overlaying cellular networks is studied. The graph-based scheduling consists of two stages, the frequency assignment stage and the time slot scheduling stage. For such scheduling, a theoretical method to analyze the average spectrum efficiency of the D2D subsystem is proposed. The method consists of three steps. First, the frequency assignment stage is analyzed and the approximate formula of the average number of the D2D links which are assigned the same frequency is derived. Secondly, the time slot scheduling stage is analyzed and the approximate formula of the average probability of a D2D link being scheduled in a time slot is derived. Thirdly, the average spectrum efficiency of the D2D subsystem is analyzed and the corresponding approximate formula is derived. Analysis results show that the average spectrum efficiency of the D2D subsystem is approximately inversely linearly proportional to the second- order origin moment of the normalized broadcast radius of D2D links. Simulation results show that the proposed method can correctly predict the average spectrum efficiency of the D2D subsystem.

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

Interference management is one of the most important issues in the device-to-device(D2D)-enabled heterogeneous cellular networks(HetCNets)due to the coexistence of massive cellular and D2D devices in which D2D devices reuse the cellular spectrum.To alleviate the interference,an efficient interference management way is to set exclusion zones around the cellular receivers.In this paper,we adopt a stochastic geometry approach to analyze the outage probabilities of cellular and D2D users in the D2D-enabled HetCNets.The main difficulties contain three aspects:1)how to model the location randomness of base stations,cellular and D2D users in practical networks;2)how to capture the randomness and interrelation of cellular and D2D transmissions due to the existence of random exclusion zones;3)how to characterize the different types of interference and their impacts on the outage probabilities of cellular and D2D users.We then run extensive Monte-Carlo simulations which manifest that our theoretical model is very accurate.

Efcient Algorithms for Cache-Throughput Analysis in Cellular-D2D 5G Network

In this paper,we propose a two-tiered segment-based Device-toDevice(S-D2D)caching approach to decrease the startup and playback delay experienced by Video-on-Demand(VoD)users in a cellular network.In the S-D2D caching approach cache space of each mobile device is divided into two cache-blocks.The rst cache-block reserve for caching and delivering the beginning portion of the most popular video les and the second cacheblock caches the latter portion of the requested video les‘fully or partially’depending on the users’video watching behaviour and popularity of videos.In this approach before caching,video is divided and grouped in a sequence of xed-sized fragments called segments.To control the admission to both cacheblocks and improve the system throughput,we further propose and evaluate three cache admission control algorithms.We also propose a video segment access protocol to elaborate on how to cache and share the video segments in a segmentation based D2D caching architecture.We formulate an optimisation problem and nd the optimal cache probability and beginning-segment size that maximise the cache-throughput probability of beginning-segments.To solve the non-convex cache-throughout maximisation problem,we derive an iterative algorithm,where the optimal solution is derived in each step.We used extensive simulations to evaluate the performance of our proposed S-D2D caching system.

On Cost Minimization for Cache-Enabled D2D Networks with Recommendation

To accommodate the tremendous increase of mobile data traffic,cache-enabled device-to-device(D2D)communication has been taken as a promising technique to release the heavy burden of cellular networks since popular contents can be pre-fetched at user devices and shared among subscribers.As a result,cellular traffic can be offloaded and an enhanced system performance can be attainable.However,due to the limited cache capacity of mobile devices and the heterogeneous preferences among different users,the requested contents are most likely not be proactively cached,inducing lower cache hit ratio.Recommendation system,on the other hand,is able to reshape users’request schema,mitigating the heterogeneity to some extent,and hence it can boost the gain of edge caching.In this paper,the cost minimization problem for the social-aware cache-enabled D2D networks with recommendation consideration is investigated,taking into account the constraints on the cache capacity budget and the total number of recommended files per user,in which the contents are sharing between the users that trust each other.The minimization problem is an integer non-convex and non-linear programming,which is in general NP-hard.Therewith,we propose a timeefficient joint recommendation and caching decision scheme.Extensive simulation results show that the proposed scheme converges quickly and significantly reduces the average cost when compared with various benchmark strategies.

Outage Probability Based on Relay Selection Method for Multi-Hop Device-to-Device Communication

To improve the connectivity of device-to-device(D2D)communication between delay-assisted vehicles,a multi-hop D2D relay selection strategy based on outage probability is proposed.The algorithm firstly clusters the relay users based on the distance of D2D users,and determines the number of one-hop relay nodes through the outage probability threshold.Two-hop relay nodes directly select the same number of relays as one-hop relay nodes according to the descending order of signal noise ratio(SNR)to establish a square matrix.The Hungarian algorithm is used to assign the relay nodes of two clusters to complete the inter relay communication.Finally,the information is sent to the D2D receiver by combining technology.The simulation results show that this algorithm can reduce the cost of relay probing process and the outage probability of system in multi-hop D2D relay communication.

Device-to-Device Based Cooperative Relaying for 5G Network:A Comparative Review

Due to the proliferation of mobile internet access, the cellu-lar traffic is envisaged to experience a 1000-fold growth inthe second decade of the 21 st century. To meet such a hugetraffic demand, the Fifth Generation(5G) network have toadopt new techniques to substantially increase spectral effi-ciency and reliability. At the base station side, available re-sources(power supply, equipment size, processing capability,etc.) are far more sufficient than that of the terminal side,which imposes a high challenge on the uplink transmission.The concept of cooperative communications opens a possibili-ty of using multiple terminals to cooperatively achieve spa-tial diversity that is typically obtained by means of multipleantennas in the base station. The application of Device-to-Device(D2D) communications in the 3GPP LTE system fur-ther pushes the collaboration of terminals from the theory tothe practice. The utilization of D2D-based cooperative relay-ing is promising in the era of 5G. In this paper, we compara-tively study several cooperative multi-relay schemes, includ-ing the proposed opportunistic space-time coding, in thepresence of imperfect channel state information. The numeri-cal results reveal that the proposed scheme is the best coop-erative solution until now from the perspective of multiplex-ing-diversity tradeoff.

A Combining Call Admission Control and Power Control Scheme for D2D Communications Underlaying Cellular Networks

As device-to-device(D2D) communications usually reuses the resource of cellular networks, call admission control(CAC) and power control are crucial problems. However in most power control schemes, total data rates or throughput are regarded as optimization criterion. In this paper, a combining call admission control(CAC) and power control scheme under guaranteeing QoS of every user equipment(UE) is proposed. First, a simple CAC scheme is introduced. Then based on the CAC scheme, a combining call admission control and power control scheme is proposed. Next, the performance of the proposed scheme is evaluated. Finally, maximum DUE pair number and average transmitting power is calculated. Simulation results show that D2 D communications with the proposed combining call admission control and power control scheme can effectively improve the maximum DUE pair number under the premise of meeting necessary QoS.

Secure Beamforming Design for SWIPT in Cooperative D2D Communications

In device-to-device(D2D) communications, device terminal relaying makes it possible for devices in a network to function as transmission relays for each other to enhance the spectral efficiency. In this paper we consider a cooperative D2D communication system with simultaneous wireless information and power transfer(SWIPT). The cooperative D2D communication scheme allows two nearby devices to communicate with each other in the licensed cellular bandwidth by assigning D2D transmitters as half-duplex(HD) relay to assists cellular downlink transmissions. In particular, we focus on secure information transmission for the cellular users when the idle D2D users are the potential eavesdroppers. We aim to design secure beamforming schemes to maximize the D2D users data rate while guaranteeing the secrecy rate requirements of the cellular users and the minimum required amounts of power transferred to the idle D2D users. To solve this non-convex problem, a semi-definite programming relaxation(SDR) approach is adopted to obtain the optimal solution. Furthermore, we propose two suboptimal secure beamforming schemes with low computational complexity for providing secure communication and efficient energy transfer. Simulation results demonstrate the superiority of our proposed scheme.

Beamforming and Interference Cancellation for D2D Communication Assisted by Two-Way Decode-and-Forward Relay Node

This paper investigates the device-to-device(D2D) communication underlaying cellular network assisted by a two-way decode-and-forward relay node. We assume the base station(BS) is equipped with M-antenna and serves its own cellular user while the D2D users communicate via a two-way decode-and-forward relay node. Both beamforming(BF) and interference cancellation(IC) strategies at the BS are considered to improve the performance for the cellular link and D2D link, respectively. We first analyze the received signal-to-interference-plus-noise for the cellular link under BF and IC strategies and then derive the exact closed-form expressions for the cellular link. Asymmetric and symmetric cases are discussed for various locations of each user. Finally, the approximations for high signal-to-noise regime are also presented. Numerical results demonstrate the accuracy of the analytical and asymptotic results.

Security Rate Optimization of D2D Communication Based on Power Control

An optimization of device-to-device(D2D) security rate algorithm based on power control is provided to enhance the physical layer security underlaying D2D communication and guarantee the data rate requirement of the cellular user(CU) at the same time.First,a scenario model is set up,in which an eavesdropper is considered to wiretap the information of D2D transmitters.Then,a secure region of D2D communication is proposed.When D2D communication users reside outside the secure region,the spectrum of CU's is not allowed to share with the D2D communication so as to avoid eavesdropper tapping useful information of D2D communication.When D2D communication users reside inside the secure region,the security rate of D2D is maximized by optimization of the transmitting power of D2D and CU.The simulation results showthat the achieved D2D security rate of the proposed algorithm increases 2.8 bps/Hz when the signal to noise ratio(SNR) is 15 d B,compared with that when the random access algorithm is used.

Admission control based on beamforming and interference alignment for D2D communication underlaying cellular networks

An admission control algorithm based on beamforming and interference alignment for device-to-device( D2D) communication underlaying cellular networks is proposed. First, some portion of D2D pairs that are the farthest away from the base station( BS) is selected to perform joint zero-forcing beamforming together with the cellular user equipments( UEs) and is admitted to the cellular network. The interference of the BS transmitting signal to the cellular UEs and the portion of D2D pair is eliminated completely at the same time. Secondly,based on the idea of interference alignment,the definition of channel parallelism is given. The channel parallelism of the remaining D2D pairs which are not involved in joint zero-forcing beamforming is computed by using the channel state information from the BS to the D2D devices. The higher the channel parallelism,the less interference the D2D pair suffers from the BS. Finally,in a descending order of channel parallelism,the remaining D2D pairs are reviewed in succession to determine admission to the cellular network. The algorithm stops when the admission of a D2D pair decreases the system sum rate. Simulation results show that the proposed algorithm can effectively reduce the interference of the BS transmitting signal for D2D pairs and significantly improve system capacity. Furthermore, D2D communication is more applicable to short-range links.

Energy Efficiency Optimization for D2D Communications Based on SCA and GP Method

In this paper, we propose an energy-efficient power control scheme for device-to-device(D2D) communications underlaying cellular networks, where multiple D2D pairs reuse the same resource blocks allocated to one cellular user. Taking the maximum allowed transmit power and the minimum data rate requirement into consideration, we formulate the energy efficiency maximization problem as a non-concave fractional programming(FP) problem and then develop a two-loop iterative algorithm to solve it. In the outer loop, we adopt Dinkelbach method to equivalently transform the FP problem into a series of parametric subtractive-form problems, and in the inner loop we solve the parametric subtractive problems based on successive convex approximation and geometric programming method to obtain the solutions satisfying the KarushKuhn-Tucker conditions. Simulation results demonstrate the validity and efficiency of the proposed scheme, and illustrate the impact of different parameters on system performance.

D2D communication in a cellular network based on link adaptation with truncated ARQ

A device-to-device （D2D） communication mode underlaying cellular network in a single- cell environment is introduced. A practical method based on link adaptation with automatic repeat request （ARQ） is presented. Link adaptation technique, which combines adaptive modulation and coding （ AMC ） with truncated ARQ, can maximize the cellular UEs＇ data rate under prescribed delay and performance constraints. The proposed method can maximize the total transmission rate when an outage probability is determined. Numerical results show that with proper power control, the in- terference between the two links can be coordinated to increase the sum rate without overwhelming the cellular service.

Novel dynamic anti-collusion ciphertext policy attribute-based encryption scheme in 5G D2D environment

To share data securely with secure attribute revocation,anti-collusion,and dynamic user management in the 5G device-to-device(D2D)environment,a novel dynamic anti-collusion ciphertext policy attribute-based encryption(NDA-CP-ABE)scheme in the 5G D2D environment is proposed.On the basis of the ciphertext policy attribute-based encryption algorithm,fine-grained access control and secure attribute revocation are realized,and the confidentiality of data is guaranteed.A polynomial function is adopted in the ciphertext generation phase to realize dynamic user management.A random number is used to prevent a collusion attack among the legitimate user equipment(UE),revoked UE,and external network attackers.Finally,on the basis of the Diffie-Hellman problem,the NDA-CP-ABE scheme is formally proved,and the simulation performances are compared with those of similar schemes.The results show that data can be securely shared through a D2D channel with secure attribute revocation,anti-collusion,and dynamic user management.Moreover,compared with similar schemes,the NDA-CP-ABE scheme has higher efficiency in encryption,decryption,and storage.

Energy efficiency optimization of relay-assisted D2D two-way communications with SWIPT

Aiming at the energy consumption of long-distance device-to-device(D2D) devices for two-way communications in a cellular network,this paper proposes a strategy that combines two-way relay technology(TWRT) and simultaneous wireless information and power transfer(SWIPT) technology to achieve high energy efficiency(EE) communication.The scheme first establishes a fractional programming problem to maximize EE of D2D,and transforms it into a non-fractional optimization problem that can be solved easily.Then the problem is divided into three sub-problems:power control,power splitting ratios optimization,and relay selection.In order to maximize EE of the D2D pair,the Dinkelbach iterative algorithm is used to optimize the transmitted power of two D2D devices simultaneously;the one-dimensional search algorithm is proposed to optimize power splitting ratios;an improved optimal relay selection scheme based on EE is proposed to select relay.Finally,experiments are carried out on the Matlab simulation platform.The simulation results show that the proposed algorithm has faster convergence.Compared with the one-way relay transmission and fixed relay algorithms,the proposed scheme has higher EE.

A Caching Strategy Based on Many-to-Many Matching Game in D2D Networks

Wireless edge caching has been proposed to reduce data traffic congestion in backhaul links, and it is being envisioned as one of the key components of next-generation wireless networks. This paper focuses on the influences of different caching strategies in Device-to-Device(D2D) networks. We model the D2D User Equipments(DUEs) as the Gauss determinantal point process considering the repulsion between DUEs, as well as the caching replacement process as a many-to-many matching game. By analyzing existing caching placement strategies, a new caching strategy is proposed, which represents the preference list of DUEs as the ratio of content popularity to cached probability. There are two distinct features in the proposed caching strategy.(1) It can cache other contents besides high popularity contents.(2) It can improve the cache hit ratio and reduce the latency compared with three caching placement strategies: Least Recently Used(LRU), Equal Probability Random Cache(EPRC), and the Most Popular Content Cache(MPC). Meanwhile, we analyze the effect of caching on the system performance in terms of different content popularity factors and cache capacity. Simulation results show that our proposed caching strategy is superior to the three other comparison strategies and can significantly improve the cache hit ratio and reduce the latency.

Caching and D2D Assisted Wireless Emergency Communications Networks with Statistical QoS Provisioning

Along with natural disasters,the destruction of communication infrastructures leads to the congestion or failure of communication networks.Unmanned aerial vehicles(UAVs),which are with a high flexibility,can be employed as temporary base stations to establish emergency networks.To relieve the backhaul burden of UAVs,some imperative contents can be cached by terrestrial cache-enabled rescuers(CERs)and provide for victims with device-to-device(D2D)transmissions.To support the effectiveness and timeliness of emergency communication,the delay-bounded quality-of-service(QoS)requirement and network throughput are desired to be comprehensively considered,which imposes a new challenge for caching placement and CER deployment.In this paper,we focus on joint caching placement and CER deployment to maximize the effective capacity subject to delay-bounded QoS requirement.The overall non-convex problem is transformed into the caching placement and the CER deployment sub-problems.Then,we develop the QoS-aware caching placement scheme with fixed CER deployment density and obtain the QoS-aware CER deployment density with fixed caching placement.Based on the block-coordinate descent method,we also propose the joint caching placement and CER deployment scheme,which can not only effectively enhance average effective capacity but also guarantee the delay-bounded QoS requirement.Also,numerical simulations are conducted to show the performances of the proposed schemes.