Publication | Closed Access
Bipartite Graph Based Proportional Fair Resource Allocation for D2D Communication
35
Citations
10
References
2017
Year
Unknown Venue
Bipartite GraphCross-layer OptimizationEngineeringDynamic Resource AllocationResource Allocation SchemeResource Allocation SchemesD2d CommunicationCommunication EngineeringNetwork OptimizationMobile Data OffloadingComputer EngineeringFair Resource AllocationComputer ScienceMobile ComputingDevice-to-deviceCommunication AlgorithmGraph TheoryEdge ComputingBusinessHeterogeneous Network
Device to Device (D2D) communication is expected to play a major role for enhancing system capacity in the fifth generation wireless networks. The gains are expected due to the possibility of reusing resources allocated to the cellular users (CUs) for the D2D underlay network. This allows for the resource reuse in the same cell and thus may lead to a significant interference. The key challenge is to devise resource allocation schemes for the D2D communication that does not adversely affect CUs' communication. In this paper, our aim is to propose a polynomial time proportionally fair resource allocation scheme for D2D users that respects the rate requirements of the CUs. The proposed scheme can potentially work with any resource allocation scheme for CUs and can adapt to the time and location varying channel conditions. Unlike most of the previous work, our scheme allows for allotting more than one resource block to a D2D pair. The performance of the proposed scheme is validated through the simulations.
| Year | Citations | |
|---|---|---|
Page 1
Page 1