## Minimum-energy multicast in mobile ad hoc networks using network coding (2005)

### Download From

IEEE### Download Links

- [research.microsoft.com]
- [research.microsoft.com]
- [www.cs.mun.ca]
- [gbook.yolasite.com]
- [www.princeton.edu]
- [www.cs.huji.ac.il]
- [wclb.tamu.edu]
- [www.princeton.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE Trans. Commun |

Citations: | 92 - 2 self |

### BibTeX

@ARTICLE{Wu05minimum-energymulticast,

author = {Yunnan Wu and Student Member and Philip A. Chou and Sun-yuan Kung},

title = {Minimum-energy multicast in mobile ad hoc networks using network coding},

journal = {IEEE Trans. Commun},

year = {2005},

volume = {53},

pages = {1906--1918}

}

### Years of Citing Articles

### OpenURL

### Abstract

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 layered model of wireless networks, the minimum energyper-bit for multicasting in a mobile ad hoc network can be found by a linear program; the minimum energy-per-bit can be attained by performing network coding. Compared with conventional routing solutions, network coding not only promises a potentially lower energy-per-bit, but also enables the optimal solution to be found in polynomial time, in sharp contrast with the NPhardness of constructing the minimum-energy multicast tree as the optimal routing solution. We further show that the minimum energy multicast formulation is equivalent to a cost minimization with linear edge-based pricing, where the edge prices are the energy-per-bits of the corresponding physical broadcast links. This paper also investigates minimum energy multicasting with routing. Due to the linearity of the pricing scheme, the minimum energy-per-bit for routing is achievable by using a single distribution tree. A characterization of the admissible rate region for routing with a single tree is presented. The minimum energy-per-bit for multicasting with routing is found by an integer linear program. We show that the relaxation of this integer linear program, studied earlier in the Steiner tree literature, can now be interpreted as the optimization for minimum energy multicasting with network coding. In short, this paper presents a unifying study of minimum energy multicasting with network coding and routing. Index Terms — Network coding, routing, multicast, Steiner tree, wireless ad hoc networks, energy efficiency, mobility.

### Citations

8889 |
Elements of Information Theory
- Covet, Thomas
- 1991
(Show Context)
Citation Context ...sion network coding, while it cannot be achieved by separately processing the two sessions. A well-known technique for establishing an outer bound is to consider the cuts; see, e.g., Cover and Thomas =-=[27]-=- and Yeung [26]. For any cut of ,define (47) which is the set of sources for sessions that need to communicate across the cut. The sum rate of all sessions that need to communicate across the cut has ... |

1176 | Network information flow
- Ahlswede, Cai, et al.
- 2000
(Show Context)
Citation Context ...ng nodes to perform arbitrary operations on the information received to generate the output. Historically, throughput gain has been the primary motivation for network coding. In their pioneering work =-=[4]-=-, Ahlswede et al. gave a simple example network to show that network coding can potentially achieve a higher throughput than routing solutions. More generally, they showed in [4] that the multicast ca... |

944 | Next Century Challenges: Scalable Coordination in Sensor Networks - Estrin, Govindan, et al. - 1999 |

755 | BWireless integrated network sensors - Pottie, Kaiser - 2000 |

619 | Linear network coding
- Li, Yeung, et al.
- 2003
(Show Context)
Citation Context ...common information to a set of receivers, is equal to the minimum of maximum flow values between the sender and each receiver and can be achieved with network coding. Subsequently, Li, Yeung, and Cai =-=[5]-=- showed that it is sufficient for the encoding functions at the interior nodes to be linear. Koetter and Médard [6] gave an algebraic characterization of linear encoding schemes and proved existence o... |

572 |
Combinatorial Optimization - Polyhedra and Efficiency
- Schrijver
- 2003
(Show Context)
Citation Context ... allocated to the destinations, which can be used to stream distinct data to the destinations. In other words, the SUM of flows solution, also called multicommodity flow in the literature (see, e.g., =-=[19]-=-), treats the multicast session as multiple separate unicast sessions. This treatment could be unnecessarily wasteful as it has not taken into account the possibility of sharing resources among differ... |

546 | An algebraic approach to network coding
- Koetter, Medard
- 2003
(Show Context)
Citation Context ...h receiver and can be achieved with network coding. Subsequently, Li, Yeung, and Cai [5] showed that it is sufficient for the encoding functions at the interior nodes to be linear. Koetter and Médard =-=[6]-=- gave an algebraic characterization of linear encoding schemes and proved existence of linear time-invariant codes achieving the multicast capacity. Empirical comparisons of the throughput achievable ... |

537 | A new approach to the maximum flow problem - Goldberg, Tarjan - 1988 |

433 | On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks
- Wieselthier, Nguyen, et al.
- 2000
(Show Context)
Citation Context ..., a single transmission by a certain transmitter may result in multiple nodes recovering the transmitted signals; this physical-layer broadcast property was called the wireless multicast advantage in =-=[1]-=-. Then, the problem is to find a set of relaying nodes and their respective power levels such that all nodes in T receive the message, whereby the total energy expenditure for the task is minimized. U... |

373 | Broadcast channels
- Cover
- 1972
(Show Context)
Citation Context ...l-valued additive white Gaussian noise (AWGN) reception model at each node , , where is Gaussian with variance , . The input is constrained to satisfy . Then, from known results on broadcast channels =-=[14]-=-–[17], we observe that the associated elementary graphs can be characterized by Fig. 5 with edge capacities (31) where , . Letting be the family of elementary graphs parameterized by variables and , t... |

354 |
The Steiner Tree Problem
- Hwang, Richards, et al.
- 1992
(Show Context)
Citation Context ...routing schemes that use a single Steiner tree – a minimum cost Steiner tree. The minimum (cost) Steiner tree problem has been studied extensively in the literature; a survey can be found in the book =-=[20]-=-. This result essentially comes from the Steiner tree literature; see, e.g., [21]–[23]. Proof: 1) Let denote the set of all length- binary vectors that correspond to a Steiner tree. Index these vector... |

