Name
Abstract | ||
|---|---|---|
Sensors in a data fusion environment over hostile territory are geographically dispersed and change location with time. To collect and process data from these sensors, an equally flexible network of fusion beds (i.e., clusterheads) is required. To account for the hostile environment, we allow communication links between sensors and clusterheads to be unreliable. We develop a mixed-integer linear programming (MILP) model to determine the clusterhead location strategy that maximizes the expected data covered minus the clusterhead reassignments, over a time horizon. A column generation (CG) heuristic is developed for this problem. Computational results show that CG performs much faster than a standard commercial solver, and the typical optimality gap for large problems is less than 5%. Improvements to the basic model in the areas of modeling link failure, consideration of bandwidth capacity, and clusterhead changeover cost estimation are also discussed. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1287/opre.1040.0171 | Operations Research |
Keywords | Field | DocType |
basic model,clusterhead changeover cost estimation,data fusion environment,military applications,process data,expected data,wireless ad hoc networks,maximal expected cov- erage.,fusion bed,clusterhead reassignments,hostile environment,change location,clustering sensors,threat environment,clusterhead location strategy,column generation,wireless ad hoc network,data fusion,cost estimation | Mathematical optimization,Column generation,Heuristic,Time horizon,Algorithm,Sensor fusion,Integer programming,Solver,Wireless ad hoc network,Cluster analysis,Mathematics,Distributed computing | Journal |
Volume | Issue | ISSN |
53 | 3 | 0030-364X |
Citations | PageRank | References |
6 | 0.63 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dipesh J. Patel | 1 | 6 | 0.63 |
| Rajan Batta | 2 | 849 | 89.39 |
| Rakesh Nagi | 3 | 443 | 45.82 |