English  |  正體中文  |  简体中文  |  Items with full text/Total items : 63139/95882 (66%)
Visitors : 4345766      Online Users : 232
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/120928


    Title: Coverage-Aware Recharging Scheduling Using Mobile Charger in Wireless Sensor Networks
    Authors: BHARGAVI DANDE;SHI-YONG CHEN;HUAN-CHAO KEH;SHIN-JER YANG;DIPTENDU SINHA ROY
    Keywords: Mobile charger;recharging;coverage;wireless sensor networks;ping-pong effect
    Date: 2021-06-11
    Issue Date: 2021-08-18 12:12:09 (UTC+8)
    Abstract: Energy recharging in wireless rechargeable sensor networks (WRSNs) has acquired much attention in recent years. In literature, many recharging path construction algorithms have been proposed. Most of them considered that all sensors are equally important and designed algorithms to increase the number of recharged sensors or decrease the path length of the mobile charger. However, different sensors have different coverage contributions. Recharging the sensors with larger coverage contribution can achieve better surveillance quality. The proposed recharging scheduling algorithm is divided into three phases, including the Initialization, Recharging Scheduling and Path Construction Phases. In the second phase, this paper proposed two recharging scheduling algorithms, namely the Cost-Effective (CE) algorithm and Cost-Effective with Considerations of Coverage and Fairness (C2F) algorithm. The proposed two algorithms construct paths for the mobile charger and select the recharging sensors based on the higher weight in terms of larger coverage contribution and smaller path cost. Performance results show that the CE and C2F algorithms yield better performance in terms of the fairness of recharging, recharging stability and coverage ratio, as compared with the existing studies.
    Relation: IEEE ACCESS 9, p.87318-87331
    DOI: 10.1109/ACCESS.2021.3088524
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

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