Power-Aware Broadcasting in Mobile Ad Hoc Networks∗
01 Jan 1999-
TL;DR: This paper shows that using five different power-aware metrics based on battery power consumption at nodes for determining broadcast routes in wireless ad hoc networks reduces the cost/broadcast of routing packets to all destinations by 5-50% over a broadcast tree constructed using a greedy strategy based on network topology information only.
Abstract: In this paper we present five different power-aware metrics based on battery power consumption at nodes for determining broadcast routes in wireless ad hoc networks. We show that using these metrics in a power-aware broadcasting algorithm reduces the cost/broadcast of routing packets to all destinations by 5-50% over a broadcast tree constructed using a greedy strategy based on network topology information only (this cost reduction is on top of a 40-70% reduction in energy consumption obtained by using PAMAS, our MAC layer protocol). We also show that the maximum node cost after many broadcasts is reduced by 20-150% with the power-aware algorithm compared to the nonpower-aware algorithm, thereby increasing the life of the network significantly. For comparison purposes, we also ran simulations with the flooding algorithm for broadcasting which performs worse by a factor of 10 compared to the power-aware algorithm. An interesting property of using power-aware broadcasting is that the average packet delays do not increase. Technical Subject Area: Adaptive Traffic and Access Control Protocol, Radio Resource Management
Citations
More filters
TL;DR: A comprehensive summary of recent work addressing energy efficient and low-power design within all layers of the wireless network protocol stack of wireless networks is presented.
Abstract: Wireless networking has witnessed an explosion of interest from consumers in recent years for its applications in mobile and personal communications. As wireless networks become an integral component of the modern communication infrastructure, energy efficiency will be an important design consideration due to the limited battery life of mobile terminals. Power conservation techniques are commonly used in the hardware design of such systems. Since the network interface is a significant consumer of power, considerable research has been devoted to low-power design of the entire network protocol stack of wireless networks in an effort to enhance energy efficiency. This paper presents a comprehensive summary of recent work addressing energy efficient and low-power design within all layers of the wireless network protocol stack.
958 citations
Cites background or methods from "Power-Aware Broadcasting in Mobile ..."
...A broadcast tree approach is presented in [52], in which the tree is constructed starting from a source and expanding to the neighbor that has the lowest cost per outgoing degree, where the cost associated with each mobile increases as the mobile consumes more power....
[...]
...Addressed in [52] is the routing of broadcast traffic in terms of power consumption....
[...]
...Another method to improve energy performance is to take advantage of the broadcast nature of the network for broadcast and multicast traffic as in [52,66]....
[...]
...Therefore, the authors of [52] propose that it is more beneficial to spend some energy in gathering topology information in order to determine the most efficient broadcast tree....
[...]
23 Sep 2002
TL;DR: A new heuristic is described, Embedded Wireless Multicast Advantage, that compares well with other proposals and is explained how it can be distributed, and a formal proof that the problem of power-optimal broadcast is NP-complete is provided.
Abstract: In all-wireless networks a crucial problem is to minimize energy consumption, as in most cases the nodes are battery-operated. We focus on the problem of power-optimal broadcast, for which it is well known that the broadcast nature of the radio transmission can be exploited to optimize energy consumption. Several authors have conjectured that the problem of power-optimal broadcast is NP-complete. We provide here a formal proof, both for the general case and for the geometric one; in the former case, the network topology is represented by a generic graph with arbitrary weights, whereas in the latter a Euclidean distance is considered. We then describe a new heuristic, Embedded Wireless Multicast Advantage. We show that it compares well with other proposals and we explain how it can be distributed.
530 citations
22 Apr 2001
TL;DR: By exploring geometric structures of Euclidean MSTs, it is proved that the approximation ratio of MST is between 6 and 12, and the approximation ratios of BIP is between /sup 13///sub 3/ and 12; these are the first analytical results for minimum-energy broadcasting.
Abstract: 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 routes which requires the lowest total energy consumption. This optimization problem is referred to as minimum-energy routing. While minimum-energy unicast routing can be solved in polynomial time by shortest-path algorithms, it remains open whether minimum-energy broadcast routing can be solved in polynomial time, despite the NP-hardness of its general graph version. Previously three greedy heuristics were proposed in Wieselthier et al. (2000): MST (minimum spanning tree), SPT (shortest-path tree), and BIP (broadcasting incremental power). They have been evaluated through simulations in Wieselthier et al.], but little is known about their analytical performance. The main contribution of this paper is the 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 /sup 13///sub 3/ and 12. On the other hand, the approximation ratio of SPT is shown to be at least /sup n///sub 2/, where n is the number of receiving nodes. To our best knowledge, these are the first analytical results for minimum-energy broadcasting.
415 citations
Cites background from "Power-Aware Broadcasting in Mobile ..."
...Introduction Ad hoc wireless networks have received significant attention in recent years due to their potential applications in battlefield, emergency disaster relief and etc [7] [8]....
[...]
...This problem is referred to as the Minimum-Energy Routing [7] [8]....
[...]
TL;DR: By exploring geometric structures of Euclidean MSTs, it is proved that the approximation ratio of MST is between 6 and 12, and the approximation ratios of BIP is between 13/3 and 12; these are the first analytical results for the minimum-energy broadcasting problem.
Abstract: 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.
204 citations
Cites background or methods from "Power-Aware Broadcasting in Mobile ..."
...Ad hoc wireless networks have received significant attention in recent years due to their potential applications in battlefield, emergency disaster relief and other applications [10,11]....
[...]
...This problem is referred to as Minimum-Energy Routing [7,10,11]....
[...]
...However, for broadcast applications (in general multicast applications), Minimum-Energy Routing is far more challenging....
[...]
References
More filters
01 Jan 1994
TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
8,614 citations
01 Jan 1996
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
8,256 citations
09 Apr 1997
TL;DR: The proposed protocol is a new distributed routing protocol for mobile, multihop, wireless networks that is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks.
Abstract: We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each computation consisting of a sequence of directed link reversals. The protocol is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks. In these networks, the protocol's reaction to link failures typically involves only a localized "single pass" of the distributed algorithm. This capability is unique among protocols which are stable in the face of network partitions, and results in the protocol's high degree of adaptivity. This desirable behavior is achieved through the novel use of a "physical or logical clock" to establish the "temporal order" of topological change events which is used to structure (or order) the algorithm's reaction to topological changes. We refer to the protocol as the temporally-ordered routing algorithm (TORA).
2,211 citations
01 Oct 1994
TL;DR: This paper studies media access protocols for a single channel wireless LAN being developed at Xerox Corporation's Palo Alto Research Center and develops a new protocol, MACAW, which uses an RTS-CTS-DS-DATA-ACK message exchange and includes a significantly different backoff algorithm.
Abstract: In recent years, a wide variety of mobile computing devices has emerged, including portables, palmtops, and personal digital assistants. Providing adequate network connectivity for these devices will require a new generation of wireless LAN technology. In this paper we study media access protocols for a single channel wireless LAN being developed at Xerox Corporation's Palo Alto Research Center. We start with the MACA media access protocol first proposed by Karn [9] and later refined by Biba [3] which uses an RTS-CTS-DATA packet exchange and binary exponential back-off. Using packet-level simulations, we examine various performance and design issues in such protocols. Our analysis leads to a new protocol, MACAW, which uses an RTS-CTS-DS-DATA-ACK message exchange and includes a significantly different backoff algorithm.
2,000 citations