Performance Comparison Of Various Hierarchical WSN Routing Protocols

Wireless Sensor Networks (WSN) is composed of small sensor nodes which may be hundreds or multi hundreds or thousands in number. Sensor nodes, also known as mote, are small, lightweight and portable devices equipped with a transducer, microcomputer, transceiver, and power source. Based on the network topology, routing protocols in sensor networks can be classified as flat-based routing, hierarchical-based routing and location-based routing. This paper studied some hierarchical-based routing protocols and evaluated these protocols with different cluster head probability in medium network with 200 nodes number. Protocols like Low Energy Adaptive Clustering Hierarchy (LEACH), Distributed Energy-Efficient Clustering (DEEC), Threshold sensitive Energy Efficient sensor Network protocol (TEEN) and Stable Election Protocol (SEP) are used for our comparisons. We evaluate the performance of these protocols for a cluster head probability sensing application. Cluster head Probability effects on throughput, overhead, packet delivery ratio, alive nodes and dead nodes, as parameters used to measure the performance of these protocols. We observed new results and different comparisons for hierarchical protocols in WSN.