Minimum Energy Broadcast Routing Research Articles

Maritime Data Transmission Coverage Optimization Under Power and Distance Constraints

A problem of the minimum-energy broadcast routing is considered for efficient maritime data transmission coverage. The power emitted by a ship radio station is limited, and this limitation tethers distance. Given an initial number of ships and their locations, they are triangulated. Upon the triangulation, the edges exceeding the maximum edge length equivalent to the maximum distance are removed. If the resulting graph has no disconnected ships, the solution is the minimum spanning tree. For two or more disconnected subgraphs, a minimum spanning tree is built for each of them, and the corresponding set of the efficient solutions is formed. Within this set, no minimum spanning tree exists that would either be shorter by connecting no fewer than a number of ships from an efficient solution or be not longer by connecting more than a number of ships from an efficient solution. The respective optimization problem, consisting in minimizing the broadcasting route length along with maximizing the number of ships communicating through the route, is solved by scalarizing the two criteria. The scalarization consists in standardizing the two criteria and calculating the distance of every achievable standardized efficient solution to the unachievable standardized solution. The percentage of two or more disconnected subgraphs is about 60%, whereas it is about 80% probable that the number of efficient solutions is equal to the number of disconnected subgraphs.

An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks

We present a new approximation algorithm for the Minimum Energy Broadcast Routing (MEBR) problem in ad hoc wireless networks that achieves an exponentially better approximation factor compared to the well-known Minimum Spanning Tree (MST) heuristic. Namely, for any instance where a minimum spanning tree of the set of stations is guaranteed to cost at most ρ ≥ 2 times the cost of an optimal solution for MEBR, we prove that our algorithm achieves an approximation ratio bounded by 2lnρ-2 ln 2 + 2. This result is particularly relevant for its consequences on Euclidean instances where we significantly improve previous results. In this respect, our experimental analysis confirms the better performance of the algorithm also in practice.

MINIMUM ENERGY BROADCAST ROUTING IN AD HOC AND SENSOR NETWORKS WITH DIRECTIONAL ANTENNAS

In this paper we discuss minimum energy broadcast routing with directional antennas in ad hoc and sensor networks. We assume that the network consists of sensor nodes whose antennas are switched beam directional antennas. The problem of our concern is: a given set V with n nodes and each node vi has l(i) transmission directions (i.e. the antenna sectors) and a broadcast request sourced at s, how to find a broadcast tree rooted at s and spanning all nodes in V such that the total energy is minimized. This problem involves with the choice of transmitting nodes and their transmission directions, which is NP-hard. We firstly propose a directed Steiner tree-based approximation algorithm for this problem and discuss its distributed implementation. Then we also propose a |V|-approximation algorithm and one heuristic with lower time complexities. Extensive simulations have demonstrated the efficiency of our algorithms.

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.

Tightening the upper bound for the minimum energy broadcasting

In this paper we present a new upper bound on the approximation ratio of the Minimum Spanning Tree heuristic for the basic problem on Ad-Hoc Networks given by the Minimum Energy Broadcast Routing (MEBR). We introduce a newanalysis allowing to establish a 6.33-approximation ratio in the 2-dimensional case, thus decreasing the previously known 7.6 upper bound [4], almost closing the gap with the lower bound of 6 [12].

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.