The dynamic routing algorithm for renewable wireless sensor networks with wireless power transfer

Wireless power transfer is recently considered as a potential approach to remove the lifetime performance bottleneck for wireless sensor networks. By using a wireless charging vehicle (WCV) to periodically recharge each sensor node’s battery, a wireless sensor network may remain operational forever....

Full description

Saved in:
Bibliographic Details
Published in:Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2014-12, Vol.74, p.34-52
Main Authors: Shi, Lei, Han, Jianghong, Han, Dong, Ding, Xu, Wei, Zhenchun
Format: Article
Language:English
Subjects:
Access methods and protocols, osi model
Applied sciences
Charging
Computer networks
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Dynamics
Exact sciences and technology
Information retrieval. Graph
Mathematical models
Network flow problem
Optimization
Optimization algorithms
Polynomials
Radiocommunications
Remote sensors
Route optimization
Routing (telecommunications)
Sensors
Software
Studies
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Theoretical computing
Wireless networks
Wireless power transfer
Wireless sensor network
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Wireless power transfer is recently considered as a potential approach to remove the lifetime performance bottleneck for wireless sensor networks. By using a wireless charging vehicle (WCV) to periodically recharge each sensor node’s battery, a wireless sensor network may remain operational forever. In this paper, we aim to jointly optimize a dynamic multi-hop data routing, a traveling path (for the WCV to visit all the sensor nodes in a cycle), and a charging schedule (charging time for each sensor node) such that the ratio of the WCV’s vacation time over the cycle time can be maximized. The key challenge of this problem (caused by time-varying data routing) is the integration and differentiation terms in problem formulation, which yields a very challenging non-polynomial program. To remove these non-polynomial terms, we introduce the concept of (N+1)-phase solution, which adopt a special dynamic routing scheme. We prove that an optimal (N+1)-phase solution can achieve the same objective value as that by an optimal time-varying solution. We further prove that the optimal traveling path must follow the shortest Hamiltonian cycle. Finally, we linearize the problem for data routing and charging schedule and thus obtain an optimal solution in polynomial-time.
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2014.08.020