Abstract
In this letter, we investigate the context-aware resource allocation for device-to-device communications accounting for the quality-of-service requirements and priorities of different applications based on users’ requests. We formulate a context-aware optimization problem and implement the matching theory to solve the problem. We propose a novel algorithm where the device-to-device user equipments and resource blocks act as two opposite sets of players and interact with each other to obtain the optimal matching. We analytically prove that the algorithm converges to a two-sided exchange stability within limited number of swap operations. We also demonstrate that the proposed algorithm significantly outperforms the context-unaware resource allocation algorithm by around 62.2%.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
