The detour routing algorithm for geographic sensor networks
| Autor: | Wen-Bin Li, 李文彬 |
|---|---|
| Rok vydání: | 2010 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 98 Due to sensor networks are deployed over various landforms, the barriers (holes) on the natural topography often cause existing geographic routing algorithms to fail. An important challenge often faced in greedy forwarding of geographic routing algorithms in sensor networks is the “local minima problem” which is caused by deployment holes. If we avoid sending the package to the nodes which will cause the local minima problem, then we can reduce the occurrence of dead end problem. In this paper, we propose a novel algorithm called Detour Routing based on Quadrantal Classification (DRQC), which is based on the geographic information of 2-Hop neighbors. The basic idea of DRQC is to divide sensors into two type of nodes ( Red node : no local minima problem. White node : may cause local minima problem ) and choose the red node first which is the closest to the destination in 2-Hop neighbors as the next Hop. We implement the DRQC algorithm and evaluate in sensor networks with different parameters. Simulation results show that our algorithm (DRQC) have higher packet delivery rate(96%) than traditional greedy forwarding algorithms (1-Hop Greedy (79%) and 2-Hop Greedy(87%) ), especially in sparsely-deployed networks. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|