Skip to main navigation Skip to search Skip to main content

On multicast-based binding update scheme for NEMO environments

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

NEMO Basic Support (NBS) protocol ensures session continuity for all the nodes in a mobile network, however, there exists a serious pinhall routing problem. To overcome this one, there are many Route Optimization (RO) solutions such as Bi-directional Tunneling (BT) mechanism, Aggregation and Surrogate (A&S) mechanism, Recursive Approach, etc. The A&S RO mechanism is known to outperform the other RO mechanisms, except for the Binding Update (BU) cost. Although Improved Prefix Delegation (IPD) reduces the cost problem of Prefix Delegation (PD), a well-known A&S protocol, the BU cost problem still presents. In this paper, a solution to reduce the cost is proposed using a multicast mechanism instead of unicasting such as the traditional BU of the RO. The performance of the proposed multicast-based BU scheme is examined with an analytical model which shows that the BU cost enhancement is up to about 32% over IPD-based, hence, it is feasible to predict that the proposed scheme could benefit in other NEMO RO protocols.

Original languageEnglish
Title of host publicationProceedings - The International Conference on Computational Sciences and its Applications, ICCSA 2008
Pages3-8
Number of pages6
DOIs
StatePublished - 2008
EventInternational Conference on Computational Sciences and its Applications, ICCSA 2008 - Perugia, Italy
Duration: 30 Jun 20083 Jul 2008

Publication series

NameProceedings - The International Conference on Computational Sciences and its Applications, ICCSA 2008

Conference

ConferenceInternational Conference on Computational Sciences and its Applications, ICCSA 2008
Country/TerritoryItaly
CityPerugia
Period30/06/083/07/08

Fingerprint

Dive into the research topics of 'On multicast-based binding update scheme for NEMO environments'. Together they form a unique fingerprint.

Cite this