SIMULATIVE AND COMPARISION ANALYSIS OF LEACH AND HEED PROTOCOL IN NS2

: Nowadays, the wireless sensor network is the fast emerging technique for an ad-hoc network. Most of the routing protocol extended the network lifetime by uses the less consumption of battery by the sensor nodes. The proposed routing algorithms mostly use the hierarchical routing to increase the network lifetime and overcome the all issues in the network. The clustering approach is used to extend the lifetime of sensor node and decrease the energy consumption in the sensor network. These papers compare the various quality of service (QoS) parameter of network. In this paper we compare the LEACH and HEED protocol in term of QoS parameter. The experimental results show that the comparison of HEED protocol is better as compared to LEACH. Also the HEED algorithm is more energy efficient algorithm as compare to LEACH, because this algorithm extend the network lifetime and decreases the energy consumption.


I. INTRODUCTION
. Wireless sensor networks (WSN) consist of a small sensor node. The sensors are small in size and less-complex device. These sensor nodes sense the signal and gather information from its neighborhood node. The gathering information is than forward from a wireless link through a multiple route pass to a base that utilizes it locally or associated with different system [1] [2].In wireless sensor network nodes are deployed in a large area. Sensor nodes required very low power. A sensor consists of a sensing unit, Processing unit, storage and power supply unit. The basic feature of sensor nodes is that it stores some information and processes this information for a transmission at the BS. The component is used for wireless sensor network are as BS, sensor node and the interferences between the user through internet. In addition sensors are the most important component of the network. The applications of wireless sensor network are used in the military application, Area Monitoring, Environmental application and weather forecast detection. The nodes deployment can be fixed, regular and mobile [3] [5].In a WSN the communication can be done using either single hop Or multiple hop. In single hop communication only one hop is used to transmit the signal or information from sensor node to BS. In the multihop communication two or more hops is used to convey the information from a cluster head to destination [14]. During multihop communication the information is not directly Transfer so that the network is divided into cluster. So clustering approach is used in each cluster. In clustering approach sensor transfer information to cluster head aggregate information that are received from the different nodes in a cluster. When the all information is gathering the cluster head transmit to the Base station. The sensor node can be homogeneous or heterogeneous in the network. In homogenous network same type of node is used where as in heterogeneous network different type of node is used i.e. Active node or sleep node. The routing techniques can be classified into three categories i.e. flat, hierarchical and location based. In the Flat routing all node work together to collect the information and route this information in the network. In this routing technique the function of node is identical. In location based routing the information is sense on basis of node location. After that the node build the optimal routing path for the transfer of information on the basis of each node information .In the hierarchical routing the cluster head is used to collect the information and route the information hop by hop form the downstream(member nodes) to upstream(CH) [3] [16]. The hierarchical divide into four categories i.e. Chain Based Data Aggregation, Grid Based Data Aggregation, Tree Based Data Aggregation, and Cluster Based Data Aggregation. In chain based all nodes knows the information of another node to create a chain for the transmission of information. In the Grid based data aggregation the information is transmitted on the basis of geographic position where the aggregators transfer the information. In this approach node does not communicate with each other only the aggregator nodes communicate. In the tree based data aggregation the network is form into tree to aggregate the information. In the cluster based data aggregation the network is divided into cluster. Each clusters form its own cluster head to aggregate the information. The cluster head transfer the information to the base station [16]. LEACH protocol is based on MAC Protocol. This algorithm distributes energy consumption evenly in all sensors node of the network. In this algorithm the network are divided into cluster. In each cluster one cluster head is selected on the basis of probability. The energy factor is important in clustering so that sensor node with higher energy selected as a cluster head random rotation. LEACH protocol is work in two phases; Setup phase and the Steady state phase. In the setup phase In the set-up phases sensor nodes want to be cluster head on the basis of random number between 1 and 0 and selected thevalue of node is less than the threshold value that node number is than compare with the threshold value. After that select as a cluster head for the next round. In the steady state Phase all the data is transmitted from the sensor node to cluster head and then cluster head aggregate the data to transfer at the base station [12] [13]. In HEED (Hybrid Energy-Efficient Distributed Clustering) two parameter are used, the first parameter is residual energy and the second parameter is network topology (distance between the neighbors node, node degree) [4]. The operation of HEED is divided into several phase. In the initialize phases the node defines its probability to become a cluster head. In which the sensor select their probabilities between 0 to 1. In the main phase the some node become a tentative node and rest of node are member in cluster. In final phase the least communication cost of node become CH [11].

