nach oben

2009 | Buch

Kapitel lesen Erstes Kapitel lesen

Challenges and Opportunities of Connected k-Covered Wireless Sensor Networks

From Sensor Deployment to Data Gathering

verfasst von: Habib M. Ammari

Verlag: Springer Berlin Heidelberg

Buchreihe : Studies in Computational Intelligence

Enthalten in: Springer Professional "Wirtschaft+Technik" , Springer Professional "Technik" , Springer Professional "Wirtschaft"

Einloggen, um Zugang zu erhalten

Über dieses Buch

“The decomposition of the difficulties to be resolved, or the objects to be known, should be pushed up to the simplest elements … Such elements are seized directly and completely by the intuition. ” René Descartes, Discours de la méthode (1637) Wireless sensor networks have received significant attention because of their - portant role and many conveniences in our lives. Indeed, the recent and fast - vances 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 s- veillance, respectively. A wireless sensor network consists of a large number of - ny, 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 - ergy), 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.

Inhaltsverzeichnis

Frontmatter

Part 1: Introduction and Background Concepts

Overview of Wireless Sensor Networks

Abstract

This chapter gives a brief introduction to wireless sensor networks (WSNs) and presents the major challenging problems in their design. Moreover, it describes a sample of their potential applications as well as a key set of design requirements of the protocols proposed in this book. Furthermore, it states the problems being investigated in this book along with a brief description of their solutions.

Habib M. Ammari

Background and Fundamentals

Abstract

This chapter introduces the terminology and background that are necessary for the description of all the protocols discussed in this book. Precisely, it gives some key definitions and describes a percolation model to study coverage and connectivity in two-dimensional and three-dimensional wireless sensor networks. In addition, it presents an energy consumption model and defines the default network model.

Habib M. Ammari

Part 2: Almost Sure Coverage and Connectivity

Phase Transitions in Coverage and Connectivity in Two-Dimensional Deployment Fields

Abstract

This chapter addresses the problems of almost sure integrated coverage and connectivity in two-dimensional wireless sensor networks from the perspective of percolation theory. Specifically, it focuses on finding the critical sensor density above which the network is almost surely connected and the deployment field is almost surely covered. It proposes our solution to this problem using a probabilistic approach. Precisely, each of the above problems is discussed separately. Then, both are investigated in an integrated manner using a suitable integration model.

Habib M. Ammari

Phase Transitions in Coverage and Connectivity in Three-Dimensional Deployment Fields

Abstract

This chapter focuses on the problem of almost sure integrated coverage and connectivity in three-dimensional wireless sensor networks. Precisely, it investigates the critical sensor density above which coverage percolation and connectivity percolation in three-dimensional deployment fields will almost surely occur. It discusses our solution to this problem using an approach that is totally different from the one we proposed for two-dimensional deployment fields. Also, it addresses the problem of integrated coverage and connectivity in a two-dimensional space.

Habib M. Ammari

Part 3: Connected k-Coverage

Connected k-Coverage in Two-Dimensional Deployment Fields

Abstract

This chapter focuses on the problem of connected k-coverage in densely deployed wireless sensor networks. Precisely, it investigates how to achieve k-coverage of a two-dimensional deployment field with a minimum number of sensors while maintaining network connectivity. It considers static and homogeneous sensors under the assumption of a deterministic sensing model. Also, it proposes centralized, pseudo-distributed, and fully distributed sensor scheduling protocols, where the sensors are duty-cycled to save energy while ensuring connected k-coverage.

Habib M. Ammari

Heterogeneous and Mobile Connected k-Coverage in Two-Dimensional Deployment Fields

Abstract

This chapter introduces our solution to the problem of connected k-coverage in heterogeneous two-dimensional wireless sensor networks, where the sensors do not necessarily have the same capabilities. Also, it discusses our solution to the same problem in mission-oriented mobile wireless sensor networks, which are deployed in two-dimensional fields that could have more than one monitoring task, i.e. mission, to be accomplished. Specifically, it focuses on how to fully k-cover a region of interest in a field using a minimum number of mobile sensors while minimizing the total energy consumption, which is due to the mobility of the sensors as well as their communication in order to successfully accomplish their specific mission.

Habib M. Ammari

Two-Dimensional Stochastic Connected k–Coverage and Three-Dimensional Connected k–Coverage

Abstract

