Cooperative D2D Communication Research Articles

Fusion of artificial intelligence and game theory for resource allocation in non‐orthogonal multiple access‐assisted device‐to‐device cooperative communication

SummaryDevice‐to‐device (D2D) communication offers a low‐cost paradigm where two devices in close proximity can communicate without needing a base station (BS). It significantly improves radio resource allocation, channel gain, communication latency, and energy efficiency and offers cooperative communication to enhance the weak user's network coverage. The cellular mobile users (CMUs) share the spectral resources (e.g., power, channel, and spectrum) with D2D mobile users (DMUs), improving spectral efficiency. However, the reuse of radio resources causes various interferences, such as intercell and intracell interference, that degrade the performance of overall D2D communication. To overcome the aforementioned issues, this paper presents a fusion of AI and coalition game for secure resource allocation in non‐orthogonal multiple access (NOMA)‐based cooperative D2D communication. Here, NOMA uses the successive interference cancellation (SIC) technique to reduce the severe impact of interference from the D2D systems. Further, we utilized a coalition game theoretic model that efficiently and securely allocates the resources between CMUs and DMUs. However, in the coalition game, all DMUs participate in obtaining resources from CMUs, which increases the computational overhead of the overall system. For that, we employ artificial intelligence (AI) classifiers that bifurcate the DMUs based on their channel quality parameters, such as reference signal received power (RSRP), received signal strength indicator (RSSI), signal‐to‐noise ratio (SNR), and channel quality indicator (CQI). It only forwards the DMUs that have better channel quality parameters into the coalition game, thus reducing the computational overhead of the overall D2D communication. The performance of the proposed scheme is evaluated using various statistical metrics, for example, precision score, accuracy, recall, F1 score, overall sum rate, and secrecy capacity, where an accuracy of 99.38% is achieved while selecting DMUs for D2D communication.

MIMO Device-to-Device Communications via Cooperative Dual-Polarized Intelligent Surfaces

By making the propagation environment a programmable entity, reconfigurable intelligent surfaces (RIS) constitute a key enabler to fulfill the quality-of-service requirements of device-to-device (D2D) communications. In practice, however, a single RIS may not be able to establish a line-of-sight path between the devices, e.g., in environments with rich scattering or when devices are far apart. This can hinder the communications especially in applications that require the transfer of different data sets from a source to multiple destinations. Considering such type of applications, this letter proposes a dual-polarized cooperative RIS-assisted MIMO D2D communication scheme, where the beam routing path via multiple RISs is selected based on the maximum received signal-to-noise ratio and path constraints. Looking into system operation in indoor environments, and utilizing a realistic channel model, tractable expressions are obtained for the system’s error rate and outage probability. An asymptotic analysis is also conducted to evaluate the diversity gain. The findings reveal significant advantages of the dual-polarized cooperative RIS scheme over other RIS-based schemes.

Energy Price-Based Resource Scheduling for Network Lifetime Extending in Cooperative D2D Communications Overlaying Cellular Networks

Energy Price-Based Resource Scheduling for Network Lifetime Extending in Cooperative D2D Communications Overlaying Cellular Networks

The Design of User-Centric Mobile Crowdsensing with Cooperative D2D Communications

Ubiquitous sensor-rich smartphones have promoted MCS, an emerging people-centric sensing paradigm for urban IoT. However, using cellular networks to transmit the big data collected by MCS would incur expensive financial costs for both participating phone users and the MCS organizer. A promising solution to this is to integrate the low-cost D2D communication into the MCS design. However, using D2D in MCS will require cooperative interactions among self-interested and strategic participating phone users, which significantly complicates the “human-in-the-loop” MCS design in both the digital and human dimensions, and brings a branch of new challenges: data communication and networking become more complex; D2D connections among opportunistically encountered phone users must be secure, fast, and user-transparent; and participating phone users need to be properly incentivized. In dealing with these challenges, this article covers recent developments of D2D-enabled MCS from both the theoretical and practical perspectives. Future research questions in this rapidly growing field are also discussed.

Relay selection and power allocation for energy-load efficient network-coded cooperative unicast D2D communications

Relay selection and power allocation for energy-load efficient network-coded cooperative unicast D2D communications

