t-path Based Reliable and Real-time Routing in Battery-Free Wireless Sensor Network
Lists
Only you see this
Abstract
Wireless Sensor Networks are deployed to sense data from the physical world and transmit these data to the server(s). To reduce the maintenance cost of replacing batteries, Energy-Harvesting nodes are developed which can get recharged from Solar Power, Radio Frequency, and other environmental energy resources. We term the network consist of energy-harvesting nodes as Battery-Free WSNs (BF-WSNs). Environmental energy is inherently time-varying and exhibits a high degree of heterogeneity. These features bring challenges to routing design. In this paper, we focus on the reliability and real-time issues and propose an opportunistic strategy as time synchronization is hard and expensive to reach in BF-WSN. We first model BF-WSNs as a directed weighted multigraph and propose a novel definition called t-path to describe the time-varying availability feature of BF-nodes. Further, we show that the problem is NP-Hard. We present a centralized approximate algorithm and prove that the ratio bound is 2 under two conditions. This paper also presents a distributed algorithm. Comprehensive simulations have been performed to evaluate the performance of the proposed algorithms and the results show that the efficiency of our algorithms.
BibTeX
@inproceedings{chen2021t,
author = {Kunyi Chen and Hong Gao and Siyao Cheng and Quan Chen and Jianzhong Li},
title = {{t-path Based Reliable and Real-time Routing in Battery-Free Wireless Sensor Network}},
booktitle = {HPCC/DSS/SmartCity/DependSys},
year = {2021},
doi = {10.1109/hpcc-dss-smartcity-dependsys53884.2021.00124},
}Loading related content...