Min-energy Broadcast in Fixed-trajectory Mobile Ad-hoc Networks
-
J.M. Díaz Ibáñez [1] ; R. Fabila Monroy [2] ; D. Flores Peñaloza [2] ; M.A. Heredia [2] ; J. Urrutia [2]
-
[1] Universidad de Sevilla
Universidad de Sevilla
Sevilla, España
-
[2] Universidad Nacional Autónoma de México
Universidad Nacional Autónoma de México
México
-
- Localización: XIII Encuentros de Geometría Computacional: Zaragoza, del 29 de junio al 1 de julio de 2009 / Alfredo García Olaverri (ed. lit.)
, Javier Tejel Altarriba (ed. lit.) , 2009, ISBN 978-84-92774-11-1, págs. 75-82 - Idioma: inglés
- Texto completo no disponible (Saber más ...)
-
Resumen
This paper concerns about mobile ad-hoc wireless networks, but with the added restriction that each radio station has a rectilinear trajectory. We focus on the problem of computing an optimal range assignment for the stations, which allows to perform a broadcast operation from a source station, while the overall energy deployed is minimized. An O(n3 log n)-time algorithm for this problem is presented, under the assumption that all stations have equally sized transmission ranges. However, we prove that the general version of the problem is NP-hard, and it is not approximable within a sub-logarithmic factor (unless P=NP). We then consider a special case of the general problem (also NP-hard), and present an approximation algorithm whose approximation factor is (ln n + 1)m, where m is the size of the optimum solution.
