English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51931/87076 (60%)
Visitors : 8495120      Online Users : 136
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/102576

    Title: 在無線感測網路中具省電與充電考量之邊界覆蓋與d-陷阱覆蓋技術
    Other Titles: Barrier coverage and d-trap coverage mechanisms for energy efficient WSNs
    Authors: 方畢經慧;Fang Bi, Jing-Huei
    Contributors: 淡江大學資訊工程學系碩士班
    郭經華;Kuo, Chin-Hwa
    Keywords: 邊界覆蓋;太陽能;排程;分散式;無線感測網路;感測器;電量;覆蓋空洞;Trap coverage;Barrier Coverage;Energy harvesting;scheduling;Distributed;Wireless sensor network;sensor;Energy;Coverage Hole
    Date: 2014
    Issue Date: 2015-05-04 09:59:16 (UTC+8)
    Abstract: 近年來,邊界覆蓋(Barrier Coverage)在無線感測網路中是很重要且受到廣泛討論的問題。本論文所運作的場景為國邊界上已先佈下許多固定式感測器且感測器皆有太陽能充電的能力。由於感測器工作耗電後,需要進行太陽能充電,因此,感測器的排程與合作式監控將決定感測器在國邊界上的防衛能力。本論文擬設計一分散式排程技術,透過太陽能充電機制使網路永續運作。所謂d-Trap Coverage意指監控範圍中允許直徑不大於d的空洞產生。這樣的應用可大量的節省感測器電量或硬體成本。本論文針對一個已佈建的感測網路,提出一個感測器輪流醒睡的分散式排程技術,使場景中每個感測器皆可以輪流休息和工作,相較於現有的d-Trap coverage研究,本論文的貢獻如下。首先,感測器因電量不足而無法撐過一個醒睡週期時,將使空洞大於預設的限制值,因此,本論文提出感測器醒睡排程技術,以有效維護d-Trap coverage之要求並將空洞所造成的感測風險平均分散於場景中。
    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.
    Appears in Collections:[資訊工程學系暨研究所] 學位論文

    Files in This Item:

    File SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback