## Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks (2005)

Venue: | MOBILE NETWORKS AND APPLICATIONS |

Citations: | 16 - 0 self |

### BibTeX

@ARTICLE{Kang05maximizingnetwork,

author = {Intae Kang and Radha Poovendran},

title = { Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks},

journal = {MOBILE NETWORKS AND APPLICATIONS },

year = {2005},

volume = {10},

number = {6},

pages = {879--896}

}

### OpenURL

### Abstract

We investigate the problem of extending the network lifetime of a single broadcast session over wireless stationary ad hoc networks where the hosts are not mobile. We define the network lifetime as the time from network initialization to the first node failure due to battery depletion. We provide through graph theoretic approaches a polynomial-time globally optimal solution, a variant of the minimum spanning tree (MST), to the problem of maximizing the static network lifetime. We make use of this solution to develop a periodic tree update strategy for effective load balancing and show that a significant gain in network lifetime over the optimal static network lifetime can be achieved. We provide extensive comparative simulation studies on parameters such as update interval and control overhead and investigate their impact on the network lifetime. The simulation results are also compared with an upper bound to the network lifetime.

### Citations

1414 |
Network Flows: Theory, Algorithms and Application
- Ahuja, Magnati, et al.
- 1993
(Show Context)
Citation Context ...can adaptively assign either very small or no transmit power to the nodes with scarce battery energies. (3) Although elegant formulations in unicasting [10] are possible using the network flow theory =-=[41]-=-, this is mainly due to the fact that the flow conservation property is satisfied in unicasting. To solve broadcast problems, we can not apply the network flow theory without modification, since the f... |

1321 | Energy-Efficient Communication Protocol for Wireless Microsensor Networks
- Heinzelman, Chadrakasan, et al.
- 2000
(Show Context)
Citation Context ...he important applications of wireless stationary ad hoc networks is wireless sensor networks [2,4,6,13]. The constraint of limited battery energy is one of the most salient feature of sensor networks =-=[6,8,13,24]-=-. Therefore, it is essential to develop efficient networking algorithms and protocols that are optimized for energy consumption. In this paper, we consider the wireless stationary ad hoc network stric... |

899 | Next century challenges: Scalable coordination in sensor networks - Estrin, Govindan, et al. - 1999 |

791 | Geography-informed Energy Conservation for Ad Hoc Routing
- Xu, Heidemann, et al.
- 2001
(Show Context)
Citation Context ...her periodically or whenever there are changes in the network topology). We note that other definitions of network lifetime used in the literature include (i) fraction of surviving nodes in a network =-=[6,12,17,20]-=- and (ii) mean expiration time [9], but these definitions are not used in this paper. 2.2. Energy dissipation model We will use a linear battery discharge model. We do not consider in our battery mode... |

763 | Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks - Chen, Jamieson, et al. - 2001 |

756 | Gps-less low cost outdoor localization for very small devices
- Bulusu, Heidemann, et al.
- 2000
(Show Context)
Citation Context ...that each node (host) in a wireless ad hoc network is equipped with an omnidirectional antenna. We assume each node acquires its location information either using GPS or other localization techniques =-=[42]-=-. The broadcast routing trees rooted at the source node are constructed using algorithms according to the different cost and optimization metrics that will be discussed in the subsequent sections. We ... |

585 | BPower-aware routing in mobile ad hoc networks
- Singh, Woo, et al.
- 1998
(Show Context)
Citation Context ..., energy-efficiency can be roughly achieved by routing traffic through a path where nodes have sufficient residual battery energy and by avoiding the inclusion of nodes with scarce energy in the path =-=[7,10,19]-=-. However, broadcasting requires that every node in the network be involved either as a receiver or as a relay node. Hence, it is important to design algorithms and link cost metrics so that they can ... |

549 | Minimum energy mobile wireless networks - Rodoplu, Meng - 1999 |

535 | Topology control of multihop wireless networks using transmit power adjustment - Ramanathan, Rosales-Hain - 2000 |

