Improved approximation algorithms for maximum lifetime problems in wireless networks

Zeev Nutov, Michael Segal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithmic Aspects of Wireless Sensor Networks - 5th International Workshop, ALGOSENSORS 2009, Revised Selected Papers
Pages41-51
Number of pages11
DOIs
StatePublished - 1 Dec 2009
Externally publishedYes
Event5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS 2009 - Rhodes, Greece
Duration: 10 Jul 200911 Jul 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5804 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS 2009
Country/TerritoryGreece
CityRhodes
Period10/07/0911/07/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Improved approximation algorithms for maximum lifetime problems in wireless networks'. Together they form a unique fingerprint.

Cite this