Externally indexed torrent

If you are the original uploader, contact staff to have it moved to your account

Textbook in PDF format

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 have 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 two types of networks: The first category is called k-covered wireless sensor networks, where every point in a deployment field is covered (or sensed) by at least k sensors. The second category is called k-barrier covered wireless sensor networks, where every path in a deployment field intersects with the sensing range (disk or sphere) of at least k sensors.
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.
Foundations of Wireless Sensor Networks
General Introduction
Fundamental Concepts, Definitions, and Models
Percolation Theory-Based Coverage and Connectivity in Wireless Sensor Networks
A Planar Percolation-Theoretic Approach to Coverage and Connectivity
A Spatial Percolation-Theoretic Approach to Coverage and Connectivity
Convexity Theory-Based Connected k-Coverage in Wireless Sensor Networks
A Planar Convexity Theory-Based Approach for Connected k-Coverage
Planar Convexity Theory-Based Approaches for Heterogeneous, On-Demand, and Stochastic Connected k-Coverage
Spatial Convexity Theory-Based Approaches for Connected k–Coverage
Applied Computational Geometry-Based Connected k-Coverage in Wireless Sensor Networks
A Planar Regular Hexagonal Tessellation-Based Approach for Connected k-Coverage
A Planar Irregular Hexagonal Tessellation-Based Approach for Connected k-Coverage
A Polyhedral Space Filler Tessellation-Based Approach for Connected k-Coverage
Connectivity and Fault-Tolerance Measures of k-Covered Wireless Sensor Networks
Planar Unconditional and Conditional Network Connectivity and Fault-Tolerance Measures for k-Covered Wireless Sensor Networks
Spatial Unconditional and Conditional Network Connectivity and Fault-Tolerance Measures for k-Covered Wireless Sensor Networks
A Planar Checkpoints-Based Approach for Geographic Forwarding on Always-on Sensors
A Planar Energy-Delay Trade-off Based Approach for Geographic Forwarding on Always-on Sensors
A Planar Approach for Solving the Energy Sink-Hole Problem with Always-on Sensors
Joint k-Coverage and Geographic Data Forwarding and Gathering in Wireless Sensor Networks
Planar and Spatial Approaches for Joint k-Coverage and Data Collection Using Homogeneous Duty-Cycled Sensors
A Planar Approach for Joint k-Coverage and Data Collection Using Sparsely Deployed Duty-Cycled Sensors
Planar Approaches for Joint k-Coverage and Data Collection Using Heterogeneous Duty-Cycled Sensors
Connected k-Barrier Coverage in Wireless Sensor Networks
A Planar Approach for Physical Security Using Connected k-Barrier Coverage
A Spatial Approach for Physical Security Through Connected k-Barrier Coverage
An Overview of Sensing Hardware, Standards, Operating Systems, Software Development, and Applications and Systems
Summary and Further Extensions