Learn More
—We consider the N-user broadcast erasure channel where feedback from the users is fed back to the transmitter in the form of ACK messages. We first provide a generic outer bound to the capacity of this system; we then propose a coding algorithm, compute its throughput region and show that it achieves capacity under certain conditions on channel statistics,(More)
We consider a noise-limited wireless sensor network that consists of battery-operated nodes which can route information to a mobile sink in a multi-hop fashion. The problem of maximizing the network's lifetime, defined as the period of time during which the network can route a feasible flow to each sink location subject to power/energy constraints, is cast(More)
Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary cannot be located at many different points in the network at the same time). We present a system that(More)
We consider the N-user memoryless broadcast erasure channel with N unicast sessions (one for each user) where receiver feedback is sent to the transmitter in the form of ACK/NACK messages. We first provide a generic outer bound to the capacity of this system; using concepts from network coding, we then propose a session-mixing coding algorithm applied on(More)
In this paper, we describe a network coding scheme for the Broadcast Erasure Channel with multiple unicast stochastic flows, for a single source transmitting packets to users with per-slot ACK/NACK feedback. This scheme performs only binary (XOR) operations and involves a network of queues, along with special rules for coding and moving packets among the(More)
We consider single-hop broadcast packet erasure channels (BPEC) with degraded message sets and instantaneous feedback regularly available from all receivers, and demonstrate that the main principles of the virtual-queue-based algorithms in [1], which were proposed for multiple unicast sessions, can still be applied to this setting and lead to(More)
In this paper we describe a network coding scheme for the Broadcast Erasure Channel with multiple unicast stochastic flows, for the case of a single source transmitting packets to N users, where per-slot feedback is fed back to the transmitter in the form of ACK/NACK messages. This scheme performs only binary (XOR) operations and includes special rules for(More)
We study the case of the three-user broadcast erasure channel, with multiple unicast traffic, where feedback from the users is fed back to the transmitter in the form of ACK/NACK messages. The capacity region of this system has been recently derived and two capacity achieving algorithms, employing intersession linear network coding, have been proposed in(More)
— This paper examines the performance of a dual-hop, noise-limited, non-regenerative system where the relay gain is allowed to vary as an unknown deterministic function of the channel states, subject to instantaneous (i.e. peak) and average power constraints, the latter directly affecting battery lifetime in wireless systems. A convex optimization problem,(More)