8,271 research outputs found
Practical Network Coding in Sensor Networks: Quo Vadis?
Abstract. Network coding is a novel concept for improving network ca-pacity. This additional capacity may be used to increase throughput or reliability. Also in wireless networks, network coding has been proposed as a method for improving communication. We present our experience from two studies of applying network coding in realistic wireless sen-sor networks scenarios. As we show, network coding is not as useful in practical deployments as earlier theoretical work suggested. We discuss limitations and future opportunities for network coding in sensor net-works. 1 Network Coding in Wireless Sensor Networks Network Coding was introduced by Ahlswede et al. [1], proving that it can in-crease multicast capacity. Since then, it has been investigated in several different networked scenarios which demand different traffic characteristics. Most previous research has focused on theoretical aspects of applying network coding to sensor networks. There are, however, also more practical examples of applying networ
Doped Fountain Coding for Minimum Delay Data Collection in Circular Networks
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
Cooperative Coded Data Dissemination for Wireless Sensor Networks
In this poster paper we present a data dissemination transmission abstraction
for over the air programming (OAP) protocol which is fundamentally different
from the previous hop by hop transmission protocols. Instead of imposing the
greedy requirement that at least one node in the ith hop receives all packets
before transmitting packets to the next hop and its neighbours, we take
advantage of the spatial diversity and broadcast nature of wireless
transmission to adopt a cooperative approach in which node broadcast whatever
packets it has received with the expectation that it will recover the lost
packets with high probability by overhearing the broadcast transmissions of its
neighbours. The use of coded transmissions ensures that this does not lead to
the broadcast storm problem. We validate the improved performance our of
proposed transmission scheme with respect to the previous state of the art OAP
protocols on a proof-of-concept two-hops TelosB wireless sensor network
testbed.Comment: This paper appears in: 2016 13th Annual IEEE International Conference
on Sensing, Communication, and Networking (SECON), London, 2016, pp. 1-
Evaluation of network coding techniques for a sniper detection application
This paper experimentally studies the reliability and delay of flooding based multicast protocols for a sniper detection application. In particular using an emulator it studies under which conditions protocols based on network coding deliver performance improvements compared to classic flooding. It then presents an implementation of such protocols on mobile phones
Data Dissemination in Wireless Networks with Network Coding
We investigate the use of network coding for information dissemination over a
wireless network. Using network coding allows for a simple, distributed and
robust algorithm where nodes do not need any information from their neighbors.
In this paper, we analyze the time needed to diffuse information throughout a
network when network coding is implemented at all nodes. We then provide an
upper bound for the dissemination time for ad-hoc networks with general
topology. Moreover, we derive a relation between dissemination time and the
size of the wireless network. It is shown that for a wireless network with N
nodes, the dissemination latency is between O(N) and O(N^2), depending on the
reception probabilities of the nodes. These observations are validated by the
simulation results
- …