Probabilistic Selection of Cluster-head based on the nearest possible Distance of Cluster-head

In recent years using wireless sensor networks (WSNs) in applications, such as disaster management and security surveillance have been increased. A lot of sensors in these applications are expected to be remotely deployed in unattended environments autonomously. To support scalability, nodes are often grouped into disjointed and mostly non-overlapping clusters. Every cluster has a leader that is known as a cluster-head (CH). The CH may be selected by the sensors in the network or pre-assigned by the network designer. These networks require effective communication protocols to be energy efficient and increase network quality. In this paper, a self-organization routing protocol for wireless sensor networks is presented by using hierarchical protocols and considering the position of CHs regarding to each other which is called “Probabilistic Selection of Cluster-head based on the Nearest possible Distance of Cluster-head”. In addition to increase network lifetime, it causes to increase scalability of the network, optimal use of communication bandwidth and improve some of qualitative parameters of the sensor networks. Proposed method has little overhead control and can find appropriate CHs with local information. In this paper, simulation is done by the NS-2 simulator, and simulation results show this protocol could lead to increase environment monitoring, improve network lifetime, throughput and some qualitative sensor network parameters by improving the clustering process of all the routing protocol. WSNs that aren’t considered CHs distribution (LEACH protocol here).