305 | Practical network coding - Chou, Wu, et al. - 2003 |

287 | Maximal flow through a network - Ford, Fulkersonn - 1956 |

236 | The benefits of coding over routing in a randomized setting
- Médard, Karger, et al.
- 2003
(Show Context)
Citation Context ... capacity with low delay and is robust to random packet loss and delay as well as to changes to network topology or capacity. Distributed random network coding were also investigated by Ho et al. [7]–=-=[9]-=-. Empirical comparisons of the throughput achievable by routing and network coding have been reported in [10] for static graphs and in [11] for dynamically varying graphs. An increasingly important ap... |

174 | PicoRadio supports ad hoc ultra-low power wireless networking - RABEY, AMMER, et al. - 2000 |

153 | On randomized network coding - Ho, Médard, et al. - 2003 |

147 | On Channel Capacity Per Unit Cost - Verdú - 1990 |

134 |
A First Course in Information Theory
- Yeung
- 2002
(Show Context)
Citation Context ... nodes at rate . Assume the messages in different sessions are independent. Given , let denote the associated admissible rate region. Characterizing remains an open problem in information theory; see =-=[26]-=-. We now briefly discuss an inner bound and an outer bound of , both of which can be characterized by a system of linear inequalities. An inner bound can be established by partitioning the available r... |

133 | Algorithm for solution of a problem of maximum flow in networks with power estimation - Dinic - 1970 |

132 | Minimum-Energy Broadcast in AllWireless Networks: NP-Completness and Distribution Issues
- Čagalj, Hubaux, et al.
- 2002
(Show Context)
Citation Context ...nformation from a source node to a set of destination nodes with the minimum amount of total consumed energy per information bit, in a mobile ad hoc network (MANET). Several previous works, e.g., [1]–=-=[3]-=-, aim at finding the minimum-energy multicast tree. Suppose a sender wants to transmit a message to destinations . Assuming nodes in the network can only route, i.e., replicate and forward, received m... |

