TY - GEN
T1 - Minimum-energy multicast in mobile ad hoc networks using network coding
AU - Wu, Yunnan
AU - Chou, Philip A.
AU - Kung, Sun Yuan
PY - 2004
Y1 - 2004
N2 - The minimum energy required to transmit a bit of information through a network characterizes the most economical way to communicate in a network. In this paper, we show that under a simplified layered model of wireless networks, the minimum-energy multicast problem in mobile ad hoc networks is solvable as a linear program, assuming network coding. Compared with conventional routing solutions, network coding not only promises a potentially lower energy-per-bit, but also enables finding the optimal solution in polynomial time, in sharp contrast with the NP-hardness of constructing the minimum-energy multicast tree as the optimal routing solution.
AB - The minimum energy required to transmit a bit of information through a network characterizes the most economical way to communicate in a network. In this paper, we show that under a simplified layered model of wireless networks, the minimum-energy multicast problem in mobile ad hoc networks is solvable as a linear program, assuming network coding. Compared with conventional routing solutions, network coding not only promises a potentially lower energy-per-bit, but also enables finding the optimal solution in polynomial time, in sharp contrast with the NP-hardness of constructing the minimum-energy multicast tree as the optimal routing solution.
UR - http://www.scopus.com/inward/record.url?scp=19544372232&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=19544372232&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:19544372232
SN - 0780387201
SN - 9780780387201
T3 - 2004 IEEE Information Theory Workshop - Proceedings, ITW
SP - 304
EP - 309
BT - 2004 IEEE Information Theory Workshop - Proceedings, ITW
T2 - 2004 IEEE Information Theory Workshop - Proceedings, ITW
Y2 - 24 October 2004 through 29 October 2004
ER -