No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
A new route optimization scheme for network mobility: Combining ORC protocol with RRH and using quota mechanism
Abstract
Network mobility (NEMO) based on mobile IP version 6 has been proposed for networks that move as a whole. Route optimization is one of the most important topics in the field of NEMO. The current NEMO basic support protocol defines only the basic working mode for NEMO, and the route optimization problem is not mentioned. Some optimization schemes have been proposed in recent years, but they have limitations. A new NEMO route optimization scheme — involving a combination of the optimized route cache protocol (ORC) and reverse routing header (RRH) and the use of a quota mechanism for optimized sessions (OwR) — is proposed. This scheme focuses on balanced performance in different aspects. It combines the ORC and RRH schemes, and some improvements are made in the session selection mechanism to avoid blindness during route optimization. Simulation results for OwR show great similarity with those for ORC and RRH. Generally speaking, the OwR's performance is at least as good as that of the RRH, and besides, the OwR scheme is capable of setting up optimal routing for a certain number of sessions, so the performance can be improved and the cost of optimal routing in nested NEMO can be decreased.
... Route optimization scheme in [11] provides two types of nodes: CRs (Corresponding Routers) and OLFNs (Optimization-capable Local Fixed Nodes). Since CR node is unavailable in the network always, this scheme may not be able to handle route optimization. ...
... For ROTIO, routing cost (CROTIO) can be calculated as follows: CROTIO = ci + C1 + CN (10) Lastly, routing cost in the proposed scheme (CProposed) can be measured as follows: CProposed = ci + CN (11) As shown in above equations, for large number of nesting level, the routing cost for bidirectional tunneling increases linearly. However, as shown in Figure 5, for ROTIO and the proposed scheme, the routing cost remains constant because there will always be 2level of tunneling (for ROTIO) and 1-level of tunneling (for proposed scheme) regardless the degree of nesting. ...
... The MR must prove that it is the true router of the Mobile Network Prefix through this procedure. [12] proposes an extension to the procedure, but [13] finds a potential risk in this extension and further improves it as follows (see Figure 4 ...
... The security of the above procedure is proved in [13], and the signaling security limitation of the CR mechanism can be resolved with this improved " Return Rou- Mobile Node HA CN ① ② ③ ④ ① Home Test Init message ② Home Test message ③ Care-of Test Init message ④ ...
The future aeronautical network will be based on IPv6 and the services over the aeronautical network will be classified into 3 domains: Air Traffic Services (ATS), Airline Operational Services (AOS) and Passenger Information and Entertainment Services (PIES), among which the ATS and AOS domains are important for aircraft safety and airline business operation. Some schemes have been proposed to provide IP mobility support for aeronautical network, and Network Mobility (NEMO) scheme is the most promising one. However, using NEMO technology will lead to sub-optimal routing, so route optimization technology is highly desired for NEMO. A route optimization scheme is proposed for the ATS and AOS domains, which introduces the Correspondent Routers to realize the optimal routing and employs an improved procedure to reduce the handoff delay. The route optimization for the PIES domain is also discussed to provide better performance for some special scenarios.
... Route optimization scheme in [14] provides two types of nodes: CRs (Corresponding Routers) and OLFNs (Optimization-capable Local Fixed Nodes). Since CR node is unavailable in the network always, this scheme may not be able to handle route optimization. ...
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 throughput, delay, response time, and traffic, and achieves optimal routing
... An unrelated but equally interesting protocol is the Optimized Route Cache (ORC) protocol, which is used to provide a sense of mobile transparency by maintaining the route that the entire network takes. A hybrid scheme called OwR that combines the ORC protocol with the Reverse Routing Header protocol (RRH) is proposed in [4]. With a few modifications, the OwR is shown to be stable and at least as effective as the RRH alone. ...
Mobile IPv6 based Mobile Networks are becoming increasingly important with the widespread popularity of wireless internet connectivity. For large networks, an extension, namely, the Hierarchical Mobile IPv6 is used, which suffers from overloading of the Home Agent as every packet sent has to pass through it and this produces a significant loss in performance. In this paper, a method to improve the mobility using the fast handover of Mobile IPv6 (FMIPv6) and the Reverse Routing Header Protocol is proposed. Simulation results at different packet intervals show that, the proposed scheme is able to reduce the average delay and achieve an optimum level of throughput.
... Given the high cost of data collection, different means to achieve a costefficient process must be created. Optimizing the route planning and selection can result in cost savings such as those obtained in other areas of specialties i.e. parcels deliveries (Pajunas et al. 2007), waste management collection services (Ladanyi 2011;Lim 2010;Sahoo et al. 2005), transportations logistics (Feng et al. 2010;Haughton 2002) and network mobility (Kong et al. 2012;Mosa et al. 2012). Research related to PMS has focused on how to select the appropriate pavement assessment technology to minimize cost (Bennet 2008), but in the area of pavement data collection logistics, research is limited. ...
Transportation agencies across the world have been implementing different types of Pavement Management Systems (PMS) to facilitate pavement management and maintenance. Obtaining the necessary information in a manual pavement distress data collection process is costly and time-consuming. Research on the data collection of pavement conditions has focused mainly on evaluating the quality of the data collected, and there is limited research on ways to improve the efficiency of the data collection process (e.g., selection of optimized routes for collecting data). In this study, Geographical Information Systems (GIS) and Agent-Based Modeling (ABM), using swarm intelligence, are integrated to optimize decision-making processes for optimal routing selection in manual data collection process. The GIS platform provides the road spatial database containing the pavement sections that will be evaluated. Ant Colony Optimization (ACO) was selected as the algorithm to optimize the decision-making process of pavement evaluation crews (agents) during the pavement distress data collection process. Both the GIS and ABM models are developed using available data from the manual pavement distress data collection process in summer 2012 for the State of New Mexico. The results of this research will improve the understanding of route selection for pavement data collection.
... Like ROTIO (Hosik et al., 2006), none of these route optimization schemes can remove the tunnel completely. Route optimization scheme in Kong et al. (2012) uses two kinds of nodes: corresponding routers (CRs) and optimization-capable local fixed nodes (OLFNs). However, route optimization is not sometime possible in this scheme due to the unavailability of CR node in the network. ...
Network mobility (NEMO) basic support protocol maintains the connectivity when mobile router (MR) of a mobile network changes its point of attachment to the Internet by establishing a bi-directional tunnel between the MR and the home agent (HA). A packet from a correspondent node (CN) traverses through the tunnel to reach the mobile network. Nesting occurs in NEMO when a MR's new attachment point is in another mobile network that has also moved away from its home link. The level of tunneling increases as the level of nesting increases. Multiple levels of tunneling in nested NEMO adds multiple legs to a non-optimized routing path that the IP packets have to traverse in order to reach the final destination. As per our study, an efficient route optimization technique in NEMO, particularly in nested NEMO, is still a research challenge. In this paper, we propose an efficient route optimization scheme for nested NEMO. We use two care-of Addresses for each MR, as well as two types of entries, such as fixed and visiting, in the routing table in each MR. Our route optimization scheme removes the tunnels completely from the nested NEMO in a single step using only one binding update message irrespective of the number of levels in the nest. Our route optimization scheme also works for non-nested NEMO.
For fast handoff protocol to succeed in nested NEMO, acquisition of new care-of-address, and exchange of signaling packets for handoff must be done with minimum delay. New care-of-address can be obtained using anticipation but signaling packets must also pass through minimum number of tunnels. These challenges creates far more complex scenario than a simple NEMO and node mobility. In this paper, we propose Fast Handoff with End-to-end Route Optimization (FHE2ERO) protocol for nested mobility that meets these requirements. FHE2ERO improves previous work on route optimization by combining the handoff and route optimization process and performing L2 and the L3 handoff in parallel, thereby, significantly reducing the number of signaling packets and hence the handoff delay. Numerical analysis shows that FHE2ERO reduces both handoff delay and packet loss duration and achieves zero packet loss during successful anticipation.
The network mobility basic support (NEMO BS) protocol has been investigated to provide Internet connectivity for a group of nodes, which is suitable for intelligent transportation systems (ITS) applications. NEMO BS often increases the traffic load and handover latency because it is designed on the basis of mobile Internet protocol version 6 (MIPv6). Therefore, schemes combining proxy MIPv6 with NEMO (P-NEMO) have emerged to solve these problems. However, these schemes still suffer from packet loss and long handover latency during handover. Fast P-NEMO (FP-NEMO) has emerged to prevent these problems. Although the FP-NEMO accelerates handover, it can cause a serious tunneling burden between the mobile access gateways (MAGs) during handover. This problem becomes more critical as the traffic between the MAGs increases. Therefore, we propose a scheme for designing an improved FP-NEMO (IFP-NEMO) to eliminate the tunneling burden by registering a new address in advance. When the registration is completed before the layer 2 handover, the packets are forwarded to the new MAG directly and thereby the IFP-NEMO avoids the use of the tunnel between the MAGs during handover. For the evaluation of the performance of the IFP-NEMO compared with the FP-NEMO, we develop an analytical framework for fast handovers on the basis of P-NEMO. Finally, we demonstrate that the IFP-NEMO outperforms the FP-NEMO through numerical results.
Network mobility, i.e. Internet access services for a moving network as a single unit brings about new challenging issues. A nested mobile network is a hierarchical form of multiple mobile networks. Nested mobile networks suffer from a pin-ball routing problem. This problem becomes more serious in the case of a communication between any two nodes in the same nested mobile network. To solve this sub-optimality, we propose a nested NEMO route optimization (NNRO) protocol to retain the mobility transparency as the NEMO basic support protocol and to reduce the communication cost of any two nodes in a nested mobile network. The re-sults of simulation reveal that the proposed NNRO protocol efficiently supports communication within a nested mobile network.
Among the schemes, proposed in the literature to solve the route optimization problem in NEtwork Mobility (NEMO), the prefix delegation-based schemes perform better than other schemes. Depending on the way the prefix are delegated, the prefix delegation-based schemes result in difference in performance under different speed at various distance from the home network (network to which mobile network usually belongs). Therefore, there is a need to evaluate the performance of individual prefix delegation-based scheme to find an appropriate scheme based on speed and distance from home network. In this paper, we identify the differences of the prefix delegation-based schemes using simulation. Results reveal that performance of the schemes depends on speed of the network and distance from home network.
An important requirement for Internet protocol (IP) networks to achieve the aim of ubiquitous connectivity is network mobility (NEMO). With NEMO support we can provide Internet access from mobile platforms, such as public transportation ve- hicles, to normal nodes that do not need to implement any spe- cial mobility protocol. The NEMO basic support protocol has been proposed in the IETF as a first solution to this problem, but this solution has severe performance limitations. This paper presents MIRON: Mobile IPv6 route optimization for NEMO, an approach to the problem of NEMO support that overcomes the limitations of the basic solution by combining two different modes of opera- tion: a Proxy-MR and an address delegation with built-in routing mechanisms. This paper describes the design and rationale of the solution, with an experimental validation and performance evalu- ation based on an implementation. Index Terms—Computer network performance, mobile commu- nication, mobile IPv6 (MIPv6), mobile router (MR), network mo- bility (NEMO), route optimization (RO).
Mobile IP is the basic solution to provide host mobility, whereas network mobility refers to the concept of collective mobility of a set of nodes. In the simplest scenario, a mobile network moves as a single unit with one mobile router (MR) that connects it to the global Internet. Also, multiple mobile networks can be nested in a hierarchical form, e.g., a wireless personal area network (PAN) in a vehicular network. In a nested mobile network, multiple MRs form a tree hierarchy in which the root MR is called the top-level mobile router (TLMR). Nested mobile networks exhibit the pinball routing problem, which becomes worse in proportion to the number of nested levels in the hierarchy. To solve this problem, we propose a routing optimization scheme using a tree information option (ROTIO) that extends the NEMO basic support protocol. In the ROTIO scheme, each MR in the nested mobile network sends two binding updates (BUs): one to its home agent and the other to the TLMR. The former BU contains the TLMR's home address, while the latter contains routing information between the issuing MR and the TLMR. This alleviates the pinball routing problem significantly. Now, a packet from a correspondent node only needs to visit two transit nodes (the home agents of the MR and the TLMR), regardless of the degree of nesting. Moreover, the ROTIO scheme provides location privacy and mobility transparency. We also extend ROTIO to perform routing between two mobile network nodes inside the same nested mobile network more efficiently and to substantially reduce the disruption when a mobile network hands off
IP version 6 #IPv6# is being designed within the IETF as a replacement for the currentversion of the IP protocol used in the Internet #IPv4#. Wehave designed protocol enhancements for IPv6, known as Mobile IPv6, that allow transparent routing of IPv6 packets to mobile nodes, taking advantage of the opportunities made possible by the design of a new version of IP.InMobile IPv6, each mobile node is always identi#ed by its home address, regardless of its current point of attachment to the Internet. While away from its home IP subnet, a mobile node is also associated with a careof address, which indicates the mobile node's current location. Mobile IPv6 enables any IPv6 node to learn and cache the care-of address associated with a mobile node's home address, and then to send packets destined for the mobile node directly to it at this care-of address using an IPv6 Routing header.
Return routability procedure is adopted for performance and security purpose in mobile IPv6. RFC 3963 proposes the network mobility support for mobile IPv6, but doesn't give any route optimization scheme. Many optimization schemes are proposed, and correspondingly, RRNP scheme is proposed to improve the return routability procedure. This paper analyses the potential risk of RRNP and proposes a further improved scheme based on RRNP
This document shows how to route optimization by using bi-directional tunnel between home agent and top level mobile router. A packet will be transmitted directly from the home link of the mobile node to top level mobile router of the correspondent node through this tunnel.
Network mobility is based on mobile IPv6, and there isnpsilat appropriate simulation tool in this area. NS2 is a popular software for network simulation, and a patch named ldquoMobiwanrdquo has been published for NS2 so that mobile IPv6 can be simulated. Based on NS2 and Mobiwan, an extension scheme for network mobility simulation is proposed. Some problems of the scheme are analyzed, and some key technologies for these problems are presented. The validity of the extensions is tested and proved.
This paper specifies a mechanism for enabling mobile nodes in IPv6 mobile networks to perform route optimization. The route optimization is possible because the mobile router provides the prefix of its care-of address for its mobile nodes by playing the role of ND-proxy. Through binding updates associated with the network prefix of an access network, the mobile nodes can perform route optimization.
This paper presents the mechanism which allows mobile nodes in mobile network to perform route optimization. The mechanism is based on the prefix delegation protocol which is an address autoconfiguration technique on router. Mobile router gets a prefix from an access router using prefix delegation protocol and advertises the delegated prefix to its subnet. Each mobile node makes its care-of address from the prefix and performs binding update. It allows the mobile nodes to communicate with correspondent nodes directly by pass ingress filtering. In this paper, we define a new IPv6 neighbor discovery option to advertise the delegated prefix and extend a mobile node operation to process the new option.
In this paper, we describe the Optimized Route Cache Management Protocol (ORC) as a network mobility protocol and evaluated it through experiments on a prototype implementation. ORC provides mobility transparency to a network regardless of network movements. Mobile network is a network that moves entirely. Typical examples for a mobile network are personal area networks (PAN) and networks inside vehicles. ORC is based on mobile IPv6 and is combined with the Internet routing mechanisms for network mobility management. ORC assigns a unique unchanging subnet prefix to a mobile network and notifies and maintains a mobile network's route called binding route (BR). A BR is an association between the prefix of the mobile network and a current available address known as care-of address in mobile IPv6. ORC allows interior gateway protocol (IGP) routers named ORC routers to cache a BR. ORC routers intercept packets destined to the mobile network and route them to the mobile network according to the BR. The BR must be updated as soon as the mobile network changes the care-of address by its topological position, employing constant BR exchange to ORC routers and temporary BR exchange to dynamically discovered ORC routers. Based on the experimental results, ORC is confirmed to provide network mobility and optimal communication in terms of route optimization. The evaluation shows that route optimization is required for network mobility to improve communication performance.
Mobile network prefix delegation
- P Thubert
- T J Kniveton
P. Thubert and T. J. Kniveton, " Mobile network prefix delegation, " draft-ietf-nemo-prefix-delegation-02.txt, Aug. 2007.
Extending return routability procedure for network prefix (RRNP)
- C Ng
- J Hirano
C. Ng and J. Hirano, " Extending return routability procedure for network prefix (RRNP), " draft-ng-nemo-rrnp-00, Oct. 2004.
Extensions to mobiwan according to RFC 3775 based on NS2
- R Kong
- H Zhou
R. Kong and H. Zhou, " Extensions to mobiwan according to RFC 3775 based on NS2, " in Proc. ISCST, May 2007, pp. 998–1001.
Design and experimental evaluation of a route optimization solution for NEMO
- M Calderon
- C J Bemardos
- M Bagnulo
- I Soto
- A De
- Oliva