Aiming at the problem that node load is rarely considered in existing clustering routing algorithm for Wireless Sensor Networks (WSNs), a dynamic clustering routing algorithm for WSN is presented in this paper called DCRCL (Dynamic Clustering Routing Considering Load). This algorithm is comprised of three phases including cluster head (CH) selection, cluster setup and inter-cluster routing. First, the CHs are selected based on residual energy and node load. Then the non-CH nodes choose a cluster by comparing the cost function of its neighbor CHs. At last, each CH communicates with base station by using multi-hop communication. The simulation results show that comparing with the existing one, the techniques life cycle and date volume of the network are increased by 30.7 percent and 29.8 percent respectively by using the proposed algorithm DCRCL.
In REF Dynamic Clustering Routing Considering Load (DCRCL) is proposed for clustering.
Research on Dynamic Clustering Routing Considering Node Load for Wireless Sensor Networks
Communications and Network
Computer Science