A study on Cluster Based Routing Protocols in Wireless Sensor Networks

INTRODUCTION

The series of wireless sensor networks [1, 2] was at first annoyed by military applications. While, wireless sensor networks are at the present time used in many civilian application areas like: monitoring, tracking, mechanization, traffic control, and healthcare applications. The WSN is collected of wireless modules called sensor nodes. The structural design of sensor node is shown in figure 1. The key components [3] of a node are: a micro sensor, a microchip, a memory, a battery, and a transceiver to converse with rest of the networks. Because of the boundaries on the power provide, transmission bandwidth and processing ability, well-organized routing becomes a vital issue in wireless sensor network. Routing protocols [4, 5] in WSN are accountable for discovering and maintaining energy well-organized routes in order to create communication dependable and well-organized. On the basis of literature review on network structure based routing schemes, WSNs routing protocols can be separated into three categories: flat routing, hierarchical or cluster based routing and location based routing.

In flat networks, every node plays the same position and nodes work together to execute the sensing task [4]. Flat routing protocols [6, 7] are fairly effectual in small scale networks. Though, they are quite undesirable in large scale networks because of resources limitation. In hierarchical routing, nodes carry out different tasks and are characteristically grouped into clusters based on exact requirements. In this paper, authors present a sufficient survey of a variety of cluster based routing protocols planned in current years. The rest of the paper is prepared as follows. Describes the routing protocols in wireless sensor networks, describe the cluster based routing protocols, and evaluate the different cluster based routing protocols in WSN. Some open issues are discussed in section 5 and section 6 concludes the paper.

Routing is a technique to find out a path between the source node and the destination node [5]. Routing in WSN is actually demanding due to the inherent characteristics that distinguish these networks from other networks. The design of routing protocols in WSNs is affected by a number of demanding factors. The efficient communication can be achieved in WSNs by overcoming these factors.

Routing protocols [4, 7] in WSNs are accountable for discovering and maintaining energy well-organized routes in the networks, in arrange to make communication reliable and well-organized. Due to the limitations in the type of network, the major aim of routing protocol plan is extending the network life time by keeping the sensors alive as much as possible. This subject results in observance the network connected for a extended period of time. There are some demanding factors which are significant in designing routing protocols. These are given as: Node deployment: Deployment application dependent and affects the performance of the routing protocols. It can be physical or randomized [4, 6]. In the first plan, the nodes are physically placed and data is routed through predestined paths. In physical deployment, coverage of area is pleased with careful option of node density. Though, this is high-quality choice when nodes are expensive and their operations are prejudiced by their locations, it is not good for cruel environments [8]. On the other hand, in chance deployment, the nodes are dotted randomly. If the application is connected to event detection, then it is well-organized to have a random node deployment to get effective results [9, 10]. Energy consumption: The major aim of routing protocols is to express data in the middle of sensors and go under in well-organized manner. Every sensor node consumes energy in sensing, dispensation, receiving and transmitting information [2]. In the middle of these data transmission is the most energy consuming task [11]. Since, the sensor nodes have connectivity changes, reorganization of network and finding new routes. So, there is a require to design routing protocols that can accommodate the tradeoff between energy optimization and correctness [12, 13]. Nature of node: In WSN, the nodes that are dotted over the environments can be either homogeneous or heterogeneous. Homogeneous nodes have the similar capabilities such as, variety of transmission, battery life, and dispensation capacity while heterogeneous nodes have dissimilar capabilities [4]. The majority of the network structural design assumes that the sensor nodes are motionless. However, mobility of base stations as well as of nodes is essential in several applications [14]. Coverage: In WSNs, every node prevails a sure view of the environment. A given sensor's vision of the environment is incomplete both in range and in accuracy. Hence reporting area is essential design issue [11]. Scalability: The number of nodes deployed in the field may be changeable i.e. few numbers to few thousands. The routing protocol is necessary to be able to work with huge amount of nodes [4, 11]. When the number of nodes is wide, it is infeasible that each node preserve a global knowledge of network topology. Quality of service (QoS): The routing protocols should be able to provide sure level of QoS that is necessary by the application. The QoS parameters can be bandwidth, release delay, throughput, jitter etc.[15]. For example, target discovery and tracking applications requires low broadcast delay for the time responsive data. While, multimedia networks requires high throughput [16]. Application: The routing protocols are very application exact. In other words, diverse situation or network environments require different routing protocols. From the application's point of view, data can be composed from the environment using a variety of methods such as, time driven, event driven, and query driven methods. In time driven methods, the sensor nodes send their data occasionally to BS or Gateways. In event driven methods, sensor nodes report the collected data when the event occurs. Finally, in query driven methods, the BS requirements the data from the nodes and send a query [4, 16].

