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.
|