| Introduction | |
| Introduction | p. 3 |
| Sensors | p. 3 |
| Sensor Nodes | p. 5 |
| Sensor Networks | p. 9 |
| Sensor Network Scenarios | p. 9 |
| Sensor Network Applications | p. 12 |
| Challenges and Issues | p. 14 |
| Sensor Network Challenges | p. 14 |
| Key Research Issues | p. 15 |
| References | p. 17 |
| Sensor Coverage Model | p. 19 |
| Motivations | p. 19 |
| Sensor Coverage Models | p. 21 |
| Boolean Sector Coverage Models | p. 22 |
| Boolean Disk Coverage Models | p. 23 |
| Attenuated Disk Coverage Models | p. 25 |
| Truncated Attenuated Disk Models | p. 26 |
| Detection Coverage Models | p. 27 |
| Estimation Coverage Models | p. 30 |
| References | p. 32 |
| Network Coverage Control | p. 35 |
| Motivations and Objectives | p. 35 |
| Notes and Comments | p. 37 |
| Coverage Control in the Protocol Architecture | p. 38 |
| Notes and Comments | p. 40 |
| Design Issues of Network Coverage Control | p. 41 |
| A Taxonomy for Network Coverage Problems | p. 44 |
| References | p. 48 |
| Target Coverage Problems | |
| Node Placement Optimization | p. 51 |
| Node Placement as the Set-Covering Problem | p. 51 |
| Optimal Sensor Placement Problems | p. 55 |
| Modeling Node Placement | p. 56 |
| Approximation Algorithms | p. 57 |
| Other Placement Problems | p. 59 |
| References | p. 62 |
| Coverage Lifetime Maximization | p. 65 |
| Maximizing Target Coverage Lifetime | p. 65 |
| Disjoint Set Cover | p. 69 |
| Nondisjoint Set Cover | p. 77 |
| Notes and Comments | p. 83 |
| Maximizing Connected Target Coverage Lifetime | p. 84 |
| Notes and Comments | p. 92 |
| References | p. 93 |
| Area Coverage Problems | |
| Critical Sensor Density | p. 99 |
| Deterministic Node Placement | p. 99 |
| Node Placement in Two-Dimensional Field | p. 99 |
| Node Placement in Three-Dimensional Space | p. 103 |
| Notes and Comments | p. 106 |
| Random Node Deployment | p. 106 |
| Vacancy Analysis | p. 106 |
| Numerical Example | p. 114 |
| Notes and Comments | p. 116 |
| References | p. 118 |
| Sensor Activity Scheduling | p. 121 |
| Assumptions and Objectives | p. 121 |
| Preserving Complete Area Coverage | p. 123 |
| Redundancy Check Methods | p. 123 |
| Activity Scheduling Procedures | p. 127 |
| Example Scheduling Protocols | p. 129 |
| Notes and Comments | p. 133 |
| Preserving Partial Area Coverage | p. 134 |
| Random Independent Sleeping | p. 134 |
| Neighbor Based Scheduling | p. 136 |
| Example Scheduling Protocols | p. 140 |
| Notes and Comments | p. 145 |
| Preserving Area Coverage and Network Connectivity | p. 147 |
| Relation Between Area Coverage and Network Connectivity | p. 147 |
| Connected Coverage Scheduling | p. 148 |
| Notes and Comments | p. 150 |
| References | p. 150 |
| Node Movement Strategy | p. 155 |
| Healing Coverage Hole | p. 155 |
| Optimizing Area Coverage | p. 159 |
| Coverage Pattern Based Movement | p. 160 |
| Virtual Force Based Movement | p. 162 |
| Grid Quorum Based Movement | p. 164 |
| Improving Event Coverage | p. 168 |
| References | p. 170 |
| Barrier Coverage Problems | |
| Build Intrusion Barriers | p. 175 |
| Sensor Barrier for Intrusion Detection | p. 175 |
| Sensor Scheduling for Barrier Construction | p. 180 |
| Sensor Barrier with Mobile Nodes | p. 183 |
| References | p. 185 |
| Find Penetration Paths | p. 187 |
| Maximal Breach Path | p. 187 |
| Maximal Support Path | p. 190 |
| Exposure Path | p. 192 |
| Detection Path | p. 194 |
| Analysis for Path Characteristics | p. 198 |
| References | p. 199 |
| Voronoi Diagram and Delaunay Triangulation | p. 201 |
| Voronoi Diagram | p. 201 |
| Delaunay Triangulation | p. 203 |
| References | p. 203 |
| Index | p. 205 |
| Color Plates | p. 207 |
| Table of Contents provided by Ingram. All Rights Reserved. |