Article

Authors:
Article

# Optimal Number of Cluster Head Selection for Efficient Distribution of Sources in WSNs

If you want to read the PDF, try requesting it from the authors.

## Abstract

In this paper, we compare problems of cluster formation and cluster-head selection between different protocols for data aggregation and transmission. We focus on two aspects of the problem: (i) how to guess number of clusters required to proficiently consume available sources for a sensor network, and (ii) how to select number of cluster-heads to cover up sensor networks more proficiently. A sensor in Wireless Sensor Networks (WSNs) can communicate directly only with other sensors that are within a radio range in a cluster. However, in order to enable communication between sensors not within communication range, they must form new clusters in distributed sensors. Several clustering algorithms such as LEACH, DEEC, and SEP have been proposed with the objectives of energy minimization, route-path selection, increased connectivity and network longevity. LEACH protocol and the similar ones assume an energy homogeneous system where a node is not likely to fail due to failure in connectivity and packet dropping. More recent protocols like SEP and TEEN considered the reverse that is energy heterogeneity which is more applicable to case of WSNs. We developed a bi-dimensional chain model to select average number of for DEEC. Simulation results are used to compare performance of different protocols to found optimal solutions of above mentioned problems.

## No full-text available

... Controlling the size of the cluster is also important for balancing the load. In the proposed mechanism, we use the Markov chain model [21] to select an optimal number of CHs in the network according to the number of available sensor nodes for optimal resource utilization. In this designed framework, we also limit the number of C MNs in a cluster to divide the energy overhead and other CH-related responsibilities. ...
... The current clustering protocols [7][8][9][10][11][12]utilize the distributed algorithm for CH selection that increase the computational overhead and also causes the resources to drain very quickly. We use Markov Bi-directional Chain Model (MBCM) [21,26] to equally divide the sensing area into clusters, and to examine the behavior of the cluster formation process. We also used this formulation [21,26] for optimal CH selection and to analyze the stochastic characteristics of the MOCHs in the sense of the mean value, the probability mass function (PMF), the standard deviation (SD), and the coefficient of variation (COV) for the optimal selection of CHs. ...
... We use Markov Bi-directional Chain Model (MBCM) [21,26] to equally divide the sensing area into clusters, and to examine the behavior of the cluster formation process. We also used this formulation [21,26] for optimal CH selection and to analyze the stochastic characteristics of the MOCHs in the sense of the mean value, the probability mass function (PMF), the standard deviation (SD), and the coefficient of variation (COV) for the optimal selection of CHs. Through this formulation [21,26], the obtained CHs are optimal in number and well-distributed all across the network, which leads to higher energy efficiency, better fairness among nodes, and prolonged the network lifetime. ...
Article
Full-text available
... Routing protocols improve the lifetime of a network and specifically the stability period of a network. Protocols [14], [15], [16], [18], [19], [27], [28], [29], [30], [31], [35] and [40] are proposed to achieve these goals. ...
... i. SCALABILITY ALD of AODV is less in lower scalabilities because when nodes move with same speed as shown in eq. (18), AODV repairs the link quickly but due to less number of hops it takes more time to repair the links. In higher scalabilities, ALD is greater and due to more number of hops, link is maintained quickly as depicted in fig. ...
... 16(a), ALD of FSR and OLSR is high in low speeds as shown in eq. (18) and eq. (20). ...
Article
Full-text available
Mobility constraints and speed cause the radio link to break frequently, the main issue in Mobile Ad-hoc Networks (MANETs) is how to select the path which is more reliable. In this paper, we propose a model to calculate the reliable link between the nodes and reliable path for the purpose of communication. This paper also evaluates and compares the performance of routing protocols with different number of nodes, mobilities and speeds in MANETs and VANETs using Packet Delivery Ratio (PDR), Normalized Routing Overhead (NRO), End-to-End Delay (E2ED), Average Link Duration (ALD) and Average Path Duration (APD). We select three routing protocols namely Ad-hoc On-demand Distance Vector (AODV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). We perform these simulations with NS-2 using Two Ray Ground propagation model. The Vanet MobiSim simulator is used to generate a random mobility pattern for VANETs. From the extensive simulations, we observe that AODV is more efficient than both FSR and OLSR at the cost of delay but the ALD and APD of FSR and OLSR are greater as compared to AODV. Moreover these protocols perform better in MANETs as compared to VANETs.
... Routing protocols improve the lifetime of a network and specifically the stability period of a network. Protocols [14], [15], [16], [18], [19], [27], [28], [29], [30], [31], [35] and [40] are proposed to achieve these goals. ...
... i. SCALABILITY ALD of AODV is less in lower scalabilities because when nodes move with same speed as shown in eq. (18), AODV repairs the link quickly but due to less number of hops it takes more time to repair the links. In higher scalabilities, ALD is greater and due to more number of hops, link is maintained quickly as depicted in fig. ...
... 16(a), ALD of FSR and OLSR is high in low speeds as shown in eq. (18) and eq. (20). ...
... TEEN is a hierarchical clustering protocol [6], which groups different sensor nodes into clusters with each having a clusterhead( CH).The job of the sensors within a cluster is to send their sensed data to their respective CH. The CH now sends the aggregated data to higher level CH until the data reaches the sink. ...
... Within our protocol the areas of clusters are decided in advanced and cluster heads are selected based on residual energy and estimated energy cost. O. Younis et al. [6] suggested new vigor powerful process for bunching modems in unplanned alarm systems. Fixated with this specific technique, some form of typical meeting are shown, HEED (Hybrid Energy-Efficient Spread bunching), that often pick class minds in knowledge to half and 1 / 2 of their blend outstanding vigor moreover was extra parameter, such as for instance for instance regarding situation center place to their buddies or even center level. ...
Article
Full-text available
Wireless sensor networks (WSNs) are becoming popluar day by day due to its wide range of applications. But, sensors have battery constraints i.e. batteries are not rechargable nor replaceble. Therefore, it become significant issue to save the energy of sensor nodes, in such a way that the overall lifetime can be increased. Many clustering and tree-based protocols have been proposed so far to improve the network lifetime of WSNs. This paper has presented a detail review of some well-known energy efficient protocols for WSNs.It has been observed that the Game theory based energy balanced (GTEB) protocol is more efficient than other protocols in terms of network lifetime by balancing energy consumption in large network area using geographical routing protocols. It also compared some well-known protocols based upon certain features.
... Each node has a little amount of energy and that is not rechargeable, so, energy should be used efficiently for the sake of network lifetime. But Previous works on WSNs such as LEACH [1], LEACH-C [16], TEEN [13], SEP [14] and DEEC [15] have shown that the coverage holes may be created during lifetime of the network and that can not be accepted. Clustering technique of LEACH [1] does not assure a fix number of CHs in each round therefore, its behavior is not so appreciable in case of network lifetime. ...
... Nodes=200 Nodes=300 Nodes=400 Nodes=500 Nodes=600 Nodes=700 Nodes=800 Nodes=900 Nodes=1000 We are working on some more clustering and routing techniques to make the network much better and more efficient than DREEM-ME. In future we would like to reduce deficiencies which are expected in this paper and implementation of DREEM-ME in other clustering protocols like Threshold sensitive energy efficient sensor network protocol [13], stable election protocol [14], distributed energy efficient clustering [15], etc. In future, we aim to introduce multiple QoS path parameters [27], energy efficient MAC protocols [37], sink mobility [34] and heterogeneity [32] in our work. ...
Thesis
Full-text available
Wireless distributed sensor network consists of randomly deployed wireless sensors having low energy assets. These networks can be used for monitoring a variety of environments. Major problem of these networks is energy constraint and lifetime, so, to overcome these problems different routing protocols and clustering techniques have been introduced. We propose Distributed Regional Energy Efficient Multi-hop Routing Protocol based on Maximum Energy in WSNs (DREEM-ME), which uses a unique technique for clustering to cover these two problems efficiently. Clustering technique of LEACH does not assure a fix number of Cluster Heads (CHs) in each round. Therefore, its behavior is not so appreciable in case of network lifetime. DREEM-ME elects fix number of CHs in each round instead of probabilistic selection of CHs. We also implement the Packet Drop technique in our protocol which makes it more comprehensive and practical. Our simulations and results show that DREEM-ME competes all of its identical protocols.
... In this way, the CHs will also be optimum in every round. As shown by the research that 8 cluster heads are optimum in the network [12]. And other problems with previous protocols are their stability period and network lifetime, which are not good enough. ...
Article
Wireless distributed sensor network consists of randomly deployed sensors having low energy assets. These networks can be used for monitoring a variety of environments. Major problems of these networks are energy constraints and their finite lifetimes. To overcome these problems different routing protocols and clustering techniques are introduced. We propose DREEM-ME which uses a unique technique for clustering to overcome these two problems efficiently. DREEM-ME elects a fix number of cluster heads (CHs) in each round instead of probabilistic selection of CHs. Packet Drop Technique is also implemented in our protocol to make it more comprehensive and practical. In DREEM-ME confidence interval is also shown in each graph which helps in visualising the maximum deviation from original course. Our simulations and results show that DREEM-ME is much better than existing protocols of the same nature.
... JID: CAEE [m3Gsc;December 14, 2015;15:53] of minimum transmission energy, when the node senses data to transmit, it may find the shortest possible route consisting of several hops to the base station. Optimal routes help to save the energy of the network [12]. However, the nodes closer to the base station forward more packets as compared to the distant nodes. ...
Article
Full-text available
Hierarchical clustering technique is an effectual topology control methodology in Wireless Sensor Networks (WSNs). This technique is used to increase the life time of the network by reducing the number of transmissions towards the base station. We propose and validate a new routing protocol termed as Sleep-awake Energy Efficient Distributed (SEED) clustering algorithm. We divide the network sensing field into three energy regions because in SEED cluster heads are communicating directly with the base station. The cluster heads of the high energy region are communicating with the base station through a longer distance and paying extra energy cost as compared to the cluster heads of the low energy region. Same application base sensor nodes form sub-clusters to decrease the number of transmissions towards the base station. In every round, one node from these sub-clusters nodes awake and transmit the data and the rest of them sleep to save available resources. We select six criteria to check the performance of our algorithm. The simulation results show that SEED achieves longer network life time and high throughput as compared to the existing clustering protocols.
... Clustering is one of the methods to improve network lifetime as it can balance the energy dissipation of nodes. Several works have appeared in literature [7], which discuss the clustering techniques. One of the main ideas available in the clustering algorithms is the use of LEACH [8] algorithm. ...
Conference Paper
... overall number of vertices (see, e.g. Fareed et al. 2012;Sevgi and Kocyigit 2008). Thus, CluBFS-Fpt1 might result in being truly effective in practice. ...
Article
Full-text available
Given an $n$-vertex non-negatively real-weighted graph $G$, whose vertices are partitioned into a set of $k$ clusters, a \emph{clustered network design problem} on $G$ consists of solving a given network design optimization problem on $G$, subject to some additional constraint on its clusters. In particular, we focus on the classic problem of designing a \emph{single-source shortest-path tree}, and we analyze its computational hardness when in a feasible solution each cluster is required to form a subtree. We first study the \emph{unweighted} case, and prove that the problem is \np-hard. However, on the positive side, we show the existence of an approximation algorithm whose quality essentially depends on few parameters, but which remarkably is an $O(1)$-approximation when the largest out of all the \emph{diameters} of the clusters is either $O(1)$ or $\Theta(n)$. Furthermore, we also show that the problem is \emph{fixed-parameter tractable} with respect to $k$ or to the number of vertices that belong to clusters of size at least 2. Then, we focus on the \emph{weighted} case, and show that the problem can be approximated within a tight factor of $O(n)$, and that it is fixed-parameter tractable as well. Finally, we analyze the unweighted \emph{single-pair shortest path problem}, and we show it is hard to approximate within a (tight) factor of $n^{1-\epsilon}$, for any $\epsilon>0$.
... Authors in [13] compare problems of cluster formation and cluster-head selection between different protocols for data aggregation and transmission. They focused on two aspects of the problem: (i) how to guess number of clusters required to proficiently consume available sources for a sensor network, and (ii) how to select number of cluster-heads to cover up sensor networks more proficiently. ...
... While hundreds of clustering protocols have been proposed, few analytical studies that allow an informed choice for the selection of the most energy-efficient clustering strategies. Authors in [13] determine the best position of the BS when the first node dies (FND) lifetime measure is considered while authors in [14] try to find the optimum number of CHs. This paper compares for the first time widely adopted clustering strategies that are unequal and equal, rotation and non-rotation. ...
Chapter
Wireless Sensor Networks (WSNs) are the essential elements to sense the environment, process and broadcast information into the Internet of Things (IoT) and advanced Unmanned Aerial Vehicles (UAVs) assisted networks. Clustering is an energy-efficient routing technique that has been widely applied to send data to BS. There have been proposed many clustering protocols but it is very hard to decide the most energy-efficient one, to be applied in a particular scenario. In this paper, we analyze the simulation results-based different clustering strategies (e.g., equal, unequal, rotation, and non-rotation). We developed a novel analytical model to support the simulation results and to conclude an informed choice for the selection of the most energy-efficient protocol.
... JID: CAEE [m3Gsc; December 2, 2015;20:0] of minimum transmission energy, when the node senses data to transmit, it may find the shortest possible route consisting of 12 several hops to the base station. Optimal routes help to save the energy of the network [12]. However, the nodes closer to the 13 base station forward more packets as compared to the distant nodes. ...
Article
Conference Paper
A wireless sensor network (WSN) organizes collected data at a central location using a set of specialized transducers with a communications infrastructure for monitoring and recording conditions at various locations. A sensor network consists of multiple detection stations called sensor nodes, each of which is small, lightweight and portable. A WSN node contains several technical components which include the radio, microcontroller, analog circuit, sensor interface and an energy source, usually a battery. Sensor nodes have the limitation of its battery where the battery is impossible to be replaced once it has been deployed. This paper presents an improvement of clustering method by implementing two-tiers of network design for efficiency of data transmission and fuzzy logic approach for cluster head selection which minimizes the energy usage of sensor nodes hence can maximize the network lifetime. The two-tiers clustering approach used in this paper covers the average of 100M×100M network and involves three parameters that worked together in order to select the cluster head which are residual energy, communication cost and centrality. The parameters have shown that the selection of cluster head can minimize the energy usage for the whole network lifetime. It is concluded that, the implementation of Fuzzy Logic used all node evenly and the nodes died sequentially as the data keep increasing. This causes the sensor nodes to use their energy effectively hence prolonging the network's lifetime. For the future work, the stability of this algorithm can be tested using random energy.
Conference Paper
Clustering is a hierarchical method to data transmission in wireless sensor networks, which has a considerable effect on energy conservation. A balanced and efficient clustering has an important role in these networks. This paper discusses an optimal clustering method in wireless sensor network. Firstly, by considering energy and distance parameters, we model the clustering problem using two techniques, Integer Linear Programming and Linear Programming. Then we propose a clustering algorithm based on the optimal selected cluster heads. Experimental results shown that Linear Programming technique has better performance in energy consumption and network lifetime in comparison to the Integer Linear Programming technique.
Conference Paper
In a Wireless Sensor Networks (WSNs), energy consumption is a key challenge due to its dynamic topology, highly decentralized infrastructure and resource constraint sensors. These entities make WSNs easily compromised by various denials of service attacks resulting in disastrous consequences. In the development of various cluster based energy efficient protocols to improve the lifetime of WSNs compromised with some malicious nodes, a challenging problem is how to adopt the most effective energy efficient cluster head selection approach to extend lifetime of WSNs. Gray-Hole and Black-Hole attack are those denial of service attacks that reduces the performance of WSNs. In order to achieve energy efficiency in WSNs, an efficient and trust based secure protocol is proposed to defend against single and cooperative Gray-Hole and Black Hole attacks. A proposed protocol incorporates efficient estimation to determine honest nodes during packets transmission phase. A proposed energy efficient technique is builds to evaluate in detecting and preventing compromised node to become cluster head. Besides, NS2 simulation result compare proposed protocol with LEACH proves that proposed system is efficiently reduces possibility of compromised node to be a part of network communication process and achieves better packet delivery ratio, throughput, less end-to-end delay and extend the lifetime of network significantly.
Article
Full-text available
We study the impact of heterogeneity of nodes, in terms of their energy, in wireless sensor networks that are hierarchically clustered. In these networks some of the nodes become cluster heads, aggregate the data of their cluster members and transmit it to the sink. We assume that a percentage of the population of sensor nodes is equipped with additional energy resources—this is a source of heterogeneity which may result from the initial setting or as the operation of the network evolves. We also assume that the sensors are randomly (uniformly) distributed and are not mobile, the coordinates of the sink and the dimensions of the sensor field are known. We show that the behavior of such sensor networks becomes very unstable once the first node dies, especially in the presence of node heterogeneity. Classical clustering protocols assume that all the nodes are equipped with the same amount of energy and as a result, they can not take full advantage of the presence of node heterogeneity. We propose SEP, a heterogeneous-aware protocol to prolong the time interval before the death of the first node (we refer to as stability period), which is crucial for many applications where the feedback from the sensor network must be reliable. SEP is based on weighted election probabilities of each node to become cluster head according to the remaining energy in each node. We show by simulation that SEP always prolongs the stability period compared to (and that the average throughput is greater than) the one obtained using current clustering protocols. We conclude by studying the sensitivity of our SEP protocol to heterogeneity parameters capturing energy imbalance in the network. We found that SEP yields longer stability region for higher values of extra energy brought by more powerful nodes.
Conference Paper
Full-text available
Wireless sensor networks are designed to extract data from the deployment environment and combine sensing, data processing and wireless communication to provide useful information for the network users. Hundreds or thousands of small embedded units, which operate under low-energy supply and with limited access to central network control, rely on interconnecting protocols to coordinate data aggregation and transmission. Energy efficiency is crucial and it has been proposed that cluster based and distributed architectures such as LEACH are particularly suitable. We analyse the random cluster hierarchy in this protocol and provide a solution for low-energy and limited-loss optimization. Moreover, we extend these results to a multi-level version of LEACH, where clusters of nodes again self-organize to form clusters of clusters, and so on.
Article
Full-text available
For mission-critical applications of wireless sensor networks (WSNs) involving extensive battlefield surveillance, medical healthcare, etc., it is crucial to have low-power, new protocols, methodologies and structures for transferring data and information in a network with full sensing coverage capability for an extended working period. The upmost mission is to ensure that the network is fully functional providing reliable transmission of the sensed data without the risk of data loss. WSNs have been applied to various types of mission-critical applications. Coverage preservation is one of the most essential functions to guarantee quality of service (QoS) in WSNs. However, a tradeoff exists between sensing coverage and network lifetime due to the limited energy supplies of sensor nodes. In this study, we propose a routing protocol to accommodate both energy-balance and coverage-preservation for sensor nodes in WSNs. The energy consumption for radio transmissions and the residual energy over the network are taken into account when the proposed protocol determines an energy-efficient route for a packet. The simulation results demonstrate that the proposed protocol is able to increase the duration of the on-duty network and provide up to 98.3% and 85.7% of extra service time with 100% sensing coverage ratio comparing with LEACH and the LEACH-Coverage-U protocols, respectively.
Conference Paper
Full-text available
This paper presents an energy efficient cluster ID based routing scheme with maximum residual node energy as one of routing metrics. The uneven load in network is minimized by cluster size adaptation technique. Our new routing protocol CIDRSN (Cluster ID based Routing in Sensor Networks) takes the cluster ID as next hop address instead of cluster-head ID) in routing table and eliminate the cluster formation phase and routing phase from being executed in each round. Both cluster formation and routing phases are only executed during the initialization of network, which reduces the energy consumption and increases the network life to about 16%. Robustness is increased by multi-path routing. Simulation results show that CIDRSN outperforms the preceding hierarchical routing protocols.
Conference Paper
Full-text available
In the area of wireless sensor networks (WSN) there is still a significant gap between theory and practice: system designs and protocols are rapidly out-pacing analysis. We develop formal computational models of a WSN based on non-linear optimization and use them to analyze the impact of fairness constraints on network performance. The optimization framework presented is very general and can also be used to analyze the optimal performance of WSN subject to other design parameters such as the topology, number of nodes, energy levels, source rates, reception power, etc. Our results show that the maximum information that can be extracted for a fixed amount of energy increases and that the minimum energy required outputting a fixed amount of information decreases as we reduce the fairness requirement in the network. We present these functions for a fixed network topology and observe that they exhibit sharp changes in gradient due to qualitative changes in optimal routes.
Article
Full-text available
Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.
Article
The clustering Algorithm is a kind of key technique used to reduce energy consumption. It can increase the scalability and lifetime of the network. Energy-efficient clustering protocols should be designed for the characteristic of heterogeneous wireless sensor networks. We propose and evaluate a new distributed energy-efficient clustering scheme for heterogeneous wireless sensor networks, which is called DEEC. In DEEC, the cluster-heads are elected by a probability based on the ratio between residual energy of each node and the average energy of the network. The epochs of being cluster-heads for nodes are different according to their initial and residual energy. The nodes with high initial and residual energy will have more chances to be the cluster-heads than the nodes with low energy. Finally, the simulation results show that DEEC achieves longer lifetime and more effective messages than current important clustering protocols in heterogeneous environments.
Conference Paper
A sensor network system consisting of a large number of small sensors with low-power can be an effective tool for collection and integration of data by each sensor in a variety of environments. The collected data by each sensor node is communicated through the network to a single base station that uses all collected data to determine properties of the data. Clustering sensors into groups, yields that sensors communicate information only to cluster heads and then the cluster-heads communicate the aggregated information to the base station. We estimate the optimal number of cluster-heads among randomized sensors in a bounded region. We derive solutions for the values of parameters of our algorithm that minimize the total energy spent in the wireless sensor network when all sensors communicate data from the cluster-heads to the base station. Computer simulation shows that the energy consumption reduce as the optimal number of cluster-heads for the proposed method.
Article
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000. Includes bibliographical references (p. 145-154).
Conference Paper
Distributed clustering architecture has been considered an effective and practical model to offer energyefficient, load-balancing, scalable, and robust communication for Wireless Sensor Networks (WSNs). In this paper, we compare and analyze various clustering schemes based on a comprehensive classification. We propose a bi-dimensional Markov chain model for analyzing a class of distributed, dynamic, and randomized (DDR) clustering schemes. With this model, we present extensive evaluation of stochastic properties of a representative DDR clustering scheme – Low Energy Adaptive Clustering Hierarchy (LEACH), in terms of the distribution of cluster number, the mean, the standard deviation and coefficient of variation of number of clusters. The results indicate that the number of clusters generated in LEACH-like DDR schemes is a random variable, which can not concentrate with in a narrow range of the optimal value. This variability in the number of clusters adversely affects the system lifetime.
Estimation of the optimal number of cluster-heads in sensor network, in Knowledge-Based Intelligent Information and Engineering Systems
• H Kim
• S Kim
• S Lee
• B Son