Sink-Connected Barrier Coverage Optimization for Wireless Sensor Networks
This paper addresses the sink-connected barrier coverage optimization problem, which is concerned with how to select randomly deployed sensor nodes of a Wireless Sensor Network (WSN) to reach two optimization goals: to maximize the degree of barrier coverage by the minimum number of detecting nodes, and to make the detecting nodes sink-connected by the minimum number of forwarding nodes. The detecting nodes are those for detecting intruders crossing the boundary of a monitored region. On detecting intruders, they send intruding event notifications to one of the sink nodes with the help of the forwarding nodes relaying. An algorithm, called Optimal Node Selection Algorithm (ONSA), is proposed for solving the problem on the basis of the maximum flow minimum cost algorithm.