Abstract

Wireless sensor networks (WSNs) have a wide range of applications in our lifetime. Indeed, WSNs perform a various missions and tasks in odor localization, firefighting, medical service, surveillance and security. In order to accomplish these tasks, the sensors have to perform partitioning protocols to form an organization into clusters and cliques. The hierarchical clustering is the key solution for WSNs to deal with the scalability problems in a network composed of millions of nodes. In this paper, a new hierarchical partitioning scheme is presented, named MCCC. It is cliques and clusters based hierarchical scheme that takes into account the size of cliques and clusters, it also minimizes the number of hops between the cluster head and its nodes. The proposed scheme is motivated by the need to have minimum and maximum size for cliques and clusters. This hierarchical scheme is proposed to respond to the energy and memory constraints for WSNs.

Full Text
Paper version not known

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 call

Disclaimer: 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.