ALGORITHM TO SELECT BEST CLUSTER HEAD FOR BETTER PERFORMANCE OF WIRELESS SENSOR NETWORKS
Shikha Chourasia M. Tech Scholar, BTIRT, Sagar
Anamika Pyasi
Assistant Professor, BTIRT, Sagar
Abstract:- Wireless sensors nodes are made up of small electronic devices which are capable of sensing, computing and transmitting data from harsh physical environments like a surveillance field. These sensor nodes majorly depend on batteries for energy, which get depleted at a faster rate because of the computation and communication operations they have to perform. Communication protocols can be designed to make efficient utilization of energy resources of a sensor node and to obtain real time functionality. In recent advances, many routing protocols have been proposed based on heterogeneity with main research goals such as achieving the energy efficiency, lifetime, deployment of nodes, fault tolerance, latency, and high reliability. In this thesis work, some protocols are proposed which increases the life span of the network. Analysis is done in terms of dead nodes, a live nodes and number of packets sent to the base station. A comparative study has been done with DEEC, DDEEC, EDEEC and TDEEC for wireless sensor networks. TDEEC is the proposed routing and clustering protocol in this thesis work. Simulation results show that proposed algorithm performs better as compared to others. The alive nodes in TDEEC sustains up to 10000 rounds for CH selection while in other protocols, the nodes died before 5000 rounds, hence it is concluded that TDEEC performs better.
Keywords: Cluster Head Selection, Energy Efficiency, LEACH, Network Lifetime, Wireless Sensor Networks.
1. INTRODUCTION
Wireless sensor networks (WSNs) include small-sized sensor nodes that can transmit data through data sensing, computation and wireless channel communication capabilities [1]. One of the major problems in the WSN is the limited battery power at the sensor nodes.
Routing protocols around the work areas of the WSN are an important area. In addition to prolonging the life of the sensor nodes, it is also desirable to distribute the existing energy homogeneously to the WSN. Due to the limited power supply in the sensor nodes, the energy consumption of the power source is an important concept in the WSNs. Maximum energy is used when data is transmitted to other nodes via sensor nodes. For all these reasons, a number of studies have been conducted to develop routing algorithms to extend a sensor network lifetime [2]. In one study [4], a routing algorithm with LEACH clustering adaptation is presented for homogeneous WSNs, where sensor nodes are randomly determined as CHs (Cluster Heads) and the energy load of the system is shared with the WSN. In [5], a new routing protocol based on LEACH for energy optimization is proposed. It is
understood that this algorithm is more efficient than the LEACH algorithm by selecting cluster heads equally.
The paper [6] presents a modified LEACH derived from the LEACH algorithm. In [7], a mobile sink improved energy efficient algorithm is presented and compared with mod-LEACH and PEGASIS [8]. In [9], a new energy efficient (EE) clustering based method is proposed for single pass, heterogeneous WSNs.
Simulations in MATLAB show that the mentioned method has a 1.62-1.89 times better stability than known protocols such as LEACH, DEEC, and SEP. In [10], the stability of the cluster is reduced because the LEACH protocol on an irregular network causes a decrease in aggregate data efficiency. For this reason, this article [10] suggests a method of selecting a cluster head to improve the LEACH protocol in order to increase cluster head stability. For this purpose, an LEACH variant combined with HEED and LEACH protocol is proposed and this method is approved by simulation. In [11], two energy efficient route planning routing protocols are proposed for three levels of heterogeneous WSNs, namely, Central Energy Efficiency Clustering (CEEC) with
Two Hop Heterogeneity awareness (THCEEC) and Advanced Equalization (ACEEC).
Comprehensive simulation results have provided CEEC, ACEEC, and THCEEC central cluster deployments with improved reliability and energy efficiency performance, providing better network lifetime and successful data transmission than LEEC, SEP, ESEP, and DEEC’s traditional distributed routing protocols.
In addition, ACEEC performs CEEC and provides more network stability time.
Analytical evaluation shows that THCEEC performs CEEC, ACEEC, and other existing road planning routing protocols.
The study [12] suggests an efficient method of collecting data with a support vector in the WSN. In [13], performance evaluation of clustering protocols is presented in WSNs. Clustering of sensor nodes is an effective technique in reaching these targets. With this technique, other clustering models (LEACH, LEACH-C, and HEED) were evaluated and compared. At the end of these, clustering methods are compared with depending on several criteria such as convergence speed, cluster stability, cluster overlap, location awareness, and node mobility support.
In another study [14], the study of various routing models for sensor networks offers a survey with classification on behalf of kinds of models.
The three main categories examined are data-centric, hierarchical, and location- based. Routing methods and algorithms each have a common purpose to better output and extend the useful life of the sensor network. A comparison was made between flood and direct diffusion, two routing protocols based on network throughput and lifetime.
2. WORK STUDY
Varsha Katre, et. al. [1] explained about the problem of cluster head selection.
Author discussed that Wireless Sensor Networks (WSN), consists tiny but powerful devices to monitor or sense specific phenomena, e.g. temperature, visual, humidity etc. In WSNs nodes are deployed in the harsh and unattended environment. In such scenario, nodes may fail due to various reasons, e.g. link failure, battery depletion, hardware/software failure etc. In order to provide a reliable network, fault-tolerant
network is required. Furthermore in WSN, energy is one of the major constraints, due to irreplaceable batteries. There have been various techniques proposed for fault tolerance and energy saving by detecting and correcting node failure. In this paper, the proposed algorithm called Cluster Head Fault Detection and Correction algorithm (FDFC), detects Cluster Head (CH) failure in a distributed manner and replace a faulty node. In this work, all the CHs present in network share status data with all the other CHs.
Besides fault detection, this algorithm also suggests faulty node replacement technique. The effectiveness of the proposed algorithms is validated through simulation experiments.
R. R. S. Sneha et. al. [2] explains that Wireless Sensor Network (WSN) is known to be a highly resource constrained class of network where energy consumption is one of the prime concerns. In this research, a cross layer design methodology was adopted to design an energy efficient routing protocol entitled “Position Responsive Routing Protocol” (PRRP). PRRP is designed to minimize energy consumed in each node by (1) reducing the amount of time in which a sensor node is in an idle listening state and (2) reducing the average communication distance over the network. The performance of the proposed PRRP was critically evaluated in the context of network lifetime, throughput, and energy consumption of the network per individual basis and per data packet basis. The research results were analysed and benchmarked against the well-known LEACH and CELRP protocols. The outcomes show a significant improvement in the WSN in terms of energy efficiency and the overall performance of WSN.
S. Cc, V Raychuodhury [3]
explains that the Delay Tolerant Networks (DTNs) have practical applications in various fields. DTNs have been studied in- depth by many researchers and multiple high quality survey papers have been produced which analyses DTN features, taxonomies, and applications. In recent years, interest in DTN research has rekindled as there are several emerging network-based application domains that require delay tolerance support and thus can use DTN specific routing and data dissemination techniques. Examples of
such novel areas are Information Centric Network (ICN), Mobile ICN, Named Data Network (NDN), Internet of Things (IoT), etc. In this paper, those applications briefly surveyed and have proposed an alternate taxonomy for classifying existing DTN routing algorithms. The objective of this survey is to help future researchers to identify DTN specific properties in the new applications and to apply appropriate routing protocols whenever necessary. We have studied the relation between message replication and individual or group communication semantics of DTN routing protocols considering both social- based and opportunistic message forwarding techniques. Here also introduced an in-depth coverage of data dissemination protocols in DTN which can be adapted to content-centric networking domains. We conclude our survey by identifying a set of open challenges for future researchers.
X. Liu [4] described that Hierarchical routing in wireless sensor networks (WSNs) is a very important topic that has been attracting the research community in the last decade. Typical hierarchical routing is called clustering routing, in which the network is divided into multiple clusters. Recently, some types of atypical hierarchical routing arise, including chain-based, tree-based, grid-based routing, and area-based routing. There are several survey papers that present and compare the hierarchical routing protocols from various perspectives, but a survey on atypical hierarchical routing is still missing. This paper makes a first attempt to provide a comprehensive review on atypical hierarchical routing. We offer a classification of atypical hierarchical routing of WSNs, and give detailed analysis of different logical topologies. The most representative atypical hierarchical routing protocols are described, discussed, and qualitatively compared. In particular, the advantages and disadvantages of different atypical hierarchical routing protocols are analyzed with respect to their significant performances and application scenarios.
Finally, we put forward some open issues concerning the design of hierarchical WSNs. This survey aims to provide useful guidance for system designers on how to
evaluate and select appropriate logical topologies and hierarchical routing protocols for specific applications.
3. PROPOSED METHODOLOGY
In this study, designing the threshold energy model, unlike heterogeneous algorithms such as other DEEC, EDEEC and DDEEC is derived from both a mean and a residual energy of a node in the network. In this study, the proposed model was compared with DEEC, EDEEC, and DDEEC as three different simulations using the MATLAB program for network performance, life if the nodes of the network, energy consumption of the system and number of packets received by BS. Also, the proposed model was compared with other protocols for alive nodes in the network and energy consumption of the system as different simulations. All the parameters used in programming the three methods are identical. The results show that the proposed model prolongs the network lifetime and is better than the other three clustering protocols in terms of all. In WSN selection of CH is basic phenomenon, but there are so many routing protocols are there to accomplish this task. For better performance of the heterogeneous WSN TDEEC is employed here.
The algorithm shown below explains the steps used in the simulation of the proposed model.
1. Initialize the network.
2. Estimate the energy dissipated during a round.
3. Estimate the average residual energy of the network.
4. Calculating the probability to be a 5. CH. Calculating the probability of
threshold T.
6. Generating a random number for every node.
7. Select node as cluster member, if random number is greater than T.
8. Cluster member choose nearest CH to join.
9. Data transfer, calculate residual energy of the node and alive node.
The proposed algorithm is shown in following flow chart:
4. RESULT DISCUSSION
The proposed algorithm is simulated in MATLAB environment, and the simulation results obtained. In this
Fig.1: Simulation Curves
Paper four various routing protocols, DEEC (Distributed Energy Efficient Clustering), DDEEC (Developed Distributed Energy Efficient Clustering), EDEEC (Enhanced Distributed Energy Efficient Clustering), and TDEEC (Threshold Distributed Energy Efficient Clustering) has been examined and compared. Four comparative plots had
obtained. The first graph shows number of rounds versus number of dead nodes curve, the second graph shows number of rounds versus number of alive nodes curve, the third graph shows number of rounds versus number of packet sent curve, the fourth graph shows number of rounds versus number of cluster head curve.
Table 1: Comparative analysis between Routing Protocols
5. CONCLUSION
This paper presents energy efficient clustering heterogeneous protocol based TDEEC routing protocol in distributed WSNs. We analysed the performances of the proposed protocol with different scenarios in comparison with DEEC, DDEEC and EDEEC protocols in terms of criteria, alive nodes during the network life and throughput of the sensor network, number of packets received by Base Station in the network, energy depletion, and average latency of the algorithms in MATLAB simulation. In this paper we proposed TDEEC (Threshold Distributed Energy Efficient Clustering) protocol which improves stability and energy efficient property of the heterogeneous wireless sensor network and hence increases the lifetime due to right selection of CH. Simulation results show that TDEEC performs better as compared to other protocols (DEEC, DDEEC and EDEEC) in heterogeneous environment for wireless sensor networks because TDEEC selects perfect CH. The alive nodes in TDEEC sustains up to 10000 rounds for CH selection while in other protocols, the nodes died before 5000 rounds, hence it is concluded that TDEEC performs better.
5.1 Future Scope
As the sensor nodes are mostly battery operated, design of energy efficient algorithms for routing in wireless sensor networks is a rapidly growing area of research. Presented research work focuses on the design of energy efficient algorithms for generic applications of WSN. However, the development of more energy efficient algorithms will result in increased application areas of WSNs in real time. In addition to the focus on the reduction in high frequency of clustering and distribution of cluster heads, the areas such as finding the optimal route with high residual energy for inter-cluster multi-hop communication, placing multiple base stations to reduce the load on cluster heads close to a single base station may be considered to bring further improvement in energy efficiency and overall lifetime of the network in WSNs.
REFERENCE
1. VarshaKatre, Dr. Siddharthchauhan,
“Cluster head failure detection and correction Algorithm for WSN”, ICICCS 2018, IEEE explore complaint part number:
CFP18K74-ART; ISBN: 978-1-5386-2842-3.
2. R. R. S. Sneha and D. Nithya “Wireless sensor Network: A survey”, IJARSCCES, vol. 2, no. 2, pp. 92-95, 2016.
3. S. Cc, V Raychuodhury, G. Marphiya, A.
Singla, “A survey of Routing and data
dissemination in Delay Tolerance Network”, JNCA, vol. 6, pp. 128-146, 2016.
4. X. Liu, “A typical Hierarchical Routing protocol for Wireless Sensor Network: A review”, IEEE Sens. J., vol. 15, no. 10, pp.
5372-5353, 2015.
5. G. Xu, W. Shen and X. Wang, “Applications of Wireless Sensor Networks in marine environment monitoring: A survey”, Sensors, vol. 14, no. 9, pp. 16932-16954, 2014.
6. M. Toulabi, S. Javadi, I. Azad and T.
Branch, “A survey on routing protocols in WSN”, JWSN, 2013, pp. 1-3, 2013.
7. Zang Z, Qi JD, Cao YJ. “A robust routing protocol in wireless sensor networks”. In:
IET International Conference on Wireless Sensor Network. China: IET; 2010. pp.
276-279.
8. Ehsan S, Hamdaoui B. “A survey on energy-efficient routing techniques with QoS assurances for wireless multimedia sensor networks”. IEEE Communications Surveys & Tutorials. 2012; 14(2), PP. 265- 278.
9. O. Younis, S. Fahmy, "HEED: A hybrid, energy efficient, distributed clustering approach for ad-hoc sensor networks", IEEE Transactions on Mobile Computing vol.3, no4, pp 660-669, 2004.
10. L. Qing, Q. Zhu, M. Wang, “Design of a distributed energy-efficient clustering algorithm for heterogeneous wireless sensor networks". ELSEVIER, Computer Communications 29, 2006, pp 2230-2237.
11. A. Manjeshwar and D. P. Agarwal, "TEEN: a routing protocol for enhanced efficiency in wireless sensor networks," In 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing, April 2001.
12. A. Manjeshwar and D. P. Agarwal,
"APTEEN: A hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks,"
Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, pp.195-202.
13. W.R. Heinzelman, A.P. Chandrakasan, H.
Balakrishnan, “An application specific protocol architecture for wireless micro sensor networks”, IEEE Transactions on Wireless Communications 1(4)(2002)660–
670.
14. Elbhiri Brahim, Saadane Rachid, Alba- Pages Zamora, Driss About ajdine,
“Stochastic Distributed Energy-Efficient Clustering (SDEEC)for heterogeneous wireless sensor networks”, ICGST-CNIR Journal, Volume 9,Issue 2, December 2009.
15. Yingchi Mao, ZhenLiu, Lili Zhang, XiaofangLi, “An Effective Data Gathering Scheme in Heterogeneous Energy Wireless Sensor Networks”, International Conference on Computational Science and Engineering, 2009.
16. Dilip Kumar, Trilok C. Aseri, R.B. Patel,
“EEHC: Energy efficient heterogeneous clustered scheme for wireless sensor
networks”, ELSEVIER, Computer Communications, 32 (2009) 662–667.
17. Jamal N. Al-Karaki, Ahmed E. Kamal,
“Routing Techniques in Wireless Sensor Networks: A Survey”, IEEE Wireless Communications, Volume: 11, Issue: 6, 26- 28, December 2004.
18. W. Heinzelman, A. Chandrakasan, and H.
Balakrishnan, "Energy- efficient communication protocol for wireless sensor networks," in the Proceeding of the Hawaii International Conference System Sciences, Hawaii, January, 2000.
19. G Yin, G Yang, W Yang, B Zhang, W Jin.
“An energy-efficient routing algorithm for wireless”. In. International Conference on Internet Computing in Science and Engineering (ICICSE’08), IEEE, China;
2008.
20. G. Smaragdakis, I.Matta, A.Bestavros,
“SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor networks”, in: Second International Workshop on Sensor and Actor Network Protocols and Applications (SANPA2004), 2004.
21. Md. Solaiman Ali, Tanay Dey, and Rahul Biswas, ―ALEACH: “Advanced LEACH Routing Protocol for Wireless Micro sensor Networks”, ICECE 2008, 20-22 December 2008.
22. L.Qing, Q. Zhu, M. Wang," Design of a distributed energy- efficient clustering algorithm for heterogeneous wireless sensor networks". ELSEVIER, Computer Communications 29, pp 2230-2237,2006.
23. A. Elrahim, H. Elsayed, S. Ramly, and M.
Magdy, “An energy aware WSN geographic routing protocol”, Universal Journal of Computer Science and Engineering Technology, vol. 1, no. 2, pp. 105111, 2010.
24. M. A. Rahmadhani, L. V. Yovita, Ratna Mayasari, “Energy consumption and Packet loss analysis of LEACH Routing protocol on WSN over DTN”, IEEE 2018.
