Handshake mechanism selection in MANETs with directional antennas: A new evaluation view

Abstract

Abstract Handshake mechanism plays a significant role in neighbour discovery (ND) algorithms in mobile ad hoc networks (MANETs) with directional antennas. In this letter, aiming at 1) the MANET scenario of uniformly‐distributed nodes and 2) the random beam‐scanning manner, the upper and lower bounds of ND time of the network are theoretically derived for both 1‐way and 2‐way. This analysis indicates that the ND time is approximately linear growth with NDT‐Mutual, where the NDT‐Mutual is defined as the expected time for a node to complete mutual discovery with its neighbours. Then the theoretical expression for NDT‐mutual is derived, which is a function of the number of nodes. The asymptotic analysis reveals that when the number of nodes is very small, the NDT‐mutual of 2‐way is lower than 1‐way, while 1‐way performs better when the number of nodes approaches infinity. The number of nodes when 1‐way and 2‐way perform as well is further presented, which can be utilized to guide the selection of handshake mechanism in MANETs with directional antennas. Simulation results demonstrate the accuracy of our modelling for ND and the effectiveness of using NDT‐mutual to approximate who performs better with 1‐way and 2‐way.

Keywords

• access protocols
• directive antennas
• mobile ad hoc networks