淡江大學機構典藏:Item 987654321/106946
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62805/95882 (66%)
造访人次 : 3989580      在线人数 : 682
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/106946


    题名: Data Gathering in Wireless Sensor Networks: A Combine–TSP–Reduce Approach
    作者: Cheng, Chien-Fu;Yu, Chao-Fu
    关键词: TSP problem;Wireless sensor networks;data gathering;mobile sink;static sensor
    日期: 2016-04
    上传时间: 2016-08-15
    出版者: nstitute of Electrical and Electronics Engineers
    摘要: 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.
    關聯: IEEE Transactions on Vehicular Technology 65(4), p.2309-2324
    DOI: 10.1109/TVT.2015.2502625
    显示于类别:[資訊工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    Data Gathering in Wireless Sensor Networks_ A Combine–TSP–Reduce Approach.pdf6004KbAdobe PDF2检视/开启
    index.html0KbHTML217检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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