Yang / Wang Wireless Rechargeable Sensor Networks

1. Auflage 2015
ISBN: 978-3-319-17656-7
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 66 Seiten

Reihe: SpringerBriefs in Electrical and Computer Engineering

This SpringerBrief provides a concise guide to applying wireless energy transfer techniques in traditional battery-powered sensor networks. It examines the benefits and challenges of wireless power including efficiency and reliability. The authors build a wireless rechargeable sensor networks from scratch and aim to provide perpetual network operation. Chapters cover a wide range of topics from the collection of energy information and recharge scheduling to joint design with typical sensing applications such as data gathering. Problems are approached using a natural combination of probability theory, optimization, algorithm and protocol designs. All proposed mechanisms are evaluated by extensive simulations. Wireless Rechargeable Sensor Networks targets professionals and researchers working in networks, wireless communications, energy technology and information technology. Advanced-level students studying electrical engineering and computer science will also find this material useful as a study guide.

Autoren/Hrsg.

Yang, Yuanyuan

Wang, Cong

Inhaltsverzeichnis

1;Preface;8
2;Acknowledgments;10
3;Contents;12
4;Acronyms;14
5;1 Introduction;15
5.1;1.1 Introduction and Background;15
5.2;1.2 Wireless Charging Technology;17
5.2.1;1.2.1 Electromagnetic Radiation;17
5.2.2;1.2.2 Magnetic Resonant Coupling;18
5.3;1.3 Summary;19
5.4;References;19
6;2 Network Architecture and Principles;22
6.1;2.1 Network Components;22
6.2;2.2 Principles in Wireless Rechargeable Sensor Networks;24
6.2.1;2.2.1 Energy Neutrality;24
6.2.2;2.2.2 Estimation of Node Lifetime;26
6.2.3;2.2.3 Adaptive Recharge Threshold;27
6.3;2.3 Summary;28
6.4;References;28
7;3 Distributed Node Status Reporting Protocol;29
7.1;3.1 Overview;29
7.2;3.2 Protocol Design;30
7.2.1;3.2.1 Head Election;30
7.2.2;3.2.2 Status Request;31
7.2.3;3.2.3 Status Report and Recharge;32
7.2.4;3.2.4 Emergency Report and Recharge;33
7.2.5;3.2.5 Head Hierarchy Maintenance;34
7.3;3.3 Summary;34
7.4;References;35
8;4 Recharge Scheduling;36
8.1;4.1 Emergency Recharge Scheduling Problem;36
8.2;4.2 Normal Recharge Scheduling;39
8.2.1;4.2.1 Weighted-Sum Algorithm;42
8.2.2;4.2.2 Adaptive Recharge Scheduling Algorithm;43
8.2.2.1;4.2.2.1 Adaptive Network Partitioning;44
8.2.2.2;4.2.2.2 Generating Capacitated Minimum Spanning Tree;46
8.2.2.3;4.2.2.3 Insertion Algorithm for Recharge Route Improvement;48
8.2.2.4;4.2.2.4 Computation Complexity;52
8.3;4.3 Summary;52
8.4;References;52
9;5 Performance Evaluations;54
9.1;5.1 Parameter Settings;54
9.2;5.2 Comparison of Recharge Scheduling Algorithms;55
9.3;5.3 Node Nonfunctionality;55
9.4;5.4 Energy Evolution;56
9.5;5.5 Duration of Nonfunctional Status;58
9.6;5.6 Data Collection Latency;59
9.7;5.7 Overhead of Node Status Collection Protocol;60
9.8;5.8 Charging Vehicle's Moving Energy Cost;60
9.9;5.9 Comparison with Static Optimization Approach;62
9.10;5.10 Summary;63
9.11;References;63
10;6 Conclusions;64
11;Glossary;65