Abstract
Social-aware device-to-device (D2D) resource allocation utilizes social ties in human-formed social networks to allocate spectrum resources between D2D users and cellular users. In this letter, we consider the small size social communities formed by people with similar interests and exploit them to optimize the resource allocation of the communities. This results in an optimal graph matching problem among communities to solve the D2D resource allocation problem. Solutions are derived via bipartite graph matching and an effective small social community resource allocation algorithm corresponding to the cases of small and high D2D user loads.
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.
