By Topic

An Index-Based Sensor-Grouping Mechanism for Efficient Field-Coverage Wireless Sensor Networks

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
$33 $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

3 Author(s)
Yangfan Zhou ; Dept. of Comput. Sci. & Eng., Chinese Univ. of Hong Kong, Hong Kong ; Lyu, M.R. ; Jiangchuan Liu

This paper discusses a point-distribution index, l, which measures the normalized minimum distance between sensors. Maximizing l of a set of points causes the Delaunay triangulation graph of these points to be a net of equilateral triangles. Such a structure indicates the lowest redundancy of coverage if each point represents the center of a disc. Thus l can serve as a promising measure for solving a critical problem in field coverage: How to group a set of sensor nodes into disjoint subsets so that each subset can cover the entire field? Based on the l index, we develop an effective algorithm, MAXINE (MAXimizing-l Node-redundancy Exploiting), for the sensor- grouping problem. We evaluate the performance of MAXINE through extensive simulations and compare it with existing algorithms. The results demonstrate the effectiveness of MAXINE and verify the superiority of employing i for the sensor-grouping problem.

Published in:

Communications, 2008. ICC '08. IEEE International Conference on

Date of Conference:

19-23 May 2008