Abstract

Underwater Acoustic Communication (UWAC) is a recent addition to the ad hoc networking arena, and it has a variety of applications using autonomous underwater vehicles (AUVs). However, UWAC faces several challenges such as the Doppler Effect, channel availability problems, and limited bandwidth. Efficient management of the network is crucial to overcome these challenges, and clustering is an effective approach to achieve this. In this paper, we propose a novel protocol called EEMCCP (Efficient Energy Management and Cluster-based Communication Protocol) that uses clusters to route packets efficiently with the lowest cost. The Chaotic Algae Algorithm (CAA) is used to efficiently achieve clustering without requiring node position information. One node from each cluster acts as the Cluster Head (CH) to ensure the proper combination of network components. The proposed protocol does not consider nodes based on their location or position. Instead, the Received Signal Strength Indicator (RSSI) value of the Hello packets is used to select some CHs as gateway nodes, which are responsible for supplying AUVs with data. When gateway CH nodes exhaust their energy, back-up nodes take over, making the protocol flexible. Communication links transmit the data from AUV nodes to terrestrial destinations. We compare the performance of EEMCCP with existing underwater communication protocols, and our analysis shows that EEMCCP achieves a higher throughput and a higher Packet Delivery Ratio (PDR) than the existing protocols. EEMCCP is a cost-effective solution for transmitting data underwater, and it opens up several avenues for research in the field of UWAC. EEMCCP achieves a higher throughput and a higher Packet Delivery Ratio (PDR) than existing underwater communication protocols such as AEERP and EEDBR, making it a cost-effective solution to transmit data underwater.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call