Interference management in dense inband D2D network using spectral clustering &amp; dynamic resource allocation

In this paper, we present a general Gaussian N-relay network by allowing relays to communicate to each other and allowing a direct channel between source and destination as compared to the standard diamond network in Nazaroğlu et al. (IEEE Trans Inf Theory 60:6329–6341, 2014) at the cost of extra channel uses. Our main focus is to examine the min-cut bound capacities of the relay network. Very recently, the results in Uykan (IEEE Trans Neural Netw Learn Syst 31:3294–3304, 2020) imply that the GADIA in Babadi and Tarokh (IEEE Trans Inf Theory 56:6228–6252, 2010), a pioneering algorithm in the interference avoidance literature, actually performs max-cut of a given power-domain (nonnegative) link gain matrix in the 2-channel case. Using the results of the diamond network in Nazaroğlu et al. (2014) and the results in Uykan (2020), in this paper, we (i) turn the mutual information maximization problem in the Gaussian N-relay network into an upper bound minimization problem, (ii) propose a modified GADIA-based algorithm to find the min-cut capacity bound and (iii) present an upper and a lower bound to its min-cut capacity bound using the modified GADIA as applied to the defined “squared channel gain matrix/graph”. Some advantages of the proposed modified GADIA-based simple algorithm are as follows: (1) The Gaussian N-relay network can determine the relay clusters in a distributed fashion and (2) the presented upper bound gives an insight into whether allowing the relays to communicate to each other pays off the extra channel uses or not as far as the min-cut capacity bound is concerned. The simulation results confirm the findings. Furthermore, the min-cut upper bound found by the proposed modified-GADIA is verified by the cut-set bounds found by the spectral clustering based solutions as well.

show abstract

“…For the spectral clustering formulation as applied to the channel allocation problem, see e.g. [38,39,43]. Let's define a discrete-value vector…”

Section: Simulation Resultsmentioning

confidence: 99%

“…Relaxing the optimization in (43) such that x 2 R NÂ1 (instead of being integers), it's well-known that the optimum solution which maximizes h T Lh with unit norm constraint is equal to…”

Section: Simulation Resultsmentioning

confidence: 99%

A modified GADIA-based upper-bound to the capacity of Gaussian general N-relay networks

Uykan

Jäntti

2021

Wireless Netw

View full text Add to dashboard Cite

show abstract

“…However, D2D multiplexing the spectrum resources of cellular users will cause interference between two types of users. Effective resource allocation algorithm and interference management scheme are needed to avoid or reduce these interferences [17,18].…”

Section: Network Auxiliary Control Network Architecturementioning

confidence: 99%

Automatic Repair Method for D2D Communication Routing Buffer Overflow Vulnerability in Cellular Network

Yang

Jiang

2021

Scientific Programming

View full text Add to dashboard Cite

Repairing D2D communication routing buffer overflow in a cellular network is of great significance in improving communication quality and security. Due to the increase of user usage, the communication data are easy to exceed the boundary of the buffer, resulting in the reduction of covered data information. The traditional repair methods mainly repair through the characteristics of covered data information, ignoring the impact of network topology information transmission delay and packet loss during calculation, resulting in the problem of low communication security. A cellular network routing buffer overflow repair algorithm based on the homomorphic analysis of node residual energy is proposed; the cellular network D2D communication routing protocol is designed; the cellular network D2D communication protocol path index is determined; then, the cellular network D2D communication routing protocol is designed by analyzing node residual energy; and the cellular network D2D communication network routing optimization method based on AHP is designed. Big constructs the energy model of cellular network D2D communication network, solves and sets the routing optimization objective function, realizes the control of network routing, and repairs the buffer overflow. The experiment results show that the improved method can effectively reduce the packet loss rate of communication data, improve the anti-interference ability of the system, and ensure the security of network communication.

show abstract

“…However, to the best of the authors' knowledge, the literature on interference management for cooperative D2D systems is scant. Several studies have also been carried out for D2D [16], [17], [18] and cooperative D2D systems [19], [20]. Such research [16], [17], [18] focuses on interference management in D2D systems.…”

Section: Introductionmentioning

confidence: 99%

“…Several studies have also been carried out for D2D [16], [17], [18] and cooperative D2D systems [19], [20]. Such research [16], [17], [18] focuses on interference management in D2D systems. First, Doumiati et al [16] proposed the interference network model as a connected graph, turning the clustering problem into a graph partitioning problem.…”

Section: Introductionmentioning

confidence: 99%

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

et al. 2022

View full text Add to dashboard Cite

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.

show abstract

Interference management in dense inband D2D network using spectral clustering & dynamic resource allocation

Cited by 14 publications

References 19 publications

A modified GADIA-based upper-bound to the capacity of Gaussian general N-relay networks

A modified GADIA-based upper-bound to the capacity of Gaussian general N-relay networks

Automatic Repair Method for D2D Communication Routing Buffer Overflow Vulnerability in Cellular Network

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

Contact Info

Product

Resources

About