Minimum-energy multicast in mobile ad hoc networks using network coding
Top Cited Papers
- 6 April 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 304-309
- https://doi.org/10.1109/itw.2004.1405319
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.Keywords
This publication has 8 references indexed in Scilit:
- On the utility of network coding in dynamic environmentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Minimum-energy multicast in mobile ad hoc networks using network codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- Linear network codingIEEE Transactions on Information Theory, 2003
- Minimum energy communication over a relay channelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On the construction of energy-efficient broadcast and multicast trees in wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Constructing minimum-energy broadcast trees in wireless ad hoc networksPublished by Association for Computing Machinery (ACM) ,2002
- Network information flowIEEE Transactions on Information Theory, 2000