442 research outputs found
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 strategies design based on the diversity and multiplexing tradeoff
This thesis focuses on designing wireless cooperative communication strategies that are
either optimal or near-optimal in terms of the tradeoff between diversity and multiplexing
gains. Starting from classical cooperative broadcast, multiple-access and relay channels
with unit degree of freedom, to more general cooperative interference channels with
higher degrees of freedom, properties of different network topologies are studied and
their unique characteristics together with several advanced interference management
techniques are exploited to design cooperative transmission strategies in order to enhance
data rate, reliability or both at the same time. Moreover, various algorithms are
proposed to solve practical implementation issues and performance is analyzed through
both theoretical verifications and simulations
Network Coding for Packet Radio Networks
We present methods for network-coded broadcast and multicast distribution of files in ad hoc networks of half-duplex packet radios. Two forms of network coding are investigated: fountain coding and random linear network coding. Our techniques exploit the broadcast nature of the wireless medium by permitting nodes to receive packets from senders other than their designated relays. File transfer is expedited by having multiple relays cooperate to forward the file to a destination. When relay nodes apply fountain coding to the file, they employ a simple mechanism to completely eliminate the possibility of sending duplicate packets to the recipients. It is not necessary for the nodes to transmit multiple packets simultaneously or to receive packets from multiple senders simultaneously. To combat the effects of time varying propagation loss on the links, each sender has the option to adapt the modulation format and channel-coding rate packet-by-packet by means of an adaptive transmission protocol. We use simulations to compare our network-coded file distributions with conventional broadcast and multicast techniques that use automatic repeat request (ARQ). Our numerical results show that the proposed strategies outperform ARQ-based file transfers by large margins for most network configurations. We also provide analytical upper bounds on the throughput of file distributions in networks comprising four nodes. We illustrate that our network-coded file-distribution strategies, when applied to the four-node networks, perform very close to the bounds
Link Quality Control Mechanism for Selective and Opportunistic AF Relaying in Cooperative ARQs: A MLSD Perspective
Incorporating relaying techniques into Automatic Repeat reQuest (ARQ)
mechanisms gives a general impression of diversity and throughput enhancements.
Allowing overhearing among multiple relays is also a known approach to increase
the number of participating relays in ARQs. However, when opportunistic
amplify-and-forward (AF) relaying is applied to cooperative ARQs, the system
design becomes nontrivial and even involved. Based on outage analysis, the
spatial and temporal diversities are first found sensitive to the received
signal qualities of relays, and a link quality control mechanism is then
developed to prescreen candidate relays in order to explore the diversity of
cooperative ARQs with a selective and opportunistic AF (SOAF) relaying method.
According to the analysis, the temporal and spatial diversities can be fully
exploited if proper thresholds are set for each hop along the relaying routes.
The SOAF relaying method is further examined from a packet delivery viewpoint.
By the principle of the maximum likelihood sequence detection (MLSD),
sufficient conditions on the link quality are established for the proposed
SOAF-relaying-based ARQ scheme to attain its potential diversity order in the
packet error rates (PERs) of MLSD. The conditions depend on the minimum
codeword distance and the average signal-to-noise ratio (SNR). Furthermore,
from a heuristic viewpoint, we also develop a threshold searching algorithm for
the proposed SOAF relaying and link quality method to exploit both the
diversity and the SNR gains in PER. The effectiveness of the proposed
thresholding mechanism is verified via simulations with trellis codes.Comment: This paper has been withdrawn by the authors due to an improper proof
for Theorem 2. To avoid a misleading understanding, we thus decide to
withdraw this pape
- …