Beacon‐based routing protocols for underwater acoustic sensor networks

Tariq, Moeenuddin; Latiff, Muhammad Shafie Abd; Ayaz, Muhammad; Abbas, Muhammad

doi:10.1002/dac.3375

Cited by 5 publications

(2 citation statements)

References 56 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…networks with star, tree, mesh, or cluster topologies. Cluster topologies divide the network into groups, each consisting of a cluster head and several cluster members [11], [12], [13], [14], [15]. Cluster heads establish multi-hop transmission between the source and sink, reducing energy consumption while mitigating impairments of acoustic channels, such as multi-path fading and beam bending [1], [16].…”

Section: Introductionmentioning

confidence: 99%

“…However, using conventional cluster-based protocols can lead to a reduction in network lifetime due to the energy depletion of cluster heads [17]. To address this issue, Heinzelman et al introduced the low-energy adaptive clustering hierarchy (LEACH) protocol for radio frequency (RF) networks [17], [18], which has since been adapted for underwater acoustic clustering networks (UACNs) [11], [12], [13], [14], [15], [19]. The LEACH protocol extends the network lifetime by aggregating data and rotating the cluster head role among sensor nodes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Low-Latency Low-Energy Adaptive Clustering Hierarchy Protocols for Underwater Acoustic Networks

Ghazy

Kaddoum

Singh³

2023

IEEE Access

View full text Add to dashboard Cite

Underwater acoustic cluster networks (UACNs) are commonly used due to their adaptability in dynamic underwater environments. While the low-energy adaptive clustering hierarchy (LEACH) protocol was initially designed for radio frequency (RF) cluster networks, it has also been applied to UACNs. However, the LEACH protocol uses lengthy overheads per packet due to its use of global or wide-scale IDs, leading to increased communication latency and energy usage per packet. To address this issue, we propose the low-latency low-energy adaptive clustering hierarchy (L 3 EACH) protocol. The L 3 EACH protocol is a comprehensive framework that integrates ID assignment, time slot reservation, packet routing, and selfnetwork organization. The protocol uses shorter overheads by assigning local IDs instead of global or widescale IDs. It assigns unique IDs to nodes within a cluster and reassigns the same IDs to nodes in other clusters, i.e., spatial ID reuse. The protocol also allocates IDs and time slots on demand to maximize network resources. To further enhance the protocol, we introduce the L 3 EACH-Version 2 (L 3 EACH-V2) protocol, which modulates the preamble bits to embed the IDs in the overhead rather than inserting extra bits. We also provide the computational complexity of the L 3 EACH-V2 protocol. Compared to the DIVE protocol, the L 3 EACH protocol reduces the ID length and average energy per packet by 50% and 13%, respectively. Furthermore, the L 3 EACH-V2 protocol reduces the average energy per packet by 27% and increases the network throughput by 16% compared to the L 3 EACH protocol, making it an efficient and scalable solution, especially, for dense UACNs.

show abstract