Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Minimum-energy broadcasting in wireless networks in the d-dimensional Euclidean space (the alpha

In English

Författare

Redaktör

  • Thomas Erlebach

Summary, in English

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.

Avdelning/ar

  • Computer Science

Publiceringsår

2006

Språk

Engelska

Sidor

112-124

Publikation/Tidskrift/Serie

Combinatorial and Algorithmic Aspects of Networking / Lecture Notes in Computer Science

Volym

4235

Dokumenttyp

Konferensbidrag

Förlag

Springer

Ämne

  • Computer Science

Conference name

Third Workshop, CAAN 2006

Conference date

2006-07-02

Conference place

Chester, United Kingdom

Status

Published

Projekt

  • VR 2005-4085

ISBN/ISSN/Övrigt

  • ISBN: 978-3-540-48822-4