Name
Abstract | ||
|---|---|---|
Compressive Sensing (CS) has recently opened the door for efficient algorithms to solve various data gathering problems. Among these problems is sparse events detection in wireless sensor networks. In this problem, it is desirable to reduce the sensing cost by minimizing the number of sensors and the amount of data sent by each sensor. In this paper, we model the problem of sparse event detection as a compressive support recovery problem. We exploit the sparse and the binary nature of the event signal in the reconstruction algorithm using sequential compressive sensing. This provides an efficient solution to the problem, even under the assumptions of wide sensing area and high levels of noise. Simulation results show an improved performance under different compression ratios as compared to previous CS based approaches. It also shows the robustness of the proposed approach at low SNRs. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/WCNC.2014.6953130 | Wireless Communications and Networking Conference |
Keywords | Field | DocType |
compressed sensing,signal detection,signal reconstruction,wireless sensor networks,CS,SNR,adaptive low power detection,data gathering problems,reconstruction algorithm,sensing cost reduction,sequential compressive sensing,sparse event detection,wide sensing area,wireless sensor networks | Key distribution in wireless sensor networks,Detection theory,Computer science,Signal-to-noise ratio,Robustness (computer science),Real-time computing,Reconstruction algorithm,Wireless sensor network,Signal reconstruction,Compressed sensing | Conference |
ISSN | Citations | PageRank |
1525-3511 | 4 | 0.40 |
References | Authors | |
9 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ahmed S. Alwakeel | 1 | 4 | 0.40 |
| Mohamed F. Abdelkader | 2 | 4 | 0.40 |
| Karim G. Seddik | 3 | 59 | 10.63 |
| Atef M. Ghuniem | 4 | 4 | 0.40 |