A multi-token sector antenna neighbor discovery protocol for directional ad hoc networks

Zhang Hang, Li Bo, Zhongjiang Yan, Yang Mao, Li Xinru
{"title":"A multi-token sector antenna neighbor discovery protocol for directional ad hoc networks","authors":"Zhang Hang, Li Bo, Zhongjiang Yan, Yang Mao, Li Xinru","doi":"10.23919/JCC.ea.2022-0222.202401","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a Multi-token Sector Antenna Neighbor Discovery (M-SAND) protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks. The central concept of our work involves maintaining multiple tokens across the network. To prevent mutual interference among multi-token holders, we introduce the time and space non-interference theorems. Furthermore, we propose a master-slave strategy between tokens. When the master token holder (MTH) performs the neighbor discovery, it decides which 1-hop neighbor is the next MTH and which 2-hop neighbors can be the new slave token holders (STHs). Using this approach, the MTH and multiple STHs can simultaneously discover their neighbors without causing interference with each other. Building on this foundation, we provide a comprehensive procedure for the M-SAND protocol. We also conduct theoretical analyses on the maximum number of STHs and the lower bound of multi-token generation probability. Finally, simulation results demonstrate the time efficiency of the M-SAND protocol. When compared to the Q-SAND protocol, which uses only one token, the total neighbor discovery time is reduced by 28% when 6 beams and 112 nodes are employed.","PeriodicalId":504777,"journal":{"name":"China Communications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"China Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/JCC.ea.2022-0222.202401","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we propose a Multi-token Sector Antenna Neighbor Discovery (M-SAND) protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks. The central concept of our work involves maintaining multiple tokens across the network. To prevent mutual interference among multi-token holders, we introduce the time and space non-interference theorems. Furthermore, we propose a master-slave strategy between tokens. When the master token holder (MTH) performs the neighbor discovery, it decides which 1-hop neighbor is the next MTH and which 2-hop neighbors can be the new slave token holders (STHs). Using this approach, the MTH and multiple STHs can simultaneously discover their neighbors without causing interference with each other. Building on this foundation, we provide a comprehensive procedure for the M-SAND protocol. We also conduct theoretical analyses on the maximum number of STHs and the lower bound of multi-token generation probability. Finally, simulation results demonstrate the time efficiency of the M-SAND protocol. When compared to the Q-SAND protocol, which uses only one token, the total neighbor discovery time is reduced by 28% when 6 beams and 112 nodes are employed.
定向特设网络的多令牌扇形天线邻居发现协议
在本文中,我们提出了一种多令牌扇区天线邻居发现(M-SAND)协议,以提高异步定向 ad hoc 网络中邻居发现的效率。我们工作的核心理念是在整个网络中维护多个令牌。为了防止多令牌持有者之间的相互干扰,我们引入了时间和空间互不干涉定理。此外,我们还提出了令牌之间的主从策略。当主令牌持有者(MTH)执行邻居发现时,它会决定哪个 1 跳邻居是下一个 MTH,哪个 2 跳邻居可以成为新的从令牌持有者(STH)。利用这种方法,主令牌持有者和多个从令牌持有者可以同时发现它们的邻居,而不会相互干扰。在此基础上,我们为 M-SAND 协议提供了一个全面的程序。我们还对 STH 的最大数量和多令牌生成概率的下限进行了理论分析。最后,仿真结果证明了 M-SAND 协议的时间效率。与只使用一个令牌的 Q-SAND 协议相比,当使用 6 个波束和 112 个节点时,总的邻居发现时间减少了 28%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信