New Heterogeneous Clustering Protocol for Prolonging Wireless Sensor Networks Lifetime

LEACH (Low Energy Adaptive Clustering Hierarchy) [1], which is a homogeneous system then proposed a new routing protocol and data aggregation method in Leach heterogeneous

As seen from the simulation results in LEACH R, transmissions to the base station (high energy), takes place only from the R nodes which are selected from

A fast clustering algorithm based on an approximate commute time embedding for heterogeneous information networks with a star network schema is proposed in this paper by utilizing

The service layer contains most of the services required for communication and discovery. This layer invokes its service after receiving the message from the application

Wireless sensor networks consists of thousands of tiny, low cost, low power and multifunctional sensor nodes where each sensor node has very low battery

Organizing nodes in separate groups for preventing extra data transfer is a method for reducing nodes' energy consumption but on the other hand the problem of

LEACH is a clustering algorithm, which means the nodes of the network are organized within clusters and they communicate between themselves via sensor elements called Cluster

Then the routing paths are selected by connecting all the cluster head nodes using the minimum spanning tree with degree constraint that minimizes the energy consumption for