### Abstract

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.

Original language | English (US) |
---|---|

Title of host publication | 2004 IEEE Information Theory Workshop - Proceedings, ITW |

Pages | 304-309 |

Number of pages | 6 |

State | Published - Dec 1 2004 |

Event | 2004 IEEE Information Theory Workshop - Proceedings, ITW - San Antonio, TX, United States Duration: Oct 24 2004 → Oct 29 2004 |

### Publication series

Name | 2004 IEEE Information Theory Workshop - Proceedings, ITW |
---|

### Other

Other | 2004 IEEE Information Theory Workshop - Proceedings, ITW |
---|---|

Country | United States |

City | San Antonio, TX |

Period | 10/24/04 → 10/29/04 |

### All Science Journal Classification (ASJC) codes

- Engineering(all)

## Fingerprint Dive into the research topics of 'Minimum-energy multicast in mobile ad hoc networks using network coding'. Together they form a unique fingerprint.

## Cite this

*2004 IEEE Information Theory Workshop - Proceedings, ITW*(pp. 304-309). (2004 IEEE Information Theory Workshop - Proceedings, ITW).