Challenges and opportunities of connected k-covered wireless sensor networks : from sensor deployment to data gathering /
Ammari, Habib,
Challenges and opportunities of connected k-covered wireless sensor networks : from sensor deployment to data gathering / Habib M. Ammari. - xxvi, 342 pages : illustrations ; 24 cm. - Studies in computational intelligence v. 2 . - Studies in computational intelligence v. 2. .
Includes bibliographical references (pages 321-334) and index.
Introduction and Background Concepts -- Overview of Wireless Sensor Networks -- Introduction -- Major Challenges -- Limited Resources and Capabilities -- Location Management -- Sensor Deployment -- Time-Varying Network Characteristics -- Network Scalability, Heterogeneity, and Mobility -- Sensing Application Requirements -- Sample Sensing Applications -- Motivations of This Book -- Design Requirements -- Contributions of This Book -- Summary -- Background and Fundamentals -- Introduction -- Terminology -- Deterministic and Stochastic Sensing Models -- Network Connectivity and Fault Tolerance -- Energy Consumption Model -- Percolation Model -- Why a Continuum Percolation Model? -- Network Model -- Summary -- Almost Sure Coverage and Connectivity -- Phase Transitions in Coverage and Connectivity in Two-Dimensional Deployment Fields -- Introduction -- Phase Transition in Sensing Coverage -- Estimation of the Shape of Covered Components -- Critical Density of Covered Components -- Critical Radius of Covered Components -- Characterization of Critical Percolation -- Numerical Results -- Phase Transition in Network Connectivity -- Integrated Sensing Coverage and Network Connectivity -- 1 Simultaneous Phase Transitions When R >= 2r -- 2 Simultaneous Phase Transitions When r <= R < 2r -- Discussion -- Related Work -- Summary -- Phase Transitions in Coverage and Connectivity in Three-Dimensional Deployment Fields -- Introduction -- Three Percolation Problems -- Sensing Coverage Percolation -- Network Connectivity Percolation -- Coverage and Connectivity Percolation -- 1 Two-Concentric-Sphere Model -- 2 Integrated Continuum Percolation -- Further Discussion -- Practicality and Generalizability Issues -- Sensor Deployment in Three-Dimensional Fields -- Relaxations of Assumptions -- 1 Relaxing the Unit Sphere Model -- 2 Relaxing the Homogeneous Sensor Model -- Related Work -- Summary -- Part 1. 1. 1.1. 1.2. 1.2.1. 1.2.2. 1.2.3. 1.2.4. 1.2.5. 1.2.6. 1.3. 1.4. 1.5. 1.6. 1.7. 2. 2.1. 2.2. 2.3. 2.4. 2.5. 2.6. 2.6.1. 2.7. 2.8. Part 2. 3. 3.1. 3.2. 3.2.1. 3.2.2. 3.2.3. 3.2.4. 3.2.5. 3.3. 3.3.1. 3.3.1. 3.3.1. 3.4. 3.5. 3.6. 4. 4.1. 4.2. 4.2.1. 4.2.2. 4.2.3. 4.2.3. 4.2.3. 4.3. 4.3.1. 4.3.2. 4.3.3. 4.3.3. 4.3.3. 4.4. 4.5. Connected k-Coverage -- Connected k-Coverage in Two-Dimensional Deployment Fields -- Introduction -- Achieving Connected k-Coverage -- Connected k-Coverage Problem Modeling -- Sufficient Condition to Ensure k-Coverage -- Centralized k-Coverage Protocol -- Deployment Field Slicing -- Sensor Selection -- Slicing Grid Dynamics -- Clustered k-Coverage Protocol -- Cluster-Head Selection and Attributed Roles -- The T-CRACCk Protocol -- The D-CRACCk Protocol -- 1 Deployment Field Clustering -- 2 Cluster-Heads Coordination and Sensor Selection -- Distributed k-Coverage Protocol -- k-Coverage Checking Algorithm and Sensor Selection -- State Transition Diagram of Trig-DIRACCk -- Ensuring Network Connectivity -- Self-scheduling Based k-Coverage -- k-Coverage Candidacy Algorithm -- State Transition Diagram of Self-DIRACCk -- Tri-DIRACCk Versus Self-DIRACCk -- Relaxation of Assumptions -- Relaxing the Unit Disk Model -- Relaxing the Sensor Homogeneity Model -- Performance Evaluation -- Simulation Settings -- Simulation Results -- Comparison of Self-DIRACCk with CCP -- Related Work -- Summary -- Heterogeneous and Mobile Connected k-Coverage in Two-Dimensional Deployment Fields -- Introduction -- Heterogeneous Connected k-Coverage -- Random Deployment Approach -- 1 Centralized Connected k-Coverage Protocol -- 2 Distributed Connected k-Coverage Protocol (R-Het-DCCk) -- Pseudo-random Deployment Approach -- 1 Centralized Connected k-Coverage Protocol (PR-Het-CCCk) -- 2 Distributed Connected k-Coverage Protocol (PR-Het-DCCk) -- Performance Evaluation -- Mobile Connected k-Coverage -- Pseudo-random Sensor Placement -- Sensor Mobility for k-Coverage of a Region of Interest -- 1 Centralized Approach for Mobile Sensor Selection (CAMSEL) -- 2 Distributed Approach for Mobile Sensor Selection (DAMSEL) -- 3 How to Ensure Network Connectivity? -- Performance Evaluation -- Related Work -- Sensor Heterogeneity -- Sensor Mobility -- Summary -- Two-Dimensional Stochastic Connected k - Coverage and Three-Dimensional Connected k - Coverage -- Introduction -- Two-Dimensional Stochastic Connected k-Coverage -- Stochastic k-Coverage Characterization -- Stochastic k-Coverage-Preserving Scheduling -- 1 k-Coverage Candidacy Algorithm -- 2 State Transition of SCPk -- Simulation Results -- Three-Dimensional Connected k-Coverage -- Problem Analysis: The Curse of Dimensionality -- Our Distributed k-Coverage Protocol -- Performance Evaluation -- Related Work -- Summary -- Network Connectivity and Fault-Tolerance Measures in Two-Dimensional Deployment Fields -- Introduction -- Unconditional Fault-Tolerance Measures -- Homogeneous Sensors -- Heterogeneous Sensors -- Conditional Fault-Tolerance Measures -- Homogeneous Sensors -- Heterogeneous Sensors -- Related Work -- Summary -- Part 3. 5. 5.1. 5.2. 5.2.1. 5.2.2. 5.3. 5.3.1. 5.3.2. 5.3.3. 5.4. 5.4.1. 5.4.2. 5.4.3. 5.4.3. 5.4.3. 5.5. 5.5.1. 5.5.2. 5.5.3. 5.6. 5.6.1. 5.6.2. 5.6.3. 5.7. 5.7.1. 5.7.2. 5.8. 5.8.1. 5.8.2. 5.8.3. 5.9. 5.10. 6. 6.1. 6.2. 6.2.1. 6.2.1. 6.2.1. 6.2.2. 6.2.2. 6.2.2. 6.2.3. 6.3. 6.3.1. 6.3.2. 6.3.2. 6.3.2. 6.3.2. 6.3.3. 6.4. 6.4.1. 6.4.2. 6.5. 7. 7.1. 7.2. 7.2.1. 7.2.2. 7.2.2. 7.2.2. 7.2.3. 7.3. 7.3.1. 7.3.2. 7.3.3. 7.4. 7.5. 8. 8.1. 8.2. 8.2.1. 8.2.2. 8.2.3. 8.2.4. 8.2.5. 8.3. 8.4. Data Forwarding and Gathering -- Geographic Forwarding on Always-On Sensors -- Introduction -- The WLDT Protocol -- Long-Range Versus Short-Range Forwarding -- A Two-Step Data Forwarding Protocol -- 1 Checkpoint Selection -- 2 Checkpoint-Based Short-Range Forwarding -- Illustrative Example -- Analysis of WLDT -- Short-Range Versus Long-Range -- Energy Gain -- Controlled Short-Range Data Forwarding -- Discussion -- Related Work -- Summary -- Trade-Off between Energy and Delay in Geographic Forwarding on Always-On Sensors -- Introduction -- A Slicing Approach -- Slicing of Communication Range -- Selection of Candidate Proxy Forwarders -- Uniform Energy Depletion Characterization -- Trading-Off Energy with Delay -- Simple Analytical Bounds -- 1 Data Forwarding along Shortest Paths -- 2 Data Forwarding along Non-direct Paths -- 3 Numerical Results -- Multi-objective Optimization Approach -- 1 Overview of the WES Approach -- 2 Solving the Trade-Off Problem Using WES -- 3 Numerical Results -- TED Detailed Description -- 1 Communication Range Slicing -- 2 Concentric Circular Band Selection -- 3 Proxy Forwarder Selection -- 4 Is k Fixed for All Proxy Forwarders or Not? -- Relaxation of Several Key Assumptions -- Relaxing the Sensor Homogeneity Model -- Relaxing the Communication Disk Model -- Relaxing the Dense Network Model -- Relaxing the Energy Consumption Model -- Relaxing the Always-On Sensors Model -- Simulation Results -- Simulation Settings -- Impact of Selection Space Size -- Using the Energy x Delay Metric -- Impact of Variability of k -- Impact of Sensor Heterogeneity -- Related Work -- Summary -- Energy Sink-Hole Problem with Always-On Sensors in Two-Dimensional Deployment Fields -- Introduction -- Energy Sink-Hole Problem Analysis -- Base Protocol Average Energy Consumption -- Nominal Communication Range-Based Data Forwarding -- Adjustable Communication Range-Based Data Forwarding -- 1 Perfect Uniform Energy Depletion -- 2 Partial Uniform Energy Depletion -- Using Heterogeneous Sensors -- Multi-tier Architecture -- NEAR Performance Evaluation -- Sink Mobility and Energy Aware Voronoi Diagram -- Why Energy Aware Voronoi Diagram? -- EVEN Detailed Description -- 1 Computing Relative Positions -- 2 Computing Energy-Aware Voronoi Diagram -- EVEN Performance Evaluation -- 1 Impact of Sink Mobility -- 2 Comparing EVEN with VGF -- 3 Comparing EVEN with Another Protocol -- Related Work -- Balancing Energy Consumption -- Minimizing Energy Consumption -- Mobility-Based Forwarding Protocols -- Summary -- Geographic Forwarding on Duty-Cycled Sensors in Two-Dimensional and Three-Dimensional Deployment Fields -- Introduction -- Two-Dimensional Sensor Deployment -- Potential Fields Based Modeling Approach -- Data Forwarding without Aggregation -- Data Forwarding with Aggregation -- 1 Locally Aggregated Data Forwarding -- 2 Globally Aggregated Data Forwarding -- Generalizability of GEFIB -- 1 Convex Sensing and Communication Model -- 2 Sensor Heterogeneity Model -- Performance Evaluation -- Three-Dimensional Sensor Deployment -- Hybrid Geographic Forwarding -- Performance Evaluation -- Related Work -- Summary -- Part 4. 9. 9.1. 9.2. 9.2.1. 9.2.2. 9.2.2. 9.2.2. 9.2.3. 9.3. 9.4. 9.4.1. 9.4.2. 9.5. 9.6. 9.7. 10. 10.1. 10.2. 10.2.1. 10.2.2. 10.2.3. 10.3. 10.3.1. 10.3.1. 10.3.1. 10.3.1. 10.3.2. 10.3.2. 10.3.2. 10.3.2. 10.3.3. 10.3.3. 10.3.3. 10.3.3. 10.3.3. 10.4. 10.4.1. 10.4.2. 10.4.3. 10.4.4. 10.4.5. 10.5. 10.5.1. 10.5.2. 10.5.3. 10.5.4. 10.5.5. 10.6. 10.7. 11. 11.1. 11.2. 11.2.1. 11.2.2. 11.2.3. 11.2.3. 11.2.3. 11.3. 11.3.1. 11.3.2. 11.4. 11.4.1. 11.4.2. 11.4.2. 11.4.2. 11.4.3. 11.4.3. 11.4.3. 11.4.3. 11.5. 11.5.1. 11.5.2. 11.5.3. 11.6. 12. 12.1. 12.2. 12.2.1. 12.2.2. 12.2.3. 12.2.3. 12.2.3. 12.2.4. 12.2.4. 12.2.4. 12.2.5. 12.3. 12.3.1. 12.3.2. 12.4. 12.5. Summary and Further Extensions -- Conclusion and Future Work -- Contributions of This Book -- Research Directions -- Appendix: Network Connectivity and Fault-Tolerance Measures in Three-Dimensional Deployment Fields -- Introduction -- k-Coverage Characterization -- Unconditional Connectivity -- Conditional Connectivity -- Discussion -- Relaxing the Unit Sphere Model: Convex Model -- Underwater Sensor Networks -- Summary. Part 5. 13. 13.1. 13.2. 1. 2. 3. 4. 5. 6. 7. 8.
"Wireless sensor networks have received significant attention because of their important role and many conveniences in our lives. Indeed, the recent and fast advances in inexpensive sensor technology and wireless communications has made the design and development of large-scale wireless sensor networks cost-effective and appealing to a wide range of mission-critical situations, including civilian, natural, industrial, and military applications, such as health and environmental monitoring, seism monitoring, industrial process automation, and battlefields surveillance, respectively. A wireless sensor network consists of a large number of tiny, low-powered devices, called sensors, which are randomly or deterministically deployed in a field of interest while collaborating and coordinating for the successful accomplishment of their mission. These sensors suffer from very scarce resources and capabilities, such as bandwidth, storage, CPU, battery power (or energy), sensing, and communication, to name a few, with energy being the most critical one. The major challenge in the design process of this type of network is mainly due to the limited capabilities of the sensors, and particularly, their energy, which makes them unreliable. This book aims to develop a reader's thorough understanding of the opportunities and challenges of k-covered wireless sensor networks, where each point in a deployment field is covered (or sensed) by at least k sensors. Following Rene Descartes' most elegant methodology of dividing each difficulty into as many parts as might be possible and necessary to best solve it (Discours de la Method, 1637), this book presents a variety of theoretical studies based on percolation theory and computational geometry, as well as protocols that lead to the design of a unified framework, where connected k-coverage, sensor scheduling, and data routing and dissemination are jointly considered ."--Publisher's website.
3642018769 9783642018763
Wireless sensor networks
TK7872.D48 / A43 2009
621.381
Challenges and opportunities of connected k-covered wireless sensor networks : from sensor deployment to data gathering / Habib M. Ammari. - xxvi, 342 pages : illustrations ; 24 cm. - Studies in computational intelligence v. 2 . - Studies in computational intelligence v. 2. .
Includes bibliographical references (pages 321-334) and index.
Introduction and Background Concepts -- Overview of Wireless Sensor Networks -- Introduction -- Major Challenges -- Limited Resources and Capabilities -- Location Management -- Sensor Deployment -- Time-Varying Network Characteristics -- Network Scalability, Heterogeneity, and Mobility -- Sensing Application Requirements -- Sample Sensing Applications -- Motivations of This Book -- Design Requirements -- Contributions of This Book -- Summary -- Background and Fundamentals -- Introduction -- Terminology -- Deterministic and Stochastic Sensing Models -- Network Connectivity and Fault Tolerance -- Energy Consumption Model -- Percolation Model -- Why a Continuum Percolation Model? -- Network Model -- Summary -- Almost Sure Coverage and Connectivity -- Phase Transitions in Coverage and Connectivity in Two-Dimensional Deployment Fields -- Introduction -- Phase Transition in Sensing Coverage -- Estimation of the Shape of Covered Components -- Critical Density of Covered Components -- Critical Radius of Covered Components -- Characterization of Critical Percolation -- Numerical Results -- Phase Transition in Network Connectivity -- Integrated Sensing Coverage and Network Connectivity -- 1 Simultaneous Phase Transitions When R >= 2r -- 2 Simultaneous Phase Transitions When r <= R < 2r -- Discussion -- Related Work -- Summary -- Phase Transitions in Coverage and Connectivity in Three-Dimensional Deployment Fields -- Introduction -- Three Percolation Problems -- Sensing Coverage Percolation -- Network Connectivity Percolation -- Coverage and Connectivity Percolation -- 1 Two-Concentric-Sphere Model -- 2 Integrated Continuum Percolation -- Further Discussion -- Practicality and Generalizability Issues -- Sensor Deployment in Three-Dimensional Fields -- Relaxations of Assumptions -- 1 Relaxing the Unit Sphere Model -- 2 Relaxing the Homogeneous Sensor Model -- Related Work -- Summary -- Part 1. 1. 1.1. 1.2. 1.2.1. 1.2.2. 1.2.3. 1.2.4. 1.2.5. 1.2.6. 1.3. 1.4. 1.5. 1.6. 1.7. 2. 2.1. 2.2. 2.3. 2.4. 2.5. 2.6. 2.6.1. 2.7. 2.8. Part 2. 3. 3.1. 3.2. 3.2.1. 3.2.2. 3.2.3. 3.2.4. 3.2.5. 3.3. 3.3.1. 3.3.1. 3.3.1. 3.4. 3.5. 3.6. 4. 4.1. 4.2. 4.2.1. 4.2.2. 4.2.3. 4.2.3. 4.2.3. 4.3. 4.3.1. 4.3.2. 4.3.3. 4.3.3. 4.3.3. 4.4. 4.5. Connected k-Coverage -- Connected k-Coverage in Two-Dimensional Deployment Fields -- Introduction -- Achieving Connected k-Coverage -- Connected k-Coverage Problem Modeling -- Sufficient Condition to Ensure k-Coverage -- Centralized k-Coverage Protocol -- Deployment Field Slicing -- Sensor Selection -- Slicing Grid Dynamics -- Clustered k-Coverage Protocol -- Cluster-Head Selection and Attributed Roles -- The T-CRACCk Protocol -- The D-CRACCk Protocol -- 1 Deployment Field Clustering -- 2 Cluster-Heads Coordination and Sensor Selection -- Distributed k-Coverage Protocol -- k-Coverage Checking Algorithm and Sensor Selection -- State Transition Diagram of Trig-DIRACCk -- Ensuring Network Connectivity -- Self-scheduling Based k-Coverage -- k-Coverage Candidacy Algorithm -- State Transition Diagram of Self-DIRACCk -- Tri-DIRACCk Versus Self-DIRACCk -- Relaxation of Assumptions -- Relaxing the Unit Disk Model -- Relaxing the Sensor Homogeneity Model -- Performance Evaluation -- Simulation Settings -- Simulation Results -- Comparison of Self-DIRACCk with CCP -- Related Work -- Summary -- Heterogeneous and Mobile Connected k-Coverage in Two-Dimensional Deployment Fields -- Introduction -- Heterogeneous Connected k-Coverage -- Random Deployment Approach -- 1 Centralized Connected k-Coverage Protocol -- 2 Distributed Connected k-Coverage Protocol (R-Het-DCCk) -- Pseudo-random Deployment Approach -- 1 Centralized Connected k-Coverage Protocol (PR-Het-CCCk) -- 2 Distributed Connected k-Coverage Protocol (PR-Het-DCCk) -- Performance Evaluation -- Mobile Connected k-Coverage -- Pseudo-random Sensor Placement -- Sensor Mobility for k-Coverage of a Region of Interest -- 1 Centralized Approach for Mobile Sensor Selection (CAMSEL) -- 2 Distributed Approach for Mobile Sensor Selection (DAMSEL) -- 3 How to Ensure Network Connectivity? -- Performance Evaluation -- Related Work -- Sensor Heterogeneity -- Sensor Mobility -- Summary -- Two-Dimensional Stochastic Connected k - Coverage and Three-Dimensional Connected k - Coverage -- Introduction -- Two-Dimensional Stochastic Connected k-Coverage -- Stochastic k-Coverage Characterization -- Stochastic k-Coverage-Preserving Scheduling -- 1 k-Coverage Candidacy Algorithm -- 2 State Transition of SCPk -- Simulation Results -- Three-Dimensional Connected k-Coverage -- Problem Analysis: The Curse of Dimensionality -- Our Distributed k-Coverage Protocol -- Performance Evaluation -- Related Work -- Summary -- Network Connectivity and Fault-Tolerance Measures in Two-Dimensional Deployment Fields -- Introduction -- Unconditional Fault-Tolerance Measures -- Homogeneous Sensors -- Heterogeneous Sensors -- Conditional Fault-Tolerance Measures -- Homogeneous Sensors -- Heterogeneous Sensors -- Related Work -- Summary -- Part 3. 5. 5.1. 5.2. 5.2.1. 5.2.2. 5.3. 5.3.1. 5.3.2. 5.3.3. 5.4. 5.4.1. 5.4.2. 5.4.3. 5.4.3. 5.4.3. 5.5. 5.5.1. 5.5.2. 5.5.3. 5.6. 5.6.1. 5.6.2. 5.6.3. 5.7. 5.7.1. 5.7.2. 5.8. 5.8.1. 5.8.2. 5.8.3. 5.9. 5.10. 6. 6.1. 6.2. 6.2.1. 6.2.1. 6.2.1. 6.2.2. 6.2.2. 6.2.2. 6.2.3. 6.3. 6.3.1. 6.3.2. 6.3.2. 6.3.2. 6.3.2. 6.3.3. 6.4. 6.4.1. 6.4.2. 6.5. 7. 7.1. 7.2. 7.2.1. 7.2.2. 7.2.2. 7.2.2. 7.2.3. 7.3. 7.3.1. 7.3.2. 7.3.3. 7.4. 7.5. 8. 8.1. 8.2. 8.2.1. 8.2.2. 8.2.3. 8.2.4. 8.2.5. 8.3. 8.4. Data Forwarding and Gathering -- Geographic Forwarding on Always-On Sensors -- Introduction -- The WLDT Protocol -- Long-Range Versus Short-Range Forwarding -- A Two-Step Data Forwarding Protocol -- 1 Checkpoint Selection -- 2 Checkpoint-Based Short-Range Forwarding -- Illustrative Example -- Analysis of WLDT -- Short-Range Versus Long-Range -- Energy Gain -- Controlled Short-Range Data Forwarding -- Discussion -- Related Work -- Summary -- Trade-Off between Energy and Delay in Geographic Forwarding on Always-On Sensors -- Introduction -- A Slicing Approach -- Slicing of Communication Range -- Selection of Candidate Proxy Forwarders -- Uniform Energy Depletion Characterization -- Trading-Off Energy with Delay -- Simple Analytical Bounds -- 1 Data Forwarding along Shortest Paths -- 2 Data Forwarding along Non-direct Paths -- 3 Numerical Results -- Multi-objective Optimization Approach -- 1 Overview of the WES Approach -- 2 Solving the Trade-Off Problem Using WES -- 3 Numerical Results -- TED Detailed Description -- 1 Communication Range Slicing -- 2 Concentric Circular Band Selection -- 3 Proxy Forwarder Selection -- 4 Is k Fixed for All Proxy Forwarders or Not? -- Relaxation of Several Key Assumptions -- Relaxing the Sensor Homogeneity Model -- Relaxing the Communication Disk Model -- Relaxing the Dense Network Model -- Relaxing the Energy Consumption Model -- Relaxing the Always-On Sensors Model -- Simulation Results -- Simulation Settings -- Impact of Selection Space Size -- Using the Energy x Delay Metric -- Impact of Variability of k -- Impact of Sensor Heterogeneity -- Related Work -- Summary -- Energy Sink-Hole Problem with Always-On Sensors in Two-Dimensional Deployment Fields -- Introduction -- Energy Sink-Hole Problem Analysis -- Base Protocol Average Energy Consumption -- Nominal Communication Range-Based Data Forwarding -- Adjustable Communication Range-Based Data Forwarding -- 1 Perfect Uniform Energy Depletion -- 2 Partial Uniform Energy Depletion -- Using Heterogeneous Sensors -- Multi-tier Architecture -- NEAR Performance Evaluation -- Sink Mobility and Energy Aware Voronoi Diagram -- Why Energy Aware Voronoi Diagram? -- EVEN Detailed Description -- 1 Computing Relative Positions -- 2 Computing Energy-Aware Voronoi Diagram -- EVEN Performance Evaluation -- 1 Impact of Sink Mobility -- 2 Comparing EVEN with VGF -- 3 Comparing EVEN with Another Protocol -- Related Work -- Balancing Energy Consumption -- Minimizing Energy Consumption -- Mobility-Based Forwarding Protocols -- Summary -- Geographic Forwarding on Duty-Cycled Sensors in Two-Dimensional and Three-Dimensional Deployment Fields -- Introduction -- Two-Dimensional Sensor Deployment -- Potential Fields Based Modeling Approach -- Data Forwarding without Aggregation -- Data Forwarding with Aggregation -- 1 Locally Aggregated Data Forwarding -- 2 Globally Aggregated Data Forwarding -- Generalizability of GEFIB -- 1 Convex Sensing and Communication Model -- 2 Sensor Heterogeneity Model -- Performance Evaluation -- Three-Dimensional Sensor Deployment -- Hybrid Geographic Forwarding -- Performance Evaluation -- Related Work -- Summary -- Part 4. 9. 9.1. 9.2. 9.2.1. 9.2.2. 9.2.2. 9.2.2. 9.2.3. 9.3. 9.4. 9.4.1. 9.4.2. 9.5. 9.6. 9.7. 10. 10.1. 10.2. 10.2.1. 10.2.2. 10.2.3. 10.3. 10.3.1. 10.3.1. 10.3.1. 10.3.1. 10.3.2. 10.3.2. 10.3.2. 10.3.2. 10.3.3. 10.3.3. 10.3.3. 10.3.3. 10.3.3. 10.4. 10.4.1. 10.4.2. 10.4.3. 10.4.4. 10.4.5. 10.5. 10.5.1. 10.5.2. 10.5.3. 10.5.4. 10.5.5. 10.6. 10.7. 11. 11.1. 11.2. 11.2.1. 11.2.2. 11.2.3. 11.2.3. 11.2.3. 11.3. 11.3.1. 11.3.2. 11.4. 11.4.1. 11.4.2. 11.4.2. 11.4.2. 11.4.3. 11.4.3. 11.4.3. 11.4.3. 11.5. 11.5.1. 11.5.2. 11.5.3. 11.6. 12. 12.1. 12.2. 12.2.1. 12.2.2. 12.2.3. 12.2.3. 12.2.3. 12.2.4. 12.2.4. 12.2.4. 12.2.5. 12.3. 12.3.1. 12.3.2. 12.4. 12.5. Summary and Further Extensions -- Conclusion and Future Work -- Contributions of This Book -- Research Directions -- Appendix: Network Connectivity and Fault-Tolerance Measures in Three-Dimensional Deployment Fields -- Introduction -- k-Coverage Characterization -- Unconditional Connectivity -- Conditional Connectivity -- Discussion -- Relaxing the Unit Sphere Model: Convex Model -- Underwater Sensor Networks -- Summary. Part 5. 13. 13.1. 13.2. 1. 2. 3. 4. 5. 6. 7. 8.
"Wireless sensor networks have received significant attention because of their important role and many conveniences in our lives. Indeed, the recent and fast advances in inexpensive sensor technology and wireless communications has made the design and development of large-scale wireless sensor networks cost-effective and appealing to a wide range of mission-critical situations, including civilian, natural, industrial, and military applications, such as health and environmental monitoring, seism monitoring, industrial process automation, and battlefields surveillance, respectively. A wireless sensor network consists of a large number of tiny, low-powered devices, called sensors, which are randomly or deterministically deployed in a field of interest while collaborating and coordinating for the successful accomplishment of their mission. These sensors suffer from very scarce resources and capabilities, such as bandwidth, storage, CPU, battery power (or energy), sensing, and communication, to name a few, with energy being the most critical one. The major challenge in the design process of this type of network is mainly due to the limited capabilities of the sensors, and particularly, their energy, which makes them unreliable. This book aims to develop a reader's thorough understanding of the opportunities and challenges of k-covered wireless sensor networks, where each point in a deployment field is covered (or sensed) by at least k sensors. Following Rene Descartes' most elegant methodology of dividing each difficulty into as many parts as might be possible and necessary to best solve it (Discours de la Method, 1637), this book presents a variety of theoretical studies based on percolation theory and computational geometry, as well as protocols that lead to the design of a unified framework, where connected k-coverage, sensor scheduling, and data routing and dissemination are jointly considered ."--Publisher's website.
3642018769 9783642018763
Wireless sensor networks
TK7872.D48 / A43 2009
621.381