Efficient Clustering Routing Algorithm Based on Opportunistic Routing
- 1 School of Computer Science and Technology, Dalian University of Technology, Dalian, China
- 2 School of Computer and Information Technology, Liaoning Normal University, Dalian, China
- 3 School of Computer Science and Technology, Dalian University of Technology, Dalian, China
- 4 School of Computer Science and Technology, Dalian University of Technology, Dalian, China
- 5 School of Computer Science and Technology, Dalian University of Technology, Dalian, China
Abstract
Based on the analysis of the existing classic clustering routing algorithm HEED, this paper proposes an efficient dynamic clustering routing algorithm ED-HEED. In the cluster selection process, in order to optimize the network topology and select more proper nodes as the cluster head, the proposed clustering algorithm considers the shortest path prediction of the node to the destination sink and the congestion situation. In the data transmission procedure, the high-efficiency CEDOR opportunistic routing algorithm is applied into the ED-HEED as the data transmission mode between cluster headers. A novel adaptive dynamic clustering mechanism is also considered into the algorithm, as well as the data redundancy and security control. Our Simulation demonstrates that the ED-HEED algorithm can reduce the energy consumption, prolong the network life and keep the security and availability of the network compared with the HEED algorithm.
- Ren, F.Y., Huang, H.N. and Lin, C. (2003) Wireless Sensor Networks. Journal of Software, 14, 1282-1291.
- Zhao, T., Guo, T.D. and Yang, W.G. (2009) Energy Balancing Routing Model and Its Algorithm in Wireless Sensor Networks. Journal of Software, 20, 3023-3033. http://dx.doi.org/10.3724/SP.J.1001.2009.03384
- Pantazis, N.A., Nikolidakis, S.A. and Vergados, D.D. (2013) Energy-Efficient Routing Protocols in Wireless Sensor Networks: A Survey. IEEE Communications Surveys & Tutorials, 15, 551-591. http://dx.doi.org/10.1109/SURV.2012.062612.00084
- Heinzelman, W.R., Chandrankasan, A. and Balakrishnan, H. (2000) Energy-Efficient Communication Protocol for Wireless Microsensor Networks. Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, Hawaii, 4-7 January 2000, Vol. 2, 10. http://dx.doi.org/10.1109/hicss.2000.926982
- Manjeshwar, A. and Agrawal, D.P. (2001) TEEN: A Routing Protocol for Enhanced Efficiency in Wireless Sensor Networks. IPDPS, 1, 189. http://dx.doi.org/10.1109/ipdps.2001.925197
- Handy, M.J., Haase, M. and Timmermann, D. (2002) Low Energy Adaptive Clustering Hierarchy with Deterministic Cluster-Head Selection. 2002 IEEE 4th International Workshop on Mobile and Wireless Communications Network, 368-372. http://dx.doi.org/10.1109/mwcn.2002.1045790
- Younis, O. and Fahmy, S. (2004) HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks. IEEE Transactions on Mobile Computing, 3, 366-379. http://dx.doi.org/10.1109/TMC.2004.41
- Yoon, M., Kim, Y.K. and Chang. J.W. (2013) An Energy-Efficient Routing Protocol Using Message Success Rate in Wireless Sensor Networks. Journal of Convergence, 4, 15-22.
- Lung, C.H. and Zhou, C. (2010) Using Hierarchical Agglomerative Clustering in Wireless Sensor Networks: An Energy-Efficient and Flexible Approach. Ad Hoc Networks, 8, 328-344. http://dx.doi.org/10.1016/j.adhoc.2009.09.004
- Ding, N., Tan, G.-z., You, D. and Zhang, W. (2013) Opportunistic Routing Algorithm Based on Topological Time- Varying and Residual-Energy Balance in Wireless Sensor Network. Journal of Electronics & Information Technology, 35, 715-720.
- Heinzelman, W.B., Chandrakasan, A.P. and Balakrishnan, H. (2002) An Application-Specific Protocol Architecture for Wireless Microsensor Networks. IEEE Transactions on Wireless Communications, 1, 660-670. http://dx.doi.org/10.1109/TWC.2002.804190