Minimum Energy Broadcast Routing Problem Research Articles

New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm

The Broadcast Incremental Power (BIP) algorithm is the most frequently cited method for the minimum energy broadcast routing problem. A recent survey concluded that BIP has O ( | V | 3 ) time complexity, and that its approximation ratio is at least 4.33. We strengthen these results to O ( | V | 2 ) and 4.598, respectively.

3-Dimensional minimum energy broadcasting problem

The minimum energy broadcast routing problem was extensively studied during the last years. Given a sample space where wireless devices are distributed, the aim is to perform the broadcast communication pattern from a given source while minimising the total energy consumption. While many papers deal with the 2-dimensional case where the sample space is given by a plain area, few results are known about the more interesting and practical 3-dimensional case. In this paper we study this case and we present a tighter analysis of the minimum spanning tree heuristic in order to considerably decrease its approximation factor from the known 26 to roughly 18.8. This decreases the gap with the known lower bound of 12 given by the so-called 3-dimensional kissing number.

Energy efficient broadcast routing in mobile ad hoc networks

AbstractIn this paper, we address the problem of broadcast routing in mobile ad hoc networks from the viewpoint of energy efficiency. In an ad hoc wireless network, each node runs on a local energy source which has a limited energy lifespan. Thus, energy conservation is a critical issue in ad hoc networks. One approach for energy conservation is to establish routes which require lowest total energy consumption. This optimization problem is referred as the minimum‐energy broadcast routing problem (MEBRP). In this paper, we propose new efficient algorithms for the construction of energy‐efficient trees for broadcast in mobile ad hoc networks. These algorithms exploit the broadcast nature of the wireless channel, and address the need for energy‐efficient operations. Empirical studies show that our algorithms are able to achieve better performance than algorithms that have been developed for MEBRP. Copyright © 2004 John Wiley & Sons, Ltd.

Minimum-energy broadcasting in static ad hoc wireless networks

Energy conservation is a critical issue in ad hoc wireless networks for node and network life, as the nodes are powered by batteries only. One major approach for energy conservation is to route a communication session along the route which requires the lowest total energy consumption. This optimization problem is referred to as Minimum-Energy Routing. While the minimum-energy unicast routing problem can be solved in polynomial time by shortest-path algorithms, it remains open whether the minimum-energy broadcast routing problem can be solved in polynomial time, despite the NP-hardness of its general graph version. Recently three greedy heuristics were proposed in [11]: MST (minimum spanning tree), SPT (shortest-path tree), and BIP (broadcasting incremental power). They have been evaluated through simulations in [11], but little is known about their analytical performances. The main contribution of this paper is a quantitative characterization of their performances in terms of approximation ratios. By exploring geometric structures of Euclidean MSTs, we have been able to prove that the approximation ratio of MST is between 6 and 12, and the approximation ratio of BIP is between 13/3 and 12. On the other hand, we show that the approximation ratio of SPT is at least n/2, where n is the number of receiving nodes. To the best of our knowledge, these are the first analytical results for the minimum-energy broadcasting problem.