A New Adaptive Power Control Based on LEACH Clustering Protocol for Interference Management in Cooperative D2D Systems

The cooperative device-to-device (D2D) system is becoming one of the most popular communication models in wireless 5G technology that combines the D2D system with cooperative communication to extend coverage and increase system performance. However, interference is one of the factors of decreasing service quality in cooperative D2D systems because of adjacent users/clusters and excessive power usage, which also causes interference to the receiver. Interference management, such as power control, can overcome interference problems in the cooperative D2D communication system. Therefore, this paper proposes a new form of adaptive power control (APC) based on the low-energy adaptive clustering hierarchy (LEACH) protocol for interference management systems in cooperative D2D systems that other studies have not considered. For a fair comparison, this paper also modifies the conventional fixed power control (FPC) method using the LEACH protocol and the modified fixed power control (MFPC) used in the previous study and then considers the system without power control. The simulation results show that the proposed APC can significantly reduce interference in cooperative D2D communication compared to the MFPC and without power control. Moreover, the simulation results also show that concerning the signal-to-interference and noise ratio (SINR) to the outage probability and throughput, the proposed APC performs better than the MFPC and without power control. Thus, the proposed APC can effectively reduce interference in cooperative D2D systems.

Adaptive relay selection based on channel gain and link distance for cooperative out-band device-to-device networks

Device-to-device (D2D) communication is one of the key enabling technologies for 5G to support many connections efficiently. In a cooperative out-band D2D communication network, relay nodes have an essential role in receiving and forwarding information signals from source (S) to destination (D), making the system more reliable and with higher energy efficiency. Therefore, the relay selection method is very important in determining the best relay among existing relays to achieve maximum performance. This paper proposes a new Adaptive Relay Selection (ARS) scheme for cooperative out-band D2D networks based on channel gain value and transmission link distance. Firstly, the best relay is adaptively selected among N available relays (R) based on the maximum channel gain values between S to R if the channel gain-based signal-to-noise ratio (SNR) is greater than the distance-based SNR. Otherwise, the best relay is selected based on the minimum distance between S to R. We also analyzed an exact closed-form throughput and the total energy consumption required for a cooperative out-band D2D communication system using the Quantization-and-Forward (QF) protocol. The numerical results show that the proposed ARS scheme has a higher throughput than the two previous schemes: maximum channel gain and minimum distance. Furthermore, the proposed ARS can reduce the total energy consumption, which indirectly impacts the resulting energy efficiency level. The proposed ARS scheme achieves higher energy efficiency than the previous schemes, either by link distance or power allocation. So, the proposed ARS scheme for an out-band D2D communication network is an appropriate solution for the next generation of cellular communications.

Lightweight fog computing-based authentication protocols using physically unclonable functions for internet of medical things

The Internet of Medical Things (IoMT) is a network of connections between a medical information system and medical equipment. Fog computing for IoMT is a model for extending cloud computing and medical services to the edge of the network, but the conventional fog computing model does not support some necessary features, such as device-to-device (D2D) communications for the effective exchange of data and processing thereof between devices in the IoMT. This investigation develops a secure authentication scheme for the fog computing model with cooperative D2D communication support. Since the power and resources of the medical sensors are limited, the proposed protocols use lightweight cryptographic operations, including a one-way cryptographic hash function, the Barrel Shifter Physically Unclonable Function (BS-PUF), to ensure the security of the sensors and fog nodes and to avoid a computational burden on devices. The proposed protocols not only resist possible attacks and provide more security than related schemes, but also are more efficient.

A Nonlinear MIMO-OFDM Based Full-Duplex Cooperative D2D Communications System

