English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Bounded-hop Energy-efficient Broadcast in Low-dimensional Metrics Via Coresets

Funke, S., & Laue, S. (2007). Bounded-hop Energy-efficient Broadcast in Low-dimensional Metrics Via Coresets. In W. Thomas, & P. Weil (Eds.), STACS 2007 (pp. 272-283). Berlin: Springer. doi:10.1007/978-3-540-70918-3_24.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1E79-2 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0025-BD9B-7
Genre: Conference Paper

Files

show Files
hide Files
:
FL2007.pdf (Any fulltext), 5KB
 
File Permalink:
-
Name:
FL2007.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-
:
BroadcastDD.ps (Any fulltext), 5KB
 
File Permalink:
-
Name:
BroadcastDD.ps
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/postscript
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Funke, Stefan1, Author           
Laue, Sören1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We consider the problem of assigning powers to nodes of a wireless network in the plane such that a message from a source node s reaches all other nodes within a bounded number k of transmissions and the total amount of assigned energy is minimized. By showing the existence of a coreset of size we are able to (1 + ε)-approximate the bounded-hop broadcast problem in time linear in n which is a drastic improvement upon the previously best known algorithm. While actual network deployments often are in a planar setting, the experienced metric for several reasons is typically not exactly of the Euclidean type, but in some sense ’close’. Our algorithm (and others) also work for non-Euclidean metrics provided they exhibit a certain similarity to the Euclidean metric which is known in the literature as bounded doubling dimension. We give a novel characterization of such metrics also pointing out other applications such as space-efficient routing schemes. This work was supported by the Max Planck Center for Visual Computing and Communication (MPC-VCC) funded by the German Federal Ministry of Education and Research (FKZ 01IMC01).

Details

show
hide
Language(s): eng - English
 Dates: 2008-02-2820072007
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 356733
DOI: 10.1007/978-3-540-70918-3_24
Other: Local-ID: C12573CC004A8E26-7CAF38D9D2C68FA1C125728E0048C8FF-FL2007
 Degree: -

Event

show
hide
Title: 24th Annual Symposium on Theoretical Aspects of Computer Science
Place of Event: Aachen, Germany
Start-/End Date: 2007-02-22 - 2007-02-24

Legal Case

show

Project information

show

Source 1

show
hide
Title: STACS 2007
  Abbreviation : STACS 2007
  Subtitle : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007. Proceedings
Source Genre: Proceedings
 Creator(s):
Thomas, Wolfgang1, Editor
Weil, Pascal1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 272 - 283 Identifier: ISBN: 3-540-70917-6

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 4393 Sequence Number: - Start / End Page: - Identifier: ISSN: 0302-9743