Compressive oversampling for robust data transmission in sensor networks

Zainul Charbiwala, Supriyo Chakraborty, Sadaf Zahedi, Younghun Kim, Mani B. Srivastava, Ting He, Chatschik Bisdikian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

52 Citations (Scopus)

Abstract

Data loss in wireless sensing applications is inevitable and while there have been many attempts at coping with this issue, recent developments in the area of Compressive Sensing (CS) provide a new and attractive perspective. Since many physical signals of interest are known to be sparse or compressible, employing CS, not only compresses the data and reduces effective transmission rate, but also improves the robustness of the system to channel erasures. This is possible because reconstruction algorithms for compressively sampled signals are not hampered by the stochastic nature of wireless link disturbances, which has traditionally plagued attempts at proactively handling the effects of these errors. In this paper, we propose that if CS is employed for source compression, then CS can further be exploited as an application layer erasure coding strategy for recovering missing data. We show that CS erasure encoding (CSEC) with random sampling is efficient for handling missing data in erasure channels, paralleling the performance of BCH codes, with the added benefit of graceful degradation of the reconstruction error even when the amount of missing data far exceeds the designed redundancy. Further, since CSEC is equivalent to nominal oversampling in the incoherent measurement basis, it is computationally cheaper than conventional erasure coding. We support our proposal through extensive performance studies.

Original languageEnglish (US)
Title of host publication2010 Proceedings IEEE INFOCOM
DOIs
StatePublished - Jun 15 2010
EventIEEE INFOCOM 2010 - San Diego, CA, United States
Duration: Mar 14 2010Mar 19 2010

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

OtherIEEE INFOCOM 2010
CountryUnited States
CitySan Diego, CA
Period3/14/103/19/10

Fingerprint

Data communication systems
Sensor networks
Data handling
Telecommunication links
Redundancy
Sampling
Degradation

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Charbiwala, Z., Chakraborty, S., Zahedi, S., Kim, Y., Srivastava, M. B., He, T., & Bisdikian, C. (2010). Compressive oversampling for robust data transmission in sensor networks. In 2010 Proceedings IEEE INFOCOM [5461926] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2010.5461926
Charbiwala, Zainul ; Chakraborty, Supriyo ; Zahedi, Sadaf ; Kim, Younghun ; Srivastava, Mani B. ; He, Ting ; Bisdikian, Chatschik. / Compressive oversampling for robust data transmission in sensor networks. 2010 Proceedings IEEE INFOCOM. 2010. (Proceedings - IEEE INFOCOM).
@inproceedings{d2194e6807634473bc7c6bcf06057e73,
title = "Compressive oversampling for robust data transmission in sensor networks",
abstract = "Data loss in wireless sensing applications is inevitable and while there have been many attempts at coping with this issue, recent developments in the area of Compressive Sensing (CS) provide a new and attractive perspective. Since many physical signals of interest are known to be sparse or compressible, employing CS, not only compresses the data and reduces effective transmission rate, but also improves the robustness of the system to channel erasures. This is possible because reconstruction algorithms for compressively sampled signals are not hampered by the stochastic nature of wireless link disturbances, which has traditionally plagued attempts at proactively handling the effects of these errors. In this paper, we propose that if CS is employed for source compression, then CS can further be exploited as an application layer erasure coding strategy for recovering missing data. We show that CS erasure encoding (CSEC) with random sampling is efficient for handling missing data in erasure channels, paralleling the performance of BCH codes, with the added benefit of graceful degradation of the reconstruction error even when the amount of missing data far exceeds the designed redundancy. Further, since CSEC is equivalent to nominal oversampling in the incoherent measurement basis, it is computationally cheaper than conventional erasure coding. We support our proposal through extensive performance studies.",
author = "Zainul Charbiwala and Supriyo Chakraborty and Sadaf Zahedi and Younghun Kim and Srivastava, {Mani B.} and Ting He and Chatschik Bisdikian",
year = "2010",
month = "6",
day = "15",
doi = "10.1109/INFCOM.2010.5461926",
language = "English (US)",
isbn = "9781424458363",
series = "Proceedings - IEEE INFOCOM",
booktitle = "2010 Proceedings IEEE INFOCOM",

}

