English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 49942/85109 (59%)
造訪人次 : 7784883      線上人數 : 48
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/109468

    題名: Impasse-Aware Node Placement Mechanism for Wireless Sensor Networks
    作者: Chang, Chih-Yung;Chin, Yu-Ting;Chen, Cheng-Chang;Chang, Chao-Tsun
    關鍵詞: wireless sensor network (WSN);Coverage;dead-end;impasse;deployment;obstacle;robot
    日期: 2017-02-13
    上傳時間: 2017-02-21 02:10:41 (UTC+8)
    摘要: In wireless sensor networks, sensor deployment is an important issue in which sensors are deployed in a specific monitoring region using low-cost hardware but achieving high coverage quality. In recent years, several mechanisms have been developed for the efficient robotic deployment of sensors. Their performance levels are highly dependent on unknown obstacles that can give rise to the dead-end problem. A key challenge when developing a robot deployment mechanism is to overcome the dead-end problem and deliver full coverage with a minimal number of sensors. This paper proposes an impasse-aware robot deployment (IAD) algorithm. The proposed IAD mainly consists of basic deployment rules and dead-end handling rules. The basic deployment rules are intended to achieve full coverage with a minimal number of sensors; the proposed dead-end handling rules can efficiently resolve the dead-end problem. Extensive experimental studies have demonstrated that our proposed IAD achieves superior performance to that of existing robot deployment mechanisms with respect to coverage ratio, energy efficiency, deployment path length, and required stack space.
    關聯: IEEE Transactions on Systems, Man, and Cybernetics: Systems 99, pp.1-13
    DOI: 10.1109/TSMC.2017.2659803
    顯示於類別:[資訊工程學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數



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