Abstract : This paper studies the construction of powerefficient 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.
https://hal.inria.fr/inria-00501499
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Soumis le : lundi 12 juillet 2010 - 11:24:16
Dernière modification le : samedi 17 février 2018 - 17:46:02
Document(s) archivé(s) le : jeudi 14 octobre 2010 - 15:32:06
Liron Levin, Michael Segal, Hanan Shpungin. Optimizing Performance of Ad-hoc Networks Under Energy and Scheduling Constraints. WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2010, Avignon, France. pp.110-119, 2010. 〈inria-00501499〉
