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

  • Authors:

  • Lo-Yao Yeh;Chun-Chuan Yang;Jee-Gong Chang;Yi-Lang Tsai

  • Affiliations:

  • Network and Information Security Division, National Center for High-Performance Computing (NCHC), Tainan 744, Taiwan and Department of Information Management, National Chi Nan University, Puli, Na ...;Department of Computer Science and Information Engineering, National Chi Nan University, Puli, Nantou 545, Taiwan;Network and Information Security Division, National Center for High-Performance Computing (NCHC), Tainan 744, Taiwan;Network and Information Security Division, National Center for High-Performance Computing (NCHC), Tainan 744, Taiwan

  • Venue:
  • Journal of Network and Computer Applications
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

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.