Multiple input multiple output (MIMO) based orthogonal frequency division multiplexing (OFDM) has widely been used in a wireless communications system for its robustness to frequency-selective channels and better spectral efficiency. The introduction of full-duplex (FD) and device-to-device (D2D) communications, which are potential candidates of fifth-generation (5G) and beyond, further improve the spectral efficiency of MIMO-OFDM based systems. This paper proposes a novel MIMO-OFDM based FD Cooperative-D2D (C-D2D) communications system wherein a cellular user (CU) acts as an FD relay to facilitate seamless communications between D2D transmitter and receiver. The complete analytical framework is presented to analyze the end-to-end performance of the proposed system. Specifically, the closed-form expression for symbol error rate (SER) of the proposed system is derived in the presence of multipath Rayleigh fading channel and residual self-interference (RSI) due to the FD mode. Further, the performance of the system is analyzed in the presence of a nonlinear high power amplifier (HPA) which introduces the nonlinear distortion. Finally, simulation results are presented to verify the derived expressions. The results show that there is higher SER in the presence of nonlinear HPA due to nonlinear distortion, which can be reduced by increasing input back off (IBO). The presence of RSI also increases the SER at CU, which is further reduced by employing self-interference cancellation (SIC) techniques. A complete end-to-end analytical framework is designed to compare the performance of the proposed system with the conventional system with linear HPA and no RSI.

Two-Timescale Resource Allocation for Cooperative D2D Communication: A Matching Game Approach

In this paper, we consider a cooperative device-to-device (D2D) communication system, where the D2D transmitters (DTs) act as relays to assist the densified cellular network users (CUs) for transmission quality of service (QoS) improvement. The proposed system achieves a win-win situation, i.e. improving the spectrum efficiency of the CUs that cannot meet their rate requirement while providing spectrum access for D2D pairs. Unlike previous works, to reduce the overhead, we design a novel two-timescale resource allocation scheme, in which the pairing between CUs and D2D pairs is decided at a long timescale and transmission time for CU and D2D pair is determined at a short timescale. Specifically, to characterize the long-term payoff of each potential CU-D2D pair, we investigate the optimal cooperation policy to decide the transmission time based on the instantaneous channel state information (CSI). We prove that the optimal policy is a threshold policy which can be achieved via binary search. Since CUs and D2D pairs are self-interested, they are paired only when they agree to cooperate mutually. Therefore, to study the cooperation behaviors of CUs and D2D pairs, we formulate the pairing problem as a matching game, based on the long-term payoff achieved by the optimal cooperation policy of each possible pairing. Furthermore, unlike most previous matching models in D2D networks, we allow transfer between CUs and D2D pairs to improve the performance. To solve the pairing problem, a distributed algorithm is proposed, which converges to an $\epsilon$ -stable matching. We show that there is a trade-off between the optimality and the computational complexity of the algorithm. We also analyze the algorithm in terms of the robustness to the unilateral deviation of D2D pairs. Finally, the simulation results verify the efficiency of the proposed matching algorithm.

Energy-efficient relay selection and power allocation for multi-source multicast network-coded D2D communications

Device-to-device (D2D) communication improves spectrum efficiency (SE) and increases system capacity. Heterogeneous networks comprise macrocell and several small cells, such as picocells and femtocells, where femtocells are more efficient. In cooperative communications, one or several additional nodes help to send data from source to destination to improve the quality of service (QoS). Network coding (NC) in cooperative networks can extend data rate and coverage area of D2D communication. The purpose of this article is to minimize power consumption of transmitting nodes during network-coded cooperative D2D transmission to reduce the interference on co-channel transmissions. In this study, we consider cooperative multicast D2D communication with NC, where femtocell base stations (FBSs) are used as relay. We propose a method based on energy efficiency (EE) maximization for relay selection and power allocation for multi-source network-coded cooperative D2D communication in heterogeneous cellular networks. We present a solution to the proposed method and evaluate its performance. The results show that the introduced method significantly improves the SE and EE compared to the coordinated multi-point (CoMP) transmission, multi-source direct D2D communication (D-D2D), and other works.

Performance analysis of a cooperative D2D communication network with NOMA

The cooperative device-to-device (D2D) network employing non-orthogonal multiple access (NOMA) is expected to play an important role in the next-generation wireless networks. In this work, the authors derive outage probability expressions of a cooperative NOMA D2D network which employs decode-and-forward relaying. A wireless link experiencing Nakagami-m fading is considered which is further assisted in the communication network by a wired link which is a powerline communication link and experiences Rayleigh fading. The outage analysis, shown for both the strong user and the weak user, is derived assuming that at the receiver there is perfect successive interference cancellation. Employing power division NOMA, optimum value for the coefficient of power allocation is obtained corresponding to the minimum probability of outage of the strong user. Furthermore, a range of the NOMA power allocation coefficient is provided for the communication link at the weak user which is between the wireless and the powerline link. Symbol error probability expressions are also derived for the strong and the weak users for the scenario when: i) both the wireless and the wired links are available for communication and ii) only the wireless link is available for communication.

