Resumen de Min-energy Broadcast in Fixed-trajectory Mobile Ad-hoc Networks

J.M. Díaz Báñez, Ruy Fabila Monroy, D. Flores Peñaloza, M.A. Heredia, Jaime Urrutia Fucugauchi

• 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.