On design of a route-optimised and seamless HCoP-B scheme for nested mobile networks
by Ing-Chau Chang, Chia-Hao Chou, Lin-Huang Chang
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 7, No. 1, 2011

Abstract: In this paper, we first apply the hierarchical concept to the care-of prefix (CoP) scheme as HCoP and enhance HCoP with a novel binding update tree (BUT) structure as HCoP-B for network mobility (NEMO) management of the nested mobile network. Second, we further extend HCoP-B to support the seamless handoff of the nested NEMO. As compared to schemes such as reverse routing header (RRH), route optimisation using tree information option (ROTIO) and HCoP with numerical performance evaluations, HCoP-B achieves the shortest handoff latency and significantly reduces the consumed network bandwidth of global binding update messages for route optimisations (RO) of all correspondent nodes (CN) after the nested mobile network hands over to a new AR. Besides, HCoP-B also achieves shorter playback disruption time and buffering time than ROTIO does, which is the only one scheme mentioned how to achieve seamless handoff for the NEMO in the literature, for ongoing real-time multimedia applications whenever the mobile subnet in the old nested mobile network hands over to a new one.

Online publication date: Wed, 23-Feb-2011

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com