English  |  正體中文  |  简体中文  |  Items with full text/Total items : 60924/93528 (65%)
Visitors : 1561711      Online Users : 20
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: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/100106

    Title: Path Construction and Visit Scheduling for Targets by Using Data Mules
    Authors: Chang, C. Y.;Yu, G. J.;Wang, T. L.;Lin, C. Y.
    Contributors: 淡江大學資訊工程學系
    Keywords: Disconnected targets;mobile data collectors, recharge station;weighted target;wireless sensor networks (WSNs)
    Date: 2014-10-01
    Issue Date: 2015-01-28 11:07:39 (UTC+8)
    Publisher: America: Institute of Electrical and Electronics Engineers
    Abstract: In this paper, the target patrolling problem was considered, in which a set of mobile data collectors, known as data mules (DMs), must efficiently patrol a given set of targets. Because the time interval (or visiting interval) between consecutive visits to each target reflects the degree to which that target is monitored, the goal of this paper was to balance the visiting interval of each target. This paper first presents the basic target points patrolling algorithm, which enables an efficient patrolling route to be constructed for numerous DMs, such that the visiting intervals of all target points are stable. For scenarios containing weighted target points, a weighted target points patrolling (W-TPP) algorithm is presented, which ensures that targets with higher weights have higher data collection frequencies. The energy constraint of each DM was also considered, and this paper presents a W-TPP with recharge (RW-TPP) algorithm, which treats the energy recharge station as a weighted target and arranges for DMs to visit the recharge station before running out of energy. The performance results demonstrated that the proposed algorithms outperformed existing approaches in average visiting frequency, DM movement distance, average quality of monitoring satisfaction rate, and efficiency index.
    Relation: IEEE Transactions on Systems Man and Cybernetics: System 44(10), pp.1289-1300
    DOI: 10.1109/TSMC.2014.2314675
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    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