Hierarchical Mobile IPv6 Based Handoff Optimization Scheme

2013 ◽  
Vol 798-799 ◽  
pp. 460-463
Author(s):  
Xi Yi Zhou ◽  
Ge Zhang ◽  
Li Qiang Liu
Keyword(s):  
Loss Rate ◽  
Mobile Ipv6 ◽  
Optimization Scheme ◽  
Simulation Experiments ◽  
Hierarchical Mobile Ipv6 ◽  
Tunneling Mechanism ◽  
Handoff Delay ◽  
Update Process ◽  
Local Binding ◽  
Binding Update

Hierarchical mobile IPv6 fastens the binding update process of micro mobile handoff and reduces handoff delay. A large number of binding updates and registrations increase signaling load and lengthen handoff delay. For this reason, it is proposed to apply tunneling mechanism to hierarchical mobile IPv6 optimization scheme (T-HMIPv6) to obtain care-of address in advance based on handoff information, conduct duplicate address detection, and complete local binding update while building a tunnel. Simulation experiments show that compared with hierarchical mobile IPv6, this scheme can greatly reduce handoff delay and packet loss rate and effectively improve mobile node's macro handoff performance.

Analysis and Optimization of Mobile IPv6 Handoff Technology

2013 ◽  
Vol 798-799 ◽  
pp. 489-492
Author(s):  
Xi Yi Zhou ◽  
Yun Ke ◽  
Ge Zhang
Keyword(s):  
Service Quality ◽  
Network Performance ◽  
Mobile Ipv6 ◽  
Drop Out ◽  
Node Mobility ◽  
Hierarchical Mobile Ipv6 ◽  
Advantages And Disadvantages ◽  
Handoff Delay ◽  
Simulation Results ◽  
Packet Drop

Mobile IPv6 solves the problem of node mobility though the protocol handoff process requires high cost and affects service quality. Currently, mobile IPv6 fast mobility and hierarchical mobility handoff technology enjoy wide applications, but there are still weaknesses. In view of the advantages and disadvantages of these two technologies, this paper puts forward a new fast hierarchical handoff scheme of mobile IPv6. Simulation results show that the handoff delay of fast hierarchical mobile IPv6 is shorter than that of fast mobile IPv6 and hierarchical mobile IPv6, which can reduce data packet drop-out and improve network performance.

Dynamic Routing Algorithm Based on HIP Multicast Model

2012 ◽  
Vol 424-425 ◽  
pp. 607-611
Author(s):  
Xue Zhen Shen ◽  
Xin Guo Tang
Keyword(s):  
Loss Rate ◽  
Multicast Routing ◽  
Search Algorithm ◽  
Routing Algorithm ◽  
Simulation Experiments ◽  
Delay Jitter ◽  
Result Show ◽  
Dynamic Multicast ◽  
Multicast Routing Algorithm ◽  
Multiple Qos

A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be equal

Sign in / Sign up

Export Citation Format

Share Document