2018
DOI: 10.3390/s18113749
|View full text |Cite
|
Sign up to set email alerts
|

CS-FCDA: A Compressed Sensing-Based on Fault-Tolerant Data Aggregation in Sensor Networks

Abstract: When the nodes in the network are deployed in the target area with an appropriate density, the effective aggregation and transmission of the data gathered in the monitoring area remain to be solved. The existing Compressed Sensing (CS) based on data aggregation schemes are accomplished in a centralized manner and the Sink node achieves the task of data aggregation. However, these existing schemes may suffer from load imbalance and coverage void issues. In order to address these problems, we propose a Compresse… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
9

Relationship

3
6

Authors

Journals

citations
Cited by 15 publications
(15 citation statements)
references
References 23 publications
0
15
0
Order By: Relevance
“…An isolated area is randomly selected, and the location, where the local density of the monitoring target is relatively large, is deployed to deploy the first sensor node. The greedy method based on the local density of the monitoring target is used for tackling the coverage problem of other locations in this area [48], [49]. Specifically, within the maximum communication range R max of the currently deployed sensor node locations x i , the location x i+1 with the highest local density of the monitoring target is selected as the deployment location of the next sensor node, that is,…”
Section: Implementation Of Im-csr Algorithm a Level Determinatiomentioning
confidence: 99%
“…An isolated area is randomly selected, and the location, where the local density of the monitoring target is relatively large, is deployed to deploy the first sensor node. The greedy method based on the local density of the monitoring target is used for tackling the coverage problem of other locations in this area [48], [49]. Specifically, within the maximum communication range R max of the currently deployed sensor node locations x i , the location x i+1 with the highest local density of the monitoring target is selected as the deployment location of the next sensor node, that is,…”
Section: Implementation Of Im-csr Algorithm a Level Determinatiomentioning
confidence: 99%
“…This algorithm uses clusters for the first time to determine the sensing direction of directional sensor nodes to achieve maximum target coverage. Paper [32] proposed a network coverage enhancement strategy based on an improved genetic algorithm and binary ant colony algorithm. This strategy introduced a genetic operator into the binary ant colony algorithm, and used crossover and mutation to expand the search space and achieve global optimization.…”
Section: A Coverage Problemmentioning
confidence: 99%
“…Lara-Nion et al investigated efficient scalar multiplication for resource-constrained devices in the paper “Energy/Area-Efficient Scalar Multiplication with Binary Edwards Curves for the IoT” [12]. In this work, the proposed energy-reducing techniques can provide efficient area/energy trade-offs.…”
Section: The Papersmentioning
confidence: 99%