Abstract
SummaryUsing full‐duplex relaying in device‐to‐device (D2D) communication, spectrum efficiency can be further improved as compared with traditional half‐duplex relaying. Due to the increasing demands for more system capacities and higher data rate, a throughput‐guaranteed and power‐aware relay selection mechanism is essential so that services can be successfully accomplished within tolerable power consumption. It is also imperative to prevent cellular users from interfering and preserve resources for more users at the same time. In current paper, we proposed an efficient relay selection scheme with subchannel reusing. Using the nonconflict group discovery algorithm, firstly, we divided D2D pairs into different groups based on the neighbor lists of all the devices. The D2D pairs in the same group were considered nonconflictive. By building a matrix that represents the power consumption of D2D transmission peers through relays, we proposed a group‐oriented relay selection scheme based on the Hungarian method allowing subchannel reuse over relay‐assisted D2D networks. Applying this mechanism, different D2D pairs are able to transmit messages at the same subchannel, whenever they are in the same group. Better throughput and spectrum usage than currently available relay selection schemes without subchannel reusing can be obtained. Particularly, more D2D pairs in high dense networks can be accommodated, and spectrum resources can be better preserved. The simulation results showed that our proposed mechanism can improve the total throughput by up to 35% as compared with an existing relay selection scheme without subchannel reusing, called as PRS‐D2D, when most D2D pairs are in a few groups.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.