Packet-centric approach to distributed sparse-graph coding in wireless ad-hoc networks

Cedomir Stefanovic, Dejan Vukobratovic, Vladimir Stankovic, Romano Fantacci

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

In this paper we present a packet-centric approach for distributed coding in decentralized wireless ad hoc networks, for applications in distributed data storage, data persistence and efficient data gathering. We study the setting where each of N network nodes generates an information packet and the goal is to efficiently encode information packets and disseminate produced encoded packets across the network in such fashion that gathering of any subset of slightly more than N encoded packets allows for retrieval of the original information. The process of distributed encoding is performed using packets that randomly walk over the network and sample information packets from network nodes, producing the encoded packets in a simple, elegant, fully decentralized and stateless way. The proposed scheme maintains properties of centralized codes in terms of performance parameters, offering at the same time advantage of robustness to node failures and changes in network topology. We specialize the proposed scheme for several important classes of low-complexity encodable/decodable sparse-graph codes – LDGM, LDPC (IRA), LT, and Raptor codes, evaluating its performance via simulation for various data-gathering scenarios.
LanguageEnglish
Pages167-181
Number of pages15
JournalAd Hoc Networks
Volume11
Issue number1
Early online date18 May 2012
DOIs
Publication statusPublished - 1 Jan 2013

Fingerprint

Wireless ad hoc networks
Topology
Data storage equipment

Keywords

  • distributed encoding
  • sparse-graph codes
  • wireless ad hoc networks

Cite this

Stefanovic, Cedomir ; Vukobratovic, Dejan ; Stankovic, Vladimir ; Fantacci, Romano. / Packet-centric approach to distributed sparse-graph coding in wireless ad-hoc networks. In: Ad Hoc Networks. 2013 ; Vol. 11, No. 1. pp. 167-181.
@article{e7c29c89091a45d6bdc959d5a4029ecf,
title = "Packet-centric approach to distributed sparse-graph coding in wireless ad-hoc networks",
abstract = "In this paper we present a packet-centric approach for distributed coding in decentralized wireless ad hoc networks, for applications in distributed data storage, data persistence and efficient data gathering. We study the setting where each of N network nodes generates an information packet and the goal is to efficiently encode information packets and disseminate produced encoded packets across the network in such fashion that gathering of any subset of slightly more than N encoded packets allows for retrieval of the original information. The process of distributed encoding is performed using packets that randomly walk over the network and sample information packets from network nodes, producing the encoded packets in a simple, elegant, fully decentralized and stateless way. The proposed scheme maintains properties of centralized codes in terms of performance parameters, offering at the same time advantage of robustness to node failures and changes in network topology. We specialize the proposed scheme for several important classes of low-complexity encodable/decodable sparse-graph codes – LDGM, LDPC (IRA), LT, and Raptor codes, evaluating its performance via simulation for various data-gathering scenarios.",
keywords = "distributed encoding, sparse-graph codes, wireless ad hoc networks",
author = "Cedomir Stefanovic and Dejan Vukobratovic and Vladimir Stankovic and Romano Fantacci",
year = "2013",
month = "1",
day = "1",
doi = "10.1016/j.adhoc.2012.04.014",
language = "English",
volume = "11",
pages = "167--181",
journal = "Ad Hoc Networks",
issn = "1570-8705",
number = "1",

}

Packet-centric approach to distributed sparse-graph coding in wireless ad-hoc networks. / Stefanovic, Cedomir; Vukobratovic, Dejan; Stankovic, Vladimir; Fantacci, Romano.

In: Ad Hoc Networks, Vol. 11, No. 1, 01.01.2013, p. 167-181.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Packet-centric approach to distributed sparse-graph coding in wireless ad-hoc networks

AU - Stefanovic, Cedomir

AU - Vukobratovic, Dejan

AU - Stankovic, Vladimir

AU - Fantacci, Romano

PY - 2013/1/1

Y1 - 2013/1/1

N2 - In this paper we present a packet-centric approach for distributed coding in decentralized wireless ad hoc networks, for applications in distributed data storage, data persistence and efficient data gathering. We study the setting where each of N network nodes generates an information packet and the goal is to efficiently encode information packets and disseminate produced encoded packets across the network in such fashion that gathering of any subset of slightly more than N encoded packets allows for retrieval of the original information. The process of distributed encoding is performed using packets that randomly walk over the network and sample information packets from network nodes, producing the encoded packets in a simple, elegant, fully decentralized and stateless way. The proposed scheme maintains properties of centralized codes in terms of performance parameters, offering at the same time advantage of robustness to node failures and changes in network topology. We specialize the proposed scheme for several important classes of low-complexity encodable/decodable sparse-graph codes – LDGM, LDPC (IRA), LT, and Raptor codes, evaluating its performance via simulation for various data-gathering scenarios.

AB - In this paper we present a packet-centric approach for distributed coding in decentralized wireless ad hoc networks, for applications in distributed data storage, data persistence and efficient data gathering. We study the setting where each of N network nodes generates an information packet and the goal is to efficiently encode information packets and disseminate produced encoded packets across the network in such fashion that gathering of any subset of slightly more than N encoded packets allows for retrieval of the original information. The process of distributed encoding is performed using packets that randomly walk over the network and sample information packets from network nodes, producing the encoded packets in a simple, elegant, fully decentralized and stateless way. The proposed scheme maintains properties of centralized codes in terms of performance parameters, offering at the same time advantage of robustness to node failures and changes in network topology. We specialize the proposed scheme for several important classes of low-complexity encodable/decodable sparse-graph codes – LDGM, LDPC (IRA), LT, and Raptor codes, evaluating its performance via simulation for various data-gathering scenarios.

KW - distributed encoding

KW - sparse-graph codes

KW - wireless ad hoc networks

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

U2 - 10.1016/j.adhoc.2012.04.014

DO - 10.1016/j.adhoc.2012.04.014

M3 - Article

VL - 11

SP - 167

EP - 181

JO - Ad Hoc Networks

T2 - Ad Hoc Networks

JF - Ad Hoc Networks

SN - 1570-8705

IS - 1

ER -