Learn More
We consider a source node broadcasting to two receivers over a general erasure channel with receiver feedback. We characterize the capacity region of the channel and construct algorithms based on linear network coding (either randomized or depending on channel dynamics) that achieve this capacity. We then consider stochastic arrivals at the source for the(More)
We consider a random access system of non-cooperative selfish transmitters with the individual objectives of jointly optimizing throughput rewards, energy and delay costs. Our goal is to evaluate the effects of malicious nodes that have the dual objectives of blocking the packet transmissions of the other selfish nodes as well as optimizing their individual(More)
We consider game theoretic models of wireless medium access control (MAC) in which each transmitter makes individual decisions regarding their power level or transmission probability. This allows for scalable distributed operation; however, it can also enable users to pursue malicious objectives such as jamming other nodes to deny them service. We study(More)
In this paper, we address the problem of communication over the relay channel from the perspective of a stochastic game and evaluate the fundamental tradeoffs between direct communication and relaying through a detailed foray into the questions of throughput, delay and energy-efficiency. We consider a simple wireless ad-hoc network with a transmitter , a(More)
In wireless networks, throughput optimization is an essential performance objective that cannot be adequately characterized by a single criterion (such as the minimum transmitted or sum-delivered throughput) and should be specified over all source-destination pairs as a rate region. For a simple and yet fundamental model of tandem networks, a cross-layer(More)