A multi-hop routing algorithm for WSNs based on compressive sensing and multiple objective genetic algorithm

57Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Energy-efficiency and reliability are vital metrics of the robustness of Wireless Sensor Networks (WSNs). Various data reduction techniques are used to improve them, among them compressive sensing (CS) is a data reduction technique used to recover extensive data from fewer samples in case of sparse representation of sensor-readings. Unfortunately, energy-efficiency and accuracy are contradictory metrics, as increased accuracy requires a large number of measurements, and data transmissions. Therefore, in this paper, a CS-based algorithm is proposed for efficient data transfer through WSNs, which uses multiple objective genetic algorithms (MOGA) to optimize the number of measurements, transmission range, and the sensing matrix. The algorithm aims at striking the right balance between energy-efficiency and accuracy. It constructs a path in a multi hop manner based on the optimized values. Numerical simulations and experiments show that Pareto-front, which is the output of MOGA, helps the user to select the right combination of the number of measurements and the transmission range fitting the application at hand, and to strike a good balance between energy efficiency and accuracy. The results also demonstrate the existence of measurement matrices which lower mutual coherency improve the accuracy of CS.

Cite

CITATION STYLE

APA

Mazaideh, M. A., & Levendovszky, J. (2021). A multi-hop routing algorithm for WSNs based on compressive sensing and multiple objective genetic algorithm. Journal of Communications and Networks, 23(2), 138–147. https://doi.org/10.23919/JCN.2021.000003

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free