TY - GEN

T1 - Improved approximation algorithms for maximum lifetime problems in wireless networks

AU - Nutov, Zeev

AU - Segal, Michael

N1 - Funding Information:
We thank anonymous referees for their valuable comments that significantly improved the presentation of the paper. The second author was supported in part by US Air Force, European Office of Aerospace Research and Development, Grant# FA8655-09-1-3016.

PY - 2009/12/1

Y1 - 2009/12/1

N2 - 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}, and a root r. The goal is to find a maximum size collection {T 1, ..., T k } of Broadcast/Convergecast trees rooted at r so that ∑i=1k w(δTi(υ)) ≤ b (υ),, where δ T (υ) is the set of edges leaving υ in T. In the Single Topology version all the Broadcast/Convergecast trees T i are identical. We present a number of polynomial time algorithms giving constant ratio approximation for various broadcast and convergecast problems, improving previously known result of Ω(⌊1/log n ⌋)-approximation by [1]. We also consider a generalized Rooted Maximum Lifetime Mixedcast problem, where we are also given an integer γ≥ 0, and the goal is to find the maximum integer k so that k Broadcast and γk Convergecast rounds can be performed.

AB - 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}, and a root r. The goal is to find a maximum size collection {T 1, ..., T k } of Broadcast/Convergecast trees rooted at r so that ∑i=1k w(δTi(υ)) ≤ b (υ),, where δ T (υ) is the set of edges leaving υ in T. In the Single Topology version all the Broadcast/Convergecast trees T i are identical. We present a number of polynomial time algorithms giving constant ratio approximation for various broadcast and convergecast problems, improving previously known result of Ω(⌊1/log n ⌋)-approximation by [1]. We also consider a generalized Rooted Maximum Lifetime Mixedcast problem, where we are also given an integer γ≥ 0, and the goal is to find the maximum integer k so that k Broadcast and γk Convergecast rounds can be performed.

UR - http://www.scopus.com/inward/record.url?scp=77049122556&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-05434-1_6

DO - 10.1007/978-3-642-05434-1_6

M3 - Conference contribution

AN - SCOPUS:77049122556

SN - 3642054331

SN - 9783642054334

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 41

EP - 51

BT - Algorithmic Aspects of Wireless Sensor Networks - 5th International Workshop, ALGOSENSORS 2009, Revised Selected Papers

T2 - 5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS 2009

Y2 - 10 July 2009 through 11 July 2009

ER -