The range assignment problem in non-homogeneous static ad-hoc networks
Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Del Rossi, Angelo Monti, Riccardo Silvestri · 2004
Summary form only given. We introduce the weighted version of the range assignment problem in which the cost a station s pays to transmit to another station depends on the distance between the stations and on the energy cost of station s. Most of the algorithm results for the unweighted range assignment problem can not be applied to the weighted version. We thus provide a set of algorithmic results for this version and discuss some interesting related open questions.