TY - GEN
T1 - Improved approximate decoding based on position information matrix
AU - Kwon, Minhae
AU - Park, Hyunggon
AU - Frossard, Pascal
PY - 2012
Y1 - 2012
N2 - This paper proposes a robust decoding algorithm in delivery of network coded data which is in particular correlated and delay-sensitive. We consider ad-hoc sensor network topologies, where a correlated data is delivered based on network coding techniques in conjunction with approximate decoding algorithm in order for efficient and robust data delivery. The approximate decoding algorithm has been developed as a decoding solution to ill-posed problems for network coded correlated data sources. In this paper, we improve the performance of approximate decoding algorithm by explicitly considering more information, which is used to additionally refine the recovered data. The information includes potential results that are from finite field operations and the set of such information is referred to as position information matrix in this paper. We deploy the position information matrix into approximate decoding algorithm and investigate its corresponding properties. We then analytically show that this improves the performance of approximate decoding algorithm. Our simulation results confirm the properties of the proposed approximate decoding algorithm with position information matrix and improved performance.
AB - This paper proposes a robust decoding algorithm in delivery of network coded data which is in particular correlated and delay-sensitive. We consider ad-hoc sensor network topologies, where a correlated data is delivered based on network coding techniques in conjunction with approximate decoding algorithm in order for efficient and robust data delivery. The approximate decoding algorithm has been developed as a decoding solution to ill-posed problems for network coded correlated data sources. In this paper, we improve the performance of approximate decoding algorithm by explicitly considering more information, which is used to additionally refine the recovered data. The information includes potential results that are from finite field operations and the set of such information is referred to as position information matrix in this paper. We deploy the position information matrix into approximate decoding algorithm and investigate its corresponding properties. We then analytically show that this improves the performance of approximate decoding algorithm. Our simulation results confirm the properties of the proposed approximate decoding algorithm with position information matrix and improved performance.
KW - ad hoc sensor networks
KW - approximate decoding
KW - correlated source data
KW - distributed delivery
KW - Network coding
KW - position information matrix (PIM)
UR - http://www.scopus.com/inward/record.url?scp=84866612684&partnerID=8YFLogxK
U2 - 10.1109/ISCC.2012.6249277
DO - 10.1109/ISCC.2012.6249277
M3 - Conference contribution
AN - SCOPUS:84866612684
SN - 9781467327121
T3 - Proceedings - IEEE Symposium on Computers and Communications
SP - 114
EP - 118
BT - 2012 IEEE Symposium on Computers and Communications, ISCC 2012
T2 - 17th IEEE Symposium on Computers and Communication, ISCC 2012
Y2 - 1 July 2012 through 4 July 2012
ER -