Dynamic Coverage Problems in Sensor Networks

• Published in: Intelligent Sensor Networks pp. 459 - 482
• Main Authors: Djidjev, Hristo, Potkonjak, Miodrag
• Format: Book Chapter
• Language: English
• Published: CRC Press 2013
• Edition: 1
• Subjects: Min Max Problem; Exact Polynomial Time Algorithm; Sensor Networks; Medical Shoes; Barrier Coverage; Perimeter Coverage; Dynamic Coverage; Menger’s Theorem; Voronoi Diagram; Wireless Sensor Networks; Mobile Sensors; Energy Efficiency; Min Max Algorithm; Sweep Coverage; Coverage Problem; Maximum Breach Path; Cognitive Wireless Sensor Networks; Shortest Paths Formulation; Weak Coverage; Intelligent Sensor Networks; Vertex Disjoint Paths; Poisson Point Process; Traveling Salesman Problem; Physical Unclonable Function
• ISBN: 1138199745; 9781439892817; 1439892814; 9781138199743
• DOI: 10.1201/b14300-24

This chapter discusses the practitioners and facilitate starting research in obtaining a better global picture of coverage in sensor networks. Coverage may be defined as a task where the objective is to guarantee that a set of entities of interest is completely covered. The research and development impetus was provided by rapid emergence of security as one of the most important and desired system and application aspects. Security is one of the premier requirements in many applications and its relative role is rapidly increasing. It already ranges from privacy and trust to resiliency against hardware, software, and physical attacks. The chapter also discusses the importance of the coverage problem in sensor networks and briefly review the topic of static coverage. In static coverage, the goal is to place the smallest number of sensors in such a way that an area of interest is observable.