Abstract
MATHEMATICAL MODELING OF THE E-EDCH CLUSTERING ALGORITHM FOR WSNS
Rajkumar* and Dr. H. G. Chandrakanth
ABSTRACT
A wireless sensor network (WSN) consists of a huge number of sensor nodes which are organized over an region to execute home computations support on information get together from the surroundings. Every node in the network is prepared with a battery, but it is very difficult to change, adjust or recharge batteries, therefore, the critical question is, how to extend the network lifetime to such a extended time. Hence, maximizing the lifetime of the network through minimizing the power is an significant challenge in wireless sensor network (WSN). Sensors node cannot be simply replaced or recharged due to their ad-hoc deployment in hazardous atmosphere. Considering that power saving acts as one of the hottest topics in wireless sensor networks (WSN). In this paper, a mathematical model for the E-EDCH algorithm is obtainable in order to guess the number of sensed actions (packets) in the network. Our widespread research illustrated on average 91.19% accuracy for the planned mathematical model evaluated with the results of a simulation study. The mathematical model presented at this time has also revealed that the number of sensed actions in the E-EDCH algorithm is responsive to the number of sensors and the network dimensions. On the other hand, it is approximately insensitive to the number of clusters.
[Full Text Article] [Download Certificate]