This chapter addresses the problem of stochastic connected k-coverage in two-dimensional wireless sensor networks using a more realistic, probabilistic sensing model instead of a deterministic sensing model. Moreover, it investigates the problem of connected k-coverage in homogeneous three-dimensional wireless sensor networks while considering a deterministic sensing model. Both studies are generalizations of the work described earlier in Chap. 5. Our goal is to enhance the practicality of our previous work and extend its scope of applicability.

Habib M. Ammari

Network Connectivity and Fault-Tolerance Measures in Two-Dimensional Deployment Fields

Abstract

This chapter gives our measures of unconditional (or traditional) and conditional connectivity and fault-tolerance of two-dimensional k-covered wireless sensor networks. The latter measures are more realistic than the former as they impose a restriction on the subsets of sensors that can fail at the same time. Precisely, conditional measures take into consideration the inherent properties of k-covered wireless sensor networks, such as high sensor density and sensor heterogeneity. In particular, the neighbour set of a sensor is defined as a forbidden faulty set, and hence cannot fail at the same time. This concept defines the new measure of connectivity, called conditional connectivity, which seems to be more realistic.

Habib M. Ammari

Part 4: Data Forwarding and Gathering

Geographic Forwarding on Always-On Sensors

Abstract

This chapter addresses the problem of energy-efficient data forwarding in wireless sensor networks. It presents our solution to this problem for always-on wireless sensor networks, where the sensors are active all the time. Specifically, it investigates both short-range and long-range data forwarding schemes on always-on sensors and provides several theoretical and simulation results. It shows that short-range data forwarding scheme is more appropriate than long-range data forwarding scheme to save energy of the sensors and promote the longevity of wireless sensor networks with scarce energy resources. Our proposed solution is based on the geometric properties of Delaunay triangulation.

Habib M. Ammari

Trade-Off between Energy and Delay in Geographic Forwarding on Always-On Sensors

Abstract

This chapter proposes a data forwarding protocol for wireless sensor networks that trades off between energy and delay. Specifically, this protocol helps achieve minimum energy consumption while ensuring uniform battery power depletion of the sensors and meeting the required delay constraints in the sense that data gathering points must receive the sensed data within a specified time bound. Given that these are conflicting goals, this trade-off is formulated as a multi-objective optimization problem whose solution is an input to our data forwarding scheme.

Habib M. Ammari

Energy Sink-Hole Problem with Always-On Sensors in Two-Dimensional Deployment Fields

Abstract

This chapter investigates the energy sink-hole problem, which is inherent to static always-on wireless sensor networks, where the sensors located around a static sink act as relays to the sink on behalf of all other sensors, thus suffering from severe energy depletion. It presents a theoretical analysis of the problem showing that it can be solved provided that the sensors adjust their communication ranges. However, this solution imposes a severe restriction on the size of a deployment field. To overcome this limitation, we propose a sensor deployment strategy based on energy heterogeneity with a goal that all the sensors deplete their energy at the same time. Also, it proposes an energy-efficient protocol to solve the energy sink-hole problem using sensor mobility and our newly introduced concept, called energy-aware Voronoi diagram.

Habib M. Ammari

Geographic Forwarding on Duty-Cycled Sensors in Two-Dimensional and Three-Dimensional Deployment Fields

Abstract

This chapter focuses on the problem of joint k-coverage, sensor scheduling, and geographic forwarding in two-and three-dimensional wireless sensor networks. Specifically, it studies geographic forwarding in duty-cycled, k-covered wireless sensor networks and proposes the first design of protocols for geographic forwarding on duty-cycled sensors with and without data aggregation. The proposed protocols exploit the geometry of the configurations, which result from our connected k-coverage protocols, and the concept of virtual potential fields.

Habib M. Ammari

Part 5: Summary and Further Extensions

Conclusion and Future Work

Abstract

This chapter gives a summary of the topics that have been discussed in this book. Precisely, it summarizes the contributions that we made in the areas of k-coverage, connectivity, duty-cycling, and geographic forwarding in two-and three-dimensional wireless sensor networks. All the proposed protocols are energy-efficient with a goal to minimize the total energy consumption of the sensors, thus extending their lifetime. Then, it presents our future research work in an attempt to solve some (open) problems more efficiently.

Habib M. Ammari

Backmatter

Titel: Challenges and Opportunities of Connected k-Covered Wireless Sensor Networks
verfasst von: Habib M. Ammari
Verlag: Springer Berlin Heidelberg
Electronic ISBN: 978-3-642-01878-7
Print ISBN: 978-3-642-01876-3
DOI: https://doi.org/10.1007/978-3-642-01878-7

Premium Partner

Marktübersichten

Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.

Zur Marktübersicht