An Obstacle-Avoidance Routing Protocol in Wireless Sensor Network

碩士 === 國立中央大學 === 資訊工程研究所 === 99 === In wireless sensor networks, an important challenge often faced in geographic routing is the “local minimum phenomenon” which is caused by obstacles. For solving this problem, most obstacle-avoiding schemes route packets along the perimeter of obstacles or forbid...

Full description

Bibliographic Details
Main Authors: Chi-Wei Chen, 陳佳偉
Other Authors: Guey-Yun Chang
Format: Others
Language:en_US
Published: 2010
Online Access:http://ndltd.ncl.edu.tw/handle/93234719050404182464
Description
Summary:碩士 === 國立中央大學 === 資訊工程研究所 === 99 === In wireless sensor networks, an important challenge often faced in geographic routing is the “local minimum phenomenon” which is caused by obstacles. For solving this problem, most obstacle-avoiding schemes route packets along the perimeter of obstacles or forbidden regions. Thus, sensor nodes on the perimeter of obstacles and forbidden regions exhaust their energy faster than others, which enlarge the hole size, called growing hole problem. In this paper, we propose an discrete energy-efficient Obstacle Avoiding Routing Protocol (OARP) to disperse energy consumption of sensor nodes on the perimeter of obstacles for solving growing hole problem, and prolong the network lifetime.