Limits...
Markov Chain Model-Based Optimal Cluster Heads Selection for Wireless Sensor Networks

View Article: PubMed Central - PubMed

ABSTRACT

The longer network lifetime of Wireless Sensor Networks (WSNs) is a goal which is directly related to energy consumption. This energy consumption issue becomes more challenging when the energy load is not properly distributed in the sensing area. The hierarchal clustering architecture is the best choice for these kind of issues. In this paper, we introduce a novel clustering protocol called Markov chain model-based optimal cluster heads (MOCHs) selection for WSNs. In our proposed model, we introduce a simple strategy for the optimal number of cluster heads selection to overcome the problem of uneven energy distribution in the network. The attractiveness of our model is that the BS controls the number of cluster heads while the cluster heads control the cluster members in each cluster in such a restricted manner that a uniform and even load is ensured in each cluster. We perform an extensive range of simulation using five quality measures, namely: the lifetime of the network, stable and unstable region in the lifetime of the network, throughput of the network, the number of cluster heads in the network, and the transmission time of the network to analyze the proposed model. We compare MOCHs against Sleep-awake Energy Efficient Distributed (SEED) clustering, Artificial Bee Colony (ABC), Zone Based Routing (ZBR), and Centralized Energy Efficient Clustering (CEEC) using the above-discussed quality metrics and found that the lifetime of the proposed model is almost 1095, 2630, 3599, and 2045 rounds (time steps) greater than SEED, ABC, ZBR, and CEEC, respectively. The obtained results demonstrate that the MOCHs is better than SEED, ABC, ZBR, and CEEC in terms of energy efficiency and the network throughput.

No MeSH data available.


The random election, random Cluster Head (CH) selection, and random cluster formation in the network.
© Copyright Policy - open-access
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC5375726&req=5

sensors-17-00440-f004: The random election, random Cluster Head (CH) selection, and random cluster formation in the network.

Mentions: In this phase, every node elects itself as a local CH on the basis of certain probability. In SEED [11], every node in the network selects itself as CH on the basis of the desired percentage of CHs for the whole network. Each node chooses a random number from zero to one, then it calculates the threshold . The node compares the self-generated random number with the calculated . If the selected random number is less than or equal to threshold , then this specific node becomes a CH for the current round. Firstly, in our proposed protocol the CHs are selected by following the random procedure. The detail of the random CH selection process of our model is shown in Figure 4.


Markov Chain Model-Based Optimal Cluster Heads Selection for Wireless Sensor Networks
The random election, random Cluster Head (CH) selection, and random cluster formation in the network.
© Copyright Policy - open-access
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC5375726&req=5

sensors-17-00440-f004: The random election, random Cluster Head (CH) selection, and random cluster formation in the network.
Mentions: In this phase, every node elects itself as a local CH on the basis of certain probability. In SEED [11], every node in the network selects itself as CH on the basis of the desired percentage of CHs for the whole network. Each node chooses a random number from zero to one, then it calculates the threshold . The node compares the self-generated random number with the calculated . If the selected random number is less than or equal to threshold , then this specific node becomes a CH for the current round. Firstly, in our proposed protocol the CHs are selected by following the random procedure. The detail of the random CH selection process of our model is shown in Figure 4.

View Article: PubMed Central - PubMed

ABSTRACT

The longer network lifetime of Wireless Sensor Networks (WSNs) is a goal which is directly related to energy consumption. This energy consumption issue becomes more challenging when the energy load is not properly distributed in the sensing area. The hierarchal clustering architecture is the best choice for these kind of issues. In this paper, we introduce a novel clustering protocol called Markov chain model-based optimal cluster heads (MOCHs) selection for WSNs. In our proposed model, we introduce a simple strategy for the optimal number of cluster heads selection to overcome the problem of uneven energy distribution in the network. The attractiveness of our model is that the BS controls the number of cluster heads while the cluster heads control the cluster members in each cluster in such a restricted manner that a uniform and even load is ensured in each cluster. We perform an extensive range of simulation using five quality measures, namely: the lifetime of the network, stable and unstable region in the lifetime of the network, throughput of the network, the number of cluster heads in the network, and the transmission time of the network to analyze the proposed model. We compare MOCHs against Sleep-awake Energy Efficient Distributed (SEED) clustering, Artificial Bee Colony (ABC), Zone Based Routing (ZBR), and Centralized Energy Efficient Clustering (CEEC) using the above-discussed quality metrics and found that the lifetime of the proposed model is almost 1095, 2630, 3599, and 2045 rounds (time steps) greater than SEED, ABC, ZBR, and CEEC, respectively. The obtained results demonstrate that the MOCHs is better than SEED, ABC, ZBR, and CEEC in terms of energy efficiency and the network throughput.

No MeSH data available.