3,628 research outputs found
Multicast in wireless erasure networks with feedback
This paper studies the lossy, wireless packet network of [1], in the case of a multicast requirement and the availability of feedback. In the unicast case, feedback is sufficient to allow a strategy which achieves the throughput-optimal cut-set capacity without requiring network coding [3]. We provide a counter-example to show that source coding and feedback, without network coding, is insufficient to achieve the cut-set capacity for the multicast wireless erasure network. In particular, we examine a network with one source, one relay, and two destinations. We show that even with the highly optimistic assumption of feedback which provides global packet state awareness, this network still fails to reach capacity. This bridges the gap between two previously known results; one, that network coding can achieve the capacity of the wireless erasure network, and two, that feedback allows a capacity achieving scheme which does not require network coding in the unicast wireless erasure network
Speeding Multicast by Acknowledgment Reduction Technique (SMART)
We present a novel feedback protocol for wireless broadcast networks that
utilize linear network coding. We consider transmission of packets from one
source to many receivers over a single-hop broadcast erasure channel. Our
method utilizes a predictive model to request feedback only when the
probability that all receivers have completed decoding is significant. In
addition, our proposed NACK-based feedback mechanism enables all receivers to
request, within a single time slot, the number of retransmissions needed for
successful decoding. We present simulation results as well as analytical
results that show the favorable scalability of our technique as the number of
receivers, file size, and packet erasure probability increase. We also show the
robustness of this scheme to uncertainty in the predictive model, including
uncertainty in the number of receiving nodes and the packet erasure
probability, as well as to losses of the feedback itself. Our scheme, SMART, is
shown to perform nearly as well as an omniscient transmitter that requires no
feedback. Furthermore, SMART, is shown to outperform current state of the art
methods at any given erasure probability, file size, and numbers of receivers
Content Delivery in Erasure Broadcast Channels with Cache and Feedback
We study a content delivery problem in a K-user erasure broadcast channel
such that a content providing server wishes to deliver requested files to
users, each equipped with a cache of a finite memory. Assuming that the
transmitter has state feedback and user caches can be filled during off-peak
hours reliably by the decentralized content placement, we characterize the
achievable rate region as a function of the memory sizes and the erasure
probabilities. The proposed delivery scheme, based on the broadcasting scheme
by Wang and Gatzianas et al., exploits the receiver side information
established during the placement phase. Our results can be extended to
centralized content placement as well as multi-antenna broadcast channels with
state feedback.Comment: 29 pages, 7 figures. A short version has been submitted to ISIT 201
Random Linear Network Coding for Wireless Layered Video Broadcast: General Design Methods for Adaptive Feedback-free Transmission
This paper studies the problem of broadcasting layered video streams over
heterogeneous single-hop wireless networks using feedback-free random linear
network coding (RLNC). We combine RLNC with unequal error protection (UEP) and
our main purpose is twofold. First, to systematically investigate the benefits
of UEP+RLNC layered approach in servicing users with different reception
capabilities. Second, to study the effect of not using feedback, by comparing
feedback-free schemes with idealistic full-feedback schemes. To these ends, we
study `expected percentage of decoded frames' as a key content-independent
performance metric and propose a general framework for calculation of this
metric, which can highlight the effect of key system, video and channel
parameters. We study the effect of number of layers and propose a scheme that
selects the optimum number of layers adaptively to achieve the highest
performance. Assessing the proposed schemes with real H.264 test streams, the
trade-offs among the users' performances are discussed and the gain of adaptive
selection of number of layers to improve the trade-offs is shown. Furthermore,
it is observed that the performance gap between the proposed feedback-free
scheme and the idealistic scheme is very small and the adaptive selection of
number of video layers further closes the gap.Comment: 15 pages, 12 figures, 3 tables, Under 2nd round of review, IEEE
Transactions on Communication
Generalized Instantly Decodable Network Coding for Relay-Assisted Networks
In this paper, we investigate the problem of minimizing the frame completion
delay for Instantly Decodable Network Coding (IDNC) in relay-assisted wireless
multicast networks. We first propose a packet recovery algorithm in the single
relay topology which employs generalized IDNC instead of strict IDNC previously
proposed in the literature for the same relay-assisted topology. This use of
generalized IDNC is supported by showing that it is a super-set of the strict
IDNC scheme, and thus can generate coding combinations that are at least as
efficient as strict IDNC in reducing the average completion delay. We then
extend our study to the multiple relay topology and propose a joint generalized
IDNC and relay selection algorithm. This proposed algorithm benefits from the
reception diversity of the multiple relays to further reduce the average
completion delay in the network. Simulation results show that our proposed
solutions achieve much better performance compared to previous solutions in the
literature.Comment: 5 pages, IEEE PIMRC 201
- …