An Effective Survey on Cluster Based Routing Protocols

An Effective Survey on Cluster Based Routing Protocols

Dhanya Rajan

PG Scholar/Dept. of CSE, Karunya University, Tamil Nadu, India,

Deva Priya. I,

Assistant Professor/Dept. of CSE, Karunya University, Tamil Nadu, India,

Abstract

Wireless Sensor Network consists of distributed sensors for monitoring environmental and physical conditions such as temperature, sound and pressure etc. Ad hoc network is a decentralized type of network without any pre-existing infrastructure. Routing is a technique used to determine appropriate path from source to destination. In case of wireless sensor network routing is an important problem. There are several routing protocols available (E.g. AODV, PEACH, CBRP, LEACH etc.). Clustering is a technique that divides the major network into interconnected sub networks that is called as clusters. Each cluster has a cluster head. The main aim of the clustering protocols is to increase the network lifetime and reduce the energy consumption of the sensor nodes. This paper presents a survey on various routing protocols.

Index Terms Ad-hoc network, Routing Protocol Wireless sensor network, Clustering, Cluster head.

1. Introduction

   Wireless Sensor Network (WSNs) consists of sensor nodes for monitoring environmental conditions, health, commercial and home applications. Wireless impromptu network may be a suburbanized form of wireless network. The network is alleged to impromptu then it doesnt consider a pre existing infrastructure like routers in wired networks or access points in managed wireless networks. WSN has many applications such as civilian and military applications. The usually used application of MANET (Mobile ad- hoc networks) is military communications including emergency response, and search/rescue maneuvers [12-16]. The

   WSNs consist of small sensor nodes, the nodes are small, lightweight, battery-powered devices, it has less or limited energy. Hence in WSNs consumption of energy is an important issue. In the ad hoc network for routing every node participates by forwarding knowledge for different nodes, therefore the determination of that nodes forwarding knowledge is formed dynamically on the idea of network property. Circumstantial network uses flooding additionally to the classic routing for forwarding the information. For both sensor networks and ad-hoc networks, the most popular technique is clustering for locality- preserving network organization [8]. Architectures based on clusters are effectively reducing energy consumption and enable data aggregation [9, 10] and security mechanisms [11]. The wireless circumstantial networks have kind of applications because of the decentralized nature of the network. Negligible configuration and fast readying makes the circumstantial network appropriate for emergency things like natural disasters or military conflicts. Because of the presence of dynamic and reconciling routing protocols circumstantial networks may be fashioned quickly. There are different types of ad hoc routing protocols such as table-driven or proactive routing, on-demand or reactive routing and hierarchical routing protocol.

2. Study of Routing Protocol

   This section describes various routing protocols for ad-hoc network. There are different types of ad hoc routing protocols are there such as table-driven or proactive routing, on-demand or reactive routing and hierarchical routing protocol.

   1. Ad-Hoc On-Demand Distance Vector Routing

      An ad hoc network is a collection of mobile nodes without any centralized access point or existing infrastructure. It is an on-demand or reactive type ad hoc routing protocol. Ad-hoc On Demand Vector Routing (AODV) algorithm can be used for ad hoc networks [1]. It is suitable for self-starting dynamic network. It provides loop-free routes even if the broken links are repairing. Global periodic advertisements are not required for this type of protocols so that the overall bandwidth availability of the mobile nodes is less than other protocols that needs such advertisements. The basic objectives of the algorithms are: (1) broadcast the discovery packets only when necessary, (2) distinguish between local connectivity management and general topology maintenance and (3) to disseminate information about changes in local connectivity. AODV uses a broadcast route discovery mechanism. It can find route quickly and efficiently. The features of AODV are the following: (1) it stores only the needed routes, (2) need for broadcast is minimized, (3) memory requirement is reduced, (4) fast response to link breakage and (5) it is scalable for large population of nodes. The drawback is it has longer latency for route establishment.

   2. Energy-Driven Adaptive Clustering Hierarchy (Edach) for Wireless Sensor Networks

      Wireless Sensor Network (WSNs) consists of sensors which has less battery power. Hence energy consumption is a major issue in WSNs. There are different methods for improving the network lifetime. A new approach called energy- driven adaptive clustering hierarchy (EDACH) evenly distributes the energy among the sensor nodes to increase the network lifetime [2]. The proposed system has two phases (1) set-up phase,

      (2) self-organizes data collection and transmission phase. Compare with Low-Energy Adaptive Clustering Hierarchy (LEACH) and Proxy-Enabled Adaptive Clustering Hierarchy (PEACH) the proposed approach increases the network lifetime. This proposed model is not suitable for multi-level cluster hierarchy.

   3. Peach: Power-Efficient and Adaptive Clustering Hierarchy Protocol for Wireless Sensor Network

      The Wireless Sensor Network clustering is a technique which is used to minimize the energy consumption and maximize the lifetime of the network. But in many cases the clustering consumes large amount of energy because of fixed clustering and cluster formation overhead. A protocol called Power-Efficient and Adaptive Clustering hierarchy (PEACH) [3]. This proposed system supports adaptive multi-level clustering and form clusters without additional overhead. It can be used for location-aware and location unaware wireless sensor network. Even with the energy constraints the network lifetime can be maximized with energy-aware clustering protocol. Low and balanced energy consumption of each node and long term connectivity to the network are the few properties provided by the clustering protocol; these properties are closely related to the network lifetime of the WSNs. This system increases the network lifetime and minimizes the energy consumption compared with existing clustering protocols.

   4. Enhanced Cluster Based Routing Protocol for Manets

      Wireless Sensor Networks are composed of collection of devices that communicate with each other over wireless medium [7]. The routing protocols suffer in their performance due to the resource constraints and the nodes mobility. In case of MANETs, the protocols based on clustering suffer in many cases due to the failure of cluster head; it decreases the stability of the cluster. An enhanced cluster based routing protocol (CBRP) was proposed to increase the performance of traditional CBRP [4]. By using weighted clustering algorithm (WCA) they are electing better cluster head. In the hierarchical network structure each cluster has a leader, which is also called the cluster head (CH).

   5. Modified Leach Algorithm for Wireless Sensor Network

      Wireless Sensor Network (WSNs) consists of large number of sensor nodes which are deployed in a certain area for collection of data. The major issues in Wireless Sensor Network ar resource

      constraints. The main aim is to increase the network lifetime of the network. To achieve this goal clustering the sensor nodes is a good technique. An energy efficient clustering algorithm for sensor networks based on the LEACH (Low Energy Adaptive Clustering hierarchy) protocol was proposed [5]. When compared to LEACH the proposed system decreases the consumption of the network resource.

   6. A Management of Ad Hoc Network Model for Rescue and Emergency Senarios

      The main problem of the Mobile Ad-hoc Networks (MANETs) is the availability of the network. Clustering is a technique which is used in the ad hoc network. A Backup Cluster head (BCH) was proposed in order to improve the hierarchical routing and for the convergence of the clusters [6]. Backup Cluster Head protocol (BCHP) is used in order to improve the availability and convergence of the network. The BCHP is better when compared with the existing protocols such as AODV and CBRP. Here the cluster formation is done by the variant of WCA.

