Quantized Network Coding for Sparse Messages

Details Quantized Network Coding for Sparse Messages Quantized Network Coding for Sparse Messages

2012-01-30

arxiv.org/abs/1201.6271v3

Computer Science

Information Theory

Scientific paper

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, calledquantized network coding, which performs linear net-work coding in the 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 l1-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 l1-min decoding. Our numerical analysis show that the proposed quantized network coding scheme with l1-min decoding can achieve significant improvements, in terms of compression ratio and delivery delay, compared to conventional packet forwarding.

Affiliated with

Also associated with

No associations

Rating

Quantized Network Coding for Sparse Messages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantized Network Coding for Sparse Messages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantized Network Coding for Sparse Messages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-360080