Wireless sensor networks provide an alternative way of improving our environments, such as environment surveillance, hazard monitoring, and other customized environment application, especially in military applications. Furthermore, the coverage issue in wireless sensor networks also plays an important role. Good coverage of a sensor network is an essential issue to ensure the quality of service.
This paper studies the barrier coverage problems of a sensor networks, and will find the optimized straight-line path for both best-case and worst-case coverage problems. The optimal algorithm we proposed has a quadratic time complexity and is based on computational geometry. We proposed the distance function theory and applied it in our problems and we used the sweep and divide concept to solve the problems. Furthermore, the correctness of the proposed method is validated and simulated by experiments.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0717106-190850 |
| Date | 17 July 2006 |
| Creators | Lee, Tzu-Chen |
| Contributors | Chia-Mei Chen, Sheng-Tzong Cheng, Chu-Sing Yang, Bing-Chiang Jeng |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0717106-190850 |
| Rights | campus_withheld, Copyright information available at source archive |
Page generated in 0.0013 seconds