HMNR Scheme Based Dynamic Route Optimization to Support Network Mobility of Mobile Network

Author(s):  
Moon-Sang Jeong ◽  
Jong-Tae Park ◽  
Yeong-Hun Cho
Author(s):  
Arun Prakash ◽  
Rajesh Verma ◽  
Rajeev Tripathi ◽  
Kshirasagar Naik

Network mobility (NEMO) route optimization support is strongly demanded in next generation networks; without route optimization the mobile network (e.g., a vehicle) tunnels all traffic to its Home Agent (HA). The mobility may cause the HA to be geographically distant from the mobile network, and the tunneling causes increased delay and overhead in the network. It becomes peculiar in the event of nesting of mobile networks due to pinball routing, for example, a Personal Area Network (PAN) inside a vehicle. The authors propose an Extended Mobile IPv6 route optimization (EMIP) scheme to enhance the performance of nested mobile networks in local and global mobility domain. The EMIP scheme is based on MIPv6 route optimization and the root Mobile Router (MR) performs all the route optimization tasks on behalf of all active Mobile Network Nodes (MNNs). Thus, the network movement remains transparent to sub MRs and MNNs and modifies only MRs and MNNs leaving other entities untouched and is more efficient than the Network Mobility Basic Support protocol (NEMO BS). The authors carried out an extensive simulation study to evaluate the performance of EMIP.


2015 ◽  
Vol 2015 ◽  
pp. 1-14
Author(s):  
Ananthi Jebaseeli Samuelraj ◽  
Sundararajan Jayapal

Proxy Mobile IPV6 (PMIPV6) is a network based mobility management protocol which supports node’s mobility without the contribution from the respective mobile node. PMIPV6 is initially designed to support individual node mobility and it should be enhanced to support mobile network movement. NEMO-BSP is an existing protocol to support network mobility (NEMO) in PMIPV6 network. Due to the underlying differences in basic protocols, NEMO-BSP cannot be directly applied to PMIPV6 network. Mobility management signaling and data structures used for individual node’s mobility should be modified to support group nodes’ mobility management efficiently. Though a lot of research work is in progress to implement mobile network movement in PMIPV6, it is not yet standardized and each suffers with different shortcomings. This research work proposes modifications in NEMO-BSP and PMIPV6 to achieve NEMO support in PMIPV6. It mainly concentrates on optimizing the number and size of mobility signaling exchanged while mobile network or mobile network node changes its access point.


2018 ◽  
Vol 7 (3.20) ◽  
pp. 422
Author(s):  
Amer Sami Hasan ◽  
Zaid Hashim Jaber

Network mobility (NEMO) is an important requirement for internet networks to reach the goal of ubiquitous connectivity. With NEMO basic support protocols, correspondent entities suffer from a number of limitations and problems that prevent route-optimization procedures to be established between the correspondent nodes and mobile network nodes associated with NEMO. The goal is to alleviate the signaling load and execute the route-optimization steps on behalf of the correspondent entities that are not sophisticated enough to support route optimization. This paper introduces a new architecture that uses firewall as a new entity with new mobility filtering rules and acts as root certificate server supporting PKI infrastructure. The PKI-firewall executes the route-optimization procedure on behalf of these correspondent entities depends on CA distributed to its mobile end nodes. User entities is reachable via optimized path approved by mobile node or user CA As a result of completing the above procedure, performance degradation will be reduced, especially when signaling storm occurs; applying these modifications will increase the security, availability and scalability of NEMO optimization and enable wider NEMO deployment. An analytical model is used to validate the new proposed framework and understand the behavior of this framework under different network scenarios. 


Author(s):  
Arun Prakash ◽  
Rajesh Verma ◽  
Rajeev Tripathi ◽  
Kshirasagar Naik

Network mobility (NEMO) route optimization support is strongly demanded in next generation networks; without route optimization the mobile network (e.g., a vehicle) tunnels all traffic to its Home Agent (HA). The mobility may cause the HA to be geographically distant from the mobile network, and the tunneling causes increased delay and overhead in the network. It becomes peculiar in the event of nesting of mobile networks due to pinball routing, for example, a Personal Area Network (PAN) inside a vehicle. The authors propose an Extended Mobile IPv6 route optimization (EMIP) scheme to enhance the performance of nested mobile networks in local and global mobility domain. The EMIP scheme is based on MIPv6 route optimization and the root Mobile Router (MR) performs all the route optimization tasks on behalf of all active Mobile Network Nodes (MNNs). Thus, the network movement remains transparent to sub MRs and MNNs and modifies only MRs and MNNs leaving other entities untouched and is more efficient than the Network Mobility Basic Support protocol (NEMO BS). The authors carried out an extensive simulation study to evaluate the performance of EMIP.


2013 ◽  
Vol 2013 ◽  
pp. 1-9
Author(s):  
Pei-Yu Chen ◽  
Frank Yeong-Sung Lin

With more and more mobile device users, an increasingly important and critical issue is how to efficiently evaluate mobile network survivability. In this paper, a novel metric called Average Degree of Disconnectivity (Average DOD) is proposed, in which the concept of probability is calculated by the contest success function. The DOD metric is used to evaluate the damage degree of the network, where the larger the value of the Average DOD, the more the damage degree of the network. A multiround network attack-defense scenario as a mathematical model is used to support network operators to predict all the strategies both cyber attacker and network defender would likely take. In addition, the Average DOD would be used to evaluate the damage degree of the network. In each round, the attacker could use the attack resources to launch attacks on the nodes of the target network. Meanwhile, the network defender could reallocate its existing resources to recover compromised nodes and allocate defense resources to protect the survival nodes of the network. In the approach to solving this problem, the “gradient method” and “game theory” are adopted to find the optimal resource allocation strategies for both the cyber attacker and mobile network defender.


Sign in / Sign up

Export Citation Format

Share Document