II. RELATED WORK
Kaur H., et al. [2010] proposed the H-HEED (Heterogeneoushybrid energy efficient distributed) Algorithm to extend the network lifetime. In this algorithm the different level of heterogeneity impact is describe in term of node energy. The simulation result show that the H-HEED algorithm is better as compare to HEED in term of lifetime and more effective data packet transmission [15]. Ren F., et al. [2011] implements Energy-Balanced Routing Protocol (EBRP). In this algorithm the forces is apply on the packets to pass in the direction of BS through the dense area with very low residual energy. The results show that this algorithm work more effectively as compare to other exiting routing protocol in term of extended network lifetime, energy balance, and coverage ratio [7].Sharma S., et al. [2013] presented a survey regarding to the routing protocol, architecture design issue, power consumption and the communication capabilities. For implement the networks the some factors are considered such as the mobility, coverage area, , power consumption, communication capabilities etc. In this paper also describe some issues for WSNs like as security, energy consumptions, network lifetime [8]. Mardini W., et al. [2014] proposed R-HEED protocol to extend the lifetime of network and residual energy. This algorithm selects the cluster head on the basis of turn schedule. In this algorithm if the energy of current cluster head is goes down under the threshold value, than transmitted the reclustering message to the BS. The base station transmitted the re-clustering message among all the nodes to select the cluster head for the next round. Otherwise re-clustering is not required for the next round. The simulation result show that the R-HEED perform better as compare to HEED protocol [9]. Varma A., et al. [2015] suggested the entire network is divided into a cluster , and multipath are restricted to these clusters by which traffic will be distributed only to the cluster without propagation entire network and does not restricted and does not cause delay , energy consumption ,increase delivery ratio between the nodes. Multi-path routing provides an easy mechanism to distributed traffic, balance networks load and fault tolerance [10]. Eshaftri M., et al. [2015] implement LCP protocol to extend the network lifetime of wireless sensor network. In this paper algorithm use the inter cluster approach which balance the energy consumption in the network. This algorithm rotates continuously to select Cluster Head (CH) with higher residual energy in each round. The results show that this approach extended the network lifetime and also effective for balances the energy consumption among all sensor nodes [3].Singh S., et al.
[2015] presented a survey paper on cluster based routing protocol in wireless sensor network. In this paper the various routing algorithm is presented in term of the scalability, energy efficiency, cluster stability, delivery delay, load balancing and algorithm complexity. Also the merits and demerits of clustering algorithm is define. The comparison between various routing technique shows that the cluster based routing algorithm improve the performance of wireless sensor network [6]. Ma Z., et al. [2016] presented the improved version of LEACH algorithm known as LEACH-C (Low Low -Energy Adaptive Clustering Hierarchy-centralized). In this paper energy is distributed in the network by changing the nodes into cluster head. This algorithm balances the energy efficiently as compare to LEACH algorithm. The simulation result show that improved version of algorithm can extend the lifetime of the system [11].

III. SIMULATION SETUP
The network is simulated in network simulator NS2. We considered the heterogeneous sensor network with 41 sensors nodes that are deployed evenly distributed in the 800m*800m area. In which the one node is used as the sink (base station).We analyzed and compared the LEACH protocol and HEED protocol with each other. Table: -1 show the network configuration used in the NS2. The Figure 1 shows that the 41 node are deployed in a network area. The figure 2 shows that the nodes transfers the information and aggregate the information from its neighboring nodes and cluster head. After the aggregation of information the cluster head communicate with base station for the transfer of information.

IV. RESULT & DISCUSSION
We analyze the LEACH and HEED Protocol with each other. For comparison we use some parameter such as delay, packet loss and throughput. The result show according to the simulation time for 800*800 m area. In 8000*800m network area 41 nodes are deployed random manner. Figure 1 shows that the delay comparison result of LEACH and HEED protocol. The delay is more in LEACH as compared to the HEED protocol. The more time taken by the packet for the transmission in the network from the cluster head to sink is known as delay. Figure 2 shows that the packet loss in LEACH and HEED. The packet loss is high in LEACH protocol as compared to the HEED protocol. If the packet is not successfully received at the destination is known as the packet loss. In packet loss the packet are drop during the transmission. The packet loss is more in LEACH because in this protocol the re-clustering is not done. Figure 3 show that the throughput of the HEED protocol is higher than as compare to the LEACH protocol. The maximum amount of the successfully information is received from source to destination in a particular time is known as the throughput. The comparison result show that the performance of HEED protocol is better as compare to the LEACH protocol.

V. CONCLUSION
The various clustering protocol are used to extend the network lifetime and also balance the energy consumption of WSNs. In this paper we compared the LEACH and HEED protocol by using different parameter. The simulation result show that the HEED protocol is better as compare to LEACH protocol in term of packet loss, delay and throughput. But still there are some issues in WSNs such as reliability, scalability etc. So that to overcome this issues further enhancement is required for this protocol. .