淡江大學機構典藏:Item 987654321/34984
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 55217/89514 (62%)
Visitors : 10718880      Online Users : 29
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/34984


    Title: 無線感測網路中具電量平衡及國邊界防衛能力之技術
    Other Titles: On-supporting energy balanced k-barrier coverage in wireless sensor networks
    Authors: 陳昱价;Chen, Yu-chieh
    Contributors: 淡江大學資訊工程學系碩士班
    張志勇;Chang, Chih-yung
    Keywords: 護城河覆蓋能力;k-覆蓋能力;無線感測網路;Wireless sensor networks;Barrier Coverage;k-coverage
    Date: 2007
    Issue Date: 2010-01-11 05:51:57 (UTC+8)
    Abstract: 從古至今,城堡外往往圍繞著護城河或是挖掘很深的溝渠來抵禦入侵者;而國與國之間的邊界通常派駐軍隊住紮來保護自己的疆土或以山脈河川做為屏障。將城堡的周圍或是國家的邊界佈置感測器並且達到完整覆蓋整個感測區域,即可利用感應器的感測能力來進行入侵者偵測,取代護城河的功能並且減少防守邊境所需消耗的人力資源。在傳統k-覆蓋能力的研究中,當監控區內的每個位置均被k個感應器的感測範圍所含蓋,稱為k-覆蓋能力,覆蓋數k值越高代表該區塊的偵測的能力越強,然而在護城河用途的無線感測網路中,其k-覆蓋能力定義為在邊界區域中有k個感測器可感應闖入者跨越邊界,由於與傳統無線感測網路有不同的應用場景,其k-覆蓋能力的問題亦應特殊設計及考量。本論文首先分析傳統覆蓋能力 與護城河覆蓋能力的不同點,之後並提出了一個演算法能針對邊界護城問題,找出最少的感應器集合使其可滿足最大覆蓋數,或是針對所指定的k值找出多組無交集的感應器集合,每個集合均滿足k-覆蓋能力以符合使用者的需求。實驗顯示本論文所提出的演算法能夠以較少的感測器個數達到最高的覆蓋數,並能使整個網路的感應器能耗電平衡。
    The k-barrier coverage problem is known as the problem of detecting the intruders by at least k sensors when the intruders moving along the crossing paths from one boundary to another. This paper first analyzes the differences between the traditional coverage and barrier coverge problems, and then proposes decentralized algorithms to cope with the k-barrier coverage problem. For a given value k, the proposed algorithm finds out the maximum disjoint sets of sensors such that each set of sensors meets the requirement k-barrier coverage for users. Initially, the network monigoring region is partitioned into severl equal-sized grids based on the corse-grain policy. Then three mechanisms, called Basic, Backtracking, and Branch, are proposed for constructing as more as possible the disjoint sets of sensors that satisfy the requirement of k-barrier coverage. To increase the number of disjoint sets, the propsoed three mechanisms are extended based on the fine-grain policy. Simulation study compares the performance of the proposed mechanisms against the exhausted (optimal) algorithm in terms of the number of disjoint sets and the number of sensors in each set. Performance results reveal that the proposed algorithms achieve near-optimal performance.
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Thesis

    Files in This Item:

    File SizeFormat
    0KbUnknown211View/Open

    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