When compressive sampling meets multicast: Outage analysis and subblock network coding

P. S. Chandrashekhar Thejaswi, Tuan Tran, Junshan Zhang

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

6 Citations (Scopus)

Abstract

This paper studies multicasting compressively sampled signals from a source to many receivers, over lossy wireless channels. Our focus is on the network outage from the perspective of signal distortion across all receivers, for both cases where the transmitter may or may not be capable of reconstructing the compressively sampled signals. Capitalizing on extreme value theory, we characterize the network outage in terms of key system parameters, including the erasure probability, the number of receivers and the sparse structure of the signal. We show that when the transmitter can reconstruct the compressively sensed signal, the strategy of using network coding to multicast the reconstructed signal coefficients can reduce the network outage significantly. We observe, however, that the traditional network coding could result in suboptimal performance with power-law decay signals. Thus motivated, we devise a new method, namely subblock network coding, which involves fragmenting the data into subblocks, and allocating time slots to different subblocks, based on its priority. We formulate the corresponding optimal allocation as an integer programming problem. Since integer programming is often intractable, we develop a heuristic algorithm that prioritizes the time slot allocation by exploiting the inherent priority structure of power-law decay signals. Numerical results show that the proposed schemes outperform the traditional methods with significant margins.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages3047-3055
Number of pages9
DOIs
StatePublished - 2011
EventIEEE INFOCOM 2011 - Shanghai, China
Duration: Apr 10 2011Apr 15 2011

Other

OtherIEEE INFOCOM 2011
CountryChina
CityShanghai
Period4/10/114/15/11

Fingerprint

Network coding
Outages
Integer programming
Sampling
Transmitters
Signal distortion
Multicasting
Heuristic algorithms

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Chandrashekhar Thejaswi, P. S., Tran, T., & Zhang, J. (2011). When compressive sampling meets multicast: Outage analysis and subblock network coding. In Proceedings - IEEE INFOCOM (pp. 3047-3055). [5935148] https://doi.org/10.1109/INFCOM.2011.5935148

When compressive sampling meets multicast : Outage analysis and subblock network coding. / Chandrashekhar Thejaswi, P. S.; Tran, Tuan; Zhang, Junshan.

Proceedings - IEEE INFOCOM. 2011. p. 3047-3055 5935148.

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

Chandrashekhar Thejaswi, PS, Tran, T & Zhang, J 2011, When compressive sampling meets multicast: Outage analysis and subblock network coding. in Proceedings - IEEE INFOCOM., 5935148, pp. 3047-3055, IEEE INFOCOM 2011, Shanghai, China, 4/10/11. https://doi.org/10.1109/INFCOM.2011.5935148
Chandrashekhar Thejaswi PS, Tran T, Zhang J. When compressive sampling meets multicast: Outage analysis and subblock network coding. In Proceedings - IEEE INFOCOM. 2011. p. 3047-3055. 5935148 https://doi.org/10.1109/INFCOM.2011.5935148
Chandrashekhar Thejaswi, P. S. ; Tran, Tuan ; Zhang, Junshan. / When compressive sampling meets multicast : Outage analysis and subblock network coding. Proceedings - IEEE INFOCOM. 2011. pp. 3047-3055
@inproceedings{e0f27fccaa6743c38c13feaefa7ae7e8,
title = "When compressive sampling meets multicast: Outage analysis and subblock network coding",
abstract = "This paper studies multicasting compressively sampled signals from a source to many receivers, over lossy wireless channels. Our focus is on the network outage from the perspective of signal distortion across all receivers, for both cases where the transmitter may or may not be capable of reconstructing the compressively sampled signals. Capitalizing on extreme value theory, we characterize the network outage in terms of key system parameters, including the erasure probability, the number of receivers and the sparse structure of the signal. We show that when the transmitter can reconstruct the compressively sensed signal, the strategy of using network coding to multicast the reconstructed signal coefficients can reduce the network outage significantly. We observe, however, that the traditional network coding could result in suboptimal performance with power-law decay signals. Thus motivated, we devise a new method, namely subblock network coding, which involves fragmenting the data into subblocks, and allocating time slots to different subblocks, based on its priority. We formulate the corresponding optimal allocation as an integer programming problem. Since integer programming is often intractable, we develop a heuristic algorithm that prioritizes the time slot allocation by exploiting the inherent priority structure of power-law decay signals. Numerical results show that the proposed schemes outperform the traditional methods with significant margins.",
author = "{Chandrashekhar Thejaswi}, {P. S.} and Tuan Tran and Junshan Zhang",
year = "2011",
doi = "10.1109/INFCOM.2011.5935148",
language = "English (US)",
isbn = "9781424499212",
pages = "3047--3055",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - When compressive sampling meets multicast

T2 - Outage analysis and subblock network coding

AU - Chandrashekhar Thejaswi, P. S.

AU - Tran, Tuan

AU - Zhang, Junshan

PY - 2011

Y1 - 2011

N2 - This paper studies multicasting compressively sampled signals from a source to many receivers, over lossy wireless channels. Our focus is on the network outage from the perspective of signal distortion across all receivers, for both cases where the transmitter may or may not be capable of reconstructing the compressively sampled signals. Capitalizing on extreme value theory, we characterize the network outage in terms of key system parameters, including the erasure probability, the number of receivers and the sparse structure of the signal. We show that when the transmitter can reconstruct the compressively sensed signal, the strategy of using network coding to multicast the reconstructed signal coefficients can reduce the network outage significantly. We observe, however, that the traditional network coding could result in suboptimal performance with power-law decay signals. Thus motivated, we devise a new method, namely subblock network coding, which involves fragmenting the data into subblocks, and allocating time slots to different subblocks, based on its priority. We formulate the corresponding optimal allocation as an integer programming problem. Since integer programming is often intractable, we develop a heuristic algorithm that prioritizes the time slot allocation by exploiting the inherent priority structure of power-law decay signals. Numerical results show that the proposed schemes outperform the traditional methods with significant margins.

AB - This paper studies multicasting compressively sampled signals from a source to many receivers, over lossy wireless channels. Our focus is on the network outage from the perspective of signal distortion across all receivers, for both cases where the transmitter may or may not be capable of reconstructing the compressively sampled signals. Capitalizing on extreme value theory, we characterize the network outage in terms of key system parameters, including the erasure probability, the number of receivers and the sparse structure of the signal. We show that when the transmitter can reconstruct the compressively sensed signal, the strategy of using network coding to multicast the reconstructed signal coefficients can reduce the network outage significantly. We observe, however, that the traditional network coding could result in suboptimal performance with power-law decay signals. Thus motivated, we devise a new method, namely subblock network coding, which involves fragmenting the data into subblocks, and allocating time slots to different subblocks, based on its priority. We formulate the corresponding optimal allocation as an integer programming problem. Since integer programming is often intractable, we develop a heuristic algorithm that prioritizes the time slot allocation by exploiting the inherent priority structure of power-law decay signals. Numerical results show that the proposed schemes outperform the traditional methods with significant margins.

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

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

U2 - 10.1109/INFCOM.2011.5935148

DO - 10.1109/INFCOM.2011.5935148

M3 - Conference contribution

AN - SCOPUS:79960881824

SN - 9781424499212

SP - 3047

EP - 3055

BT - Proceedings - IEEE INFOCOM

ER -