National Changhua University of Education Institutional Repository : Item 987654321/10569
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6507/11669
造访人次 : 30002255      在线人数 : 355
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/10569

题名: On Design of a Route-Optimized and Seamless HCoP-B Scheme for Nested Mobile Networks
作者: Chang, Ing-Chau;Chou, Chia-Hao;Chang, Lin-Huang
贡献者: 資訊工程系
关键词: Binding update tree;BUT;Care-of prefix;CoP;HCoP-B;Hierarchical CoP;High performance networking;NEMO;Seamless handoff
日期: 2011-02
上传时间: 2012-05-25T07:44:18Z
出版者: Inderscience Enterprises Ltd
摘要: 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.
關聯: International Journal of High Performance Computing and Networking, 7(1): 53-62
显示于类别:[資訊工程學系] 期刊論文

文件中的档案:

档案 大小格式浏览次数
2050400510012.pdf14KbAdobe PDF636检视/开启


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

 

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