boolean formulation for sensor allocation problem and its efficient solver
This paper proposes a sensor allocation technique that can be applied to a sensor network constructed of many sensor nodes having multiple sensors. First, after describing the sensor network model, the problem is formulated. The formulation can handle the following two cases: (1) a minimum number of sensor nodes, and (2) a maximum number of sensor nodes, each of which uses only one or a few of its sensors. The formulation is based on 0-1 Integer Linear Programming. A dedicated solver using a Binary Decision Diagram (BDD) is also described. The proposed method can deal with the sudden death of a sensor and can rapidly reproduce optimal solutions without the dead sensor. According to the experimental results, all optimal and feasible solutions are obtained within 5 seconds in the case of 100 sensors.
bdd dynamic allocation combinational optimization