|
HKUST Institutional Repository >
Computer Science and Engineering >
CSE Master Theses >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1783.1/7451
|
| Title: | TK-coverage : time delay in time-based k-coverage sensor network |
| Authors: | Xiao, Chonghui |
| Issue Date: | 2011 |
| Abstract: | One fundamental issue in sensor networks is the coverage problem. Using coverage control, the space resources of networks are optimally utilized, and the monitoring and transfer are done better. K-coverage is a classic issue in wireless sensor network (WSN) deployment. Existing works typically assumes that every position in the monitoring field is covered by at least k sensor nodes at any given time. This may not always be necessary because certain events to be monitored will last only for a short period of time. In this work, we study a new way of k-coverage. We include the time dimension in the traditional k-coverage problem, and denote it as tk-coverage. In the context of tk-coverage, sensor nodes can apply periodical sleeping strategies. A corresponding tk-coverage (TKC) model is proposed to analyze the detection delay according to the duration of the event u. The proposed tk-coverage can balance detection delay by adjusting the sleeping strategies of sensor nodes. Comprehensive simulations have been conducted to validate the effectiveness and demonstrate the efficiency of this solution. |
| Description: | Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2011
vii, 40 p. : ill. ; 30 cm
HKUST Call Number: Thesis FCST 2011 Xiao |
| URI: | http://hdl.handle.net/1783.1/7451 |
| Appears in Collections: | CSE Master Theses
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| th_redirect.html | | 0Kb | HTML | View/Open |
|
All items in this Repository are protected by copyright, with all rights reserved.
|
