Research on Dynamic Clustering Routing Considering Node Load for Wireless Sensor Networks

Yi Sun, Can Cui, Shanshan Ke, Jun Lu

School of Electrical and Electronic Engineering, North China Electric Power University, Beijing, China.

DOI: 10.4236/cn.2013.53B2093                

Abstract

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.

Keywords

Wireless Sensor Network; Dynamic Routing; Clustering Algorithm; Node Load

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	T. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, “Wireless Sensor Networks: A Survey,” Computer Networks, Vol. 38, No. 4, 2002, pp. 393-422.
[2]	G. Gupta and M. Younis, “Load-Balanced Clustering of Wireless Sensor Networks,” IEEE International Conference on Communications, Vol. 3, 2003, pp. 1848-1852.
[3]	P. Kuila and P. K. Jana, “An Energy Balanced Distributed Clustering and Routing Algorithm for Wireless Sensor Networks,” IEEE International Conference on Parallel, Distributed and Grid Computing, 2012, pp. 200-225.
[4]	J. G. Yu, “A Cluster-Based Routing Protocol for Wireless Sensor Networks with Non Uniform Node Distribution,” Journal of Electronics and Communications, Vol. 66, 2012, pp. 54-61.
[5]	W. B. Heinzelman, A. P. Chandrakasan and H. Balakrishnan, “An Application Specific Protocol Architecture for Wireless Microsensor Networks,” IEEE Transactions on Wireless Communications, Vol. 1, No. 4, 2002, pp. 660-670. http://dx.doi.org/10.1109/TWC.2002.804190
[6]	S. Lindsey and C. S. Raghavendra, “PEGASIS: Power Efficient Gathering in Sensor Information Systems,” IEEE Transactions on Parallel and Distributed Systems, Vol. 13, No. 9, 2002, pp. 924-930. http://dx.doi.org/10.1109/TPDS.2002.1036066
[7]	O. Younis and S. Fahmy, “HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks,” IEEE Transactions on Mobile Computing, Vol. 3, 2004, pp. 366-379. http://dx.doi.org/10.1109/TMC.2004.41
[8]	B. C. Gong, L. Y. Li, S. R. Wang and X. J. Zhou, “Multihop Routing Protocol with Unequal Clustering for Wireless Sensor Networks,” Colloquium on Computing, Communication, Control, and Management, Vol. 2, 2008, pp. 552-556.
[9]	P. Kuila and P. K. lana, “Improved Load Balanced Clustering Algorithm for Wireless Sensor Networks,” Proceedings of the 2011 International Conference on Advanced Computing, Networking and Security, 2012, pp. 399-404.
[10]	C. Petrioli, M. Nati, P. Casari, M. Zorzi and S. Basagni, “ALBA-R: Load-Balancing Geographic Routing Around Connectivity Holes in Wireless Sensor Networks,” IEEE Transactions on Parallel and Distributed Systems, 2013, pp. 1-11.