Performance of neighbor discovery algorithms in mobile ad hoc self-configuring networks with directional antennas

One of the key performance measures for a neighbor discovery algorithm in military applications with directional antennas is how long it takes to discover the neighbors given that nodes do not have priori knowledge about where their neighbors are. One general impression in neighbor discovery is that algorithms based on all directional (directional transmission and directional receive) takes longer time to discover all neighbors than those algorithms partially or entirely based on omni-directional antennas. In this paper, we prove that this may not be the case. We first describe a generic random neighbor discovery algorithm (GRA), which uses omni-directional antennas for reception. Then we derive analytical expressions for the average number of slots required to discover all (or any one of) the neighbors for GRA and for an all-directional, scan based algorithm (omni-directional antennas are not used at all). Analytic and simulation results are presented to compare the two algorithms in terms of the expected number of slots required to discover any one or all of the neighbors. Based on the numerical results, we conclude that scan-based all-directional algorithm gives better performance than the algorithm which uses omni-antennas. If designed properly, all-directional neighbor discovery algorithms can discover neighbors in less time than those algorithms that use omnidirectional antennas. The advantages and disadvantages of each algorithm are discussed as well.

[1]  J. J. Garcia-Luna-Aceves,et al.  A new approach to channel access scheduling for Ad Hoc networks , 2001, MobiCom '01.

[2]  Jens Zander,et al.  Slotted ALOHA multihop packet radio networks with directional antennas , 1990 .

[3]  Nitin H. Vaidya,et al.  Using directional antennas for medium access control in ad hoc networks , 2002, MobiCom '02.

[4]  Wang Boliang.  Pure Directional Transmission and Reception Algorithms in Wireless Ad Hoc Networks with Directional Antennas , 2006 .

[5]  Joseph Bibb Cain,et al.  A link scheduling and ad hoc networking approach using directional antennas , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[6]  Nitin H. Vaidya,et al.  Medium access control protocols using directional antennas in ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  M. E. Steenstrup.  Exploiting directional antennas to provide quality of service and multipoint delivery in mobile wireless networks , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[8]  Elif Uysal-Biyikoglu,et al.  Energy-efficient link assessment in wireless sensor networks , 2004, IEEE INFOCOM 2004.

[9]  Yong Pei,et al.  On the capacity improvement of ad hoc wireless networks using directional antennas , 2003, MobiHoc '03.

[10]  Martha E. Steenstrup,et al.  Neighbor discovery among mobile nodes equipped with smart antennas , 2003 .

[11]  H. B. Russell,et al.  Distributed and adaptive TDMA algorithms for multiple-hop mobile networks , 2002, MILCOM 2002. Proceedings.

[12]  J. J. Garcia-Luna-Aceves,et al.  Transmission scheduling in ad hoc networks with directional antennas , 2002, MobiCom '02.

[13]  Chien-Chung Shen,et al.  Topology control for ad hoc networks with directional antennas , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[14]  Steven A. Borbash,et al.  Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks , 2001, MobiHoc '01.

[15]  Ram Ramanathan,et al.  On the performance of ad hoc networks with beamforming antennas , 2001, MobiHoc '01.

[16]  Dharma P. Agrawal,et al.  A novel MAC layer protocol for space division multiple access in wireless ad hoc networks , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.