By Topic

Adaptive Clustering Protocol for 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

2 Author(s)
A. Durresi ; Department of Computer Science, Louisiana State University 298 Coates Hall, Baton Rouge, LA 70803 225-578-3902, ; V. Paruchuri

In this paper, we present adaptive clustering protocol (ACP) for sensor networks. Clustering techniques are used by different protocols and applications to increase scalability and reduce delays in sensor networks. Examples include routing protocols, and applications requiring efficient data aggregation. Our approach which is based on The Covering Problem that aims at covering an area with minimum possible circular disks assuming ideal conditions. ACP is a lightweight protocol that does not require any neighborhood information and imposes lesser communication overhead. We present simulation results to show the efficiency of ACP in both ideal cases and randomly distributed networks. Moreover, ACP is scalable with respect to density and network size

Published in:

2005 IEEE Aerospace Conference

Date of Conference:

5-12 March 2005