By Topic

Neighbor discovery in mobile ad hoc self-configuring networks with directional antennas: algorithms and comparisons

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhensheng Zhang ; San Diego Res. Center, Inc., San Diego, CA ; Bo Li

In this paper, we consider the neighbor discovery problem in wireless ad hoc networks with directional antennas. One key performance measure is how long it takes to discover all the neighbors given that nodes do not have priori knowledge where their neighbors are. One common impression is that algorithms using directional transmission/receive take longer time than those algorithms using omni-antennas. In this paper, we prove that this is not the case. Furthermore, most of the proposed algorithms are 1-way only, which is not suitable for networks with directional antennas. We first propose three 2-way random neighbor discovery algorithms (based on the algorithms in [Vasuden et al., 2005]), two of which may still use omni-antennas in certain stages of the algorithms and a new scan based algorithm. Then we derive analytical expressions for the average number of slots required to discover all the neighbors for the three 2-way random algorithms and for two scan based algorithms. Analytic and simulation results are presented to compare 4 of the algorithms. From the numerical results, we conclude that scan-based all-directional algorithms give the best performance among all the algorithms considered. If designed properly, all-directional algorithms can discover neighbors in less time than those algorithms using omni-directional antennas.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:7 ,  Issue: 5 )