Title page for etd-0610109-130053
 論文名稱Title 無線感測網路中路徑覆蓋問題之研究The Worst-case and Best-case Coverage Problems in Wireless Sensor Networks 系所名稱Department 資訊管理學系Department of Information Management 畢業學年期Year, semester 97 學年度 第 2 學期The spring semester of Academic Year 97 語文別Language 英文English 學位類別Degree 博士Ph.D. 頁數Number of pages 56 研究生Author 侯雍聰Yung-tsung Hou 指導教授Advisor 召集委員Convenor 口試委員Advisory Committee 口試日期Date of Exam 2009-05-21 繳交日期Date of Submission 2009-06-10 關鍵字Keywords 無線感測網路、路徑覆蓋率、覆蓋率Worst-case coverage, Line Coverage, Wireless sensor networks, Best-case Coverage 統計Statistics 本論文已被瀏覽 5977 次，被下載 1785 次The thesis/dissertation has been browsed 5977 times, has been downloaded 1785 times.
 中文摘要 無線感測網路的應用遍及於不同的商業或是軍事領域，包括環境監測、災難監控、交通管制等等。而無線感測網路之服務品質取決於網路的覆蓋率，亦即感應器對監測事件的偵測能力。本論文研究無線感測網路的覆蓋率，包含以下兩個主題: (1) 如何佈署新的感測器以達到最佳覆蓋率改進; (2) 對於直線路徑如何適當的測量覆蓋率。此論文使用了計算幾何及圖論的方法來進行對最佳情況及最差情況下的覆蓋率問題，並証明此兩種問題可互相轉換成另一種問題。論文提出了有效率的多項式時間演算法來佈置新加入的感測器，新的佈署位置將可達到最佳的覆蓋率改善。而在某些感測網路的應用當中，感測目標物的移動路徑是直線路徑，例如高速公路監測或是飛彈攔截系統，這些應用需要對於直線行進路徑計算其覆蓋率。因此本論文提出新的平面掃描演算法來計算直線路徑下的無線感測網路路徑覆蓋率。 Abstract Wireless sensor networks provide a wide range of applications, such as environment surveillance, hazard monitoring, traffic control, and other commercial or military applications. The quality of service provided by a sensor network relies on its coverage, i.e., how well an event can be tracked by sensors. This research studies issues about sensor coverage: (1) how to optimally deploy new sensors in order to improve the coverage of an existing network, (2) how to properly measure the coverage when the path is a line. The best- and worst-case coverage problems that are related to the observability of a path are addressed and formulated into computational geometry problems. We prove that there exists a duality between the two coverage problems, and then solve the two problems together. The presented new-node placement algorithm is shown to deploy new nodes optimally in polynomial time. However, in some applications, such as highway monitoring and anti-missile interception systems, the trajectory of a target is linear but we can not find suitable coverage measurement for the straight-line path in previous research. Therefore, this research presents novel algorithms for coverage measurement of straight-line paths. Based on computational geometry and graph theory, we propose plane sweep algorithms to find the optimal straight-line paths for both the best-case and worst-case coverage problems in polynomial time. Both mathematical analysis and simulations are used to prove the optimality of our algorithms.
 目次 Table of Contents 1. Introduction 12. Related Work 63. Preliminaries 83.1 Sensor Network Model 83.2 Computational Geometry 83.3 Problem Formulation of New-node Deployment 103.4 Problem Formulation of Line Coverage 124. The Best- and Worst-case Coverage Deployment Problems 144.1 Duality 144.2 The Best-case Coverage Deployment Algorithm 174.3 Time Complexity 295. Line Coverage Algorithms 315.1 Distance Function of a Straight-line Path 315.2 Algorithm for Worst-case Line Coverage 335.3 Algorithm for Best-case Line Coverage 345.4 Time Complexity 406. Experiments 416.1 The Best-case Coverage Deployment Algorithm 416.2 The Best-case Line Coverage Algorithm 427. Conclusion 45Bibliography 46