Abstract—In this paper we will present a distributed balanced routing algorithm with optimized cluster distribution. According to the previous clustering algorithms, selection conditions for the cluster head (CH) were either accidentally evaluated or evaluated based on some parameters regardless of the state of a node or its neighbors. In the presented algorithm a type of mechanism was used in which it performs cluster formation in special conditions with regard of the neighborhood principle and local information of a node and its neighbors. In RCSDN a new technique is used with which we were able to apply a selective condition by using a local and distributed threshold detector so that a more optimized method for selecting CHs is created. Finally, with the results of multiple simulations we were able to show that RCSDN, in comparison with the previous Clustering Algorithm has increased the lifetime of sensor network, and reduced the amount of node energy consumption by balancing the use of energy between nodes, therefore resulting to a more suitable distribution of clusters in the sensor network. Hence, this algorithm is more effective compared to the previous algorithms.

Index Terms—Clustering, wireless sensor network, energy balancing, energy efficiency, routing, distributed system.

Arash Ghorbannia Delavar and Javad Artin Delavar are with the Computer Department of Payame Noor Universtiy (e-mail:a_ghorbannia@pnu.ac.ir, javad.artin@gmail.com).
Mohammad Mahdi Tajari Delavar is with the Computer Department of Islamic Azad University (e-mail: mm.tajari@gmail.com).

Cite: Arash Ghorbannia Delavar, Javad Artin, and Mohammad Mahdi Tajari, "RCSDN: A Distributed Balanced Routing Algorithm with Optimized Cluster Distribution," International Journal of Computer and Electrical Engineering vol. 4, no. 4, pp. 592-595, 2012.