Route Optimization Technique for Nested Mobile Networks

Abstract

Network Mobility (NEMO) is becoming an important requirement for today's and tomorrow's IP networks. NEMO can give us internet connectivity while on the move. NEMO Basic Support Protocol (BSP) has been proposed by Internet Engineering Task Force (IETF) in order to address the need of mobile networks. But NEMO BSP has some limitations like inefficient route, high latency during handoff and packet delay. Recent research on NEMO is mostly concentrated on addressing the issue of inefficient routing which is more critical in nested mobile networks. In a simple scenario multiple mobile networks join in a hierarchical way with multiple mobile routers and one Top Level Mobile Router. In nested mobile networks NEMO BSP also exhibits pinball routing problem. One of the features of NEMO BSP is that it maintains the location privacy of the mobile network node. Most of the schemes that propose route optimization compromise this feature of NEMO BSP as discussed in RFC 4889. To solve this we propose a scheme of route optimization with location privacy (ROLP) in nested mobile networks. Proposed scheme achieves better throughput, and reduction in End-to-End Delay as compared to NEMO BSP. We have simulated the proposed scheme in NS2. We calculated the confidence interval, throughput and End-to-End delay in NS2 simulations.