126 | Towards Self-Organized Mobile Ad Hoc Networks: The Terminodes Project - Hubaux, Gross, et al. - 2001 |

112 | Information exchange in wireless networks with network coding and physical-layer broadcast
- Wu, Chou, et al.
- 2005
(Show Context)
Citation Context ...mutual exchange phenomenon also occurs at the bottom of Fig. 7(b) between nodes 1 and 47. For a detailed discussion of information exchange in a wireless network using network coding, please refer to =-=[24]-=-, where we also propose a simple distributed communication scheme using only XOR for network coding. VI. CONCLUSION This paper unifies the study of network coding and routing for the problem of minimu... |

102 | Polynomial time algorithms for network information flow - Sanders, Egner, et al. - 2003 |

97 | Constructing minimum-energy broadcast trees in wireless ad hoc networks - Liang - 2002 |

95 | Random coding theorem for broadcast channels with degraded components - Bergmans - 1973 |

91 | A simple converse for broadcast channels with additive white Gaussian noise - Bergmans - 1974 |

89 | Packing Steiner trees
- Jain, Mahdian, et al.
(Show Context)
Citation Context ...n trees, each connecting to ; such a distribution tree is also called a Steiner tree in graph theory. As a result, can be characterized as in Fig. 6; this “tree-packing” characterization follows from =-=[18]-=-. However, this formulation involves the set of all Steiner trees, whose size can grow exponentially with the network size. In the following, we first discuss an inner bound of , , which can be charac... |

79 |
Capacity and coding for degraded broadcast channel
- Gallager
- 1974
(Show Context)
Citation Context ...ued additive white Gaussian noise (AWGN) reception model at each node , , where is Gaussian with variance , . The input is constrained to satisfy . Then, from known results on broadcast channels [14]–=-=[17]-=-, we observe that the associated elementary graphs can be characterized by Fig. 5 with edge capacities (31) where , . Letting be the family of elementary graphs parameterized by variables and , the mi... |

73 | Network planning in wireless ad hoc networks: A cross-layer approach
- Wu, Chou, et al.
- 2005
(Show Context)
Citation Context ...e. Nonetheless, its simplicity facilitates the analysis and enables some engineering insights to be obtained. To explain the layered model in more details, we adopt the terminologies and notations in =-=[10]-=-. A collection of lossless bitpipes mentioned earlier is called a capacity graph in [10]. A capacity graph can be described as a triple G = (V, E, c) where V and E are sets of vertices and edges respe... |

66 | Network coding with a cost criterion
- Lun, Médard, et al.
- 2004
(Show Context)
Citation Context ...ecomes immaterial, enabling one to find the minimum energyper-bit in polynomial time. More details can be found in [11]. Recently, a similar problem was considered in an independent work by Lun et al =-=[12]-=-.sII. CAPACITY GRAPHS FOR WIRELESS AD HOC NETWORKS The set of supported capacity graphs represents possible allocations of communication resources arising from scheduling and power control in the phys... |

59 | A Dual Ascent Approach for Steiner Tree Problems on a Directed Graph - Wong - 1984 |

55 | Throughput capacity of random ad hoc networks with infrastructure support - Kozat, Tassiulas - 2003 |

50 | An ad hoc network with mobile backbones - Xu, Hong, et al. - 2002 |

30 | A comparison of network coding and tree packing
- Wu, Chou, et al.
- 2004
(Show Context)
Citation Context ...ng schemes and proved existence of linear time-invariant codes achieving the multicast capacity. Empirical comparisons of the throughput achievable by routing and network coding have been reported in =-=[7]-=- for static graphs and in [8] for dynamically varying graphs. In this work, we explore the advantage of network coding in economically using network resources, more specifically the energy consumption... |

