Maximal Recovery Network Coding under Topology Constraint
Misra, K.
Karande, S.
Radha, H.
Michigan State Univ. East Lansing, East Lansing;
This paper appears in: INFOCOM 2008. The 27th Conference on Computer Communications. IEEE
Publication Date: 13-18 April 2008
On page(s): 2153-2161
Location: Phoenix, AZ,
ISSN: 0743-166X
ISBN: 978-1-4244-2025-4
INSPEC Accession Number: 9945297
Digital Object Identifier: 10.1109/INFOCOM.2008.282
Current Version Published: 2008-05-02
Abstract
Recent advances have shown that channel codes can be mapped onto networks to realize efficient Network Coding (NC); this has led to the emergence of Code-on-Network-Graphs (CNG). Traditional CNG approaches (e.g Decentralized Erasure Codes) focus on a generating a sequence of encoded symbols from a given input source (of size K), such that the original symbols can be recovered from any subset of the encoded symbols of size equal to or slightly larger than K. However in all cases the number of source symbols recovered falls rapidly if the number of encoded symbols received falls below K. In this paper we determine the CNG code-ensembles (under statistical toplogy constraint) which result in maximal recovery of WSN source data (for different erasure-rates), thereby minimizing the deterioration in data recovery. We also perform fixed point stability analysis on the underlying LDPC code ensemble. We then propose a distributed algorithm for generating a sequence of encoded symbols adhering to the designed code ensemble. Optimal solutions for a sensor network with 1000 nodes is determined using the Differential Evolution algorithm, and the solution sensitivity to variance in number of sensor nodes and node-interconnectivity is evaluated.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
