LTTMAP Fast Handoff Scheme of Advancing Hierarchical Mobile IPv6

2014 ◽  
Vol 556-562 ◽  
pp. 6375-6378 ◽  
Author(s):  
Shi Lin Fang

There are many obstacles exit in the mobile management scheme, it mainly shows in its not high switching performance, excess signaling overhead and too long handoff delay, hard guaranteed quality of service in handoff as well as safety problem. It put forwards a fast handoff scheme which advances HMIPv6 by giving it authority to temporary mobility anchor point (LT-TMAP). The lower level access router is licensed through upper level of MAP, make it a temporal mobility anchor point to give distribute management to mobile node, and describe the implementation process theoretically. In the end, we use the NS-2 simulation tool to build network topology and based on the IPv6 test-bed build in our school network laboratory which I help researched to give a simulation test to that handoff scheme. It proves the handoff scheme can take better advantage of the network MAP resource, has stronger real-time performance, and higher handoff efficiency.

Author(s):  
Hewei Yu ◽  
Ziliang Li

This article proposes an enhanced handover scheme of Proxy Mobile IPv6 (PMIPv6) which can avoid duplication authentication. In traditional handover scheme, a Mobile Node (MN) needs an authentication procedure by AAA (Authentication, Authorization and Accounting) server while it enters a PMIPv6 domain. However, when an MN moves to a new subnet in the same domain, it still needs another authentication procedure, which would increase handover latency. In the proposed scheme, an MN only needs to be authenticated once while it enters a PMIPv6 domain, and a Mobile Access Gateway (MAG) that an MN is attached to will send the authentication information to the New MAG (NMAG) which MN will access to before the MN's handover. So that MN can skip the second authentication. The authors build a test-bed and have done some tests. Result shows that this scheme has got improvement in decreasing handover latency.


Author(s):  
Xuesong Zhou ◽  
Xiao Qin ◽  
Hani S. Mahmassani

A dynamic origin–destination demand estimation model for planning applications with real-time link counts from multiple days is presented. Based on an iterative bilevel estimation framework, the upper-level problem is to minimize both the deviation between estimated link flows and real-time link counts and the deviation between estimated time-dependent demand and given historical static demand. These two types of deviations are combined into a weighted objective function, where the weighting value is determined by an interactive approach to obtain the best compromise solution. The single-day formulation is further extended to use link counts from multiple days to estimate the variation in traffic demand over multiple days. A case study based on the Irvine test bed network is conducted to illustrate the methodology and estimate day-to-day demand patterns. The application illustrates considerable benefits in analyzing the demand dynamics with multiday data.


Sign in / Sign up

Export Citation Format

Share Document