淡江大學機構典藏:Item 987654321/112189
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62819/95882 (66%)
造访人次 : 3997786      在线人数 : 587
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/112189


    题名: Energy Efficient Data Collection Scheme in Mobile Wireless Sensor Networks
    作者: Wen, Wei-Min;Dong, Zai-Xiu;Lin-Gui;Zhao, Sheng-Hui;Chang, Chih-Yung
    关键词: data collection;energy consumption;mobile sink;maximal benefit;wireless sensor networks
    日期: 2017-03-27
    上传时间: 2017-11-22 02:10:16 (UTC+8)
    出版者: IEEE
    摘要: In wireless sensor networks, sensors typically aim to transmit their own readings to the sink node. Constructing an efficient data collection tree is very important since it can determine the lifetime of the given WSNs. In literature, may studies have investigated this issue and proposed algorithms for mobile sink to visit each sensor such that the readings of the sensors can be directly transmit to the WSN. However, visiting each sensor is time consuming which results in long path for mobile sink to pass through each sensor. Consequently, the time period between the consecutive two visits to the same sensor is long, leading to the situation of sensor buffer overflow. This paper aims to propose an efficient data collection mechanism which chooses a set of sensors to play the role of the rendezvous points (RPs) which would be visited by the mobile sink. The proposed mechanism will select important sensors as the RPs and construct an efficient path for mobile sink to collect data. Those sensors that are not visited by the mobile sink will forward their readings to the nearest RP and then the RP can relay their information to the mobile sink when it is visited. Performance results show that the proposed mechanism is better than the existing studies and significantly reduce the time period between two consecutive visits.
    關聯: 2017 31st International Conference on Advanced Information Networking and Applications Workshops (WAINA)
    DOI: 10.1109/WAINA.2017.59
    显示于类别:[資訊工程學系暨研究所] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML144检视/开启

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

    TAIR相关文章

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