An efficient and provably secure multi-path Distance Vector Routing

	An efficient and provably secure multi-path Distance Vector Routing
	Guo, Xian 1,2,3; Feng, Tao 3,4; Yuan, Zhanting 2,3; Ma, Jianfeng 4
刊名	Journal of Computational Information Systems
	2011-05-01
卷号	7 期号:5 页码:1638-1647
关键词	Ad hoc networks Algorithms Mobile ad hoc networks Mobile telecommunication systems Routing protocols Acknowledgement mechanism Ad hoc on demand distance vector Digital Signature Distance vector routing Error checks Mathematical method Mobile ad hoc Multi-path Multiple-path Network configuration Node-disjoint paths Provably secure Secure routing Security requirements Trusted systems
ISSN号	15539105
英文摘要	MNDP (Multiple Node-Disjoint Paths) is an algorithm for identifying a maximal set of node-disjoint paths in Ad hoc networks. In this paper, we firstly propose a Secure Multiple node-disjoint paths Distance Vector Routing (SMDVR) protocol. SMDVR is a derivative of AODV (Ad hoc On-demand Distance Vector routing) integrated with the MNDP algorithm for the discovery of multiple paths. In SMDVR, these schemes such as error check, route acknowledgement mechanism and cryptographic mechanism, can guarantee the correctness and security of route establishing. Secondly, we propose the concept of Trusted System State (TSS). TSS is based on network configuration conf. TSS describes security requirement of multiple node-disjoint paths distance vector routing. Lastly, we analyze security of SMDVR with mathematical method. The security of SMDVR can be reduced to the security of the digital signature. Copyright © 2011 Binary Information Press.
语种	英语
出版者	Binary Information Press, P.O. Box 162, Bethel, CT 06801-0162, United States
内容类型	期刊论文
源URL	[http://ir.lut.edu.cn/handle/2XXMBERH/111775]
专题	计算机与通信学院
作者单位	1.School of Electronic Information Engineering, Gansu Lianhe University, Lanzhou 730010, China 2.School of Electrical and Information Engineering, Lanzhou University of Technology, Lanzhou 730050, China; 3.School of Computer and Communication, Lanzhou University of Technology, Lanzhou 730050, China; 4.Ministry of Education Key Laboratory of Computer Networks and Information Security, Xidian University, Xi'an 710071, China;
推荐引用方式 GB/T 7714	Guo, Xian,Feng, Tao,Yuan, Zhanting,et al. An efficient and provably secure multi-path Distance Vector Routing[J]. Journal of Computational Information Systems,2011,7(5):1638-1647.
APA	Guo, Xian,Feng, Tao,Yuan, Zhanting,&Ma, Jianfeng.(2011).An efficient and provably secure multi-path Distance Vector Routing.Journal of Computational Information Systems,7(5),1638-1647.
MLA	Guo, Xian,et al."An efficient and provably secure multi-path Distance Vector Routing".Journal of Computational Information Systems 7.5(2011):1638-1647.