A secure and efficient batch binding update scheme for route optimization of nested NEtwork MObility (NEMO) in VANETs

NCUIR > School of Management at National Central University > Department of Information Management > journal & Dissertation > Item 987654321/106323

Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/106323

Title:	A secure and efficient batch binding update scheme for route optimization of nested NEtwork MObility (NEMO) in VANETs
Authors:	葉羅堯;Yeh, Lo-Yao;Yang, Chun-Chuan;Chang, Jee-Gong;Tsai, Yi-Lang
Contributors:	管理學院資訊管理學系
Keywords:	Applied sciences;Binding update;Computer science;control theory;systems;Computer systems and distributed systems. User interface;Exact sciences and technology;Ground, air and sea transportation, marine construction;Memory and file management (including protection and security);Memory organisation. Data processing;Mobile IPv6;Network security;Road transportation and traffic;Route optimization;Software;Switching and signalling;Systems, networks and services of telecommunications;Telecommunications;Telecommunications and information theory
Date:	2013-01-01
Issue Date:	2026-04-23 13:17:46 (UTC+8)
Publisher:	Academic Press Inc.;Kidlington: Elsevier Ltd
Abstract:	摘要： NEtwork MObility (NEMO) is designed to efficiently deal with the mobility of a set of mobile nodes using Mobile Routers (MRs). NEMO is extremely suitable for Vehicle Ad hoc NETworks (VANETs) due to its highly mobile nature. However, NEMO also suffers from some limitations such as inefficient routing paths and multiple tunnels. To solve the problem of inefficient routing paths, there is a growing need for better route optimization. To achieve route optimization in NEMO, when a mobile router moves into a new foreign network, the MR or the mobile nodes within this MR are required to submit binding update messages to the correspondent nodes connecting with the aforementioned mobile nodes. As a result, a popular correspondent node may simultaneously receive a great number of binding update messages within a short period of time. This problem is quickly exacerbated in a nested NEMO environment. In addition, the security issues for route optimization have been widely discussed. Most of the improved schemes adopt traditional signatures to solve the security problems for route optimization, which often leads to heavy computational costs when a large number of signatures need to be verified. In this paper, we propose a Batch Binding Update Scheme (BBUS) to verify multiple signatures at the same time. By the adoption of elliptic curve cryptography, both the computational and communication costs are significantly reduced. 出版者： Kidlington: Elsevier Ltd 出版日期： 2013-01 出處： Journal of network and computer applications, 2013-01, Vol.36 (1), p.284-292 版權： 2012 Elsevier Ltd 版權： 2014 INIST-CNRS 識別號： ISSN: 1084-8045 識別號： EISSN: 1095-8592 識別號： DOI: 10.1016/j.jnca.2012.06.001
Appears in Collections:	[Department of Information Management] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	10	View/Open

社群 sharing

Loading...