淡江大學機構典藏:Item 987654321/112189
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62819/95882 (66%)
Visitors : 4010702      Online Users : 982
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/112189


    Title: Energy Efficient Data Collection Scheme in Mobile Wireless Sensor Networks
    Authors: Wen, Wei-Min;Dong, Zai-Xiu;Lin-Gui;Zhao, Sheng-Hui;Chang, Chih-Yung
    Keywords: data collection;energy consumption;mobile sink;maximal benefit;wireless sensor networks
    Date: 2017-03-27
    Issue Date: 2017-11-22 02:10:16 (UTC+8)
    Publisher: IEEE
    Abstract: 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.
    Relation: 2017 31st International Conference on Advanced Information Networking and Applications Workshops (WAINA)
    DOI: 10.1109/WAINA.2017.59
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Proceeding

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML144View/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