We propose a novel cluster based distributed routing algorithm in a generalized form for heterogeneous wireless sensor networks. Heterogeneity with respect to number/types of communication interfaces, their data rates and that with respect to energy dissipation model have been exploited for energy and throughput efficiency. The algorithm makes routing assignment optimized for throughput and energy and has a complexity of N/K*logN+k2logk approximately, where N is the number of nodes and k is the number of kcluster heads. Performance experiments confirm the effectiveness of throughput and energy optimizations. The importance of choosing an optimal cluster radius has been shown. The energy consumption in the network scales up well with respect to the network size.
P. Ding, J. Holliday and A. Celik, “Distributed Energy-Effcient Hierarchical Clustering for Wireless Sensor Networks,” Distributed Computing in Sensor Systems, Vol. 3560, 2005, pp. 466-467. doi:10.1007/11502593_25
S. Hussain and A. W. Matin, “Hierarchical Cluster-Based Routing in Wireless Sensor Networks,” The 5th International Conference on Information Processing in Sensor Networks, Nashville, 19-21 April 2006.
S. Bandyopadhyay and E. J. Coyle, “An Energy Effcient Hierarchical Clustering Algorithm for Wireless Sensor Networks,” INFOCOM 2003 The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Francisco, 30 March - 3 April 2003, pp. 1713-1723.
A. Bari, A. Jaekel and S. Bandyopadhyay, “Clustering Strategies for Improving the Lifetime of Two-Tiered Sensor Networks,” Computer Communications, Vol. 31, No. 14, 2008, pp. 3451-3459.