Optimizing performance of ad-hoc networks under energy and scheduling constraints

Liron Levin, Michael Segal, Hanan Shpungin

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

    9 Scopus citations

    Abstract

    This paper studies the construction of power-efficient data gathering tree for wireless ad hoc networks. Because of their high communication cost and limited capacity, a fundamental requirement in such networks is designing energy efficient data-gathering algorithms to ensure long network survivability. Two possible models for the data gathering problem are explored: scheduling model and the energy model. In the scheduling model the goal is to minimize the makespan of the most congested node, while in the energy model the goal is to maximize the lifetime of the network. We present a number of provable approximation algorithms and show inapproximation bounds for various versions of data-gathering problem.

    Original languageEnglish
    Title of host publicationWiOpt 2010 - 8th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
    Pages11-20
    Number of pages10
    StatePublished - 27 Aug 2010
    Event8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2010 - Avignon, France
    Duration: 31 May 20104 Jun 2010

    Publication series

    NameWiOpt 2010 - 8th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks

    Conference

    Conference8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2010
    Country/TerritoryFrance
    CityAvignon
    Period31/05/104/06/10

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Computer Science Applications
    • Control and Optimization

    Fingerprint

    Dive into the research topics of 'Optimizing performance of ad-hoc networks under energy and scheduling constraints'. Together they form a unique fingerprint.

    Cite this