In WSNs, the network layer is used to put into practice the routing of incoming data. In multi-hop networks, the source node cannot arrive at the sink in a straight line. So, middle nodes have to communicate their packets. The completion of the network arrangement, according to the protocol process, according to the maker of communications, and according to how a protocol selects a next hop on route of forwarded message. The classification of routing protocols is shown in figure 2.

The network structure based routing protocols are categorized as: flat based, hierarchal based (cluster based), and location based routing protocols. In flat based routing, each sensor node plays similar role. In hierarchal based routing, sensor nodes have dissimilar roles. So, when network scalability and well-organized communication is wanted, hierarchal or cluster based routing is the best choice.

CLUSTER BASED ROUTING PROTOCOLS IN WIRELESS SENSOR NETWORKS

The well-liked block cluster based routing protocols are: LEACH, HEED, UCS, EECS, CCM, TEEN, LEACH-VF etc as shown in figure 3. The merits and limitations of block cluster based routing protocols are given in table 1. The well-liked grid cluster based routing protocols are: PANEL, GAF, TTDD, SLGC etc as shown in figure3. The merits and limitations of grid cluster based routing protocols are given in table 2. The well-liked chain cluster based routing protocols are: PEGASIS, CCS, TSC etc as shown in figure 3. The merits and limitations of these protocols are given in table 3.

Table 4 summarizes the evaluation between admired cluster based routing protocols on the root of energy efficiency, delivery delay, cluster stability, load balancing, and algorithmic complexity.

• Computation and collection of cluster heads (CHs): CH is utility of computation and communication energy model for the clustering schemes. If the multi hop scheme is used then CHs count hypothetical to be revised. The presentation and ease of use of adjacent CHs is a significant factor for relaying the data of clusters. As a result, CH role in rotation of neighboring clusters must be measured as dominant factor in selection procedure of CH.

• Scalability: In a small number of large scale deployments, it is frequently desirable to increase the monitoring area in the middle of new nodes. So, cautious observations are required to ensure the flexibility and scalability of clustering techniques.

• Topology of network: Topology changes payable to defensive situation in realization of WSNs. So, it is significant to focus on the power of clustering methods.

• Fault tolerance: Transient responsibility management payable to temporal link failures needs much more attention.

 Redundancy management: Minimizing the use of particularly redundant nodes for

Wireless sensor networks have fascinated a great deal anxiety for both civil and military applications. Examples consist of ecological monitoring, border defense, battle-ground, and security observation. In these applications a enormous number of sensors are desirable, requiring cautious architecture and network organization. To support scalability, grouping nodes into clusters has been popular technique in WSNs. In this work, we surveyed the position of research and classified the dissimilar clustering methods. This paper classifies the classification of cluster based routing protocols. In this work, we spotlight on the merits and limitations of diverse cluster based routing protocols and represent them in tabular form. On the basis of comparison between diverse schemes, it is obvious that cluster based routing protocols are helpful in performance development of wireless sensor networks. This paper will be very helpful for the research group those are involved in the development, alteration or optimization of routing algorithms for WSNs.

1. Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cyirci, E., “Wireless Sensor Networks: A Survey”, Computer Networks, Vol. 38, no.4: pp. 393-422, 2002. 2. Romer, Kay, Friedemann Mattern, "The Design Space of Wireless Sensor Networks", IEEE Wireless Communications 11 (6): 54-61, 2004. 3. F. Hu, W. Siddiqui, and X. Cao, “SPECTRA: Secure Power-Efficient Clustered- Topology Routing Algorithm in Large-scale Wireless micro-Sensor Networks”, International Journal of Information Technology, vol. 11, no. 2, pp. 95–118, 2005. 4. Al-Karaki, J.N., and A.E. Kamal, “Routing Techniques in wireless sensor networks: a survey”, IEEE Wireless Communication 11:6- 28, 2004. 5. Kazem Sohraby, Daniel Minoli, Taieb Znati, “Wireless Sensor Networks: Technology: Protocols and Applications”, John Wiley & Sons, 2007. 6. Yick, J., Biswanath, M., Ghosal, D., “Wireless Sensor Network Survey”, Computer Networks, vol.52 (12):2292-2330, 2008.

Balakrishnan, “Application specific protocol architecture for wireless micro sensor networks”, IEEE Transactions on Wireless Networking, 2002. 9. Mauri, K., Hannikainen, M., Hamalainen, T., “A survey of application distribution in wireless sensor networks”, EURASIP Journal on Wireless Communications and Networking, vol. 2005: pp. 774-788, 2005. 10. P. Kumar, M. P. Singh, and U. S. Triar, “A Review of Routing Protocols in Wireless Sensor Network”, International Journal of Engineering Research & Technology(IJERT), vol. 1, no. 4, pp. 1–14, 2012. 11. Haneef, M., D. Zhongliang, “Design challenges and comparative analysis of cluster based routing protocols used in wireless sensor networks for improving network life time”, Adv. Inform. Service Sci. 4:450-459, 2012. 12. Akyildiz, I.F., Varun, M.C., “Wireless Sensor Networks”, John Wiley & Sons, 2010. 13. Cordiero, C.M., Agarwal, D.P., “Ad Hoc and Sensor Networks: Theory and Applications”, World Scientific, Singapore, 2011. 14. Ye, F., Luo, H., Cheng, J., Lu, S., Zhang, L., “A Two tier data dissemination model for large scale wireless sensor networks”, in Proceedings of ACM/IEEE Mobicom, 2002. 15. Murthy, C.S.R., Manoj, B.S., “Ad Hoc Wireless Networks: Architecture and Protocols”, Printice-Hall, New Jersey, USA, 2004. 16. Dargie, W., Poellabauer, C., “Fundamental of Wireless Sensor Networks: Theory and Practice”, John Wiley & Sons, New York, USA, 2010. 17. Ameer Ahmad Abbasi, Mohamed Younis, “A survey on clustering algorithms for wireless sensor networks”, computer Communication 30(2007) 2826-2841. 18. X. Liu, “A Survey on Clustering Routing Protocols in Wireless Sensor Networks”, Sensors, vol. 12, pp. 11113–11153, 2012. 19. S. Naeimi, H. Ghafghazi, C.O. Chow, and H. Ishi, “A survey on the taxonomy of cluster- based routing protocols for homogeneous wireless sensor networks”, Sensors, vol. 12, Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks,” IEEE INFOCOM, April 2003. 21. U. Han, S. Park, S. Kim, and Y. Chung, “An Enhanced Cluster Based Routing Algorithm for Wireless Sensor Networks,” in Proc. of PDPTA, pp. 758–763, 2006. 22. G. Gupta, M. Younis, “Load-balanced clustering in wireless sensor networks”, in Proceedings of the International Conference on Communication (ICC 2003), Anchorage, Alaska, May 2003. 23. Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H., “Energy efficient communication protocol for wireless micro sensor networks”, in Proceedings of the Hawaii International Conference on System Sciences, 2000. 24. O. Younis, S. Fahmy, “HEED: A Hybrid, Energy-Efficient, Distributed clustering approach for Ad Hoc sensor networks”, IEEE Transactions on Mobile Computing 3 (4) (2004) 366–379. 25. S. Soro, W. B. Heinzelman, “Prolonging the Lifetime of Wireless Sensor Networks via Unequal Clustering,” in Proceedings of 19th IEEE International Parallel and Distributed Processing Symposium, 2005. 26. M. Ye, C. Li, G. Chen, and J. Wu, “EECS: an energy efficient clustering scheme in wireless sensor networks,” in Proceedings of 24th IEEE International Performance, Computing, and Communications Conference, pp. 535–540, 2005. 27. F. Tang, I. You, S. Guo, M. Guo, and Y. Ma, “A chain-cluster based routing algorithm for wireless sensor networks”, Journal of Intelligent Manufacturing, vol. 23, no. 4, pp. 1305–1313, 2010. 28. M. B. Yassein, A. Al-Zou, Y. Khamayseh, and W. Mardini, “Improvement on LEACH Protocol of Wireless Sensor Network (VLEACH)”, International Journal of Digital Content: Technology and its Applications, vol. 3, no. 2, pp. 132–136, 2009. 29. Manjeshwar and D. P. Agrawal, “TEEN: A Routing Protocol for Enhanced Efficiency in Wireless Sensor Networks” in 30. Proceedings of 15th International Parallel and Distributed Processing Symposium, pp. 2009– Position-based Aggregator Node Election in Wireless Sensor Networks”, in Proceedings of IEEE International Conference on Mobile Adhoc and Sensor Systems, pp. 1–9, 2007. 32. Y. Xu, J. Heidemann, and D. Estrin, “Geography-informed Energy Conservation for Ad Hoc Routing”, in Proc. of the 7th annual international conference on Mobile computing and networking, 2001, pp. 70–84. 33. H. Luo, F. Ye, J. Cheng, S. Lu, and L. Zhang, “TTDD: Two-Tier Data Dissemination in Large-Scale Wireless Sensor Networks”, Wireless Networks, vol. 11, no. 1–2, pp. 161–175, 2005. 34. G. Delavar, S. Shamsi, N. Mirkazemi, and J. Artin, “SLGC: A New Cluster Routing Algorithm in Wireless Sensor Network for Decrease Energy Consumption”, International Journal of Computer Science, Engineering and Application, vol. 2, no. 3, pp. 39–51, 2012. 35. S. Lindsey, C. Raghavendra, and K. M. Sivalingam, “Data Gathering Algorithms in Sensor Networks Using Energy Metrics”, IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 9, pp. 924–935, 2002. 36. S. Jung, Y. Han, and T. Chung, “The Concentric Clustering Scheme for Efficient Energy Consumption in the PEGASIS”, in Proc. of 9th International conference on Advanced Communication Technology, pp. 260–265, 2007. 37. N. Gautam, W. Il Lee, and J. Y. Pyun, “Track-Sector Clustering for Energy Efficient Routing in Wireless Sensor Networks”, in Proc. of 9th IEEE International Conference on Computer and Information Technology, pp. 116–121, 2009. 38. X. liu and J. Shi, “Clustering Routing Algorithms in Wireless Sensor networks: an overview”,KSII Transactions on Internet and Information Systems, Vol 6, No.7, 2012 :pp.1735-1755. 39. G. Sikander, M.H.Zafar, A. Raza, M.I. Babar, S.A. Mahmud, and G.M. Khan, “A survey of cluster based routing schemes for wireless sensor network”, Smart Computing Review, Vol 3, No 4, August 2013. 40. Duc Ching Hoang, Rajesh Kumar, Sanjib Kumar Panda, “Realisation of cluster based

171.

41. Dilip Kumar, “Performance analysis of energy efficient clustering protocol for maximizing lifetime of wireless sensor networks”, IET Wireless Sensor System, Vol 4, Issue 1:pp.9-16, 2014.

Research Scholar, Department of Computer Science, Madhyanchal Professional University, Ratibad, Bhopal, Madhya Pradesh-462044, India