Abstract-We consider the problem of neighbor discovery in static wireless ad hoc networks with directional antennas. We propose several probabilistic algorithms in which nodes perform random, independent transmissions to discover their one-bop neighbors. Our neighbor discovery algorithms are classified hto two groups, viz. Direct-Discovery Algorithm in which nodes discover their neighbors only upon receiving a transmission from their neighbors and Gossip-Based Algorithm in which nodes gossip about their neighbors' location information to enable faster discovery. We first consider the operation of these algorithms in a slotted, synchronous system and mathematically derive their optimal parameter settings. We show how to extend these algorithms for an aqmchronous system and describe their optimal design. Analysis and simulation of the algorithms show that nodes discover their neighbors much faster using gossip-based algorithms than using direct-discovery algorithms. Furthermore, the performance of gossip-based algorithms is insensitive to a n increase in n@e density. The efficiency of a neighbor discovery algorithm also depends on the choice of antenna beamwidth, We discuss in detail how the choice of heamwidth impacts the performance of the discovery process and provide insights into how nodes can configure their beamw idths.
Vasudevan et al REF propose algorithms for neighbor discovery in directional antenna equipped ad hoc networks.
On neighbor discovery in wireless networks with directional antennas
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
Computer Science