Sciweavers

Share
ALGOSENSORS
2009
Springer

Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks

12 years 5 days ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced after each transmission, depending on the transmission distance. One of the major problems in wireless network design is to route network traffic efficiently so as to maximize the network lifetime, i.e., the number of successful transmissions. In this paper we consider Rooted Maximum Lifetime Broadcast/Convergecast problems in wireless settings. The instance consists of a directed graph G = (V, E) with edge-weights {w(e) : e ∈ E}, node capacities {b(v) : v ∈ V }, and a root r. The goal is to find a maximum size collection {T1, . . . , Tk} of Broadcast/Convergecast trees rooted at r so that k i=1 w(δTi (v)) ≤ b(v), where δT (v) is the set of edges leaving v in T. In the Single Topology version all the Broadcast/Convergecast trees Ti are identical. We present a number of polynomial time algorithms givin...
Zeev Nutov, Michael Segal
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where ALGOSENSORS
Authors Zeev Nutov, Michael Segal
Comments (0)
books