We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
—We consider broadcasting from a single source to multiple destinations in a linear wireless erasure network with feedback. The problem is to find the maximum stable throughput ...
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...
—A joint network coding and superposition coding (JNSC) scheme is proposed for information exchange between more than two users in a wireless relaying network. In this paper we c...