2018
DOI: 10.1155/2018/5131949
|View full text |Cite
|
Sign up to set email alerts
|

CS‐PLM: Compressive Sensing Data Gathering Algorithm Based on Packet Loss Matching in Sensor Networks

Abstract: The data transmission process in Wireless Sensor Networks (WSNs) often experiences errors and packet losses due to the environmental interference. In order to address this problem, we propose a Compressive Sensing data gathering algorithm based on Packet Loss Matching (CS-PLM). It is proven that, under tree routing, the packet loss on communication links would severely undermine the data reconstruction accuracy in Compressive Sensing (CS) based data gathering process. It is further pointed out that the packet … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
8
1

Relationship

3
6

Authors

Journals

citations
Cited by 16 publications
(10 citation statements)
references
References 21 publications
0
10
0
Order By: Relevance
“…In Formulation (10), N A (dγ ) is the quantity of range nodes whose its own area is dAγ from the convergence node. P{N A (dγ ) = 1} is expressed as the probability of having a node.…”
Section: Reliability Data Reconsruction a Data Retransmission Mementioning
confidence: 99%
“…In Formulation (10), N A (dγ ) is the quantity of range nodes whose its own area is dAγ from the convergence node. P{N A (dγ ) = 1} is expressed as the probability of having a node.…”
Section: Reliability Data Reconsruction a Data Retransmission Mementioning
confidence: 99%
“…In order to tackle the issue of errors and packet losses during data transmission in WSNs, Sun et al proposed a data gathering algorithm based on Packet Loss Matching to do just that [44]. Based on simulation result, it reveals that the algorithm can help in alleviating packet losses during data gathering.…”
Section: A Data Collection In Wireless Sensor Network (Wsns)mentioning
confidence: 99%
“…Then three different schemes were used to choose the parent nodes and further construct the data aggregation tree. For the wireless sensor network with different initial node energy, paper [26] investigated on the problem of finding a data aggregation tree among the minimum-distance trees to maximize the network lifetime. This problem was equivalent to finding a minimum distance tree with a minimum load and it was solved by the transformation into the generalized semi-matching subproblem.…”
Section: Related Workmentioning
confidence: 99%