Performance analysis of distributed raptor codes in wireless sensor networks

Yue, J; Lin, Z; Vucetic, B; Mao, G; Aulin, T

Performance analysis of distributed raptor codes in wireless sensor networks

Yue, J Lin, Z Vucetic, B Mao, G

Aulin, T

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Communications, 2013, 61 (10), pp. 4357 - 4368
Issue Date:: 2013-10-01

Closed Access

	Filename	Description	Size
	2013001249OK.pdf		1.11 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Yue, J	en_US
dc.contributor.author	Lin, Z	en_US
dc.contributor.author	Vucetic, B	en_US
dc.contributor.author	Mao, G https://orcid.org/0000-0002-3598-4949	en_US
dc.contributor.author	Aulin, T	en_US
dc.date.issued	2013-10-01	en_US
dc.identifier.citation	IEEE Transactions on Communications, 2013, 61 (10), pp. 4357 - 4368	en_US
dc.identifier.issn	0090-6778	en_US
dc.identifier.uri	http://hdl.handle.net/10453/27914
dc.description.abstract	In this paper, we propose a distributed network coding (DNC) scheme based on the Raptor codes for wireless sensor networks (WSNs), where a group of sensor nodes, acting as source nodes, communicate with a single sink through some other sensor nodes, serving as relay nodes, in a multi-hop fashion. At the sink, a graph-based Raptor code is formed on the fly. After receiving a sufficient number of encoded packets, the sink begins to decode. The main contributions of this paper are the derivation of a bit error rate (BER) lower bound for the LT-based DNC scheme over Rayleigh fading channels under maximum-likelihood (ML) decoding, and the derivations of upper and lower BER bounds for the proposed Raptor-based DNC scheme on the basis of the derived BER bound of LT codes. © 1972-2012 IEEE.	en_US
dc.relation.ispartof	IEEE Transactions on Communications	en_US
dc.relation.isbasedon	10.1109/TCOMM.2013.090513.120913	en_US
dc.title	Performance analysis of distributed raptor codes in wireless sensor networks	en_US
dc.type	Journal Article
utslib.citation.volume	10	en_US
utslib.citation.volume	61	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	0804 Data Format	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
utslib.copyright.status	closed_access
pubs.issue	10	en_US
pubs.publication-status	Published	en_US
pubs.volume	61	en_US

Abstract:

In this paper, we propose a distributed network coding (DNC) scheme based on the Raptor codes for wireless sensor networks (WSNs), where a group of sensor nodes, acting as source nodes, communicate with a single sink through some other sensor nodes, serving as relay nodes, in a multi-hop fashion. At the sink, a graph-based Raptor code is formed on the fly. After receiving a sufficient number of encoded packets, the sink begins to decode. The main contributions of this paper are the derivation of a bit error rate (BER) lower bound for the LT-based DNC scheme over Rayleigh fading channels under maximum-likelihood (ML) decoding, and the derivations of upper and lower BER bounds for the proposed Raptor-based DNC scheme on the basis of the derived BER bound of LT codes. © 1972-2012 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/27914