Extended Mobile IPv6 Route Optimization for Mobile Networks in Local and Global Mobility Domain

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.

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.


Author(s):  
Shayma Senan ◽  
Aisha Hassan A. Hashim

<p>As a demand of accessing Internet is increasing dramatically, host mobility becomes insufficient to fulfill these requirements. However, to overcome this limitation, network mobility has been introduced. One of its implementation is NEMO Basic Support protocol which is proposed by Internet Engineering Task Force (IETF). In NEMO, one or more Mobile Router(s) manages the mobility of the network in a way that its nodes would be unaware of their movement. Although, it provides several advantages, it lacks many drawbacks in term of route optimization especially when multiple nested mobile networks are formed. This paper presents a new hierarchical route optimization scheme for nested mobile networks using Advanced Binding Update List (BUL+), which is called HRO-B+. From performance evaluation, it shows that this scheme performs better in terms of throughp<em>ut, delay, response time, and traffic, and achieves optimal routing.</em></p>


Author(s):  
Sulata Mitra

This chapter develops the concept of route optimization in a multi-homed mobile network. In a future wireless network a user may have multiple mobile devices, each having multiple network interfaces and needing interconnection with each other as well as with other networks to form a mobile network. Such mobile networks may be multi-homed i.e. having multiple points of attachment to the Internet. It forwards packets of mobile network nodes inside it to Internet using suitable routes. But there may be multiple routes in a mobile network for forwarding packets of mobile network node. Moreover, the mobile network nodes inside a mobile network may have packets of different service types. So the optimal route selection inside a mobile network depending upon the service type of mobile network node is an important research issue. Two different route optimization schemes to create point to point network among mobile network nodes are elaborated in this chapter. This chapter is aimed at the researchers and the policy makers making them aware of the different means of efficient route selection in a multi-homed mobile network as well as understanding the problem areas that need further vigorous research.


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. 


2014 ◽  
Vol 31 (2) ◽  
pp. 127-148
Author(s):  
Ing-Chau Chang ◽  
Ciou-Song Lu ◽  
Sheng-Chih Wang

Purpose – In the past, by adopting the handover prediction concept of the fast mobile IPv6, the authors have proposed a cross-layer architecture, which was called the proactive fast HCoP-B (FHCoP-B), to trigger layer 3 HCoP-B route optimization flow by 802.11 and 802.16 link events before the actual layer 2 handover of a mobile subnet in the nested mobile network (NEMO) occurs. In this way, proactive FHCoP-B has shortened its handover latency and packet loss. However, there are two scenarios where proactive FHCoP-B cannot normally complete its operations due to fast movements of the NEMO during handover. The paper aims to discuss these issues. Design/methodology/approach – In this paper, the authors will propose efficient reactive FHCoP-B flows for these two scenarios to support fast and seamless handovers. The authors will further extend the analytical model proposed for mobile IPv6 to investigate four performance metrics of proactive and reactive FHCoP-B, HCoP-B and two well-known NEMO schemes with the radio link protocol (RLP), which can detect packet losses and performs retransmissions over the error-prone wireless link. Findings – Through intensive simulations, the authors conclude that FHCoP-B outperforms HCoP-B and the other two well-known NEMO schemes by achieving the shortest handover latencies, the smallest number of packet losses and the fewest playback interruption time during handover only with few extra buffer spaces, even over error-prone wireless links of the nested NEMO. Originality/value – This paper has three major contributions, which are rare in the NEMO literature. First, the proactive FHCoP-B has been enhanced as the reactive one to handle two fast handover scenarios with RLP for the nested NEMO. Second, the reactive FHCoP-B supports seamless reactive handover for the nested NEMO over error-prone wireless links. Third, mathematical performance analyses for two scenarios of reactive FHCoP-B with RLP over error-prone wireless links have been conducted.


Author(s):  
Isac Gnanaraj J ◽  
Sriram .

One of emerging trends in the mobile network era is Network Mobility (NEMO). It was standardized by the Internet Engineering Task Force (IETF) and gained attention of the researchers because of research opportunities that it provides. Though it was developed based on MIPv6, there are few spots that must be analyzed and rectified, especially in the security aspects. According to the literatures, NEMO lacks in providing a robust Authentication, Authorization and Accounting (AAA) services to its users. AAA operations must be performed for all the players of the mobile network, because a hacker may reside at any place and try to access the mobile network by hiding behind valid or genuine nodes’ addresses. This research work aims to provide an AAA framework for NEMO by comprising three different mechanisms which are developed for Local Mobile Node (LMN), Visiting Mobile Node (VMN) and Mobile Router (MR). Simulation and performance analysis are done.


2020 ◽  
pp. 1-16
Author(s):  
Sarra Mehamel ◽  
Samia Bouzefrane ◽  
Soumya Banarjee ◽  
Mehammed Daoui ◽  
Valentina E. Balas

Caching contents at the edge of mobile networks is an efficient mechanism that can alleviate the backhaul links load and reduce the transmission delay. For this purpose, choosing an adequate caching strategy becomes an important issue. Recently, the tremendous growth of Mobile Edge Computing (MEC) empowers the edge network nodes with more computation capabilities and storage capabilities, allowing the execution of resource-intensive tasks within the mobile network edges such as running artificial intelligence (AI) algorithms. Exploiting users context information intelligently makes it possible to design an intelligent context-aware mobile edge caching. To maximize the caching performance, the suitable methodology is to consider both context awareness and intelligence so that the caching strategy is aware of the environment while caching the appropriate content by making the right decision. Inspired by the success of reinforcement learning (RL) that uses agents to deal with decision making problems, we present a modified reinforcement learning (mRL) to cache contents in the network edges. Our proposed solution aims to maximize the cache hit rate and requires a multi awareness of the influencing factors on cache performance. The modified RL differs from other RL algorithms in the learning rate that uses the method of stochastic gradient decent (SGD) beside taking advantage of learning using the optimal caching decision obtained from fuzzy rules.


Sign in / Sign up

Export Citation Format

Share Document