Lifetime maximization of wireless sensor networks while ensuring intruder detection

Wireless sensor networks (WSN) have a wide variety of application areas and one of these areas is border crossing security. Unauthorized crossing of border areas, unauthorized arms and drug trafficking can be avoided at a lower cost and easier than conventional methods by monitoring the borders with the help of a WSN. In this study, we offer a mathematical model that guarantees the detection of possible intruders by scheduling the activities of the sensors whatever the route the intruder follows throughout the border zone or whatever the time the intruder enters to the route. To achieve the highest possible WSN management efficiency, we integrate coverage, routing, data routing, and sensor scheduling WSN design issues into the mathematical model. We first demonstrate the effectiveness of scheduling the sensors by the help of the offered mathematical model by comparing it against a random activity schedule of the sensors with respect to network lifetime and intruder detection ratio performance measures. We also develop a Lagrangean heuristic strategy to solve realistic sized instances of the proposed problem. We produce several random border zone instances with varying sizes and test the proposed solution strategy to illustrate the effectiveness of the offered solution strategy by comparing its performance against the performance of a commercial mixed-integer linear programming (MILP) solver.