Quorum-based pure directional neighbor discovery in self-organized ad hoc networks

Sina Khatibi, M. Dehghan, Mohammad Ali Poormina
{"title":"Quorum-based pure directional neighbor discovery in self-organized ad hoc networks","authors":"Sina Khatibi, M. Dehghan, Mohammad Ali Poormina","doi":"10.1109/ISTEL.2010.5734073","DOIUrl":null,"url":null,"abstract":"Neighbor discovery is vital for initialing and maintaining self-organized ad hoc networks. In order to exchange advertise messages and learn about each other presence, nodes have to aim their antennas toward each other when they are only utilized by directional antennas. Since ad hoc networks nodes have no former information about each other, neighbor discovery in directional ad hoc networks becomes more challenging. An asynchronous pure directional quorum-based neighbor discovery technique is proposed for the first time in this paper. Using quorum system for realizing the pure directional asynchronous and deterministic neighbor discovery is the novelty of this approach. All nodes are able to find all their potential neighbors in a relatively small time interval using proposed and transmission scenario and neighbor discovery. The independency of quorum based neighbor discovery to omnidirectional antennas during discovery process divides this approach from former related solutions. The suggested approach, by means of quorum system guarantees at least a common active interval for any two reciprocal beams during neighbor discovery procedure. The correctness of quorum based neighbor discovery in directional ad hoc network is discussed besides evaluating by series of simulations. This approach can be classified as fully directional handshake-based deterministic neighbor discovery algorithm.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 5th International Symposium on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTEL.2010.5734073","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Neighbor discovery is vital for initialing and maintaining self-organized ad hoc networks. In order to exchange advertise messages and learn about each other presence, nodes have to aim their antennas toward each other when they are only utilized by directional antennas. Since ad hoc networks nodes have no former information about each other, neighbor discovery in directional ad hoc networks becomes more challenging. An asynchronous pure directional quorum-based neighbor discovery technique is proposed for the first time in this paper. Using quorum system for realizing the pure directional asynchronous and deterministic neighbor discovery is the novelty of this approach. All nodes are able to find all their potential neighbors in a relatively small time interval using proposed and transmission scenario and neighbor discovery. The independency of quorum based neighbor discovery to omnidirectional antennas during discovery process divides this approach from former related solutions. The suggested approach, by means of quorum system guarantees at least a common active interval for any two reciprocal beams during neighbor discovery procedure. The correctness of quorum based neighbor discovery in directional ad hoc network is discussed besides evaluating by series of simulations. This approach can be classified as fully directional handshake-based deterministic neighbor discovery algorithm.
自组织ad hoc网络中基于群体的纯定向邻居发现
邻居发现对于初始化和维护自组织自组织网络至关重要。为了交换通告消息和了解彼此的存在,当节点的天线只被定向天线使用时,节点必须将它们的天线对准彼此。由于自组织网络节点之间没有彼此以前的信息,定向自组织网络中的邻居发现变得更加具有挑战性。首次提出了一种基于异步纯定向群体的邻居发现技术。采用仲裁系统实现纯定向异步和确定性邻居发现是该方法的新颖之处。利用提出的传输场景和邻居发现,所有节点都能够在相对较小的时间间隔内找到所有潜在的邻居。基于仲裁的邻居发现在发现过程中对全向天线的独立性使该方法有别于以往的相关解决方案。该方法通过仲裁系统保证在邻居发现过程中任意两个互反波束至少有一个共同的活动间隔。讨论了定向自组网中基于仲裁的邻居发现方法的正确性,并通过一系列仿真对其进行了评价。该方法可归类为基于全方向握手的确定性邻居发现算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信