Issue |
JNWPU
Volume 39, Number 1, February 2021
|
|
---|---|---|
Page(s) | 62 - 70 | |
DOI | https://doi.org/10.1051/jnwpu/20213910062 | |
Published online | 09 April 2021 |
An asynchronous neighbor discovery protocol based on double tokens in directional ad hoc networks
定向自组织网络中一种基于双令牌的非同步邻居发现协议
1
School of Electronics and Information, Northwestern Polytechnical University, Xi'an 710129, China
2
The 54 th Research Institute of CETC, Shijiazhuang 050081, China
3
CETC Network & Communications Co. Ltd, Shijiazhuang 050081, China
Received:
2
June
2020
Aiming at the problem of slow neighbor discovery speed of sector antenna neighbor discovery (SAND) protocol based single token, an asynchronous sector antenna neighbor discovery protocol based double tokens (D-SAND) is proposed. The double tokens include one master token and one slave token. The master token holder (MTH) starts its neighbor nodes discovery process by sending hone-in message through beam scanning, and ends this process when each neighbor node is discovered. Then, MTH passes the master token to the next hop master token holder (nMTH). At the same time, MTH sends the location information of the nMTH node to its parent master token holder (MTP) from which it obtains its token. MTP determines whether to generate a slave token according to that if there exists a neighbor node with a distance greater than 2R from nMTH, where R represents the communication distance. If there exists one such neighbor, MTP generates a slave token and passes it to that neighbor node, who can begin the neighbor discovering process. The time conditions are theoretically derived when these two tokens begin their neighbor discovering process respectively and without interference to each other. Simulation results show that compared to Q-SAND(quick-SAND), the proposed D-SAND protocol reduces the network-wide neighbor discovery time about by 10%.
摘要
针对基于单令牌(Token)的扇区天线邻居发现协议(SAND)发现速度慢的问题,提出了一种非同步下基于双Token的扇区天线邻居发现协议(D-SAND)。双Token分为主Token和从Token,主Token持有节点(MTH)探测邻居节点,通过波束扫描的形式发送Hone-In信息,建立基本连接后与各个邻居节点完成邻居发现过程,然后将该Token传递给下一跳主Token持有节点(nMTH),同时MTH将nMTH的位置信息发送给父Token持有节点(MTP),接着MTP节点进行从Token生成决策,查看是否存在与nMTH距离大于2R的邻节点(其中R表示单跳节点之间的最大通信距离),如果存在则由父Token持有节点产生临时的从Token传递给该节点进行邻居发现。之后对双Token并行工作互不干扰的时间条件进行了理论分析,通过仿真表明,相比快速扇区天线邻居发现协议(Q-SAND),提出的D-SAND协议全网邻居发现时间缩短约10%。
Key words: directional ad hoc network / asynchronization / neighbor discovery / sector antenna
关键字 : 定向自组织网络 / 非同步 / 邻居发现 / 扇区天线
© 2021 Journal of Northwestern Polytechnical University. All rights reserved.
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.