Title :
Quantized network coding for sparse messages
Author :
Nabaee, Mahdy ; Labeau, Fabrice
Author_Institution :
Electr. & Comput. Eng. Dept., McGill Univ., Montreal, QC, Canada
Abstract :
In this paper, we study the data gathering problem in the context of power grids by using a network of sensors, where the sensed data have inter-node redundancy. Specifically, we propose a new transmission method, called quantized network coding, which performs linear network coding in the infinite field of real numbers, and quantization to accommodate the finite capacity of edges. By using the concepts in compressed sensing literature, we propose to use ℓ1-minimization to decode the quantized network coded packets, especially when the number of received packets at the decoder is less than the size of sensed data (i.e. number of nodes). We also propose an appropriate design for network coding coefficients, based on restricted isometry property, which results in robust ℓ1-min decoding. Our numerical analysis show that the proposed quantized network coding scheme with ℓ1-min decoding can achieve significant improvements, in terms of compression ratio and delivery delay, compared to conventional packet forwarding.
Keywords :
compressed sensing; decoding; linear codes; network coding; quantisation (signal); ℓ1-min decoding; ℓ1-minimization; compressed sensing; compression ratio; data gathering problem; delivery delay; internode redundancy; linear network coding; packet forwarding; power; quantized network coded packets; quantized network coding; restricted isometry property; sparse messages; Abstracts; Conferences; Encoding; Signal processing; ℓ1-min decoding; Compressed sensing; linear network coding; restricted isometry property;
Conference_Titel :
Statistical Signal Processing Workshop (SSP), 2012 IEEE
Conference_Location :
Ann Arbor, MI
Print_ISBN :
978-1-4673-0182-4
Electronic_ISBN :
pending
DOI :
10.1109/SSP.2012.6319834