Void-Less Routing Protocol for Position Based Wireless Sensor Network
Void-Less Routing Protocol for Position Based Wireless Sensor Network
- 주제(키워드) Position-based wireless sensor network , Greedy routing , Communication Void , Stuck node
- 주제(KDC) 569
- 주제(DDC) 621
- 발행기관 아주대학교
- 지도교수 이채우
- 발행년도 2007
- 학위수여년월 2007. 8
- 학위명 석사
- 학과 및 전공 일반대학원 전자공학과
- 본문언어 영어
초록/요약
Geographic wireless sensor networks use position information for Greedy routing. Greedy routing works well in dense network whereas in sparse network it may fail and require the use of recovery algorithms because recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costlier for resource constrained position based wireless sensor type networks. In the present work, we propose a Temporary Ordered Virtual Distance Upgrading (TOVDU) algorithm; a novel idea based on virtual distance upgrading that allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forward packet using greedy routing only without recovery algorithm. In TOVDU, the stuck node upgrades distance unless it finds next hop node which is closer to the destination than itself. TOVDU guarantees the packet delivery if there exists a topologically valid path. We use NS-2 to evaluate the performance and correctness of TOVDU and compared the performance with GPSR. Simulation results show that our proposed algorithm generates considerably shorter paths and lower energy consumption.
more목차
Table of contents
List of figure
List of table
List of Abbreviations
Abstract Page No.
I. Introduction 1
1. Greedy Routing 4
1.1 Greedy Routing Rule 4
1.2 Hello Protocol 5
2. Limitations of Greedy Forwarding and Communication Void problem 6
3. Contributions 7
4. Organization of this Dissertation 8
II. Literature Review 9
III. Temporally Ordered Virtual Distance Upgrading (TOVDU) Algorithm 26
1. Proposed Algorithm 27
2. Assumptions 28
3. Motivation 29
4. Distance Cost 30
5. Basic Functions 31
6. Working principle 32
7. TODVU Algorithm 36
IV. Simulation and Evaluation 40
1. Simulation Environment 40
2. TOVDU Performance 42
V. Conclusion and Future Work 50
REFERENCES
