By Topic

Scalability analysis of NEMO prefix delegation-based schemes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hossain, M.S. ; Univ. of Oklahoma, Norman, OK, USA ; Shahriar, A.Z.M. ; Atiquzzaman, M. ; Ivancic, W.

A number of prefix delegation-based schemes have been proposed to solve the route optimization problem in NEMO, where a group of hosts move together as a mobile network. The schemes trade off between inefficiency of routes and various overheads. With the rapid growth of mobile computing, this overhead will give rise to the scalability issue of these schemes. However, there has been no quantitative study on the asymptotic scalability analysis of these schemes. In this paper, we have developed analytical models for scalability analysis of these schemes in terms of network size, mobility rate, distance between mobility agents, and traffic rate. Our analysis shows that the prefix delegation-based schemes exhibit asymptotically identical overhead on the network, and they show better asymptotical scalability in terms of number of mobile routers. The analytical framework for scalability analysis presented in this paper will help in visualizing the effects of future network expansion on the performance of these route optimization schemes of NEMO.

Published in:

High Performance Switching and Routing (HPSR), 2010 International Conference on

Date of Conference:

13-16 June 2010