Analysis of D2D‐pairing scheme based on Voronoi diagram in cellular networks |
| |
Authors: | Chun‐Peng Liu Chen‐Guang He Wei‐Xiao Meng |
| |
Affiliation: | Communications Research Center, Harbin Institute of Technology, Harbin, China |
| |
Abstract: | This 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. |
| |
Keywords: | coverage probability D2D D2D‐pairing stochastic geometry Voronoi diagram |
|
|