A Neighbor Discovery Algorithm for Flying Ad Hoc Network Using Directional Antennas

Lingjun Liu, Laixian Peng, Renhui Xu, Wendong Zhao
{"title":"A Neighbor Discovery Algorithm for Flying Ad Hoc Network Using Directional Antennas","authors":"Lingjun Liu, Laixian Peng, Renhui Xu, Wendong Zhao","doi":"10.1109/WOCC.2019.8770698","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the neighbor discovery problem in Flying Ad Hoc Network using directional antennas. Based on realistic scenarios, the height of UAVs can be approximated to follow a Gaussian distribution. A novel 2-way neighbor discovery algorithm that adjusts the selection probability according to transmission space divided by pitch angle parameter is proposed. Then we derive analytical expressions of the probability of a successful discovery between two nodes and the expected value of time slots needed to complete the neighbor discovery. We also adopt a practical way to determine when to terminate the discovery procedure. Lastly, simulation results are presented to show the effectiveness of proposed algorithm.","PeriodicalId":285172,"journal":{"name":"2019 28th Wireless and Optical Communications Conference (WOCC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 28th Wireless and Optical Communications Conference (WOCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCC.2019.8770698","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 consider the neighbor discovery problem in Flying Ad Hoc Network using directional antennas. Based on realistic scenarios, the height of UAVs can be approximated to follow a Gaussian distribution. A novel 2-way neighbor discovery algorithm that adjusts the selection probability according to transmission space divided by pitch angle parameter is proposed. Then we derive analytical expressions of the probability of a successful discovery between two nodes and the expected value of time slots needed to complete the neighbor discovery. We also adopt a practical way to determine when to terminate the discovery procedure. Lastly, simulation results are presented to show the effectiveness of proposed algorithm.
一种基于定向天线的飞行Ad Hoc网络邻居发现算法
本文研究了定向天线飞行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学术文献互助群
群 号:481959085
Book学术官方微信