Optimal Broadcast Scheduling Algorithm for a Multi-AUV Acoustic Communication Network

In systems of multiple autonomous underwater vehicles (AUVs), to achieve cooperative operation and cluster intelligence, information is often disseminated via broadcasting. However, due to the long propagation delay and slow transmission rate of underwater acoustic communication, traditional broadca...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE/ACM transactions on networking Ročník 31; číslo 5; s. 1 - 12
Hlavní autori: Qiu, Tianyou, Li, Yiping, Feng, Xisheng
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.10.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
ISSN:1063-6692, 1558-2566
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In systems of multiple autonomous underwater vehicles (AUVs), to achieve cooperative operation and cluster intelligence, information is often disseminated via broadcasting. However, due to the long propagation delay and slow transmission rate of underwater acoustic communication, traditional broadcast scheduling algorithms require a long broadcast period to avoid signal collision. To improve the channel utilization rate as much as possible and improve the update rate for broadcast information, we propose an optimal broadcast scheduling algorithm. This algorithm uses the location information of AUVs to adjust the broadcast sequence and broadcast schedule, to achieve the shortest possible collision-free broadcast period in the broadcast network for the current node distribution. Simulation experiments show that this algorithm can achieve a broadcast period much shorter than that of traditional TDMA and higher channel utilization without signal collision. In addition, the simulations prove the feasibility of applying the algorithm in an actual MAC protocol.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2022.3232956