| Summary: | 碩士 === 國立中央大學 === 資訊工程學系 === 101 === The optimal k-barrier coverage problem (OKBCP) deals with the selection of sensor nodes in wireless sensor network(WSN). The aim is to have any intruder who goes across monitoring area of the WSN detected by k or more detecting nodes. Based on the above scenario, the sink-connected barrier coverage optimization problem (SCBCOP) discusses how to select a minimal number of forwarding nodes, and ensure every detecting node with sink-connectivity to meet the safety requirements. Although there are algorithm (as optimal node selection algorithm, ONSA) that can be used to find optimal k-barrier coverage with sink-connectivity, the fact that multiple detecting nodes simultaneously transmit intrusion event could cause packet interference(or collision) and prevent intrusion event from being reported to the sink in real time. This study investigates methods for reducing interference and selecting routing paths among the nodes in optimal k-barrier coverage to satisfy sink-connectivity. To address the problems mentioned above, this study proposes the following strategies: 1) a multi-sinks forwarding routing trees algorithm to build routing paths and satisfy sink-connectivity. 2) a multi-channel and time-slot scheduling algorithm to further reduce the interference caused by packet transmission among sensors. This study employed the IEEE 802.15.4 module of OPNET simulator to simulate the performance of the proposed algorithms. Simulation results show that the proposed algorithm effectively reduces packet interference, and provides the lowest packet dropping rate and delay, as well as the highest throughput .
|
|---|
