Abstract
Distance vector routing protocols have been widely adopted as an efficient routing mechanism in current Internet, and many wireless networks. However, as is well-known, the existing distance vector routing protocols are insecure as it lacks of effective authorization mechanisms and routing updates aggregated from other routers. As a result, the network routing-based attacks become a critical issue which could lead to a more deteriorate performance than other general network attacks. To efficiently address this issue, this paper, through analyzing the routing model and its security aspect, and presents a novel approach on guaranteeing the routing security. Based on the model, we present the security mechanism including the message exchange and update message security authentication mechanism. The suggested approach shows that the security mechanism can effectively verify the integrity and validate the freshness of routing update messages received from neighbor nodes. In comparison with exiting mechanisms (SDV, S-RIP etc), the proposed model provides enhanced security without introducing significant network overheads and complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bellovin S.M. Security problems in the TCP/IP protocol suite. Comput Commun Rev, 1989, 19: 32–48
Kuo C F, Pang A C, Chan S K. Dynamic routing with security considerations. IEEE Trans Parallel Distrib Syst, 2009, 20: 48–58
He L. Recent developments in securing Internet routing protocols. BT Technol J, 2006, 24: 180–196
Lakshminarayanan K, Caesar M, Rangan M, et al. Achieving convergence-free routing using failure-carrying packets. In: ACM SIGCOMM 2007. New York: ACM Press, 2007. 241–252
Wang B, Guo Y F, Lan J L, et al. Fast network self-healing mechanism based on distance vector routing protocol. J Internet Technol, 2010, 11: 659–667
Kim H, Shin G. On predictive routing of security contexts in an all-IP network. Secur Commun Netw, 2010, 3: 4–15
Rick K, Simon L, Hart R. Practical interdomain routing security. IT Prof, 2009, 11: 54–56
Jun L, Brooks S. I-seismograph: Observing and measuring Internet earthquakes. In: IEEE INFOCOM 2011. Washington: IEEE Computer Society, 2011. 2624–2632
Bellman R. On a routing problem. Q Appl Math, 1958, XVI: 87–90
Yi Q, James J, David T, et al. Information Assurance: Dependability and Security in Networked Systems. San Fransisco: Morgan Kaufmann Publishers, 2007
Haim Z, Levy H. Area avoidance routing in distance-vector networks. In: Proc of IEEE INFOCOM. Washington: IEEE Computer Society, 2008. 475–483
Mittal V, Vigna G. Sensor-based intrusion detection for intra-domain distance-vector routing. In: Proc of CCS'02. Washington: IEEE Computer Society, 2002. 127–137
Hu Y C, Perrig A, Johnson D B. Efficient security mechanisms for routing protocols. In: Proc NDSS'03. San Diego: IEEE Computer Society, 2003. 1–17
Tao W, Kranakis E, Oorschot P. S-RIP: A secure distance vector routing protocol. In: Proc of 2006 Securecomm and Workshops. Washington: IEEE Computer Society, 2006. 103–109
Babakhouya A, Challal Y, Bouabdallah M, et al. SDV: A new approach to secure distance vector routing protocols. In: Proc of 2006 Securecomm and Workshops. Washington: IEEE Computer Society, 2006. 1–10
Sheng B, Wang H N, Pan J P. Keychain-based signatures for securing BGP. IEEE J Sel Areas Commun, 2010, 28: 1308–1318
Neven G. Efficient sequential aggregate signed data. IEEE Trans Inf Theory, 2011, 57: 1803–1815
Zhang L, Qina B, Wu Q H, et al. Efficient many-to-one authentication with certificateless aggregate signatures. Comput Netw, 2010, 54: 2482–2491
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, B., Wu, C., Yang, Q. et al. A secure routing model based on distance vector routing algorithm. Sci. China Inf. Sci. 57, 1–13 (2014). https://doi.org/10.1007/s11432-012-4659-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-012-4659-7