Minimum-energy broadcasting in wireless networks in the d-dimensional Euclidean space (the alpha
(2006) Third Workshop, CAAN 2006 4235. p.112-124- Abstract
- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/588139
- author
- Lingas, Andrzej LU ; Persson, Mia LU and Wahlén, Martin LU
- organization
- publishing date
- 2006
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Combinatorial and Algorithmic Aspects of Networking / Lecture Notes in Computer Science
- editor
- Erlebach, Thomas
- volume
- 4235
- pages
- 112 - 124
- publisher
- Springer
- conference name
- Third Workshop, CAAN 2006
- conference location
- Chester, United Kingdom
- conference dates
- 2006-07-02
- external identifiers
-
- wos:000244717200010
- scopus:77049104302
- ISBN
- 978-3-540-48822-4
- DOI
- 10.1007/11922377_10
- project
- VR 2005-4085
- language
- English
- LU publication?
- yes
- id
- a7f3aec8-0566-405c-ad88-a286139b8f75 (old id 588139)
- date added to LUP
- 2016-04-04 10:00:38
- date last changed
- 2022-01-29 19:37:30
@inproceedings{a7f3aec8-0566-405c-ad88-a286139b8f75, abstract = {{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.}}, author = {{Lingas, Andrzej and Persson, Mia and Wahlén, Martin}}, booktitle = {{Combinatorial and Algorithmic Aspects of Networking / Lecture Notes in Computer Science}}, editor = {{Erlebach, Thomas}}, isbn = {{978-3-540-48822-4}}, language = {{eng}}, pages = {{112--124}}, publisher = {{Springer}}, title = {{Minimum-energy broadcasting in wireless networks in the d-dimensional Euclidean space (the alpha}}, url = {{http://dx.doi.org/10.1007/11922377_10}}, doi = {{10.1007/11922377_10}}, volume = {{4235}}, year = {{2006}}, }