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....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer networks (Amsterdam, Netherlands : 1999) Ročník 74; s. 34 - 52
Hlavní autoři: Shi, Lei, Han, Jianghong, Han, Dong, Ding, Xu, Wei, Zhenchun
Médium: Journal Article
Jazyk:angličtina
Vydáno: Kidlington Elsevier B.V 09.12.2014
Elsevier
Elsevier Sequoia S.A
Témata:
Access methods and protocols, osi model
Applied sciences
Charging
Computer networks
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Data
Differentiation
Dynamics
Exact sciences and technology
Information retrieval. Graph
Mathematical models
Network flow problem
Networks
Optimization
Optimization algorithms
Polynomials
Power
Radiocommunications
Remote sensors
Route optimization
Routing (telecommunications)
Sensors
Software
Studies
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Theoretical computing
Time
Wireless communication systems
Wireless networks
Wireless power transfer
Wireless sensor network
Wireless sensor network
Optimization
Wireless power transfer
Bottleneck
Information integration
Hamiltonian cycle
Electromagnetic induction
Time varying system
Minimum time
Dynamic programming
Accumulator recharge
Inductive power transmission
Durability
Routing
Graph theory
Multi hop network
Polynomial time
Lifetime
Optimal solution
Optimal trajectory
NP complete problem
Wireless network
Optimal path
Sensor array
Energy transfer
ISSN:1389-1286, 1872-7069
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2014.08.020