English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49521/84657 (58%)
Visitors : 7595912      Online Users : 82
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/105741


    Title: 資料收集機制於具有行動資料收集器之無線感測網路
    Other Titles: Data gathering by mobile sinks in Wireless Sensor Networks
    Authors: 余昭甫;Yu, Chao-Fu
    Contributors: 淡江大學資訊工程學系資訊網路與通訊碩士班
    鄭建富
    Keywords: 無線感測網路;資料收集;行動資料收集器;路徑規劃;Wireless sensor network;data gathering;mobile mule;Traveling Salesperson Problem algorithm
    Date: 2015
    Issue Date: 2016-01-22 15:04:02 (UTC+8)
    Abstract: 利用行動資料收集器(mobile sink)於無線感測網路(Wireless Sensor Network, WSNs)中收集資料已被廣泛的使用,此做法雖然可以避免多步傳輸(multi-hop transmission)所帶來的電量消耗不平衡問題,但不可避免的將會帶來較長之資料延遲時間。因此在本研究當中,我們將探討如何縮短拜訪路徑之長度來降低資料延遲時間。本研究將藉由拜訪感測器通訊範圍重疊的區域,來取代逐一拜訪每一個感測器,然後再利用旅行業務員演算法(Traveling Salesperson Problem algorithm, TSP algorithm),規劃出拜訪路徑。最後再針對規劃出來的拜訪路徑做進一步的縮減。我們提出一個路徑規劃演算法,名為CTR(Combine-TSP-Reduce)。此方法之好處在於,透過合併拜訪點,可以減少拜訪點的數量,如此一來不但可以縮短拜訪路徑長度,更可以降低利用TSP演算法於規劃拜訪路徑時所需之計算量。由於我們是從交集區域中取一點做為拜訪點,因此規劃出來的路徑將會還有縮短的可能性。故在執行完TSP演算法後,我們將針對規劃出來的拜訪路徑做進一步的優化,藉此進一步地縮短拜訪路徑長度。此外,我們也將加入資料傳輸速率考量,規劃出符合傳輸速率要求的拜訪路徑。經由實驗結果可以驗證,我們所提出的方法,在減少計算量以及縮短拜訪路徑長度上皆有著很好的表現。
    Mobile sinks are extensively used for data gathering in Wireless Sensor Networks (WSNs). In this study, we focus on how to shorten the length of traveling path. We propose that the mobile sink visits the overlapping areas of communication regions of sensors instead of sensors one by one. We use the Traveling Salesperson Problem (TSP) algorithm to plan an optimal traveling path to reduce the delay time of data gathering. The benefit of the proposed method is that the number of visiting points is reduced after integration of the visiting points. Our experimental results show that the proposed algorithm delivers good results in terms of time complexity, space complexity, and length of traveling path.
    Appears in Collections:[資訊工程學系暨研究所] 學位論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML59View/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