448 | Energy Conserving Routing in Wireless Ad-hoc Networks
- Chang, Tassiulas
- 2000
(Show Context)
Citation Context ...efully will provide valuable insights into designing link cost metrics to prolong network lifetime. A similar network lifetime maximization problem in unicast routing has been pursued in Chang et al. =-=[10]-=-. However, ∗ A preliminary version of this paper appeared in IEEE ICC 2003 [35]. This research was funded in part by NSF grant ANI-0093187, ONR award #: N00014-04-1-0479 and Collaborative Technology A... |

418 | On the construction of energy-efficient broadcast and multicast trees in wireless networks
- Wieselthier, Nguyen, et al.
- 2000
(Show Context)
Citation Context ...f the wireless medium using omnidirectional antennas, messages sent to a receiver reach every node within the transmission range for “free,” and this property is called “wireless broadcast advantage” =-=[5]-=-, which adds significant complexity to broadcast problems in wireless environments. (2) For unicast routing, energy-efficiency can be roughly achieved by routing traffic through a path where nodes hav... |

392 | Critical power for asymptotic connectivity in wireless networks”, Stochastic Analysis, Control, Optimization and Applications: A Volume
- Gupta, PR
- 1998
(Show Context)
Citation Context ...ested readers are referred to [15,35] for details. We note that for a given specific network topology, when Wij = Pij , the bottleneck edge weight µ ∗ corresponds to the “critical power” discussed in =-=[39]-=-. Corollary 1. If Ei(0) = constant,∀i ∈ N (EDEN), the minimum spanning tree is a globally optimal solution to the static network lifetime maximization problem. Lemma 1 shows that the MST is a sufficie... |

343 |
A distributed algorithm for minimum-weight spanning trees
- Gallager, Humblet, et al.
- 1983
(Show Context)
Citation Context ...ast routing tree solution for static network lifetime maximization problem. Note that distributed algorithms for minimum weight spanning tree over both undirected and directed graphs are presented in =-=[14]-=- and [27], respectively. To illustrate this point, figure 3 shows the topology τ = {(i,j) | Lij (0) ≥ L63(0),i ∈ N,j ∈ℵi} which consists of all links such that the link longevity is larger than L63(0)... |

319 |
Introduction to Algorithms (2nd Edition
- Cormen, Leiserson, et al.
- 2001
(Show Context)
Citation Context ...G, i.e., µ(TMST) = µ ∗ . The problem can be rephrased as showing whether TMST ∈ TBST holds. This is a standard problem in the graph theory and the proof is omitted. Interested readers are referred to =-=[15,35]-=- for details. We note that for a given specific network topology, when Wij = Pij , the bottleneck edge weight µ ∗ corresponds to the “critical power” discussed in [39]. Corollary 1. If Ei(0) = constan... |

313 | Distributed topology control for power efficient operation in multihop wireless ad hoc networks
- Wattenhofer, Li, et al.
- 2001
(Show Context)
Citation Context ...her periodically or whenever there are changes in the network topology). We note that other definitions of network lifetime used in the literature include (i) fraction of surviving nodes in a network =-=[6,12,17,20]-=- and (ii) mean expiration time [9], but these definitions are not used in this paper. 2.2. Energy dissipation model We will use a linear battery discharge model. We do not consider in our battery mode... |

203 | Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks
- Toh
- 2001
(Show Context)
Citation Context ...ges in the network topology). We note that other definitions of network lifetime used in the literature include (i) fraction of surviving nodes in a network [6,12,17,20] and (ii) mean expiration time =-=[9]-=-, but these definitions are not used in this paper. 2.2. Energy dissipation model We will use a linear battery discharge model. We do not consider in our battery model the nonlinear behavior of voltag... |

197 | Energy-Aware Wireless Micro-Sensor Networks - Raghunathan, Schurgers, et al. |

141 | A performance comparison study of ad hoc wireless multicast protocols
- Lee, Su, et al.
- 2000
(Show Context)
Citation Context ...he important applications of wireless stationary ad hoc networks is wireless sensor networks [2,4,6,13]. The constraint of limited battery energy is one of the most salient feature of sensor networks =-=[6,8,13,24]-=-. Therefore, it is essential to develop efficient networking algorithms and protocols that are optimized for energy consumption. In this paper, we consider the wireless stationary ad hoc network stric... |

