Doped fountain coding for minimum delay data collection in circular networks

Silvija Kokalj-Filipović, Predrag Spasojevic, Emina Soljanin

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

This paper studies decentralized, Fountain and network-coding based strategies for facilitating data collection in circular wireless sensor networks, which rely on the stochastic diversity of data storage. The goal is to allow for a reduced delay collection by a data collector who accesses the network at a random position and random time. Data dissemination is performed by a set of relays which form a circular route to exchange source packets. The storage nodes within the transmission range of the route's relays linearly combine and store overheard relay transmissions using random decentralized strategies. An intelligent data collector first collects a minimum set of coded packets from a subset of storage nodes in its proximity, which might be sufficient for recovering the original packets and, by using a message-passing decoder, attempts recovering all original source packets from this set. Whenever the decoder stalls, the source packet which restarts decoding is polled/doped from its original source node. The random-walk-based analysis of the decoding/doping process furnishes the collection delay analysis with a prediction on the number of required doped packets. The number of doped packets can be surprisingly small when employed with an Ideal Soliton code degree distribution and, hence, the doping strategy may have the least collection delay when the density of source nodes is sufficiently large. Furthermore, we demonstrate that network coding makes dissemination more efficient at the expense of a larger collection delay. Not surprisingly, a circular network allows for a significantly more (analytically and otherwise) tractable strategies relative to a network whose model is a random geometric graph.

Original languageEnglish (US)
Article number5072354
Pages (from-to)673-684
Number of pages12
JournalIEEE Journal on Selected Areas in Communications
Volume27
Issue number5
DOIs
StatePublished - Jun 1 2009

Fingerprint

Fountains
Network coding
Decoding
Doping (additives)
Message passing
Solitons
Wireless sensor networks
Data storage equipment

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Keywords

  • Data collection
  • Decentralized Fountain codes
  • Distributed storage
  • Network coding
  • Wireless networks

Cite this

@article{6996cd293ee242259eeed553cb873c82,
title = "Doped fountain coding for minimum delay data collection in circular networks",
abstract = "This paper studies decentralized, Fountain and network-coding based strategies for facilitating data collection in circular wireless sensor networks, which rely on the stochastic diversity of data storage. The goal is to allow for a reduced delay collection by a data collector who accesses the network at a random position and random time. Data dissemination is performed by a set of relays which form a circular route to exchange source packets. The storage nodes within the transmission range of the route's relays linearly combine and store overheard relay transmissions using random decentralized strategies. An intelligent data collector first collects a minimum set of coded packets from a subset of storage nodes in its proximity, which might be sufficient for recovering the original packets and, by using a message-passing decoder, attempts recovering all original source packets from this set. Whenever the decoder stalls, the source packet which restarts decoding is polled/doped from its original source node. The random-walk-based analysis of the decoding/doping process furnishes the collection delay analysis with a prediction on the number of required doped packets. The number of doped packets can be surprisingly small when employed with an Ideal Soliton code degree distribution and, hence, the doping strategy may have the least collection delay when the density of source nodes is sufficiently large. Furthermore, we demonstrate that network coding makes dissemination more efficient at the expense of a larger collection delay. Not surprisingly, a circular network allows for a significantly more (analytically and otherwise) tractable strategies relative to a network whose model is a random geometric graph.",
keywords = "Data collection, Decentralized Fountain codes, Distributed storage, Network coding, Wireless networks",
author = "Silvija Kokalj-Filipović and Predrag Spasojevic and Emina Soljanin",
year = "2009",
month = "6",
day = "1",
doi = "10.1109/JSAC.2009.090609",
language = "English (US)",
volume = "27",
pages = "673--684",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

Doped fountain coding for minimum delay data collection in circular networks. / Kokalj-Filipović, Silvija; Spasojevic, Predrag; Soljanin, Emina.

In: IEEE Journal on Selected Areas in Communications, Vol. 27, No. 5, 5072354, 01.06.2009, p. 673-684.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Doped fountain coding for minimum delay data collection in circular networks

AU - Kokalj-Filipović, Silvija

AU - Spasojevic, Predrag

AU - Soljanin, Emina

PY - 2009/6/1

Y1 - 2009/6/1

N2 - This paper studies decentralized, Fountain and network-coding based strategies for facilitating data collection in circular wireless sensor networks, which rely on the stochastic diversity of data storage. The goal is to allow for a reduced delay collection by a data collector who accesses the network at a random position and random time. Data dissemination is performed by a set of relays which form a circular route to exchange source packets. The storage nodes within the transmission range of the route's relays linearly combine and store overheard relay transmissions using random decentralized strategies. An intelligent data collector first collects a minimum set of coded packets from a subset of storage nodes in its proximity, which might be sufficient for recovering the original packets and, by using a message-passing decoder, attempts recovering all original source packets from this set. Whenever the decoder stalls, the source packet which restarts decoding is polled/doped from its original source node. The random-walk-based analysis of the decoding/doping process furnishes the collection delay analysis with a prediction on the number of required doped packets. The number of doped packets can be surprisingly small when employed with an Ideal Soliton code degree distribution and, hence, the doping strategy may have the least collection delay when the density of source nodes is sufficiently large. Furthermore, we demonstrate that network coding makes dissemination more efficient at the expense of a larger collection delay. Not surprisingly, a circular network allows for a significantly more (analytically and otherwise) tractable strategies relative to a network whose model is a random geometric graph.

AB - This paper studies decentralized, Fountain and network-coding based strategies for facilitating data collection in circular wireless sensor networks, which rely on the stochastic diversity of data storage. The goal is to allow for a reduced delay collection by a data collector who accesses the network at a random position and random time. Data dissemination is performed by a set of relays which form a circular route to exchange source packets. The storage nodes within the transmission range of the route's relays linearly combine and store overheard relay transmissions using random decentralized strategies. An intelligent data collector first collects a minimum set of coded packets from a subset of storage nodes in its proximity, which might be sufficient for recovering the original packets and, by using a message-passing decoder, attempts recovering all original source packets from this set. Whenever the decoder stalls, the source packet which restarts decoding is polled/doped from its original source node. The random-walk-based analysis of the decoding/doping process furnishes the collection delay analysis with a prediction on the number of required doped packets. The number of doped packets can be surprisingly small when employed with an Ideal Soliton code degree distribution and, hence, the doping strategy may have the least collection delay when the density of source nodes is sufficiently large. Furthermore, we demonstrate that network coding makes dissemination more efficient at the expense of a larger collection delay. Not surprisingly, a circular network allows for a significantly more (analytically and otherwise) tractable strategies relative to a network whose model is a random geometric graph.

KW - Data collection

KW - Decentralized Fountain codes

KW - Distributed storage

KW - Network coding

KW - Wireless networks

UR - http://www.scopus.com/inward/record.url?scp=67650587788&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67650587788&partnerID=8YFLogxK

U2 - 10.1109/JSAC.2009.090609

DO - 10.1109/JSAC.2009.090609

M3 - Article

VL - 27

SP - 673

EP - 684

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 5

M1 - 5072354

ER -