| DC 欄位 |
值 |
語言 |
| DC.contributor | 資訊工程學系 | zh_TW |
| DC.creator | 陳佳偉 | zh_TW |
| DC.creator | Chi-Wei Chen | en_US |
| dc.date.accessioned | 2010-11-26T07:39:07Z | |
| dc.date.available | 2010-11-26T07:39:07Z | |
| dc.date.issued | 2010 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=975202092 | |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 無線感測網路具有價格便宜以及易於佈建的特性，因此在近幾年已成為一項被廣泛討論的研究議題，特別是在一些危險或是難以到達的區域，無法以人力佈建之處，常見的方法是空拋感測器的方式建立無線感測網路。
在實際的場景中可能存在著山丘、湖泊等障礙物，導致感測器的佈署不平均或是被破壞，使得無線感測網路拓樸存在空洞，多數現有的繞境協定會使其路徑集中於空洞周圍，使得空洞周圍節點電量很快被耗盡。
本篇論文提出一個分散式的方法分散空洞周圍節點電量消耗，以達到延長無線感測網路生命週期之目的。
| zh_TW |
| dc.description.abstract | 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.
| en_US |
| DC.subject | 分散式演算法 | zh_TW |
| DC.subject | 繞徑演算法 | zh_TW |
| DC.subject | 無線感測網路 | zh_TW |
| DC.subject | wire | en_US |
| DC.subject | Distributed algorithms | en_US |
| DC.subject | geographic routing | en_US |
| DC.title | 無線感測網路克服障礙物及延長網路存活時間之繞徑協定 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | An Obstacle-Avoidance Routing Protocol in Wireless Sensor Network | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |