English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54059/88902 (61%)
Visitors : 10550536      Online Users : 15
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/113683

    Title: Mobile Data Gathering with Bounded Relay in Wireless Sensor Networks
    Authors: Cheng, Chien-Fu;Yu, Chao-Fu
    Keywords: Internet of things;mobile data gathering;relay hop bound;traveling path
    Date: 2018-06
    Issue Date: 2018-06-14 12:10:17 (UTC+8)
    Publisher: IEEE
    Abstract: Sensing data gathering is an important and fundamental issue in the Internet of Things (IoT). However, for battery-powered sensors, energy depletion is unavoidable. Using mobile sinks to collect sensing data by one-hop transmission is an effective way to prolong the lifetime of wireless sensor networks but will inevitably cause an excessive long delay time of data gathering. In order to reduce the delay time of mobile data gathering, it is necessary to incorporate multi-hop transmission into mobile data gathering. In this paper, a new mobile data gathering algorithm with multi-hop transmission is proposed to reduce the delay time of data gathering. The proposed algorithm is called the Bounded Relay Combine-TSP-Reduce (BR-CTR). The BR-CTR algorithm visits the convergence area of sensors’ communication ranges to reduce the number of visiting points. The BR-CTR algorithm is integrated with a path adjustment mechanism, which can further shorten the planned traveling path effectively. In performance evaluation, we compare the BR-CTR algorithm not only with the existing mobile data gathering algorithms with one-hop transmission but also with the existing mobile data gathering algorithms with multi-hop transmission in terms of the length of traveling path, delay time, network lifetime and buffer size requirement. Experimental results indicate that the proposed algorithm has high performance on all the above-mentioned indices.
    Relation: IEEE Internet of Things Journal 5(5), p.3891-3907
    DOI: 10.1109/JIOT.2018.2844680
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    Mobile Data Gathering with Bounded Relay in Wireless Sensor Networks.pdf2303KbAdobe PDF0View/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