English  |  正體中文  |  简体中文  |  Items with full text/Total items : 56848/90584 (63%)
Visitors : 12156946      Online Users : 93
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/106946


    Title: Data Gathering in Wireless Sensor Networks: A Combine–TSP–Reduce Approach
    Authors: Cheng, Chien-Fu;Yu, Chao-Fu
    Keywords: TSP problem;Wireless sensor networks;data gathering;mobile sink;static sensor
    Date: 2016-04
    Issue Date: 2016-08-15
    Publisher: nstitute of Electrical and Electronics Engineers
    Abstract: Mobile sinks are extensively used for data gathering in wireless sensor networks (WSNs). This method avoids imbalances in energy consumption caused by multihop transmission but may cause an extended delay time. In this paper, we focus on how to shorten the length of the traveling path to reduce the delay time of data gathering. We propose that the mobile sink visits the overlapping areas of communication ranges of sensors instead of sensors one by one. Next, we determine the visiting point of each overlapping area and use the traveling salesperson problem (TSP) algorithm to plan a traveling path. Because the visiting point is a point within the overlapping area of communication ranges of sensors, it is possible that the length of the traveling path can be reduced further. Hence, we attempt to shorten the traveling path obtained by the TSP algorithm. The benefit of the proposed method is that the number of visiting points is reduced after integration of visiting points. This method not only shortens the length of the traveling path for the mobile sink but reduces the computational effort required for traveling-path planning by the TSP algorithm as well. Moreover, we also consider data transfer rate in traveling-path planning to obtain a path that satisfies the constraint of the data transfer rate. Our experimental results show that the proposed algorithm delivers good results in terms of the computational effort and length of the traveling path.
    Relation: IEEE Transactions on Vehicular Technology 65(4), p.2309-2324
    DOI: 10.1109/TVT.2015.2502625
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    Data Gathering in Wireless Sensor Networks_ A Combine–TSP–Reduce Approach.pdf6004KbAdobe PDF1View/Open
    index.html0KbHTML149View/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