Barrier Coverage and d-Trap Coverage Mechanisms for Energy Efficient WSNs
碩士 === 淡江大學 === 資訊工程學系碩士班 === 102 === In wireless sensors, trap coverage has recently been proposed as a tradeoff between the availability of sensor nodes and sensing performance. A d-trap coverage is referred to the network where the diameter of each existing hole should be smaller than d. The d-tr...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/wrk6zw |
id |
ndltd-TW-102TKU05392054 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-102TKU053920542019-05-15T21:42:44Z http://ndltd.ncl.edu.tw/handle/wrk6zw Barrier Coverage and d-Trap Coverage Mechanisms for Energy Efficient WSNs 在無線感測網路中具省電與充電考量之邊界覆蓋與d-陷阱覆蓋技術 Jing-Huei Fang Bi 方畢經慧 碩士 淡江大學 資訊工程學系碩士班 102 In wireless sensors, trap coverage has recently been proposed as a tradeoff between the availability of sensor nodes and sensing performance. A d-trap coverage is referred to the network where the diameter of each existing hole should be smaller than d. The d-trap offers an efficient framework to tackle the challenge of limited resources in large scale sensor networks. Currently, existing works only studied the network formation for the desired trap coverage. However, how to efficiently schedule sensor nodes between active and sleep modes to satisfy the constraint of trap coverage and prolong the network lifetime is still an open issue. This paper presents an efficient working schedule for d-trap coverage, aiming to satisfy the constraint of trap coverage and prolong the network lifetime. In simulation, the proposed algorithm outperforms the existing works in terms of the number of working sensors, reaming energy ratio, and network lifetime. Chin-Hwa Kuo 郭經華 2014 學位論文 ; thesis 78 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 淡江大學 === 資訊工程學系碩士班 === 102 === In wireless sensors, trap coverage has recently been proposed as a tradeoff between the availability of sensor nodes and sensing performance. A d-trap coverage is referred to the network where the diameter of each existing hole should be smaller than d. The d-trap offers an efficient framework to tackle the challenge of limited resources in large scale sensor networks. Currently, existing works only studied the network formation for the desired trap coverage. However, how to efficiently schedule sensor nodes between active and sleep modes to satisfy the constraint of trap coverage and prolong the network lifetime is still an open issue. This paper presents an efficient working schedule for d-trap coverage, aiming to satisfy the constraint of trap coverage and prolong the network lifetime. In simulation, the proposed algorithm outperforms the existing works in terms of the number of working sensors, reaming energy ratio, and network lifetime.
|
author2 |
Chin-Hwa Kuo |
author_facet |
Chin-Hwa Kuo Jing-Huei Fang Bi 方畢經慧 |
author |
Jing-Huei Fang Bi 方畢經慧 |
spellingShingle |
Jing-Huei Fang Bi 方畢經慧 Barrier Coverage and d-Trap Coverage Mechanisms for Energy Efficient WSNs |
author_sort |
Jing-Huei Fang Bi |
title |
Barrier Coverage and d-Trap Coverage Mechanisms for Energy Efficient WSNs |
title_short |
Barrier Coverage and d-Trap Coverage Mechanisms for Energy Efficient WSNs |
title_full |
Barrier Coverage and d-Trap Coverage Mechanisms for Energy Efficient WSNs |
title_fullStr |
Barrier Coverage and d-Trap Coverage Mechanisms for Energy Efficient WSNs |
title_full_unstemmed |
Barrier Coverage and d-Trap Coverage Mechanisms for Energy Efficient WSNs |
title_sort |
barrier coverage and d-trap coverage mechanisms for energy efficient wsns |
publishDate |
2014 |
url |
http://ndltd.ncl.edu.tw/handle/wrk6zw |
work_keys_str_mv |
AT jinghueifangbi barriercoverageanddtrapcoveragemechanismsforenergyefficientwsns AT fāngbìjīnghuì barriercoverageanddtrapcoveragemechanismsforenergyefficientwsns AT jinghueifangbi zàiwúxiàngǎncèwǎnglùzhōngjùshěngdiànyǔchōngdiànkǎoliàngzhībiānjièfùgàiyǔdxiànjǐngfùgàijìshù AT fāngbìjīnghuì zàiwúxiàngǎncèwǎnglùzhōngjùshěngdiànyǔchōngdiànkǎoliàngzhībiānjièfùgàiyǔdxiànjǐngfùgàijìshù |
_version_ |
1719118642698780672 |