SUMMARY
We consider the sensor deployment problem in the context of distance uncertainty. It is characterized by differentiated arrangement of specific detection probability thresholds at different locations. The problem is formulated as an integer linear programming (ILP) model firstly, aiming at optimizing the number of sensors and their locations. Based on the robust discrete optimization methodology, the uncertain model is transformed into an equivalent ILP problem considering distance uncertainty. The proposed approach can control the tradeoff between optimality and robustness by varying the parameters named protection levels. Uniform and non-uniform event detection probabiliy distributions are considered in the experiment. The results show that, as the distance uncertainty increases, the constraint violation can be avoided in the robust model and the robust solution can provide a significant improvement at the expense of a small loss in optimality when compared to the optimal solution of a deterministic scenario.