Abstract
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
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
