Skip to Main Content
A clustering routing algorithm based on reliability (CRAR) is proposed in this paper, for the sake of improving reliability of clustering routing algorithm. CRAR introduces the random package model and divides the net into several areas by using the size of net and positions of nodes. First, the reference node in the line from source to sink is found. And then, the node which is reliable and nearest to sink in the next hop cluster head candidate area is selected as next hop cluster head by using the reference node's position. In each area, cluster head can cover the whole area and is responsible for collecting information and transmitting packages. Certainly, non-cluster-heads are dormant in order to reduce energy consumption. Both theory and simulation show that CRAR is more efficient and reliable than Ad Hoc on-demand multi-path distance vector routing(AOMDV) and Low Energy Adaptive Clustering Hierarchy (LEACH). At the same time, it can avoid broadcast storm effectively.