2016
DOI: 10.21307/ijssis-2017-897
|View full text |Cite
|
Sign up to set email alerts
|

A Comprehensive Review On The Impact Of Compressed Sensing In Wireless Sensor Networks

Abstract: Sensor networking is a promising technology that facilitates the monitoring of the physical world using tiny, inexpensive wireless devices that are spatially distributed across a wide region. These networks are highly constrained in power, computational capacities and memory. Incorporation of techniques based on the concept of Compressed Sensing (CS) which aims to encode sparse signals using a much lower sampling rate than the traditional Nyquist approach has revolutionized the wireless network scenarios. An e… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 93 publications
0
3
0
Order By: Relevance
“…Kumar et al (8) show the suitability of CS for such a recovery. Data recovery from signals is more precise with CS theory as the degree of sparsity increases.…”
Section: Literature Surveymentioning
confidence: 99%
“…Kumar et al (8) show the suitability of CS for such a recovery. Data recovery from signals is more precise with CS theory as the degree of sparsity increases.…”
Section: Literature Surveymentioning
confidence: 99%
“…One popular postulate of such low-dimensional structures is sparsity, which is, a signal can be simply represented with a few non-zero coefficients in an invertible proper sparsifying domain [7]. CS has been introduced as a good fit for such application in both the acquisition and reconstruction of the signal [8]. With a number of measurements proportional to the sparsity level, CS enables the reliable reconstruction of the signal.…”
Section: Related Workmentioning
confidence: 99%
“…In (8), if pct Nrep % × cl j is not an integer, we round N rep j to the nearest integer greater than or equal to the value of that element. Here, the selection of the sets N rep j of clusters' representative nodes is independent from one cluster to another.…”
Section: Sampling Patternmentioning
confidence: 99%