National Changhua University of Education Institutional Repository : Item 987654321/10568
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6507/11669
造访人次 : 29912475      在线人数 : 348
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/10568

题名: HCoP-B: A Hierarchical Care-of Prefix with BUT Scheme for Nested Mobile Networks
作者: Chang, Ing-Chau;Chou, Chia-Hao
贡献者: 資訊工程系
日期: 2009-07
上传时间: 2012-05-25T07:44:16Z
出版者: Institute of Electrical and Electronics Engineers Inc.
摘要: With current IETF Network Mobility (NEMO) Basic Support (NBS) to manage mobility of a mobile network which is moving as a whole, all communications to and from mobile network nodes inside the mobile network must go through multiple tunnels between upstream mobile routers and their home agents. This results in the non-optimized route and increased packet delay between communication peers. Hence, lots of network mobility schemes such as Reverse Routing Header (RRH), Mobile IPv6 route optimization for NEMO (MIRON) and Care-of Prefix (CoP) have been proposed to solve it. Whenever the whole mobile network or its mobile subnet change their points of network attachments, a huge amount of duplicate binding update messages are sent from the handoff mobile network to all connecting correspondent nodes on the Internet for establishing a direct and optimized packet route between them, which raises the corresponding consumed Internet and local wireless network bandwidth and in turn increases the packet transmission delay. However, traditional network mobility schemes cannot solve this serious binding update storm problem. In this paper, we apply the hierarchical concept to the CoP scheme as the Hierarchical CoP (HCoP) scheme and then enhance the HCoP with a novel Binding Update Tree structure as the HCoP-B for efficient NEMO mobility management of the nested mobile network. As compared to the traditional RRH, MIRON and HCoP with intensive performance analyses and simulations, HCoP-B achieves the shortest handoff latency, the lowest number of duplicate binding update messages conveyed over the Internet and the least amount of consumed Internet and local wireless network bandwidth for session initialization and route optimization of all connecting correspondent nodes at the expense of a small amount of extra binding caches in the binding update tree. We also discuss important issues about HCoP-B deployment, security and MAP location alternative. Consequently, HCoP-B achieves CNs route optimization and resolves the associated binding update storm problem simultaneously for the nested mobile network.
關聯: IEEE Trans. on Vehicular Technology, 58(6): 2942-2965
显示于类别:[資訊工程學系] 期刊論文

文件中的档案:

档案 大小格式浏览次数
index.html0KbHTML607检视/开启


在NCUEIR中所有的数据项都受到原著作权保护.

 

DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