Coverage Awareness Scheduling Protocols For Wireless Sensor Networks
Download Coverage Awareness Scheduling Protocols For Wireless Sensor Networks PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Coverage Awareness Scheduling Protocols For Wireless Sensor Networks book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Coverage-awareness Scheduling Protocols for Wireless Sensor Networks
The coverage and energy issues are the fundamental problems which prevent the development of wireless sensor networks. In order to accurately evaluate the monitoring quality (coverage), one needs to model the interactive of sensors, phenomenons and the environment. Furthermore, in collaborative with scheduling algorithm and computer optimization, protocols can improve the overall monitoring quality and prolong the lifetime of network. This thesis is an investigation of coverage problem and its relative applications in the wireless sensor networks. We first discuss the realistic of current boolean sensing model and propose an irregular sensing model used to determine the coverage in the area with obstacles. We then investigate a joint problem of maintaining the monitoring quality and extending the lifetime of network by using scheduling schemes. Since the scheduling problem is NP hard, genetic algorithm and Markov decision process are used to determine an achievable optimal result for the joint problem of coverage-preserving and lifetime-prolong. In order to avoid the cost of centralized or distributed scheduling algorithms, a localized coverage-preserving scheduling algorithm is proposed by exploring the construction process of Voronoi diagram. Besides exploring the coverage characteristic in a static wireless sensor network, we investigate the coverage problem when the mobile elements are introduced into network. We consider the single-hop mobile data gathering problem with the energy efficiency and data freshness concerns in a wireless sensor network where the connectivity cannot be maintained. We first investigate the upper/lower bound of the covering time for a single collector to cover the monitoring area. Through our investigation we show that for a bounded rectangle area a hexagon walk could explore the area more efficiently than a random walk when the edges of area are known. We then propose a virtual force mobile model (VFM) in which the energy consumption for data transmission is modeled as a virtual elastic force and used to guide of mobile collectors to move to optimal positions for energy saving.
Coverage Control in Sensor Networks
Author: Bang Wang
language: en
Publisher: Springer Science & Business Media
Release Date: 2010-01-11
The advances in sensor design have decreased the size, weight, and cost of sensors by orders of magnitude, yet with the increase of higher spatial and temporal re- lution and accuracy. With the fast progress of sensors design and communications technique, sensor networks have also been quickly evolving in both research and practical domains in the last decade. More and more sensor networks have been - ployed in real-world to gather information for our daily life. Applications of sensor networks can be found in battle?eld surveillance, environmental monitoring, b- logical detection, smart spaces, industrial diagnostics, etc. Although the technique of sensor networks has a very promising future, many challenges are still deserving lots of research efforts for its successful applications. Thisbookisdevotedtocoveragecontrol,oneofthemostfundamentalandimportant research issues in sensor networks. The aim of the book is to provide tutorial-like and up-to-date reference resources on various coverage control problems in sensor networks, a hot topic that has been intensively researched in recent years. Due to some unique characteristics of sensor networks such as energy constraint and - hoc topology, the coverage problems in sensor networks have many new scenarios and features that entitle them an important research issue in recent years. I have done my best to include in the book the most recent advances, techniques, protocols, results, and ?ndings in this ?eld.
Theory and Practice of Wireless Sensor Networks: Cover, Sense, and Inform
This book aims at developing a reader’s 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.