Depth-Regulated and Energy-Balanced Routing for UWSNs Using Chaotic Search and Rescue Optimization
محورهای موضوعی : پردازش چند رسانه ای، سیستمهای ارتباطی، سیستمهای هوشمند
Saif Kadhim Mutar
1
,
Azam Andalib
2
,
Hossein Azgomi
3
,
Seyed Ali Sharifi
4
1 - 1MSc Student, Department of Electrical and Computer Engineering, Urmia University, Urmia, Iran
2 - Assistant Professor, Department of Computer Engineering, Ra.C., Islamic Azad University, Rasht, Iran
3 - Assistant Professor, Department of Computer Engineering, Ra.C., Islamic Azad University, Rasht, Iran
4 - Assistant Professor, Department of Computer Engineering, B.C., Islamic Azad University, Bonab, Iran
کلید واژه: underwater wireless sensor networks, depth control, routing, Clustering, search and rescue optimization algorithm and multi-hop data transfer,
چکیده مقاله :
Underwater wireless sensor networks (UWSNs) employ numerous inexpensive sensor nodes deployed in deep ocean environments. These nodes, characterized by their limited transmission power, resources, and energy, serve various purposes including disaster management, underwater navigation, and environmental monitoring. In these networks it is very challenging to update their location or add new devices, and it is very important to enhance the energy performance and lifetime of the underwater wireless sensor network. Multi-hop communication can expand the range of communication in these networks and increase its connections. The use of clustering-based routing is effective for increasing energy efficiency in these networks, with the difference that, unlike conventional wireless sensor networks, they have limitations such as low bandwidth, extended persistence, underwater pressure, and higher error probability. An energy balance routing protocol with multi-hop data transmission based on search and rescue (EBMH_CSR) is proposed, which balances by adjusting the depth of less energy nodes and replacing them with more energy nodes, and by combining chaotic concepts in the search and rescue optimization algorithm and with Considering residual energy, distance and degree of sensor nodes, fitness function is calculated. Simulation results show that the EBMH_CSR algorithm has improved the packet delivery rate (PDR) in different number of nodes by 23.6 percent, the packet reception rate (NPR) in different number of loads by 26.7 percent, the energy consumption in different number of rounds by 31.2 percent, the end-to-end delay by 31.7 percent, and the network lifetime in different number of nodes by 36 percent compared to the compared algorithms.
Underwater wireless sensor networks (UWSNs) employ numerous inexpensive sensor nodes deployed in deep ocean environments. These nodes, characterized by their limited transmission power, resources, and energy, serve various purposes including disaster management, underwater navigation, and environmental monitoring. In these networks it is very challenging to update their location or add new devices, and it is very important to enhance the energy performance and lifetime of the underwater wireless sensor network. Multi-hop communication can expand the range of communication in these networks and increase its connections. The use of clustering-based routing is effective for increasing energy efficiency in these networks, with the difference that, unlike conventional wireless sensor networks, they have limitations such as low bandwidth, extended persistence, underwater pressure, and higher error probability. An energy balance routing protocol with multi-hop data transmission based on search and rescue (EBMH_CSR) is proposed, which balances by adjusting the depth of less energy nodes and replacing them with more energy nodes, and by combining chaotic concepts in the search and rescue optimization algorithm and with Considering residual energy, distance and degree of sensor nodes, fitness function is calculated. Simulation results show that the EBMH_CSR algorithm has improved the packet delivery rate (PDR) in different number of nodes by 23.6 percent, the packet reception rate (NPR) in different number of loads by 26.7 percent, the energy consumption in different number of rounds by 31.2 percent, the end-to-end delay by 31.7 percent, and the network lifetime in different number of nodes by 36 percent compared to the compared algorithms.
