English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Approximating Energy Efficient Paths in Wireless Multi-hop Networks

Funke, S., Matijevic, D., & Sanders, P. (2003). Approximating Energy Efficient Paths in Wireless Multi-hop Networks. In Algorithms - ESA 2003: 11th Annual European Symposium (pp. 230-241). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

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

Files

show Files
hide Files
:
RadioESA03long.ps.gz (Any fulltext), 262KB
 
File Permalink:
-
Name:
RadioESA03long.ps.gz
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/gzip
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Funke, Stefan1, Author           
Matijevic, Domagoj1, Author           
Sanders, Peter1, Author           
Di Battista, Giuseppe, Editor
Zwick, Uri, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: Given the positions of $n$ sites in a radio network we consider the problem of finding routes between any pair of sites that minimize energy consumption and do not use more than some constant number $k$ of hops. Known exact algorithms for this problem required $\Omega(n \log n)$ per query pair $(p,q)$. In this paper we relax the exactness requirement and only require approximate $(1+\epsilon)$ solutions which allows us to derive schemes which guarantee constant query time using linear space and $O(n\log n)$ preprocessing time. The dependence on $\epsilon$ is polynomial in $1/\epsilon$. One tool used might be of independent interest: For any pair of points $(p,q)\in P\subseteq\mathbb{Z}^2$ report in constant time the cluster pair $(A,B)$ representing $(p,q)$ in a well-separated pair decomposition of $P$.

Details

show
hide
Language(s): eng - English
 Dates: 2004-06-152003
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 201834
Other: Local-ID: C1256428004B93B8-1EAC93284072E6C4C1256E150042DA25-Matijevic2003
 Degree: -

Event

show
hide
Title: ESA 2003
Place of Event: Budapest, Hungary
Start-/End Date: 2003-09-16 - 2003-09-19

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithms - ESA 2003: 11th Annual European Symposium
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 230 - 241 Identifier: ISBN: 3-540-20064-9

Source 2

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