A Novel Routing Efficient Algorithm Based on Clustering in WSNs

Application of Wireless Sensor Networks becomes important nowadays. One of the efficient and prevalent usages of Wireless Sensor Networks is using clustering in such a network. In fact, sensor nodes might reduce overload communications. With this purpose, it was tried to deliver an algorithm which prevents direct connection between all cluster heads and base station; instead, cluster heads should use other cluster heads near to the base station in order to transfer data to the base station; they were selected based on the factors such as cluster head distance with base station and distance among cluster heads. Also, in this proposed algorithm, routes are selected such that, the selected routes’ length is almost equal and finally results in work load balance among cluster heads and decrease energy consumptions and increase network lifetime. In addition, time delay for data transfer to base station becomes leved off in all routes.