Content Prefetching of Mobile Caching Devices in Cooperative D2D Communication Systems

The increase of mobile traffic volume in a wireless network using high carrier frequency can lead to coverage and backhaul bottleneck issues, and these issues can be solved by the use of device-to-device (D2D) caching technology that installs a content cache on a device and uses D2D communication to supply contents to other devices. In this paper, a special device that can supply contents using D2D communication to other devices is called a helper, while a device that can receive contents from a helper is called user equipment (UE). Even though a helper may have a large storage capacity compared to a UE, the cache capacity of a helper is still limited, making it difficult to obtain a sufficient hit ratio using a caching scheme based on the long-term content popularity of a large number of UEs while considering the distant future. In this paper, to solve the problem of the conventional D2D caching system, we suggest instead updating the cache contents based on the short-term content preference of individual user for the near future. In the proposed caching scheme, a UE in an area with insufficient data supply predicts the content that will be consumed in the near future. This information is then passed to a mobile helper moving along a predictable travel path, such as a bus and a self-driving car that is passing through or will pass though an area with sufficient data supply. Then, the mobile helper prefetches the contents and moves to update the cache of the nomadic or fixed helper near the UE. The simulation results show that content prefetching considering each UE and the near future can achieve better performance than content caching considering a large number of UEs and the distant future.

An interference management approach for CR-assisted cooperative D2D communication

In this paper, we investigate a cooperative D2D communication in cognitive radio (CR) networks, which is composed of two secondary links, one primary link, and a relay network. In cases where data transmission is not performed directly, the source devices can communicate with their destinations via the relay network, which consists of some idle secondary devices. We propose a clustering relay selection (RS) method to enable simultaneous transmission of primary and secondary sources. The proposed RS classifies the relay devices into two clusters and assigns one cluster to the primary link and another to the secondary links. Furthermore, an interference management approach is proposed to improve the system performance. By jointly employing the proposed RS and a cooperative beamforming (CBF) method in each cluster, the investigated approach can maximize the received SINR at the destinations while maintaining the interference plus noise power below a predefined threshold. To investigate the performance, we optimize the proposed RS and CBF vectors by solving a convex semidefinite problem using the bisection search algorithm. Simulation results are provided to show the efficiency of the investigated strategy.

Learning for Matching Game in Cooperative D2D Communication With Incomplete Information

This paper considers a cooperative device-to-device (D2D) communication system, where the D2D transmitters (DTs) act as relays to assist cellular users (CUs) in exchange for the opportunities to use licensed spectrum. Based on the interaction of each D2D pair and each CU, we formulate the pairing problem between multiple CUs and multiple D2D pairs as a one-to-one matching game. Unlike most existing works, we consider a realistic scenario with incomplete channel information. Thus, each CU lacks enough information to establish its preference over D2D pairs. Therefore, traditional matching algorithms are not suitable for our scenario. To this end, we convert the matching game to an equivalent non-cooperative game, and then propose a novel learning algorithm, which converges to a stable matching.

LAAP: Lightweight anonymous authentication protocol for D2D-Aided fog computing paradigm

Fog computing is a new paradigm that extends cloud computing and services to the edge of the network. Although it has several distinct characteristics, however, the conventional fog computing model does not support some of the imperative features such as D2D communications, which can be useful for several critical IoT applications and services. Besides, fog computing faces numerous new security and privacy challenges apart from those inherited from cloud computing, however, security issues in fog computing have not been addressed properly. In this article, first we introduce a new privacy-preserving security architecture for fog computing model with the cooperative D2D communication support, which can be useful for various IoT applications. Subsequently, based on the underlying foundation of our proposed security architecture we design three lightweight anonymous authentication protocols (LAAPs) to support three distinct circumstances in D2D-Aided fog computing. In this regard, we utilize the lightweight cryptographic primitives like one-way function and EXCLUSIVE-OR operations, which will cause limited computational overhead for the resource limited edge devices.

A Two-Way Cooperative D2D Communication Framework for a Heterogeneous Cellular Network

