The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

På svenska

Author

Editor

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

Department/s

  • Computer Science

Publishing year

2006

Language

English

Pages

112-124

Publication/Series

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

Volume

4235

Document type

Conference paper

Publisher

Springer

Topic

  • Computer Science

Conference name

Third Workshop, CAAN 2006

Conference date

2006-07-02

Conference place

Chester, United Kingdom

Status

Published

Project

  • VR 2005-4085

ISBN/ISSN/Other

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