Abstract
Fast and efficient neighbor discovery is important for the deployment of wireless networks. In this paper, we propose a novel scheme named Dual Channel Competition (DCC) for neighbor discovery of wireless networks. Unlike conventional random access neighbor discovery schemes, transmissions of wireless nodes are scheduled in a new way, through which we can solve the packets collision problem, in the meanwhile, improve the utilization of wireless channel, as a consequence, increase the efficiency of neighbor discovery. Numerical results show that, the DCC scheme has a better performance than the existing randomized neighbor discovery algorithms. Furthermore, the DCC scheme can be easily extended to scenarios of practical multi-hop wireless networks and wireless networks with directional antennas.
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.