You are not logged in.

Practical asynchronous neighbor discovery in ad hoc networks with directional antennas

Tian, Feng, Liu, Bo, Cai, Hao, Zhou, Haibo and Gui, Lin 2016, Practical asynchronous neighbor discovery in ad hoc networks with directional antennas, IEEE Transactions on vehicular technology, vol. 65, no. 5, pp. 3614-3627, doi: 10.1109/TVT.2015.2449335.

Attached Files
Name Description MIMEType Size Downloads

Title Practical asynchronous neighbor discovery in ad hoc networks with directional antennas
Author(s) Tian, Feng
Liu, BoORCID iD for Liu, Bo orcid.org/0000-0002-3603-6617
Cai, Hao
Zhou, Haibo
Gui, Lin
Journal name IEEE Transactions on vehicular technology
Volume number 65
Issue number 5
Start page 3614
End page 3627
Total pages 14
Publisher IEEE
Place of publication Piscataway, N.J.
Publication date 2016-05
ISSN 0018-9545
1939-9359
Keyword(s) ad hoc networks
asynchronous
directional antennas
neighbor discovery
Summary Neighbor discovery is a crucial step in the initialization of wireless ad hoc networks. When directional antennas are used, this process becomes more challenging since two neighboring nodes must be in transmit and receive states, respectively, pointing their antennas to each other simultaneously. Most of the proposed neighbor discovery algorithms only consider the synchronous system and cannot work efficiently in the asynchronous environment. However, asynchronous neighbor discovery algorithms are more practical and offer many potential advantages. In this paper, we first analyze a one-way handshake-based asynchronous neighbor discovery algorithm by introducing a mathematical model named 'Problem of Coloring Balls.' Then, we extend it to a hybrid asynchronous algorithm that leads to a 24.4% decrease in the expected time of neighbor discovery. Compared with the synchronous algorithms, the asynchronous algorithms require approximately twice the time to complete the neighbor discovery process. Our proposed hybrid asynchronous algorithm performs better than both the two-way synchronous algorithm and the two-way asynchronous algorithm. We validate the practicality of our proposed asynchronous algorithms by OPNET simulations.
Language eng
DOI 10.1109/TVT.2015.2449335
Field of Research 080503 Networking and Communications
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category C1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2015, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30084340

Document type: Journal Article
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 63 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Thu, 23 Jun 2016, 17:56:16 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.