136 | Flooding for reliable multicast in multi-hop ad hoc networks
- Ho, Obraczka, et al.
- 1999
(Show Context)
Citation Context ...of topology control problems in between. At one extreme, there is flooding with maximum transmit power (uncontrolled topology) where a network is most reliable at the cost of minimal network lifetime =-=[23]-=-. When trying to extend the network lifetime, it is critical to define what we mean by the lifetime of a network. In this paper, we adopt the definition of the network lifetime as the time to the firs... |

129 | Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
- Cagalj, Hubaux, et al.
- 2002
(Show Context)
Citation Context ...as been much progress in finding solutions for MINTOTAL transmit power. Theoretically, it has been proven that the construction of a broadcast routing tree with MINTOTAL transmit power is NP-complete =-=[21,25,26,34]-=-. On the other hand, several suboptimal, yet efficient, heuristic algorithms such as Broadcast Incremental Power (BIP) [5], Embedded Wireless Multicast Advantage (EWMA) [34] and Largest Expanding Swee... |

127 | Online power-aware routing in wireless Ad-hoc networks
- Li, Aslam, et al.
(Show Context)
Citation Context ..., energy-efficiency can be roughly achieved by routing traffic through a path where nodes have sufficient residual battery energy and by avoiding the inclusion of nodes with scarce energy in the path =-=[7,10,19]-=-. However, broadcasting requires that every node in the network be involved either as a receiver or as a relay node. Hence, it is important to design algorithms and link cost metrics so that they can ... |

113 |
On the shortest arborescence of a directed graph
- Chu, Liu
- 1965
(Show Context)
Citation Context ...callitamobile network; otherwise, we call it a stationary network to avoid confusion with the static network. For a directed graph, a directed spanning tree rooted at a node is called an arborescence =-=[28,29]-=-. Since a spanning tree is the minimal graph structure supporting the network connectivity, it is intuitively clear that a topology which maximizes the network lifetime should be a tree. Given a spann... |

111 | Minimum energy broadcast routing in static ad hoc wireless networks
- Wan, Călinescu, et al.
- 2001
(Show Context)
Citation Context ...as been much progress in finding solutions for MINTOTAL transmit power. Theoretically, it has been proven that the construction of a broadcast routing tree with MINTOTAL transmit power is NP-complete =-=[21,25,26,34]-=-. On the other hand, several suboptimal, yet efficient, heuristic algorithms such as Broadcast Incremental Power (BIP) [5], Embedded Wireless Multicast Advantage (EWMA) [34] and Largest Expanding Swee... |

103 | Energy concerns in wireless networks - Ephremides |

103 | Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks
- Blough, Santi
(Show Context)
Citation Context ...e, and constitute a viable (if not better) approach to MINTOTAL strategy. There exists another very interesting approach called the cell-based energy conservation techniques proposed by Blough et al. =-=[38]-=-. While 1 To the best knowledge of authors, our newly developed LESS algorithm constitutes currently the best performing heuristic algorithm in terms of total transmit power cost. theoretically intere... |

54 | A Comparison of Known Classes of Reliable Multicast Protocols
- Levine, Garcia-Luna-Aceves
- 1996
(Show Context)
Citation Context ...the network is not self-configurable, but the initial setup of a routing structure is used throughout the session. We pursue the similar questions as those raised in [31] in a broadcast routing setup =-=[5,6,8,22]-=- and try to answer which optimization criteria such as MINTOTAL transmit power or MINMAX transmit power lead to longer extended network lifetime. We observe that current research in energyefficient br... |

47 | Energy efficient battery management
- Chiasserini, Rao
- 2000
(Show Context)
Citation Context ... we take graph theoretic and heuristic approaches to solve the broadcast problem. Conceptually similar work in other fields includes the maximization of battery lifetime of multi-celled batteries. In =-=[31,32]-=-, the authors seek maximization of battery usage by comparing optimization criteria such as the minimizations880 KANG AND POOVENDRAN of the total (MINTOTAL) cost or maximum (MINMAX) cost at each insta... |

46 | Maximizing static network lifetime of wireless broadcast adhoc networks
- Kang, Poovendran
- 2003
(Show Context)
Citation Context ...ng network lifetime. A similar network lifetime maximization problem in unicast routing has been pursued in Chang et al. [10]. However, ∗ A preliminary version of this paper appeared in IEEE ICC 2003 =-=[35]-=-. This research was funded in part by NSF grant ANI-0093187, ONR award #: N00014-04-1-0479 and Collaborative Technology Alliance (CTA) from ARL under DAAD19-01-2-0011. All statements and opinions are ... |

