東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Foundations of coverage in wireless ...

Kumar, Santosh.

FindBook

Google Book

Amazon

博客來

Foundations of coverage in wireless sensor networks.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Foundations of coverage in wireless sensor networks./
作者:	Kumar, Santosh.
面頁冊數:	160 p.
附註:	Adviser: Ten H. Lai.
Contained By:	Dissertation Abstracts International67-07B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3226439
ISBN:	9780542781704

Foundations of coverage in wireless sensor networks.
Kumar, Santosh.

Foundations of coverage in wireless sensor networks. - 160 p.

Adviser: Ten H. Lai.

Thesis (Ph.D.)--The Ohio State University, 2006.

Second, we address five foundational problems for the issue of k-barrier coverage: optimal deployment pattern, critical conditions, coverage status determination, coverage restoration, and optimal sleep wakeup.

ISBN: 9780542781704Subjects--Topical Terms:

626642
Computer Science.

Foundations of coverage in wireless sensor networks.
LDR:03046nam 2200313 a 45 001 964242
005 20110901
008 110901s2006 eng d
020 $a 9780542781704
035 $a (UMI)AAI3226439
035 $a AAI3226439
040 $a UMI $c UMI
100 1 $a Kumar, Santosh. $3 1287309
245 1 0 $a Foundations of coverage in wireless sensor networks.
300 $a 160 p.
500 $a Adviser: Ten H. Lai.
500 $a Source: Dissertation Abstracts International, Volume: 67-07, Section: B, page: 3903.
502 $a Thesis (Ph.D.)--The Ohio State University, 2006.
520 $a Second, we address five foundational problems for the issue of k-barrier coverage: optimal deployment pattern, critical conditions, coverage status determination, coverage restoration, and optimal sleep wakeup.
520 $a Wireless sensor networks (WSN) promise to revolutionize the way we monitor our surroundings by enhancing our senses. Prototype systems are already being demonstrated. Several fundamental research issues, however, remain unaddressed. Sensing events being the main task of a WSN, appropriately addressing the issue of coverage is critical.
520 $a In this dissertation, we make a two fold contribution on establishing a strong foundation for the issue of coverage. First, we argue that a single concept of coverage such as k-full coverage (where every point in the deployment region needs to be within the monitoring range of at least k sensors) does not fit all applications. We propose a new concept of coverage called k-barrier coverage that is appropriate for intrusion detection applications. A WSN provides k-barrier coverage if it guarantees that every penetrating object is detected by at least k sensors before crossing the barrier of sensors.
520 $a The problem of optimal deployment pattern is to determine a pattern of deployment that uses the minimum number of sensors. The problem of critical conditions is to derive conditions that can be used to determine the minimum number of sensors to deploy in probabilistic deployments. The problem of coverage status determination is to determine whether a deployed WSN provides a desired quality of monitoring. The problem of coverage restoration is to determine the minimum number of sensors to deploy, and their locations, such that a desired quality of monitoring can be restored in a deployed WSN. The problem of optimal sleep wakeup is to produce a sleeping schedule for sensors that maximizes the network lifetime.
520 $a We comprehensively solve four of the five foundational problems. For the problem of critical conditions, we derive the conditions for a weaker notion of k-barrier coverage, called weak k-barrier coverage. In addition, we derive critical conditions for the case of k-full coverage.
590 $a School code: 0168.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a The Ohio State University. $3 718944
773 0 $t Dissertation Abstracts International $g 67-07B.
790 $a 0168
790 1 0 $a Lai, Ten H., $e advisor
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3226439