Scheduling Algorithm for Wireless Sensor Networks

Scheduling Algorithm for Wireless Sensor Networks

ISBN13: 9781466683150|ISBN10: 1466683155|EISBN13: 9781466683167
DOI: 10.4018/978-1-4666-8315-0.ch013
Cite Chapter Cite Chapter

MLA

Osman Hasan and Sofiène Tahar. "Scheduling Algorithm for Wireless Sensor Networks." Formalized Probability Theory and Applications Using Theorem Proving, IGI Global, 2015, pp.208-227. https://doi.org/10.4018/978-1-4666-8315-0.ch013

APA

O. Hasan & S. Tahar (2015). Scheduling Algorithm for Wireless Sensor Networks. IGI Global. https://doi.org/10.4018/978-1-4666-8315-0.ch013

Chicago

Osman Hasan and Sofiène Tahar. "Scheduling Algorithm for Wireless Sensor Networks." In Formalized Probability Theory and Applications Using Theorem Proving. Hershey, PA: IGI Global, 2015. https://doi.org/10.4018/978-1-4666-8315-0.ch013

Export Reference

Mendeley
Favorite

Abstract

In Wireless Sensor Networks (WSNs), scheduling of the sensors is considered to be the most effective energy conservation mechanism. The random and unpredictable deployment of sensors in many WSNs in open fields makes the sensor-scheduling problem very challenging and thus randomized scheduling algorithms are used. The performance of these algorithms is usually analyzed using simulation techniques, which do not offer 100% accurate results. Moreover, probabilistic model checking, when used, does not include a strong support to reason accurately about statistical quantities like expectation and variance. In this chapter, the authors overcome these limitations by using higher-order-logic theorem proving to formally analyze the coverage-based random scheduling algorithm for WSNs. Using the probability theory formalization, described in Chapter 5, the authors formally reason about the probability of some events that are interesting in the context of WSN coverage.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.