Smart Packet Delivery in Mobile Underwater Sensors Networks (M-CTSP)

Abstract

This research is focused on leveraging the Travelling Salesman Problem (TSP) to establish the optimal route of getting from a source node to a destination node in an underwater dynamic location. In this context, all nodes are mobile and slightly adjust their positions due to water currents. Clustering is introduced (CTSP) to identify the best possible route, where cluster heads are chosen using the known criterium of center of mass of the cluster as well as residual energy. Packets travel from source to destination (nodes) in a multiloop process, visiting cluster heads nodes, with minimum energy consumption. The intention behind using TSP in this approach is thus to efficiently handle the dynamic movement of underwater nodes by conserving energy and ensuring delivery of packets can be relied upon. Additionally, to the movement-related challenges, this method also enhances network lifetime by providing a systematic and energy-efficient way of transmitting information through cluster heads. Simulations using the novel M-CTSP into the routing algorithm yields to promising results the M-CTSP protocol enhances routing execution with the use of dynamic clustering and traveling salesman optimization. This results in a 40% rise in energy use reduction, 15% improvement in packet delivery with a 30% increase in network lifetime when compared to normal clustering-based protocols: LEACH and EECBP-FOA. Experimental results prove that M-CTSP contributes extensively in terms of node mobility packet delivery and energy conservation in dynamic UWSN environments.