Abstract
Neighbor discovery is an essential prerequisite for any device-to-device (D2D) communication. Unlike ad-hoc networks, the base station (BS) in D2D networks may facilitate the neighbor discovery process. However, device-to-BS channel states or device locations are not enough to provide BS with information on the channel quality between the devices. Thus, due to the inherent uncertainty of link quality between devices, the BS-assisted neighbor discovery cannot be treated as typical scheduling problem. In this paper, we investigate the assisted directional neighbor discovery in D2D networks. We first formulate the scheduling problem as an integer optimization problem that captures the uncertainty. Then we propose a greedy based centralized scheduling to determine directional pilot transmission instances. We also propose a one-way randomized discovery, where we choose the directional transmission probabilities based on two techniques, an intuitive and an optimized methods. Finally, we provide simulation results that assess the performance the schemes.
Published Version
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.
