Distributed Landmark Election and Routing Protocol in Wireless Sensor Networks
| Autor: | Jian-Da Lin, 林建達 |
|---|---|
| Rok vydání: | 2010 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 98 In wireless sensor networks, it is an important task to periodically collect data from an interesting area for time-critical applications, such as forest fire, military, etc. The sensed data must be gathered and transmitted to a base station for further processing to meet the end-user queries. If there are holes that the regions without any available sensor node in the environment, geographic routing can be efficient to deal with routing holes problem, but it needs sensor nodes to have location information, which is acquired from global positioning system (GPS). However, to make each sensor node equips a GPS device in a large-scale wireless sensor network is not applicable due to a GPS device is expensive in terms of size, cost and energy consumption compared with sensor node. Since sensor nodes are typically battery operated, extra GPS devices induce cost and energy consumption increase, it is challenging task to design an efficient routing scheme without GPS devices as well as provide hole avoiding solution. In this thesis, we consider the problem about landmark-based routing in wireless sensor networks (WSNs). It is important how efficiently elect some landmarks in the network. Besides, we also consider the regular and irregular holes in the environment. Simulation results show that our scheme can not only deal with routing holes problem but also achieve a better solution in construction of scalability, feasibility and energy efficiency in a large-scale wireless sensor network. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|