TY - GEN
T1 - Minimizing charging delay in wireless rechargeable sensor networks
AU - Fu, Lingkun
AU - Cheng, Peng
AU - Gu, Yu
AU - Chen, Jiming
AU - He, Tian
PY - 2013
Y1 - 2013
N2 - As a pioneering experimental platform of wireless rechargeable sensor networks, the Wireless Identification and Sensing Platform (WISP) is an open-source platform that integrates sensing and computation capabilities to the traditional RFID tags. Different from traditional tags, a RFID-based wireless rechargeable sensor node needs to charge its onboard energy storage above a threshold in order to power its sensing, computation and communication components. Consequently, such charging delay imposes a unique design challenge for deploying wireless rechargeable sensor networks. In this paper, we tackle this problem by planning the optimal movement strategy of the RFID reader, such that the time to charge all nodes in the network above their energy threshold is minimized. We first propose an optimal solution using the linear programming method. To further reduce the computational complexity, we then introduce a heuristic solution with a provable approximation ratio of (1 + θ)/(1-ε) by discretizing the charging power on a two-dimensional space. Through extensive evaluations, we demonstrate that our design outperforms the set-cover-based design by an average of 24.7% while the computational complexity is O((N/ε)2).
AB - As a pioneering experimental platform of wireless rechargeable sensor networks, the Wireless Identification and Sensing Platform (WISP) is an open-source platform that integrates sensing and computation capabilities to the traditional RFID tags. Different from traditional tags, a RFID-based wireless rechargeable sensor node needs to charge its onboard energy storage above a threshold in order to power its sensing, computation and communication components. Consequently, such charging delay imposes a unique design challenge for deploying wireless rechargeable sensor networks. In this paper, we tackle this problem by planning the optimal movement strategy of the RFID reader, such that the time to charge all nodes in the network above their energy threshold is minimized. We first propose an optimal solution using the linear programming method. To further reduce the computational complexity, we then introduce a heuristic solution with a provable approximation ratio of (1 + θ)/(1-ε) by discretizing the charging power on a two-dimensional space. Through extensive evaluations, we demonstrate that our design outperforms the set-cover-based design by an average of 24.7% while the computational complexity is O((N/ε)2).
UR - http://www.scopus.com/inward/record.url?scp=84883080417&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84883080417&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2013.6567103
DO - 10.1109/INFCOM.2013.6567103
M3 - Conference contribution
AN - SCOPUS:84883080417
SN - 9781467359467
T3 - Proceedings - IEEE INFOCOM
SP - 2922
EP - 2930
BT - 2013 Proceedings IEEE INFOCOM 2013
T2 - 32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013
Y2 - 14 April 2013 through 19 April 2013
ER -