The range assignment problem in non-homogeneous static ad-hoc networks

Range assignment problems in Ad-Hoc wireless networks have been the subject of several recent stud-ies. All these studies deal with the homogeneous case, i.e., all stations share the same energy cost function. However, this assumption does not well model real-istic scenarios in which the energy cost of a station varies dramatically depending on the particular envi-roment conditions of its location. We thus introduce the weighted version of the range assignment problem in which the cost a station s pays to transmit to an-other station depends on the distance between the sta-tions and on the energy cost of station s. We provide a set of algorithmic results for this version of the range assignment problems and discuss some interesting re-lated open questions. This work is partially funded by the Information Societ