Remote Hole Detection Algorithms for Wireless Sensor Networks
碩士 === 元智大學 === 資訊工程學系 === 97 === In this thesis, we develop a practical and energy-efficient distributed algorithm for the detection of coverage holes in a wireless sensor network. It assumes the location of sensor nodes is available. We do this in two phases. First we want to identify a set of nod...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/21008936294301027315 |
id |
ndltd-TW-097YZU05392016 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-097YZU053920162016-05-04T04:17:08Z http://ndltd.ncl.edu.tw/handle/21008936294301027315 Remote Hole Detection Algorithms for Wireless Sensor Networks 無線感測網路下之遠距偵測覆蓋空洞演算法 Chiao-Yun Liu 劉喬筠 碩士 元智大學 資訊工程學系 97 In this thesis, we develop a practical and energy-efficient distributed algorithm for the detection of coverage holes in a wireless sensor network. It assumes the location of sensor nodes is available. We do this in two phases. First we want to identify a set of nodes of which encircle a coverage hole. This is done by introducing a concept of mono-covered arc, which represents the circumference of a non-overlapping region of the sensing disc of a sensor node. That is, a coverage hole or insufficient coverage region will be along the right-hand side of these directed mono-covered arcs. Based on this notion, a graph-theoretic distributed algorithm can then be developed to identify every simple boundary and interior hole locally. Furthermore, these graph-theoretic information can also be forwarded to the sink or base station to recognize the geometric characteristics among these coverage holes existing in the network fabric remotely. 賴國華 2008 學位論文 ; thesis 26 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 元智大學 === 資訊工程學系 === 97 === In this thesis, we develop a practical and energy-efficient distributed algorithm for the detection of coverage holes in a wireless sensor network. It assumes the location of sensor nodes is available. We do this in two phases. First we want to identify a set of nodes of which encircle a coverage hole. This is done by introducing a concept of mono-covered arc, which represents the circumference of a non-overlapping region of the sensing disc of a sensor node. That is, a coverage hole or insufficient coverage region will be along the right-hand side of these directed mono-covered arcs. Based on this notion, a graph-theoretic distributed algorithm can then be developed to identify every simple boundary and interior hole locally. Furthermore, these graph-theoretic information can also be forwarded to the sink or base station to recognize the geometric characteristics among these coverage holes existing in the network fabric remotely.
|
author2 |
賴國華 |
author_facet |
賴國華 Chiao-Yun Liu 劉喬筠 |
author |
Chiao-Yun Liu 劉喬筠 |
spellingShingle |
Chiao-Yun Liu 劉喬筠 Remote Hole Detection Algorithms for Wireless Sensor Networks |
author_sort |
Chiao-Yun Liu |
title |
Remote Hole Detection Algorithms for Wireless Sensor Networks |
title_short |
Remote Hole Detection Algorithms for Wireless Sensor Networks |
title_full |
Remote Hole Detection Algorithms for Wireless Sensor Networks |
title_fullStr |
Remote Hole Detection Algorithms for Wireless Sensor Networks |
title_full_unstemmed |
Remote Hole Detection Algorithms for Wireless Sensor Networks |
title_sort |
remote hole detection algorithms for wireless sensor networks |
publishDate |
2008 |
url |
http://ndltd.ncl.edu.tw/handle/21008936294301027315 |
work_keys_str_mv |
AT chiaoyunliu remoteholedetectionalgorithmsforwirelesssensornetworks AT liúqiáoyún remoteholedetectionalgorithmsforwirelesssensornetworks AT chiaoyunliu wúxiàngǎncèwǎnglùxiàzhīyuǎnjùzhēncèfùgàikōngdòngyǎnsuànfǎ AT liúqiáoyún wúxiàngǎncèwǎnglùxiàzhīyuǎnjùzhēncèfùgàikōngdòngyǎnsuànfǎ |
_version_ |
1718256518148653056 |