Enhanced meta-heuristic optimization of resource efficiency in multi-relay underground wireless sensor networks.

PeerJ Comput Sci

Department of Computer Science, College of Computer Engineering and Sciences, Prince Sattam Bin Abdulaziz University, Al-kharj, Saudi Arabia.

Published: April 2023

Achieving a balanced energy and spectral resource utilization is an interesting key design to extend the lifetime of underground wireless sensor networks (UWSNs) where sensor nodes are equipped with small limited energy batteries and communicate through a challenging soil environment. In this article, we apply an improved meta-heuristic algorithm, based on the Salp Swarm Algorithm (SSA), for multi-relay UWSNs where cooperative relay nodes amplify and forward sensed data, received from the buried source nodes, to the aboveground base station. Hence, the optimal nodes transmission powers, maximizing the network resource efficiency, are obtained and used to select beneficial relay nodes. The algorithm enhances the standard SSA by considering the chaotic map for salps population initialization and the uniform crossover technique for salps positions updates. Simulation results show that the proposed algorithm significantly outperforms the SSA in resource efficiency optimization and network lifetime extension. The obtained gain increases when the number of cooperative relay nodes increases. Furthermore, simulations prove the efficiency of the proposed algorithm against other meta-heuristic algorithms.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC10280650PMC
http://dx.doi.org/10.7717/peerj-cs.1357DOI Listing

Publication Analysis

Top Keywords

resource efficiency
12
relay nodes
12
underground wireless
8
wireless sensor
8
sensor networks
8
cooperative relay
8
proposed algorithm
8
nodes
6
algorithm
5
enhanced meta-heuristic
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!