Perpetual and Fair Data Collection for Environmental Energy Harvesting Sensor Networks

被引:77
|
作者
Liu, Ren-Shiou [1 ]
Fan, Kai-Wei [1 ]
Zheng, Zizhan [1 ]
Sinha, Prasun [1 ]
机构
[1] Ohio State Univ, Dept Comp Sci & Engn, Columbus, OH 43210 USA
基金
美国国家科学基金会;
关键词
Rate assignment; rechargeable sensors;
D O I
10.1109/TNET.2010.2091280
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Renewable energy enables sensor networks with the capability to recharge and provide perpetual data services. Due to low recharging rates and the dynamics of renewable energy such as solar and wind power, providing services without interruptions caused by battery runouts is nontrivial. Most environment monitoring applications require data collection from all nodes at a steady rate. The objective of this paper is to design a solution for fair and high throughput data extraction from all nodes in the presence of renewable energy sources. Specifically, we seek to compute the lexicographically maximum data collection rate and routing paths for each node such that no node will ever run out of energy. We propose a centralized algorithm and two distributed algorithms. The centralized algorithm jointly computes the optimal data collection rate for all nodes along with the flows on each link, the first distributed algorithm computes the optimal rate when the routing structure is a given tree, and the second distributed algorithm, although heuristic, jointly computes a routing structure and a high lexicographic rate assignment that is nearly optimum. We prove the optimality for the centralized and the first distributed algorithm, and use real test-bed experiments and extensive simulations to evaluate both of the distributed algorithms.
引用
收藏
页码:947 / 960
页数:14
相关论文
共 50 条
  • [1] Perpetual Data Collection with Energy-Harvesting Sensor Networks
    Renner, Christian
    Unterschuetz, Stefan
    Turau, Volker
    Roemer, Kay
    [J]. ACM TRANSACTIONS ON SENSOR NETWORKS, 2014, 11 (01)
  • [2] Fair Scheduling for Data Collection in Mobile Sensor Networks with Energy Harvesting
    Li, Kai
    Yuen, Chau
    Kusy, Branislav
    Jurdak, Raja
    Ignjatovic, Aleksandar
    Kanhere, Salil S.
    Jha, Sanjay
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2019, 18 (06) : 1274 - 1287
  • [3] Probabilistic Data Collection Protocols for Energy Harvesting Sensor Networks
    Yoshida, Masaya
    Kitani, Tomoya
    Bandai, Masaki
    Watanabe, Takashi
    Chou, Pai
    Seah, Winston Khoon Guan
    [J]. 2011 IEEE 36TH CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN), 2011, : 366 - 373
  • [4] Optimal data collection in wireless sensor networks with correlated energy harvesting
    Kishor Patil
    Koen De Turck
    Dieter Fiems
    [J]. Annals of Telecommunications, 2019, 74 : 299 - 310
  • [5] Computing Optimal Data Collection Rate for Energy Harvesting Sensor Networks
    Sadlapur, Ashwini B.
    Pushpa, P., V
    [J]. 2013 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2013, : 1468 - 1472
  • [6] Robust data collection for energy-harvesting wireless sensor networks
    Liu, Ren-Shiou
    Chen, Yen-Chen
    [J]. COMPUTER NETWORKS, 2020, 167 (167)
  • [7] Probabilistic data collection protocols for energy harvesting wireless sensor networks
    Yoshida, Masaya
    Kitani, Tomoya
    Bandai, Masaki
    Watanabe, Takashi
    Chou, Pai H.
    Seah, Winston K. G.
    [J]. INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 2012, 11 (2-3) : 82 - 96
  • [8] Optimal Data Collection in Hybrid Energy-Harvesting Sensor Networks
    Patil, Kishor
    De Turck, Koen
    Fiems, Dieter
    [J]. ANALYTICAL AND STOCHASTIC MODELLING TECHNIQUES AND APPLICATIONS, 2016, 9845 : 239 - 252
  • [9] Optimal data collection in wireless sensor networks with correlated energy harvesting
    Patil, Kishor
    De Turck, Koen
    Fiems, Dieter
    [J]. ANNALS OF TELECOMMUNICATIONS, 2019, 74 (5-6) : 299 - 310
  • [10] Use of a Mobile Sink for Maximizing Data Collection in Energy Harvesting Sensor Networks
    Ren, Xiaojiang
    Liang, Weifa
    Xu, Wenzheng
    [J]. 2013 42ND ANNUAL INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP), 2013, : 439 - 448