Interference Graph-Based Resource Allocation (InGRA) for D2D Communications Underlaying Cellular Networks

Zhang, Rongqing; Cheng, Xiang; Yang, Liuqing; Jiao, Bingli

doi:10.1109/tvt.2014.2356198

Cited by 115 publications

(71 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similarly, the RU (n*, m*) satisfies (8), (20), (21) and (22) will be allocated to DUE j*. The procedure terminates until all RUs are consumed or the rate requirements of all CUEs and DUEs are satisfied.…”

Section: Ru Allocation Via Greedy Search Methodsmentioning

confidence: 99%

“…Therefore to obtain better EE performance, system resources should be allocated to the CUEs and DUEs at the same time. Limited works have been done on jointly considering CUEs and DUEs to allocate system resources [21]. However, there are some RA restrictions which are impractical just be stated as those in second.…”

Section: Iet Communicationsmentioning

confidence: 99%

“…Finally, the effectiveness of the proposed RA scheme is validated by simulations. The contributions of this paper are summarised as follows: † Considering the intrinsic features of D2D communication, an energy-efficient RA scheme is proposed from an end-to-end energy-efficient perspective, which is different from most existing works [14][15][16][21][22][23]. In our problem formulation, end-to-end energy consumptions, including the circuit energy consumption of the transmitters (both CUEs and DUEs), transmission energy consumption and the circuit energy consumption of the receivers (both BS and DUEs) are jointly considered.…”

Section: Contributionsmentioning

confidence: 99%

“…In our problem formulation, end-to-end energy consumptions, including the circuit energy consumption of the transmitters (both CUEs and DUEs), transmission energy consumption and the circuit energy consumption of the receivers (both BS and DUEs) are jointly considered. † Different from most of the existing RA algorithms [10][11][12][13][14][15][21][22][23], the proposed RA scheme can be regarded as a multi-dimensional RA algorithm, for the time slot, sub-channel (frequency) and power resources are jointly optimised to achieve better EE performance. It is very significant for multi-dimensional RA research, for multi-dimensional resources are available in existing wideband communication system, such as long-term evolution.…”

Section: Contributionsmentioning

confidence: 99%

See 3 more Smart Citations

Multiple resource allocation in device‐to‐device communication underlaying cellular networks from an end‐to‐end energy‐efficient perspective

2015

IET Communications

View full text Add to dashboard Cite

In this study, a novel energy-efficient resource allocation (RA) scheme is proposed for device-to-device communication underlaying cellular networks from an end-to-end energy-efficient perspective. The time slot, subchannel (frequency) and power resources are allocated together to optimise the energy-efficiency (EE) performance. Furthermore, to match the practical communication situations and achieve the best EE performance, the timefrequency resource units (RUs) are used in a complete-shared pattern. Then, the multiuser interference is very severe and complex. With all these considerations, the energy-efficient RA problem is formulated as a mixed integer and nonconvex optimisation problem, which is an non-deterministic polynominal (NP)-hard problem and extremely difficult to solve. To obtain a desirable solution with a reasonable computation cost, the authors tackle this problem with two steps.Step 1, the RU allocation policy is obtained via a greedy search method, and the original optimisation problem is reduced to a non-convex fractional programming problem.Step 2, exploiting the properties of fractional programming and after some manipulations, they transform the reduced problem to a concave optimisation problem, and obtain the sub-optimal power allocation strategy through the Lagrange dual approach. Finally, simulation results are presented to validate the effectiveness of the proposed RA scheme.

show abstract

Section: Ru Allocation Via Greedy Search Methodsmentioning

confidence: 99%

Section: Iet Communicationsmentioning

confidence: 99%

Section: Contributionsmentioning

confidence: 99%

Section: Contributionsmentioning

confidence: 99%

See 2 more Smart Citations

Multiple resource allocation in device‐to‐device communication underlaying cellular networks from an end‐to‐end energy‐efficient perspective

2015

IET Communications

View full text Add to dashboard Cite

show abstract

“…In this subsection, we construct the interference graph to represent the resource-sharing relations in D2D communication networks [29,30]. In particular, we assume there are C cellular users grouped in a set denoted by C = {c 1 , c 2 , · · · , c C }.…”

Section: Interference Graph Modelmentioning

confidence: 99%

A coalitional graph game framework for network coding-aided D2D communication

Zhao

Ding

et al. 2016

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

The application of device-to-device (D2D) communication in cellular networks can significantly improve the efficiency of spectrum utilization, which benefits local area cooperative services. On the other hand, network coding can realize more efficient cooperation among cellular users. Thus, it is natural to combine network coding with D2D communication in order to further increase the system sum rate. In this paper, a coalitional graph game framework is proposed to jointly accomplish resource allocation and relay selection, two challenging problems in network coding-aided D2D communication networks. It is shown that this framework can model D2D communication combined with various network coding schemes. Based on the coalitional graph game framework, a distributed algorithm with low computational complexity is proposed to solve the formulated problem for physical layer network coding-aided D2D communication. Finally, the performance of the proposed transmission scheme is evaluated through extensive simulations.

show abstract

Analysis of D2D‐pairing scheme based on Voronoi diagram in cellular networks

Liu

Meng

2018

Int J Communication

View full text Add to dashboard Cite

SummaryThis paper presents a device‐to‐device (D2D)–pairing scheme based on Voronoi diagram, which establishes D2D links by the relation of transmission powers and link distances. Using the principle of stochastic geometry and channel inversion, the coverage probability is analyzed, we observe that the co‐channel interference caused by cellular networks is stable in theory, and the influence of link distance parameter is highlighted as well. According to the second‐order moment of link distance, the new metric space of D2D terminals set is constructed, in which Voronoi diagram is degenerated into Delaunay triangles set to represent the potential D2D links. In addition, on the basis of the mini‐max length criterion of Delaunay triangle, the D2D communication range–limiting algorithm is designed. Finally, the more intuitive results compared with conventional D2D communications are displayed by simulations. Owing to restraining the D2D communication range, lower co‐channel interference can be obtained. Specially, the D2D‐pairing scheme is approximate local optimal under the D2D communication range–limiting algorithm, and it can provide more fairness than greedy algorithm.

show abstract

Interference Graph-Based Resource Allocation (InGRA) for D2D Communications Underlaying Cellular Networks

Cited by 115 publications

References 17 publications

Multiple resource allocation in device‐to‐device communication underlaying cellular networks from an end‐to‐end energy‐efficient perspective

Multiple resource allocation in device‐to‐device communication underlaying cellular networks from an end‐to‐end energy‐efficient perspective

A coalitional graph game framework for network coding-aided D2D communication

Analysis of D2D‐pairing scheme based on Voronoi diagram in cellular networks

Contact Info

Product

Resources

About