Hierarchical Routing with Energy Efficient Clustering Algorithm for Wireless Sensor Networks

Enormous changes in gathering, processing and disseminating data for varying applications and environments is brought down by the use of Wireless Sensor Networks (WSNs). The lifetime for WSNs plays an important role in survivability as energy efficiency is one of the serious concerns for WSNs. One of the energy efficient technique is Clustering, which divides sensor nodes into many clusters, each set of nodes has a cluster-head. The cluster formation and Cluster Head (CH) election are done by Energy Efficient Clustering (E2C). In E2C, the routing of data to the base station from cluster-head nodes is dealt, however, it is not clearly formulated. In cluster-based hierarchical routing, between cluster members and the BS, CH acts as an intermediate node. In the data forwarding phase, by considering both path cost and residual energy, CH selects a path from its route cache. This idea motivated us to know about the different protocols which suit for different applications and helped in developing suitable protocol used as robustly and efficient manner. The performance of E2C Single hop, CIDBR E2C, multi-tierE2C and multi-level hierarchical E2C are analyzed and compared through numerous simulation runs.