ceClub: Coded Retransmission in Wireless Networks Via Abstract MDPs

Mark Shifrin (Ben Gurion University)
Wednesday, 27.5.2015, 11:30
EE Meyer Building 861

We consider a transmission scheme with a single transmitter and multiple receivers over a faulty broadcast channel. For each receiver, the transmitter has a unique infinite stream of packets, and its goal is to deliver them at the highest throughput possible. While such multiple-unicast models are unsolved in general, several network coding based schemes were suggested. In such schemes, the transmitter can either send an uncoded packet, or a coded packet which is a function of a few packets. Sent packets can be received by the designated receiver (with some probability) or heard and stored by other receivers. Two functional modes are considered; the first presumes that the storage time is unlimited, while in the second it is limited by a given Time To Live (TTL) parameter. We model the transmission process as an infinite horizon Markov Decision Process (MDP). Since the large state space renders exact solutions computationally impractical, we introduce policy restricted and induced MDPs with significantly reduced state space, which with properly chosen reward have equal optimal value function. We then derive a reinforcement learning algorithm, which approximates the optimal strategy and significantly improves over uncoded schemes. The algorithm adapts to the packet loss rates, unknown in advance, attains high gain over the uncoded setup and is comparable with the upper bound by Wang, derived for a much stronger coding scheme.

Mark Shifrin received his PHD from EE, Technion, in 2014. He is recipient of Kreitman postdoctoral fellowship in Ben Gurion university, where he currently pursues topics in wireless communication using stochastic control methods, at department of Communication Systems Engineering.

Back to the index of events