This paper analyzes the performance of two-way OFDMA based cooperative device-to-device communication (C-D2D) framework in a heterogeneous cellular network. In the proposed work, a heterogeneous network (HetNet) is considered where the base station (BS) of the macro cell is interested in communicating with the BS of smaller cells such as micro, pico or femto cell, nested inside the macro cell. Each macro cell also consists of the number of cellular users which when given an opportunity, would like to communicate directly via D2D link. The cellular users which communicate through D2D link is defined as D2D users. Due to infrastructure failure, if no direct communication link is available between two BSs then HetNet adopts a time-slotted two-phase C-D2D protocol. Macro cell BS selects a D2D user as an amplify-and-forward (AF) two-way relay to facilitate communication between two BSs. In Phase I, both the BSs send their data over N subcarriers to the D2D transmitter (DT). Subsequently, in Phase II, DT amplifies the received signal and forward it to the BSs over D subcarriers. The remaining $$N-D$$ subcarriers are used by DT for D2D communication. Results show that the proposed analysis facilitates D2D communication in HetNet, and also improves the quality-of-service (QoS) of the BSs as compared to conventional AF protocol.

Dynamic Social-Aware Peer Selection for Cooperative Relay Management With D2D Communications

In this paper, we investigate the optimal dynamic social-aware peer selection with spectrum-power trading to maximize the average sum energy efficiency (EE) of cellular users (CUs) for uplink transmission for an orthogonal frequency division multiple access cellular network with device-to-device (D2D) communications. Different from the previous studies, which mostly focus on how to exploit social ties in human social networks to construct the permutation of all the feasible peers, we consider dynamic peer selection with social awareness-aided spectrum-power trading in D2D overlaying communications. Specifically, the amount of transmit power from the D2D transmitters to relay the CUs for uplink transmission is determined by their social trust levels. Likewise, the D2D transmitters can gain the corresponding amount of spectrum from the CUs for D2D pair link communications, which can be regarded as the compensation of the power consumption for relaying CUs. We formulate the dynamic peer selection problems with social awareness-aided spectrum-power trading in cooperative D2D communications into the infinite-horizon time-average renewal-reward problems subject to time average constraints on a collection of penalty processes. And the Lyapunov optimization concepts-based drift-plus-penalty algorithms are proposed to solve them. The simulation results demonstrate the effectiveness of the proposed dynamic peer selection algorithms. And further performance comparison indicates that the proposed dynamic peer selection algorithms not only maximize the average EE of CUs but also guarantee higher privacy protection.

Performance Analysis and Resource Allocation for Cooperative D2D Communication in Cellular Networks With Multiple D2D Pairs

In this letter, we investigate cooperative device-to-device (D2D) communication in an uplink cellular network, where D2D users act as relays for cellular users. We derive the outage probability of a cellular user and the average achievable rate from a D2D transmitter to a D2D receiver in analytic form. We obtain optimal spectrum and power allocation to maximize the total average achievable rate under the outage probability constraint. The validity of the analysis is verified by computer simulations.

Accelerating Content Delivery via Efficient Resource Allocation for Network Coding Aided D2D Communications

Device-to-device (D2D) communication is one of the emerging paradigms in 5G networks to facilitate ever-increasing demands for local area services. For content delivery, direct transmission via D2D communications among proximity nodes and cooperative content downloading from base stations can enhance system capacity, which on the other hand cause interference to regular cellular networks due to spectrum sharing. Random linear network coding is capable of improving robustness to the varying channel state with severe interference. It also increases collaborative efficiency between users for content sharing. This paper investigates cooperative relaying scheme (RNCC) for cooperative D2D communications, which is aided by the random linear network coding. This is achieved by allocating the downlink resource among multiple cellular users, cooperative relays, and D2D pairs. First a binary integer linear programming-based resource allocation problem is modeled by introducing D2D pairs' clustering concept, which is an NP-hard problem. For the optimal solution, we leverage the branch-and-cut algorithm. While for large scale networks, we contributed a distributed QoS-aware greedy algorithm, which yields close to optimal solution. Our proposed schemes are evaluated via the extensive simulations considering practical scenarios, and the system sum rate results demonstrate an enhancement of ~20% performance in comparison with several other practical strategies in literature, which validates our schemes' effectiveness.