Zoltán Gál and Mohamed Amine Korteby, University of Debrecen, Hungary

In current years, there have been a large progress in Wireless Sensor Networks (WSN) due to their development in term of hardware and cost reduction. Plenty of routing protocols have been proposed and developed depending on the application and network architecture. One of the most efficient energy management of the wireless sensor networknodes is provided by the LEACH (Low Energy Adaptive Clustering Hierarchy) mechanism. This hierarchical protocol uses cluster head function of the nodes to aggregate and forward the messages from the cluster members to the Sink node. Each node decides to become cluster head stochastically in each epoch time intervals. Nodes have enough energy to reach directly through radio channel any of the nearest cluster nodes, as well as the sink node. Optimization algorithm is required to provide efficient energy consumption on the WSN clusters level. A node being cluster head in the actual epoch time can repeat this function just with a probability p in time. Classical nodes find the nearest cluster head to minimize the transmission energy consumption and use time division multiple access method (TDMA)to send the radio frames in each epoch time. In this paper we use own developed simulation method and software to analyze the remaining energy process in time of the whole WSN network and the number of forwarded frames in function of the probability p for a set of nodes having heterogeneous levels of the initial energy

Internet of Things (IoT), Wireless Sensor Network(WSN), Low Energy Adaptive Clustering Hierarchy (LEACH) protocol, radio communication, energy sparing, stochastic process