pith. sign in

arxiv: 0901.2410 · v2 · pith:UZR4BREKnew · submitted 2009-01-16 · 💻 cs.IT · math.IT

On the Energy Benefit of Network Coding for Wireless Multiple Unicast

classification 💻 cs.IT math.IT
keywords codingbenefitenergynetworkroutingdimensionalleastmaximum
0
0 comments X
read the original abstract

We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio of the minimum energy required by routing and network coding solutions, where the maximum is over all configurations. It is shown that if coding and routing solutions are using the same transmission range, the benefit in $d$-dimensional networks is at least $2d/\lfloor\sqrt{d}\rfloor$. Moreover, it is shown that if the transmission range can be optimized for routing and coding individually, the benefit in 2-dimensional networks is at least 3. Our results imply that codes following a \emph{decode-and-recombine} strategy are not always optimal regarding energy efficiency.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.