3. Conclusion

Clustering is a technique which is used to divide the entire network into sub network. The main aim is to improve the network lifetime. In this above survey many clustering protocols are discussed to improve the network lifetime. Among those protocols BCHP (Backup Cluster Head Protocol) is efficient as it improve the availability and convergence of the network when compared to the previously existing protocols.

References

1. Perkins, C., Belding-Royer, E., & Das, S., Ad hoc on-demand distance vector (AODV) routing, 2003.

2. Kyung Tae Kim & Hee Yong Youn, Starvation Energy-Driven Adaptive Clustering Hierarchy (EDACH) for Wireless Sensor Networks, in: international federation for information processing, 2005, (LNCS 3823, pp. 10981107).

3. Sangho Yi., Junyoung Heo., Yookun Cho & Jiman Hong, PEACH: Power-efficient and adaptive clustering hierarchy protocol for wireless sensor networks, in:

   Computer Communications, 2007, 30, 2842-2852

4. Kartheek Srungaram., M. H. M. Krishna Prasad, Enhanced Cluster Based Routing Protocol For MANETs, Ad Hoc Networks, Proceedings of 21st Biennial Symposium on Communications, 2011, pp. 31 35.

5. Mortaza Fahimi Khaton Abab., Mohammad Ali, Modified LEACH Algorithm for Wireless Sensor Network, in: IJCSI International Journal of Computer Science Issues, 2011, Vol. 8, (1694-0814).

6. Rommel Torres, Luis Mengual, Oscar Marban , Santiago Eibe , Ernestina Menasalvas, Byron Maza, A management Ad Hoc networks model for rescue and emergency scenarios, in: Elsevier Ltd, 2012, doi:10.1016/j.eswa.2012.02.09

7. O. Douse, P. Thiran, and M.Hasler, Connectivity in Ad hoc and Hybrid Networks, presented at INFOCOM02, 2002.

8. D. Peleg, Distributed computing: a locality-sensitive approach: Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.

9. K. Dasgupta, K. Kalpakis, and P. Namjoshi, An efficient clustering based heuristic for data gathering and aggregation in sensor networks, Wireless Communication, IEEE Transaction on, vol. 1, pp.660- 670, 2002.

10. H.G. Luo, F. G. Ye, J. Gheng, S. G. Lu, and L. G. Zhang, TTDD: Two-Tier Data Dissemination in Large- Scale Wireless Sensor Network, Wireless Network, vol. 11, pp. 161-175, 2005.

11. S. Zhu, S. Setia, and S. Jajodia, LEAP: efficient security mechanisms for large-scale distributed sensor network, Proceedings of the 10th ACM conference on Computer and communication security, pp. 62-72, 2003

12. M. Forodigh et al., Wireless ad hoc networking- The art of networking without a network, Ericsson Review 4 (2000) 248263.

13. I. Chlamtac et al., Mobile ad hoc networking: imperatives and challenges, Ad Hoc Networks 1 (2003) 1364.

14. C.R. Dow, et al., A study of recent research trends and experimental guidelines in mobile ad-hoc, in: Proceedings of the 19th International Conference on Advanced Information Networking and Applications (AINA05), 2005, pp. 72-77.

15. N. Aschenbruck, et al., Human mobility in MANET disaster area simulation a realistic approach, in: Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks (LCN04), 2004, pp. 668675.