Underwater Acoustic Network Protocol based on Directed Graph: A self-organization method of underwater acoustic network with asymmetric communication links

Dong Xiao, Min Zhao, Ning Jia, Li Wei, Yan Chen, Li Ma
{"title":"Underwater Acoustic Network Protocol based on Directed Graph: A self-organization method of underwater acoustic network with asymmetric communication links","authors":"Dong Xiao, Min Zhao, Ning Jia, Li Wei, Yan Chen, Li Ma","doi":"10.1145/3491315.3491370","DOIUrl":null,"url":null,"abstract":"In an underwater acoustic network, the position of each underwater node is relatively fixed after it is deployed. Commonly, it is not easy to obtain auxiliary information before the network is established, such as accurate geographical position, environmental characteristics, and topological structure. The problem of asymmetry between communication uplink and downlink among nodes occurs due to the differences in transmission source level, transmission directivity, background noise, and propagation conditions of different nodes. To solve this problem, a self-organization method based on directed graph of the underwater acoustic network is proposed. In this proposed method, an adjacency matrix is established by adding the \"neighbor discovery\" phase before a round of simple flooding-based broadcasts and \"inquire-reply\" phase after that. The routing table is calculated based on the adjacency matrix using the classical shortest route algorithm to quickly complete the self-organization of the network with asymmetric communication links.","PeriodicalId":191580,"journal":{"name":"Proceedings of the 15th International Conference on Underwater Networks & Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 15th International Conference on Underwater Networks & Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3491315.3491370","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In an underwater acoustic network, the position of each underwater node is relatively fixed after it is deployed. Commonly, it is not easy to obtain auxiliary information before the network is established, such as accurate geographical position, environmental characteristics, and topological structure. The problem of asymmetry between communication uplink and downlink among nodes occurs due to the differences in transmission source level, transmission directivity, background noise, and propagation conditions of different nodes. To solve this problem, a self-organization method based on directed graph of the underwater acoustic network is proposed. In this proposed method, an adjacency matrix is established by adding the "neighbor discovery" phase before a round of simple flooding-based broadcasts and "inquire-reply" phase after that. The routing table is calculated based on the adjacency matrix using the classical shortest route algorithm to quickly complete the self-organization of the network with asymmetric communication links.
基于有向图的水声网络协议:一种具有非对称通信链路的水声网络自组织方法
在水声网络中,每个水下节点部署后的位置是相对固定的。通常,在网络建立之前,很难获得准确的地理位置、环境特征、拓扑结构等辅助信息。由于不同节点之间的传输源级别、传输指向性、背景噪声、传播条件等存在差异,导致节点间通信上下行链路不对称。为了解决这一问题,提出了一种基于水声网络有向图的自组织方法。该方法通过在一轮简单泛洪广播之前添加“邻居发现”阶段和在此之后添加“查询-应答”阶段来建立邻接矩阵。采用经典最短路由算法,基于邻接矩阵计算路由表,快速完成具有非对称通信链路的网络的自组织。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信