33 |
Resource management in energylimited, bandwidth-limited, transceiver-limited wireless networks for session-based multicasting
- WIESELTHIER, NGUYEN, et al.
- 2002
(Show Context)
Citation Context ...work lifetime performance. We consider various cost and optimization metrics that extend the network lifetime and provide comprehensive simulation results. Our work is distinguishable from other work =-=[12,37]-=- in that we present detailed analyses of the impact on network lifetime of other crucial parameters such as tree update interval, network density, initial energy distribution and control overhead, whi... |

30 |
Computing shortest, fastest, and foremost journeys in dynamic networks
- Bui-Xuan, Ferreira, et al.
- 2003
(Show Context)
Citation Context ...work lifetime. The heuristic approach adopted in this section is not new. Similar ideas can be found in [7,9,12] including our earlier work [37]. Also some recent related developments can be found in =-=[43]-=-. However, the key differences between the earlier works and our current work are as follows: (i) At each update interval, we have a clear optimization principle, e.g., maximizing the static network l... |

27 |
Calculus of Variations: With Applications to Physics and Engineering. New York:Dover Pub
- Weinstock
- 1974
(Show Context)
Citation Context ... Considering that the formulation (13) is a functional of Pi(t) and (14) is an optimization of a system of functionals, we may need to approach this problem using the calculus of variation techniques =-=[40]-=-. However, since the constraint (15) requiring the network connectivity is a graph-theoretical concept, it is very challenging applying the conventional calculus of variation techniques. Note that fin... |

24 | Minimum-energy broadcast in simple graphs with limited node power
- Egecioglu, Gonzalez
- 2001
(Show Context)
Citation Context ...as been much progress in finding solutions for MINTOTAL transmit power. Theoretically, it has been proven that the construction of a broadcast routing tree with MINTOTAL transmit power is NP-complete =-=[21,25,26,34]-=-. On the other hand, several suboptimal, yet efficient, heuristic algorithms such as Broadcast Incremental Power (BIP) [5], Embedded Wireless Multicast Advantage (EWMA) [34] and Largest Expanding Swee... |

19 | A Framework for Optimal Battery Management for Wireless Nodes
- Adamou, Sarkar
- 2001
(Show Context)
Citation Context ... we take graph theoretic and heuristic approaches to solve the broadcast problem. Conceptually similar work in other fields includes the maximization of battery lifetime of multi-celled batteries. In =-=[31,32]-=-, the authors seek maximization of battery usage by comparing optimization criteria such as the minimizations880 KANG AND POOVENDRAN of the total (MINTOTAL) cost or maximum (MINMAX) cost at each insta... |

14 | A Worstcase Analysis of an MST-based Heuristic to Construct Energy-Efficient Broadcast Trees in Wireless Networks
- Clementi, Crescenzi, et al.
- 2001
(Show Context)
Citation Context |

8 | Architecural Strategies for Energy Efficient Packet Forwarding - Tsiatsis, Zimbeck, et al. |

2 |
On the lifetime extension of energy-constrained multihop broadcast networks
- Kang, Poovendran
(Show Context)
Citation Context ...work lifetime performance. We consider various cost and optimization metrics that extend the network lifetime and provide comprehensive simulation results. Our work is distinguishable from other work =-=[12,37]-=- in that we present detailed analyses of the impact on network lifetime of other crucial parameters such as tree update interval, network density, initial energy distribution and control overhead, whi... |

1 |
Finding optimum branchings, Networks 7(1977
- Tarjan
(Show Context)
Citation Context ...callitamobile network; otherwise, we call it a stationary network to avoid confusion with the static network. For a directed graph, a directed spanning tree rooted at a node is called an arborescence =-=[28,29]-=-. Since a spanning tree is the minimal graph structure supporting the network connectivity, it is intuitively clear that a topology which maximizes the network lifetime should be a tree. Given a spann... |

1 | Broadcast with heterogeneous node capability accepted to - Kang, Poovendran |