Energy-Efficient Paths in Radio Networks

We consider a radio network consisting of n stations represented as the complete graph on a set of n points in the Euclidean plane with edge weightsω( p, q)=| pq|δ+ C p, for some constantδ>1 and nonnegative offset costs C p. Our goal is to find paths of minimal energy cost between any pair of poi...

Full description

Bibliographic Details
Published in:Algorithmica : an international journal in computer science, Vol. 61, No. 2 (2011), p. 298-319
Main Author: Beier, Rene
Other Involved Persons: Funke, Stefan ; Matijević, Domagoj ; Sanders, Peter
Format: electronic Article
Language:English
ISSN:1432-0541
Item Description:Preliminary versions of parts of the results described here were already published in the proceeding of 11th Annual European Symposium on Algorithms (see [16]) and the proceeding of 29th International Colloquium on Automata, Languages and Programming (see [5]).
Physical Description:Online-Ressource
DOI:10.1007/s00453-010-9414-0
Subjects:
QR Code: Show QR Code