Abstract
The state of the art of Wireless Sensor Networks (WSNs) has enabled attainment of complicated and challenging applications such as healthcare, traffic control, habitat monitoring, etc.. For the last few years, clustering in WSNs has gained more consideration because of the improved ability of sensor nodes to conserve energy. In a dynamic WSN, clustering consists of two important stages: cluster formation and cluster maintenance. A cluster is formed once a node or a group of nodes join an existing cluster-based network and cluster maintenance is executed to handle node(s)' leaving or even re-joining. In this paper, we investigate cluster formation problems for a dynamic cluster-based WSN. Current dynamic cluster-based WSN supports only single node's joining and/or leaving. We enhance the cluster-based structure by proposing multi-nodes-joining algorithms. We show that the time complexity of the proposed algorithm is expected O(|Q| + |R|) rounds, where R is the set of new nodes wish to join and Q is the set of neighboring nodes of set of new nodes R. We also show some simulation results for the proposed algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.