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...
In this paper we present a rapid review of known results in the context of different scenario of the...
Abstract—We derive a new outer bound on the capacity region of broadcast traffic in multiple input b...
In a single hop broadcast packet erasure network, we demonstrate that it is possible to provide mult...
Consider a lossy packet network of queues, communicating over a wireless medium. This paper presents...
In this paper, a special class of wireless networks, called wireless erasure networks, is considered...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
International audienceWe consider the benefits of coding in wireless networks, specifically its role...
In this paper we show that to achieve capacity of a wireless network, the global structure of the ne...
We consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each...
Reliable multicast over wireless poses interesting challenges arising from the unreliable nature of ...
A classical result in undirected wireline networks is the near optimality of routing (flow) for mult...
In this paper, we consider a special class of wireless networks, called wireless erasure networks. I...
We determine the capacity of a certain class of wireless erasure relay networks. We first find a sui...
We consider in this paper a network that consists of two senders and two receivers. We further assum...
This dissertation is concerned with the design and analysis of algorithms that address two related i...
In this paper we present a rapid review of known results in the context of different scenario of the...
Abstract—We derive a new outer bound on the capacity region of broadcast traffic in multiple input b...
In a single hop broadcast packet erasure network, we demonstrate that it is possible to provide mult...
Consider a lossy packet network of queues, communicating over a wireless medium. This paper presents...
In this paper, a special class of wireless networks, called wireless erasure networks, is considered...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
International audienceWe consider the benefits of coding in wireless networks, specifically its role...
In this paper we show that to achieve capacity of a wireless network, the global structure of the ne...
We consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each...
Reliable multicast over wireless poses interesting challenges arising from the unreliable nature of ...
A classical result in undirected wireline networks is the near optimality of routing (flow) for mult...
In this paper, we consider a special class of wireless networks, called wireless erasure networks. I...
We determine the capacity of a certain class of wireless erasure relay networks. We first find a sui...
We consider in this paper a network that consists of two senders and two receivers. We further assum...
This dissertation is concerned with the design and analysis of algorithms that address two related i...
In this paper we present a rapid review of known results in the context of different scenario of the...
Abstract—We derive a new outer bound on the capacity region of broadcast traffic in multiple input b...
In a single hop broadcast packet erasure network, we demonstrate that it is possible to provide mult...