Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The α≤d Case)
verfasst von : Andrzej Lingas, Mia Persson, Martin Wahlen
Erschienen in: Combinatorial and Algorithmic Aspects of Networking
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We consider the problem of minimizing the total energy assigned to nodes of wireless network so that broadcasting from the source node to all other nodes is possible. This problem has been extensively studied especially under the assumption that the nodes correspond to points in the Euclidean two- or three-dimensional space and the broadcast range of a node is proportional to at most the
α
root of the energy assigned to the node where
α
is not less than the dimension
d
of the space. In this paper, we study the case
α
≤
d
, providing several tight upper and lower bounds on approximation factors of known heuristics for minimum energy broadcasting in the
d
-dimensional Euclidean space.