Group partition for capacity-region-aware device-to-device communications

Abstract

In this paper, we propose a group partition approach for scalable throughput optimization of capacity-region-aware Device-to-Device communications. Instead of the conventional collision model, we adopt network information theory that allows a receiving device to simultaneously decode multiple packets from multiple transmitting devices, as long as the vector of transmitting rates is inside the capacity region. We propose a novel approach to partition devices into subgroups based on coloring a conflict graph and then solve an optimization problem for each subgroup. In particular, the formation of the conflict graph explicitly takes the capacity region into consideration. Simulation results show that the proposed approach could significantly outperform the greedy algorithm.

Group Partition and Dynamic Rate Adaptation for Scalable Capacity-Region-Aware Device-to-Device Communications

“…Recently, cooperative interference cancellation in the context of 3GPP D2D communications has been proposed and discussed [30]. To the best of our knowledge, our previous work [5] is the first in the literature that exploits network information theory for D2D communications. While it is possible to extend other previous works on D2D communications to benefit from network information theory, such extensions are beyond the scope of the paper.…”

“…We [5] proposed an algorithm that partitions source devices into subgroups based on graph theory. When the algorithm is used, source devices in subgroup k become candidate devices that could use channel k, ∀ 1 ≤ k ≤ C. For the completeness of the paper and the convenience of the readers, we briefly introduce the algorithm in this section.…”

“…Therefore, i, j ∈ V and (i, j) ∈ E. Otherwise, (i, j) ∈ E (and i, j ∈ V ). In [5], it has been proved that if…”

“…Pseudo codes for the second phase can be found in [5] and are omitted due to limit of space. The second phase is used to assign each source device a subgroup.…”

“…For D2D communications, Liou et al [5] proposed using a graph coloring algorithm to partition devices into subgroups and solving an integer-linear programming problem to maximize the throughput of a subgroup. In this paper, we focus on scalable algorithms for large-scale networks in which solving integer-linear programming problems is infeasible.…”