Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An improved algorithm for dispatching the minimum number of electric charging vehicles for wireless sensor networks

An improved algorithm for dispatching the minimum number of electric charging vehicles for... The very limited sensor battery energy greatly hinders the large-scale, long-term deployments of wireless sensor networks. This paper studies the problem of scheduling the minimum charging vehicles to charge lifetime-critical sensors in a wireless rechargeable sensor network, by utilizing the breakthrough wireless charging technology. Existing studies still employ a number of charging vehicles to charge sensors. The purchase cost of a charging vehicle however is not inexpensive. To further reduce the number of employed charging vehicles, we propose a novel approximation algorithm, by exploring the combinatorial properties of the problem. The techniques exploited in this paper are essentially different from that in existing studies. Not only do we show that the approximation ratio of the proposed algorithm is much better than that of the state-of-the-art, but also extensive experimental results demonstrate that the number of scheduled charging vehicles by the proposed algorithm is at least 10% less than that by the existing algorithms and the total travel energy consumption of the charging vehicles is also smaller than that by the existing algorithms. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Wireless Networks Springer Journals

An improved algorithm for dispatching the minimum number of electric charging vehicles for wireless sensor networks

Loading next page...
 
/lp/springer_journal/an-improved-algorithm-for-dispatching-the-minimum-number-of-electric-eAhQAgweiU

References (14)

Publisher
Springer Journals
Copyright
Copyright © 2018 by Springer Science+Business Media, LLC, part of Springer Nature
Subject
Engineering; Communications Engineering, Networks; Computer Communication Networks; Electrical Engineering; IT in Business
ISSN
1022-0038
eISSN
1572-8196
DOI
10.1007/s11276-018-1765-5
Publisher site
See Article on Publisher Site

Abstract

The very limited sensor battery energy greatly hinders the large-scale, long-term deployments of wireless sensor networks. This paper studies the problem of scheduling the minimum charging vehicles to charge lifetime-critical sensors in a wireless rechargeable sensor network, by utilizing the breakthrough wireless charging technology. Existing studies still employ a number of charging vehicles to charge sensors. The purchase cost of a charging vehicle however is not inexpensive. To further reduce the number of employed charging vehicles, we propose a novel approximation algorithm, by exploring the combinatorial properties of the problem. The techniques exploited in this paper are essentially different from that in existing studies. Not only do we show that the approximation ratio of the proposed algorithm is much better than that of the state-of-the-art, but also extensive experimental results demonstrate that the number of scheduled charging vehicles by the proposed algorithm is at least 10% less than that by the existing algorithms and the total travel energy consumption of the charging vehicles is also smaller than that by the existing algorithms.

Journal

Wireless NetworksSpringer Journals

Published: May 29, 2018

There are no references for this article.