Screen LibraryTheory and practice of wireless sensor networks : cover, sense, and inform /
This book aims at developing a readers thorough understanding of the challenges and opportunities of two categories of networks, namely k-covered wireless sensor networks and k-barrier covered wireless sensor networks. It presents a variety of theoretical studies based on percolation theory, convexi...
Saved in:
| Main Authors: | |
|---|---|
| Published: |
Springer,
|
| Publisher Address: | Cham : |
| Publication Dates: | [2023] |
| Literature type: | Book |
| Language: | English |
| Series: |
Studies in systems, decision and control,
volume 214 |
| Subjects: | |
| Summary: |
This book aims at developing a readers thorough understanding of the challenges and opportunities of two categories of networks, namely k-covered wireless sensor networks and k-barrier covered wireless sensor networks. It presents a variety of theoretical studies based on percolation theory, convexity theory, and applied computational geometry, as well as the algorithms and protocols that are essential to their design, analysis, and development. Particularly, this book focuses on the cover, sense, and inform (CSI) paradigm with a goal to build a unified framework, where connected k-coverage (or k-barrier coverage), sensor scheduling, and geographic data forwarding, gathering, and delivery are jointly considered. It provides the interested reader with a fine study of the above networks, which can be covered in introductory and advanced courses on wireless sensor networks. This book is useful to senior undergraduate and graduate students in computer science, computer engineering, electrical engineering, information science, information technology, mathematics, and any related discipline. Also, it is of interest to computer scientists, researchers, and practitioners in academia and industry with interest in these two networks from their deployment until data gathering and delivery. |
| Carrier Form: | xxxvi, 762 pages : illustrations (some color) ; 25 cm. |
| Bibliography: | Includes bibliographical references (pages 739-762). |
| ISBN: |
9783031078224 3031078225 |
| Index Number: | TK7872 |
| CLC: | TP212 |
| Call Number: | TP212/A518 |
| Contents: |
Intro -- Preface -- Book Overview -- Book Organization -- Acknowledgments -- Contents -- Part I Foundations of Wireless Sensor Networks -- 1 General Introduction -- 1.1 Introduction -- 1.1.1 Major Tasks -- 1.1.2 Chapter Organization -- 1.2 Major Challenges -- 1.2.1 Limited Resources and Capabilities -- 1.2.2 Location Management -- 1.2.3 Sensor Deployment -- 1.2.4 Time-Varying Network Characteristics -- 1.2.5 Network Scalability, Heterogeneity, and Mobility -- 1.2.6 Sensing Application Requirements -- 1.3 Sample Sensing Applications -- 1.4 Book Motivations -- 1.5 Design Requirements 1.6 Book Contributions -- 1.7 Conclusion -- 2 Fundamental Concepts, Definitions, and Models -- 2.1 Introduction -- 2.1.1 Major Tasks -- 2.1.2 Chapter Organization -- 2.2 Terminology -- 2.3 Deterministic and Stochastic Sensing Models -- 2.4 Network Connectivity and Fault Tolerance -- 2.5 Energy Consumption Model -- 2.6 Percolation Model -- 2.6.1 Why a Continuum Percolation Model? -- 2.7 Default Network Model -- 2.8 Random and Group Mobility Models -- 2.8.1 Random Waypoint Mobility Model (RWP) -- 2.8.2 Reference Point Group Mobility Model (RPGM) -- 2.8.3 Manhattan Mobility Model (MMM) 2.8.4 Why Group and Random Mobility Models? -- 2.9 Conclusion -- Part II Percolation Theory-Based Coverage and Connectivity in Wireless Sensor Networks -- 3 A Planar Percolation-Theoretic Approach to Coverage and Connectivity -- 3.1 Introduction -- 3.1.1 Major Tasks -- 3.1.2 Chapter Organization -- 3.2 Phase Transition in Sensing Coverage -- 3.2.1 Estimation of the Shape of Covered Components -- 3.2.2 Critical Density of Covered Components -- 3.2.3 Critical Radius of Covered Components -- 3.2.4 Characterization of Critical Percolation -- 3.2.5 Numerical Results 3.3 Phase Transition in Network Connectivity -- 3.3.1 Integrated Sensing Coverage and Network Connectivity -- 3.4 Discussion -- 3.5 Related Work -- 3.6 Conclusion -- 4 A Spatial Percolation-Theoretic Approach to Coverage and Connectivity -- 4.1 Introduction -- 4.1.1 Major Tasks -- 4.1.2 Chapter Organization -- 4.2 Three Percolation Problems -- 4.2.1 Sensing Coverage Percolation -- 4.2.2 Network Connectivity Percolation -- 4.2.3 Coverage and Connectivity Percolation -- 4.3 Further Discussion -- 4.3.1 Practicality and Generalizability Issues -- 4.3.2 Sensor Deployment in Spatial Fields 4.3.3 Relaxations of Assumptions -- 4.4 Related Work -- 4.5 Conclusion -- Part III Convexity Theory-Based Connected k-Coverage in Wireless Sensor Networks -- 5 A Planar Convexity Theory-Based Approach for Connected k-Coverage -- 5.1 Introduction -- 5.1.1 Major Tasks -- 5.1.2 Chapter Organization -- 5.2 Achieving Connected k-Coverage -- 5.2.1 Connected k-Coverage Problem Modeling -- 5.2.2 Sufficient Condition to Ensure k-Coverage -- 5.3 Centralized k-Coverage Protocol -- 5.3.1 Planar Deployment Field Slicing -- 5.3.2 Sensor Selection -- 5.3.3 Slicing Grid Dynamics |