TY - JOUR
T1 - Perpetual and fair data collection for environmental energy harvesting sensor networks
AU - Liu, Ren Shiou
AU - Fan, Kai Wei
AU - Zheng, Zizhan
AU - Sinha, Prasun
N1 - Funding Information:
Manuscript received February 25, 2010; revised August 09, 2010; accepted October 28, 2010; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor M. Liu. Date of publication November 29, 2010; date of current version August 17, 2011. This work was supported by the National Science Foundation (NSF) under Grants CNS-0721434 and CNS-0831919.
PY - 2011/8
Y1 - 2011/8
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=80051786351&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80051786351&partnerID=8YFLogxK
U2 - 10.1109/TNET.2010.2091280
DO - 10.1109/TNET.2010.2091280
M3 - Article
AN - SCOPUS:80051786351
SN - 1063-6692
VL - 19
SP - 947
EP - 960
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 4
M1 - 5643974
ER -