By Topic

On the problem of k-coverage in 3d wireless sensor networks: A Reuleaux tetrahedron-based approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ammari, H.M. ; Dept. of Comput. & Inf. Sci., Univ. of Michigan-Dearborn, Dearborn, MI, USA

The quality of monitoring accomplished by wireless sensor networks (WSNs) mainly depends on the service of coverage provided by the deployed sensors. In particular, redundant coverage is essential to several applications, where an event is simultaneously detected by multiple sensors. While several protocols have been proposed for two-dimensional (2D) space, little work has been focused on three-dimensional (3D) space although it is more accurate for the design of sensing applications. In this paper, we consider the problem of k-coverage in 3D WSNs, where each point is covered by at least k sensors. Specifically, we propose to use Helly's Theorem and the Reuleaux tetrahedron model for characterizing k-coverage of a 3D deployment field. This leads to develop a placement strategy of sensors to fully k-cover a 3D field. Then, we design an energy-efficient sensor selection protocol for 3D k-covered WSNs to extend the network lifetime. We corroborate our analysis with various simulation results.

Published in:

Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP), 2011 Seventh International Conference on

Date of Conference:

6-9 Dec. 2011