265 research outputs found
Selection of network coding nodes for minimal playback delay in streaming overlays
Network coding permits to deploy distributed packet delivery algorithms that
locally adapt to the network availability in media streaming applications.
However, it may also increase delay and computational complexity if it is not
implemented efficiently. We address here the effective placement of nodes that
implement randomized network coding in overlay networks, so that the goodput is
kept high while the delay for decoding stays small in streaming applications.
We first estimate the decoding delay at each client, which depends on the
innovative rate in the network. This estimation permits to identify the nodes
that have to perform coding for a reduced decoding delay. We then propose two
iterative algorithms for selecting the nodes that should perform network
coding. The first algorithm relies on the knowledge of the full network
statistics. The second algorithm uses only local network statistics at each
node. Simulation results show that large performance gains can be achieved with
the selection of only a few network coding nodes. Moreover, the second
algorithm performs very closely to the central estimation strategy, which
demonstrates that the network coding nodes can be selected efficiently in a
distributed manner. Our scheme shows large gains in terms of achieved
throughput, delay and video quality in realistic overlay networks when compared
to methods that employ traditional streaming strategies as well as random
network nodes selection algorithms.Comment: submitted to IEEE Transactions on Multimedia, January 18th 201
Data Compression in Multi-Hop Large-Scale Wireless Sensor Networks
Data collection from a multi-hop large-scale outdoor WSN deployment for environmental monitoring is full of challenges due to the severe resource constraints on small battery-operated motes (e.g., bandwidth, memory, power, and computing capacity) and the highly dynamic wireless link conditions in an outdoor communication environment. We present a compressed sensing approach which can recover the sensing data at the sink with good accuracy when very few packets are collected, thus leading to a significant reduction of the network traffic and an extension of the WSN lifetime. Interplaying with the dynamic WSN routing topology, the proposed approach is efficient and simple to implement on the resource-constrained motes without motes storing of a part of random measurement matrix, as opposed to other existing compressed sensing based schemes. We provide a systematic method via machine learning to find a suitable representation basis, for the given WSN deployment and data field, which is both sparse and incoherent with the measurement matrix in the compressed sensing. We validate our approach and evaluate its performance using our real-world multi-hop WSN testbed deployment in situ in collecting the humidity and soil moisture data. The results show that our approach significantly outperforms three other compressed sensing based algorithms regarding the data recovery accuracy for the entire WSN observation field under drastically reduced communication costs. For some WSN scenarios, compressed sensing may not be applicable. Therefore we also design a generalized predictive coding framework for unified lossless and lossy data compression. In addition, we devise a novel algorithm for lossless compression to significantly improve data compression performance for variouSs data collections and applications in WSNs. Rigorous simulations show our proposed framework and compression algorithm outperform several recent popular compression algorithms for wireless sensor networks such as LEC, S-LZW and LTC using various real-world sensor data sets, demonstrating the merit of the proposed framework for unified temporal lossless and lossy data compression in WSNs
INFORMATION THEORETIC SECRET KEY GENERATION: STRUCTURED CODES AND TREE PACKING
This dissertation deals with a multiterminal source model for
secret key generation by multiple network terminals with prior and
privileged access to a set of correlated signals complemented by
public discussion among themselves. Emphasis is placed on a
characterization of secret key capacity, i.e., the largest rate of
an achievable secret key, and on algorithms for key construction.
Various information theoretic security requirements of increasing
stringency: weak, strong and perfect secrecy, as well as different
types of sources: finite-valued and continuous, are studied.
Specifically, three different models are investigated.
First, we consider strong secrecy generation for a
discrete multiterminal source model. We discover a
connection between secret key capacity and a new
source coding concept of ``minimum information rate for signal dissemination,''
that is of independent interest in multiterminal data compression.
Our main contribution is to show for this discrete model
that structured linear codes suffice to generate a
strong secret key of the best rate.
Second, strong secrecy generation is considered for models with
continuous observations, in particular jointly Gaussian signals.
In the absence of suitable analogs of source coding notions for
the previous discrete model, new techniques are required for a
characterization of secret key capacity as well as for the design
of algorithms for secret key generation. Our proof of the secret
key capacity result, in particular the converse proof, as well as
our capacity-achieving algorithms for secret key construction
based on structured codes and quantization for a model with two
terminals, constitute the two main contributions for this second
model.
Last, we turn our attention to perfect secrecy generation for
fixed signal observation lengths as well as for their asymptotic
limits. In contrast with the analysis of the previous two models
that relies on probabilistic techniques, perfect secret key
generation bears the essence of ``zero-error information theory,''
and accordingly, we rely on mathematical techniques of a
combinatorial nature. The model under consideration is the
``Pairwise Independent Network'' (PIN) model in which every pair
of terminals share a random binary string, with the strings shared
by distinct pairs of terminals being mutually independent. This
model, which is motivated by practical aspects of a wireless
communication network in which terminals communicate on the same
frequency, results in three main contributions. First, the
concept of perfect omniscience in data compression leads to a
single-letter formula for the perfect secret key capacity of the
PIN model; moreover, this capacity is shown to be achieved by
linear noninteractive public communication, and coincides with
strong secret key capacity. Second, taking advantage of a
multigraph representation of the PIN model, we put forth an
efficient algorithm for perfect secret key generation based on a
combinatorial concept of maximal packing of Steiner trees of the
multigraph. When all the terminals seek to share perfect secrecy,
the algorithm is shown to achieve capacity. When only a subset of
terminals wish to share perfect secrecy, the algorithm is shown to
achieve at least half of it. Additionally, we obtain nonasymptotic
and asymptotic bounds on the size and rate of the best perfect
secret key generated by the algorithm. These bounds are of
independent interest from a purely graph theoretic viewpoint as
they constitute new estimates for the maximum size and rate of
Steiner tree packing of a given multigraph. Third, a particular
configuration of the PIN model arises when a lone ``helper''
terminal aids all the other ``user'' terminals generate perfect
secrecy. This model has special features that enable us to obtain
necessary and sufficient conditions for Steiner tree packing to
achieve perfect secret key capacity
Lecture Notes on Network Information Theory
These lecture notes have been converted to a book titled Network Information
Theory published recently by Cambridge University Press. This book provides a
significantly expanded exposition of the material in the lecture notes as well
as problems and bibliographic notes at the end of each chapter. The authors are
currently preparing a set of slides based on the book that will be posted in
the second half of 2012. More information about the book can be found at
http://www.cambridge.org/9781107008731/. The previous (and obsolete) version of
the lecture notes can be found at http://arxiv.org/abs/1001.3404v4/
The Fifth NASA Symposium on VLSI Design
The fifth annual NASA Symposium on VLSI Design had 13 sessions including Radiation Effects, Architectures, Mixed Signal, Design Techniques, Fault Testing, Synthesis, Signal Processing, and other Featured Presentations. The symposium provides insights into developments in VLSI and digital systems which can be used to increase data systems performance. The presentations share insights into next generation advances that will serve as a basis for future VLSI design
- …