Loading…
A multi-hop routing algorithm for WSNs based on compressive sensing and multiple objective genetic algorithm
Energy-efficiency and reliability are vital metrics of therobustness of Wireless Sensor Networks (WSNs). Various data re duction techniques are used to improve them, among them com pressive sensing (CS) is a data reduction technique used to recoverextensive data from fewer samples in case of sparse...
Saved in:
Published in: | Journal of communications and networks 2021, 23(2), , pp.138-147 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Energy-efficiency and reliability are vital metrics of therobustness of Wireless Sensor Networks (WSNs). Various data re duction techniques are used to improve them, among them com pressive sensing (CS) is a data reduction technique used to recoverextensive data from fewer samples in case of sparse representationof sensor-readings. Unfortunately, energy-efficiency and accuracyare contradictory metrics, as increased accuracy requires a largenumber of measurements, and data transmissions. Therefore,, inthis paper, a CS-based algorithm is proposed for efficient datatransfer through WSNs, which uses multiple objective genetic algo rithms (MOGA) to optimize the number of measurements, trans mission range, and the sensing matrix. The algorithm aims at strik ing the right balance between energy-efficiency and accuracy. Itconstructs a path in a multi hop manner based on the optimizedvalues. Numerical simulations and experiments show that Pareto front, which is the output of MOGA, helps the user to select theright combination of the number of measurements and the trans mission range fitting the application at hand, and to strike a goodbalance between energy efficiency and accuracy. The results alsodemonstrate the existence of measurement matrices which lowermutual coherency improve the accuracy of CS. KCI Citation Count: 5 |
---|---|
ISSN: | 1229-2370 1976-5541 |
DOI: | 10.23919/JCN.2021.000003 |