Yalin Evren Sagduyu

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)
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 this paper, we compare the effects of the saturated and possibly emptying packet queues on wireless network coding (or plain routing as a special case) in a simple tandem network. We consider scheduled or random access with omnidi-rectional transmissions and assume the classical collision channel model without simultaneous transmission and reception by(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)
— In this paper, we address the random access problem from the perspective of a stochastic game. We allow selfish as well as cooperative users to select their retransmission strategies depending on several performance requirements, which involve throughput, delay and transmission costs. We first consider a simple slotted collision channel with packet(More)
We study adaptive network coding (NC) for scheduling real-time traffic over a single-hop wireless network. To meet the hard deadlines of real-time traffic, it is critical to strike a balance between maximizing the throughput and minimizing the risk that the entire block of coded packets may not be decodable by the deadline. Thus motivated, we explore(More)