| Summary: | 碩士 === 朝陽科技大學 === 資訊工程系碩士班 === 94 === In recent years, wireless sensor networks (WSNs) are gaining a lot of attention because of the myriad of possible applications in both military and civilian environments. WSNs are made up by a lot of high sensitive, small and ability of the fast reaction nodes. In WSNs, sensor nodes detect the information of environment of surrounding area, such as temperatures, sounds and the moving objects and then send that information to the base station. For many applications in wireless ad hoc and sensor networks, geocasting is an important and frequent communication service. The challenging problem in geocasting is distributing the packets to all the nodes within the geocast region with high probability but low overhead.
In addition, almost all of the energy-aware routing protocols that have been proposed for wireless sensor networks aim at optimizing network performance while relaying data to a stationary gateway (sink). However, mobility of the sink can make routes established through such contemporary protocols which are unstable and non-optimal. The use of mobile sink introduces a trade-off between the need for frequent re-routing to ensure optimal network operation and the desire for minimizing the overhead of topology management.
In order to reduce energy consumption and minimize the overhead of re-routing frequency, we proposed an energy-aware geocasting protocol for efficiently and continually data transmitting to a moving sink in WSNs. A sensor network of nodes with location information and limited energy is considered. Our approach is featured by utilizing location information and electing a special gateway in each grid area responsible of forwarding the geocast messages. We restrict the flooding region to decrease overhead for route decision by utilizing local information. When the sink moves to other locations, our approach conducts a trade-off between the frequency of network topology adjustment to maintain efficient route setup and the overhead that such adaptation introduces to the sensors. Finally, we will conduct some simulations to show that the proposed routing scheme outperforms coordination-based data dissemination protocol for wireless sensor networks (CODE) [30].
|
|---|
