By Topic

Redundancy and coverage detection in wireless sensor networks in the presence of obstacles

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

2 Author(s)
Fotouhi, A. ; Dept. of Comput. Eng. & IT, Amirkabir Univ. of Technol., Tehran, Iran ; Razzazi, M.

In the real applications of wireless sensor networks (WSNs), a great number of sensors are distributed in the region of interest in order to monitor the environment. The area covered and the energy consumed by the sensors are two key problems of the WSNs. There are several efforts which tried to find the coverage percentage of the network, and eliminate the redundant sensors; however, none of them have considered the presence of obstacles in the region of interest. In this paper, we propose a new efficient algorithm to compute the area covered by the sensors in a region containing transparent and opaque obstacles, and study the problem of detecting and eliminating redundant sensors in order to improve energy efficiency, while preserving the network's coverage. The proposed algorithm uses computational geometry techniques and is applicable for both homogeneous and heterogeneous WSNs. Also, the obstacles can have arbitrary polygonal shapes which are placed in arbitrary locations.

Published in:

MIPRO, 2011 Proceedings of the 34th International Convention

Date of Conference:

23-27 May 2011