Energy‐Efficient Paths in Radio Networks

0.00 Avg rating—0 Votes

Article ID:	iaor20118128
Volume:	61
Issue:	2
Start Page Number:	298
End Page Number:	319
Publication Date:	Oct 2011
Journal:	Algorithmica
Authors:	Sanders Peter, Funke Stefan, Beier Rene, Matijevic Domagoj
Keywords:	graphs

Abstract:

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 points that do not use more than some given number k of hops.

Reviews

Required fields are marked *. Your email address will not be published.