Weighted Cluster Head Election in Wireless Sensor Network

Wireless Sensor Networks (WSNs) consist of a collection of cheap, easy to deploy Sensor nodes arranged together to fulfill a specific purpose (monitoring, tracking ... etc.). A WSN network is composed of a Base Station (BS) and collection of sensors. There are a lot of approaches for the network construction. Amongst them is the hierarchical structure, where the network is divided into clusters and the node inside this cluster communicates with BS through a chosen leader called Cluster Head (CH). In this paper, we present cluster-Head election algorithms for WSNs. We will discuss the operations of these algorithms, and compare their performance. As well s proposing a new CH election Scheme that takes into account the transmission power as well as the network security. Choosing the right cluster head with the best security odds has the effect of increasing the network lifetime significantly as well as improving the network throughput, and reducing the level of corrupt data and other threats that faces a network under attack.