
摘要： 
This talk introduces the first algorithm to solve the sinkconnected 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: (1) to maximize the degree of barrier coverage by the minimum number of detecting nodes, and (2) to make the detecting nodes sinkconnected by the minimum number of forwarding nodes. The detecting nodes are those for detecting intruders crossing a monitored belt region. On detecting intruders, they send intruding event notifications to one of the sink nodes with the help of the forwarding nodes relaying. The introduced algorithm, called the optimal node selection algorithm (ONSA), is based on the maximum flow minimum cost algorithm. We prove the optimality of ONSA, perform simulations for ONSA, and compare the simulation results with those of a related algorithm, the global determination algorithm (GDA). The results show that ONSA and GDA have similar packet delay and ONSA outperforms GDA in terms of the total energy consumption and the number of nodes required in constructing maximumdegree sinkconnected barrier coverage.