17 |
Minimum energy communication over a relay channel
- Gamal, Zahedi
- 2003
(Show Context)
Citation Context ...rmation theory, where lots of problems remain open. The minimum energy-per-bit of a wireless network in information theoretic sense is still unknown, even for a small network with 3 nodes; see, e.g., =-=[9]-=-. The discussions in this paper are based on a simplified layered model of wireless networks. The basic assumptions of the layered model are as follows. The physical and link layers of the wireless ne... |

14 | Toward a Random Operation of Networks
- Ho, Médard, et al.
- 2004
(Show Context)
Citation Context ...e to capacity with low delay and is robust to random packet loss and delay as well as to changes to network topology or capacity. Distributed random network coding were also investigated by Ho et al. =-=[7]-=-–[9]. Empirical comparisons of the throughput achievable by routing and network coding have been reported in [10] for static graphs and in [11] for dynamically varying graphs. An increasingly importan... |

13 | On the utility of network coding in dynamic environments
- Ho, Leong, et al.
- 2004
(Show Context)
Citation Context ...ce of linear time-invariant codes achieving the multicast capacity. Empirical comparisons of the throughput achievable by routing and network coding have been reported in [7] for static graphs and in =-=[8]-=- for dynamically varying graphs. In this work, we explore the advantage of network coding in economically using network resources, more specifically the energy consumption. The example in Figure 1 and... |

11 | Polynomial time algorithms for network code construction - Jaggi, Sanders, et al. |

9 |
Network Coding for Multicasting
- Wu
- 2005
(Show Context)
Citation Context ...he former discrete power control and the 1To see why it can be problematic to treat the virtual vertices associated with a same transmitter as the same in different elementary graphs, please refer to =-=[13]-=-. 2To see this, consider an arbitrary network coding solution S. Modify this solution S by letting each virtual vertex u forward whatever information flowing on uu to its outgoing edges. Then, the rec... |

8 |
Une nouvelle formulation du probleme de Steiner sur un graphe. Université de Montréal, Centre de recherche sur les transports
- Claus, Maculan
- 1983
(Show Context)
Citation Context ... minimum (cost) Steiner tree problem has been studied extensively in the literature; a survey can be found in the book [20]. This result essentially comes from the Steiner tree literature; see, e.g., =-=[21]-=-–[23]. Proof: 1) Let denote the set of all length- binary vectors that correspond to a Steiner tree. Index these vectors as . Using the expression of in Fig. 6, we see that (35) becomes subject to (39... |

8 | simple converse for broadcast channels with additive white Gaussian noise - “A - 1974 |

6 |
An algorithm for the Steiner tree problem in graphs
- Beasley
- 1984
(Show Context)
Citation Context ...mum (cost) Steiner tree problem has been studied extensively in the literature; a survey can be found in the book [20]. This result essentially comes from the Steiner tree literature; see, e.g., [21]–=-=[23]-=-. Proof: 1) Let denote the set of all length- binary vectors that correspond to a Steiner tree. Index these vectors as . Using the expression of in Fig. 6, we see that (35) becomes subject to (39) Sin... |

5 | Low complexity optimal algebraic multicast codes - Jaggi, Chou, et al. - 2003 |

4 | Practical network coding,” Technical report, Microsoft Research - Wu, Chou, et al. |

2 | he has been a Professor of Electrical Engineering at Princeton University, Princeton, NJ. He held a Visiting Professorship at Stanford University and the Delft University of Technology, Delft, The Netherlands, in 1984, a Toshiba Chair Professorship at Was - Since - 1987 |

1 | Practical network coding,” 41st Allerton Conf - Chou, Wu, et al. |

1 | On network coding for generalized multicasting - Wu - 2005 |

1 | S’02) received his BSE degree in Computer Science from University of Science and Technology of - Wu - 2002 |

1 | was with Microsoft Research, Asia, from 1999-2001 as a research assistant, with Bell Laboratory, Lucent Technologies, as a summer intern in 2002, and with Microsoft Research, Redmond, as a summer intern in 2003. His research interests include networking, - He |

1 | S’82-M’87-SM’00-F’04) received the B.S.E. degree in electrical engineering and computer science from - Chou - 1980 |