Neighbor discovery, one of the most crucial networking primitives, is particularly challenging in wireless networks with directional antennas. Most of the existing schemes have high discovery delays and serious long tail problems, especially for high-density networks. In this paper, neighbor discovery is formulated as a Markov multi-armed bandit (MAB) problem. Each node utilizes the result of past discovery attempts for learning. We use upper confidence bound (UCB) based algorithms to address the topic, which can effectively balance exploration and exploitation. In addition, a 3-way handshake algorithm with collision feedback is proposed in order to better perceive collisions in the network, thereby speeding up the learning process. Through extensive simulations, we demonstrate that the proposed algorithm is superior to existing methods in terms of neighbor discovery efficiency, while maintaining low overhead and computational complexity.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    MAB-Based 3-Way Neighbor Discovery for Wireless Networks Using Directional Antennas


    Contributors:
    Sun, Wenliang (author) / Wu, Yichen (author) / Zhang, Yu (author)


    Publication date :

    2022-06-01


    Size :

    5256072 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English





    Multipath routing in ad hoc networks using directional antennas

    Yang Li, / Hong Man, / Jin Yu, et al. | IEEE | 2004


    NEW APPROACH FOR NEIGHBOR DISCOVERY IN MOBILE AD HOC NETWORKS

    Suresh, G. / Radhika, V A / Rao, Dr.J.Srinivasa | BASE | 2015

    Free access

    Stealth constrained routing optimization using directional antennas in mobile ad-hoc networks

    Grilo, A. / Macedo, M. / Sebastiao, P. et al. | Tema Archive | 2004