ABSTRACT
A wireless sensor node is poised by a sensor, processor, confined memory, transceiver and a low-powered battery. To lessen the data communication period and energy intake, the sensor nodes are accumulated into a quantity of minute clutches denoted as clusters and the occurrence is mentioned as clustering. Essentially, clustering could be categorized into centralized, distributed and hybrid clustering methodologies. In centralized clustering method, the cluster head (CH) is immobile. The rest of the sensor nodes in the cluster deed as cluster member nodes. In case of distributed clustering mechanism, the CH is not static. The CH keeps on fluctuating form one sensor node to another sensor node within the cluster on the base of few fixed constraints. Hybrid clustering is the grouping of both centralized clustering and distributed clustering mechanisms. A dynamic clustering algorithm for mobile wireless sensor networks, the mobile clustering mechanism (MCM) has been examined and analysed appropriately. The anticipated method is hierarchical, dynamic and energy efficient algorithm. This system displays numerous clusters, with each clusters having a unique CH and two deputy CHs. The sensors start gathering the data only when the base station approaches in range with the cluster head. The performance of the projected algorithm has been assessed against the present LEACH-Mobile algorithm. This approach displays a large decrease in average communication energy and node death rate. The network lifetime has been extended by assimilating the fresh concepts to the proposed methodology, thereby finds valuable when both the nodes and the base station are moderately moveable.
