Wireless sensor networks with temporary cluster head nodes

The clustering in the Wireless Sensor Networks (WSN) is one of the most important investigation areas. There are many cluster head selection algorithms which were developed before today. These algorithms were developed to 2D and 3D spaces, WSN with fixed and mobile sensor nodes. The main goal of all of developed algorithms is the energy consumption decreasing and WSN life-time increasing. The new algorithms for clustering appeared during last time. These algorithms based on the idea of temporary cluster head using. The round length optimization and the impact of the temporary cluster head node moving on the network operation investigation in this paper.