Paper Info
Title
Multicast Scheduling Algorithms for Battery-Free Wireless Sensor Networks
Abstract
Currently, a new type of wireless sensor network (WSN) named as battery-free network (BF-WSN), has been proposed and widely studied. Compared with traditional battery-powered WSN (BP-WSN), nodes in BF-WSN can harvest energy from ambient environment, prolonging the lifetime of the network greatly. Multicast is an important way for data dissemination in WSNs. The problem of minimum latency multicast scheduling (MLMS) that seeks a fast schedule without collision for data multicast has been studied extensively in BP-WSNs. However, existing algorithms are not suitable in BF-WSNs. In this paper we study the MLMS problem in BF-WSNs (BF-MLMS). To reduce latency, we investigate how to compute the end-to-end transmission delay. By considering both energy supply and collision, we propose centralized and distributed algorithms for constructing collision-free multicast trees in BF-WSNs. To the best of our knowledge, this is the first work to consider the BF-MLMS problem. Simulation results verify our protocols have high performance in terms of multicast latency and message volume.
Year
DOI
Venue
2019
10.1109/MASS.2019.00054
2019 IEEE 16th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)
Keywords
DocType
ISSN
Multicast, scheduling algorithms, minimum latency, battery-free wireless sensor networks (BF-WSNs)
Conference
2155-6806
ISBN
Citations 
PageRank 
978-1-7281-4602-7
0
0.34
References 
Authors
22
3
Name
Order
Citations
PageRank
Bingkun Yao100.34
Hong Gao21086120.07
Jianzhong Li36324.23