Charbiwala, Z, Chakraborty, S, Zahedi, S, Kim, Y, Srivastava, MB, He, T & Bisdikian, C 2010, Compressive oversampling for robust data transmission in sensor networks. in 2010 Proceedings IEEE INFOCOM., 5461926, Proceedings - IEEE INFOCOM, IEEE INFOCOM 2010, San Diego, CA, United States, 3/14/10. https://doi.org/10.1109/INFCOM.2010.5461926

Compressive oversampling for robust data transmission in sensor networks. / Charbiwala, Zainul; Chakraborty, Supriyo; Zahedi, Sadaf; Kim, Younghun; Srivastava, Mani B.; He, Ting; Bisdikian, Chatschik.

2010 Proceedings IEEE INFOCOM. 2010. 5461926 (Proceedings - IEEE INFOCOM).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Compressive oversampling for robust data transmission in sensor networks

AU - Charbiwala, Zainul

AU - Chakraborty, Supriyo

AU - Zahedi, Sadaf

AU - Kim, Younghun

AU - Srivastava, Mani B.

AU - He, Ting

AU - Bisdikian, Chatschik

PY - 2010/6/15

Y1 - 2010/6/15

N2 - Data loss in wireless sensing applications is inevitable and while there have been many attempts at coping with this issue, recent developments in the area of Compressive Sensing (CS) provide a new and attractive perspective. Since many physical signals of interest are known to be sparse or compressible, employing CS, not only compresses the data and reduces effective transmission rate, but also improves the robustness of the system to channel erasures. This is possible because reconstruction algorithms for compressively sampled signals are not hampered by the stochastic nature of wireless link disturbances, which has traditionally plagued attempts at proactively handling the effects of these errors. In this paper, we propose that if CS is employed for source compression, then CS can further be exploited as an application layer erasure coding strategy for recovering missing data. We show that CS erasure encoding (CSEC) with random sampling is efficient for handling missing data in erasure channels, paralleling the performance of BCH codes, with the added benefit of graceful degradation of the reconstruction error even when the amount of missing data far exceeds the designed redundancy. Further, since CSEC is equivalent to nominal oversampling in the incoherent measurement basis, it is computationally cheaper than conventional erasure coding. We support our proposal through extensive performance studies.

AB - Data loss in wireless sensing applications is inevitable and while there have been many attempts at coping with this issue, recent developments in the area of Compressive Sensing (CS) provide a new and attractive perspective. Since many physical signals of interest are known to be sparse or compressible, employing CS, not only compresses the data and reduces effective transmission rate, but also improves the robustness of the system to channel erasures. This is possible because reconstruction algorithms for compressively sampled signals are not hampered by the stochastic nature of wireless link disturbances, which has traditionally plagued attempts at proactively handling the effects of these errors. In this paper, we propose that if CS is employed for source compression, then CS can further be exploited as an application layer erasure coding strategy for recovering missing data. We show that CS erasure encoding (CSEC) with random sampling is efficient for handling missing data in erasure channels, paralleling the performance of BCH codes, with the added benefit of graceful degradation of the reconstruction error even when the amount of missing data far exceeds the designed redundancy. Further, since CSEC is equivalent to nominal oversampling in the incoherent measurement basis, it is computationally cheaper than conventional erasure coding. We support our proposal through extensive performance studies.

UR - http://www.scopus.com/inward/record.url?scp=77953296196&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77953296196&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2010.5461926

DO - 10.1109/INFCOM.2010.5461926

M3 - Conference contribution

AN - SCOPUS:77953296196

SN - 9781424458363

T3 - Proceedings - IEEE INFOCOM

BT - 2010 Proceedings IEEE INFOCOM

ER -

Charbiwala Z, Chakraborty S, Zahedi S, Kim Y, Srivastava MB, He T et al. Compressive oversampling for robust data transmission in sensor networks. In 2010 Proceedings IEEE INFOCOM. 2010. 5461926. (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2010.5461926