| Summary: | 碩士 === 國立中央大學 === 資訊工程研究所 === 93 === In recent years, target tracking has been an important issue in research of wireless sensor networks. Users can use wireless sensor networks to keep the interesting target under surveillance. Once the target enters the sensing range of the sensor node, the sensing information will be recorded by the sensor nodes and forwarded to the sink node. Therefore, users can obtain the information from the sink node. However, some applications only need to record the information of a target entering or leaving a boundary for some specific regions. For example, zoologists want to know some kinds of wildlife migration or habitual behavior in a large-scale natural habitat, and then they can deploy a wireless sensor network to keep a long-term surveillance and get precious monitoring data. In this thesis, we proposed a distributed algorithm to find out the boundary nodes in a wireless sensor network. The selected boundary nodes are used to track the interesting targets (wildlife) when they enter or leave a boundary of the wireless sensor network. The information of wildlife entering or leaving the monitoring regions will be recorded and forwarded to the sink node by the boundary sensor nodes. Simulation results show that the proposed protocols have good performance in selecting boundary nodes. The number of selected boundary nodes almost closes to the optimal value. Besides, our protocol has the less total control overhead during selecting boundary nodes. As the size of the wireless sensor network is increasing, the time of selecting the boundary nodes using our protocol will not increase rapidly in our protocol.
|
|---|
