Constructing minimum-energy broadcast trees in wireless ad hoc networks

By Weifa Liang. ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2002

300 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Topology control in wireless ad hoc and sensor networks (2005, background): “For example, in Marina and Das [2002] the authors have shown that the high overhead needed to handle unidirectional links in routing protocols outweighs the benefits that they can provide, and better performance can be achieved by simply avoiding them.”
Wireless Broadcast Using Network Coding (2009, methodology): “Using the ARQ approach, the sender may have to rebroadcast a lost packet to all the receivers, although there may be only one receiver that did not correctly receive that packet.”
Minimum-cost multicast over coded packet networks (2005, background): “By contrast, the sam e problem using traditional routing-based approaches is NPcomplete—in fact, the special case of broadcast in itself is NP-complete, a result shown in [49], [50].”
Minimum-energy multicast in mobile ad hoc networks using network coding (2004, methodology): “Due to the linearity of the pricing scheme, the minimum energy-per-bit for routing is achievable by using a single distribution tree.”
A survey on power control issues in wireless sensor networks (2007, result): “The problem here, which is similar to the ones presented in [59, 60 ], is called MEB (Minimum Energy Broadcast) for short.”
Localized minimum-energy broadcasting in ad-hoc networks (2003, methodology): “problem is NP-complete and [11] proposed an approximate globalized algorithm which gives solutions with bounded ratio against lower bound.”