Resource Allocation for Underlaying Device-to-Device Communications Using Maximal Independent Sets and Knapsack Algorithm

@article{Kose2018ResourceAF,
  title={Resource Allocation for Underlaying Device-to-Device Communications Using Maximal Independent Sets and Knapsack Algorithm},
  author={Alper Kose and Berna Ozbek},
  journal={2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)},
  year={2018},
  pages={1-5}
}
In this paper, we address the resource allocation problem of device-to-device (D2D) communications underlaying orthogonal frequency division multiple access (OFDMA) based cellular systems by exploiting the efficiency that comes from an ensemble of graph theory and Knapsack problem. It is possible to construct the conflict graph of the D2D pairs by finding the maximal independent sets. Then, we use those independent sets as inputs to Knapsack problem iteratively in order to find D2D groups which… CONTINUE READING

References

Publications referenced by this paper.