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...
|Published in:||Algorithmica : an international journal in computer science, Vol. 61, No. 2 (2011), p. 298-319|
|Other Involved Persons:||; ;|
|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 ) and the proceeding of 29th International Colloquium on Automata, Languages and Programming (see ).|
|QR Code:||Show QR Code|