Coverage Strategies in Wireless Sensor Networks
Abstract
An energy efficient cover of a region using Wireless Sensor Networks (WSNs) is addressed in this paper. Sensor nodes in a WSN are characterized by limited power and computational capabilities, and are expected to function for extended periods of time with minimal human intervention. The life span of such networks depends on the efficient use of the available power for sensing and communication. In this paper, the coverage problem in a three dimensional space is rigorously analyzed and the minimum number of sensor nodes and their placement for complete coverage is determined. Also, given a random distribution of sensor nodes, the problem of selecting a minimum subset of sensor nodes for complete coverage is addressed. A computationally efficient algorithm is developed and implemented in a distributed fashion.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Oct 01, 2006
- Source ID
- 10.1080/15501320600719151
Entities
People
- Mohamed K. Watfa
- Sesh Commuri
Organizations
- United States Department of Defense
- University of Oklahoma