Paper Info
Title
The range assignment problem in non-homogeneous static ad-hoc networks
Abstract
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.
Year
DOI
Keywords
2004
10.1109/IPDPS.2004.1303265
ad hoc networks,travelling salesman problems,nonhomogeneous static ad-hoc networks,range assignment problem
Field
DocType
ISBN
Weapon target assignment problem,Wireless network,Computer science,Scheduling (computing),Generalized assignment problem,Euclidean distance,Assignment problem,Wireless ad hoc network,Linear bottleneck assignment problem,Distributed computing
Conference
0-7695-2132-0
Citations 
PageRank 
References 
10
0.48
15
Authors
7
Name
Order
Citations
PageRank
Christoph Ambühl135718.50
Andrea E. F. Clementi2116885.30
Miriam di Ianni314417.27
Gianluca Rossi423521.60
Angelo Monti567146.93
Riccardo Silvestri6132490.84
Di Ianni, M.7160.99