Please use this identifier to cite or link to this item:
|Title:||A secure routing model based on distance vector routing algorithm||Authors:||Wang, Bin
|Keywords:||DRNTU::Engineering::Computer science and engineering||Issue Date:||2012||Source:||Wang, B., Wu, C., Yang, Q., Lai, P., Lan, J., & Guo, Y. (2012) A secure routing model based on distance vector routing algorithm. Science China Information Sciences, 55.||Series/Report no.:||Science China information sciences||Abstract:||Distance vector routing protocols have been widely adopted as an efficient routing mechanism in current Internet, and any 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.||URI:||https://hdl.handle.net/10356/97044
|ISSN:||1674-733X||DOI:||http://dx.doi.org/10.1007/s11432-012-4659-7||Rights:||© 2012 Science China Press and Springer-Verlag Berlin Heidelberg.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.