Challenges and Opportunities of Connected k-Covered Wireless Sensor Networks From Sensor Deployment to Data Gathering /

• Κύριος συγγραφέας: Ammari, Habib M. (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
• Σειρά: Studies in Computational Intelligence, 215
• Θέματα: Engineering.; Artificial intelligence.; Applied mathematics.; Engineering mathematics.; Electrical engineering.; Appl.Mathematics/Computational Methods of Engineering.; Communications Engineering, Networks.; Artificial Intelligence (incl. Robotics).

 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 René 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. 

 1: Introduction and Background Concepts -- Overview of Wireless Sensor Networks -- Background and Fundamentals -- 2: Almost Sure Coverage and Connectivity -- Phase Transitions in Coverage and Connectivity in Two-Dimensional Deployment Fields -- Phase Transitions in Coverage and Connectivity in Three-Dimensional Deployment Fields -- 3: Connected k-Coverage -- Connected k-Coverage in Two-Dimensional Deployment Fields -- Heterogeneous and Mobile Connected k-Coverage in Two-Dimensional Deployment Fields -- Two-Dimensional Stochastic Connected k–Coverage and Three-Dimensional Connected k–Coverage -- Network Connectivity and Fault-Tolerance Measures in Two-Dimensional Deployment Fields -- 4: Data Forwarding and Gathering -- Geographic Forwarding on Always-On Sensors -- Trade-Off between Energy and Delay in Geographic Forwarding on Always-On Sensors -- Energy Sink-Hole Problem with Always-On Sensors in Two-Dimensional Deployment Fields -- Geographic Forwarding on Duty-Cycled Sensors in Two-Dimensional and Three-Dimensional Deployment Fields -- 5: Summary and Further Extensions -- Conclusion and Future Work.