@inbook{fa27b7251c294be98ad5673432bf8258,

title = "Efficient algorithms for low-energy bounded-hop broadcast in Ad-Hoc wireless networks",

abstract = "The paper studies the problem of computing a minimal energy cost range assignment in a ad-hoc wireless network which allows a station s to perform a broadcast operation in at most h hops. The general version of the problem (i.e., when transmission costs are arbitrary) is known to be log-APX hard even for h = 2. The current paper considers the well-studied real case in whicli n stations are located on the plane and the cost to transmit from station i to station j is proportional to the α-th power of the distance between station i and j, where a is any positive constant. A polynomial-time algorithm is presented for finding an optimal range assignment to perform a 2-hop broadcast from a given source station. The algorithm relies on dynamic programming and operates in (worst-case) time O(n7). Then, a polynomial-time approximation scheme (PTAS) is provided for the above problem for any fixed h ≥ 1. For fixed h ≥ 1 and ∈ > 0, the PTAS has time complexity O(nμ) where μ = O((α2αhα/∈) αh).",

author = "Christoph Amb{\"u}hl and Clementi, {Andrea E.F.} and {Di Ianni}, Miriam and Nissan Lev-Tov and Angelo Monti and David Peleg and Gianluca Rossi and Riccardo Silvestri",

year = "2004",

doi = "10.1007/978-3-540-24749-4_37",

language = "אנגלית",

isbn = "9783540212362",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "418--427",

editor = "Volker Diekert and Michel Habib",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "גרמניה",

}