―A P2P Based Route Optimization Architecture for Mobile IP Based on Simulation Work‖

(1)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459,ISO 9001:2008 Certified Journal, Volume 3, Issue 2, February 2013)

181

―A P2P Based Route Optimization Architecture for Mobile IP

Based on Simulation Work‖

Prof. Ramesh Bharti

1

, Vishnu Kumar Sharma

2

, Navneet

3

, Aman Gupta

4

1

Head of Department (ECE) Jagannath University, Jaipur, Raj. India.

2,3,4_{M.Tech Scholar, Jagannath University, Jaipur, India.}

Abstract - Wireless technologies are rapidly increasing and users are demanding more and more possibility to change their position with respect to the internet without breaking the signal. These services can be achieved by using Mobile IP or NEMO. In mobile IP, HA (Home Agent) and FA (Foreign Agent) concepts is used. HA is responsible for data delivery and due to this, infrastructure load is very high at HA. And with the help of Home agents the route they select are not optimal and the delay time is high to route the packet to its peer mobile nodes.

In this Paper, a peer to peer architecture is used which allow the multiple home agent concept throughout the internet. With the help of this architecture ,a mobile node or a community network will choose the closer HA to route the packet and in result it will reduce the delay and optimize the route between HA and mobile nodes .

To solve the problem of route optimization, it has attracted the attention of different research community and for this different solution has been proposed to solve the route optimization in Mobile IP. To solve this route optimization problem, multiple Home Agent (HA) concepts is deploying in different ASes (Autonomous System). For this a mobile node will choose the best HA (Home Agent) according to its topological position and in result it will choose the optimal path and by reducing the communication delay of the path towards its peers.

The main challenge in this solution is to signaling the location of different HAs throughout the internet. The main advantage of this architecture over the existing ones is that it is scalable. Due to the mobility network, security is major concerns so authentication between HA and Mobile nodes is compulsory.

Keywords-- NS2, Mobile IP, NEMO, P2P Optimization

I. INTRODUCTION

In today’s scenario, wireless technology played an important role and rapidly evolved in recent years. In wireless technology, IEEE 802.11 is used and it provides 54Mbps of bandwidth which is easily used in affordable way. IETF (Internet Engineering Task Force) designed Mobile IP because in current internet status a user cannot move from one place to another place without breaking the IP communication i.e. they cannot change the access router. So in result IETF designed Mobile IP for the mobility to the internet.

In general, a Mobile node has two IP addresses i.e. HoA (Home address) and CoA (Care of address). The first HoA identifies the identity of the mobile node and second address specifies the current location of the Mobile node. A Mobile node is always reachable by it HoA but it always changes the CoA in respect with the movement of the mobile node. In the home network of mobile node a special entity called as Home Agent which is placed at the Mobile node’s (MN) home network and this Home Agent plays an important role in binding MN’s HoA and CoA address.

But in current Mobile IP scenario there are many limitations and these limitations are- whenever a MN wants to send data packets to its peer node then it will send only through its Home Agent. So in result, it will become the bottleneck for the whole system. But when packets are routed through the specific HA it follows the sub-optimal path and in result it reduces the communication performance, increases the delay and infrastructure load. A single HA (Home Agent) is serving several MN’s connection and serving many MN’s that will cause to the failure of HA and becomes bottleneck for the whole system. Mobile IPv6 easily solves the problem of route optimization by allowing several MN’s to communicate with their peers directly by exploiting special IPv6 headers. The different version of NEMO protocol i.e. v4 and v6 which mainly provides mobility to network rather than the node and it doesn’t support route optimization concept even in IPv6. In result, route optimization issue is an important task to carry out in the current internet status i.e. in IPv4 and even in IPv6.

(2)

International Journal of Emerging Technology and Advanced Engineering

182

The external interface equipped with long range wireless interface that is intended to attach to the internet and the internal interface provides connectivity to the internal nodes of the community networks.

To solve the problem of route optimization, it has attracted the attention of different research community and for this different solution has been proposed to solve the route optimization in Mobile IP. To solve this route optimization problem, multiple Home Agent (HA) concepts is deploying in different ASes (Autonomous System). For this a mobile node will choose the best HA (Home Agent) according to its topological position and in result it will

choose the optimal path and by reducing the

communication delay of the path towards its peers. The main challenge in this solution is to signaling the location of different HAs throughout the internet. In some research paper some author uses the exterior border gateway protocol (eBGP) while others uses any cast routing for the signaling of the location of different HAs. But all these solutions are not scalable. These solutions will increase load on the system and become the bottleneck of the whole system.

In this project, a scalable architecture is proposed which will solve the route optimization problem in Mobile IP and in NEMO. In this, an overlay peer to peer network is proposed to signal the location of different HAs. In this, when a MN detects that its current HA is too distant then it will queries its original Home Agent for the closer HA for forwarding the packets. Then the home network will use the BGP (Border Gateway Protocol) information to locate HA that will reduce the delay of the path between the MN and its peers by choosing the HA located in the same AS. In this solution it will allow to deploy multiple HAs at different ASes without hindering the eBGP table. By applying this, HAs are still responsible to forward the data packets of Mobile Nodes. To alleviate their load fHA (flexible Home Agent) concept is proposed. From the networks point of view the registration from a MN to HA will treat as an internal route.

II. IMPLEMENTATION OF SYSTEM

In this Paper, a new architecture has been proposed to solve the routing problem in Mobile IP and NEMO. This architecture mainly consists of different Home Agent (HA) called the flexible HA. These HA are present in different ASes (Autonomous System). The proposed solution allows deploying multiple HAs at different ASes without impacting the exterior BGP global routing table or requiring Any cast routing protocol. Since, still the HAs (Home Agent) are still responsible for forwarding all the MN’s data packets.

In order to improve their load, a proposal has been proposed to deploy flexible HAs i.e. fHA. The main idea behind the fHAs is that a registration from a MN to a HA can be viewed as an internal route from the network’s point of view. That is, when a MN registers a new location into it’s HA, it is actually installing a new route (Home Address -> Care-of Address). And this route will be announced throughout the network using the interior BGP (IBGP) protocol to each of the AS’ Border Routers. Then, the Border Routers are aware of the current location of the MN and will encapsulate and forward any packets addressed to/from the MN directly, just as regular data packets. Hence, MN’s data packets are not forwarded by the HAs but by the Border Routers. It is worth to note that HAs are not necessarily devices designed for routing purpose whereas routers are routing-dedicated devices.

Modelling:

Following are the modules which describe the whole architecture:

 P2P Setup phase

 fHA Discovery phase

 Data packet forwarding phase

P2P Setup phase

This section will describe details how the P2P network is developed. The P2P network is used to store the location of the fHAs (AS number) and their IP addresses. This information is used by MNs to locate a closer fHA according to its topological position. fHAs organize themselves forming a structured P2P overlay. The fP2P– HN is fully flexible and can be deployed using any of the proposed structured P2P schemes. Hence, in this project, it will consider Chord as the P2P scheme; thus, the overlay’s structure is a ring.

In the fP2P–HN, the search key is the AS-key that is computed as hash (AS number). When a new fHA joins the fP2P– HN it chooses an identifier (Peer-ID). In this case, this is the hash (fHA’s IP Address). The fHA’s position in the ring is determined by its Peer-ID, the fHA is placed between the two overlay nodes with the immediately higher and lower Peer-ID to its own id. Each overlay node has direct references to its two neighbors and also to other overlay nodes (crossing the ring) thus making the routing within the fP2P–HN faster. These nodes are named fingers. Each overlay node uses these fingers to create its fP2P–HN routing table.

(3)

International Journal of Emerging Technology and Advanced Engineering

183

Then, it looks for the overlay node with the immediately higher Peer-ID to the AS-key, named successor, and sends to this node the AS-key, its IP address and it’s AS number. The successor stores an entry with all this information.

fHA Discovery phase

In this section it will describe, how a MN can use the fP2P–HN to discover a closer fHA. An MN connected to fHA eventually detects that the RTT to fHA is above a given threshold. Then, it will trigger the process to discover a closer HA. The MN sends to its Original fHA a special BU (Binding Update) message to the IP address of a closer fHA. Then, the original fHA discovers (using BGP information) the AS number associated to the MN’s CoA. After this, it will obtain the AS-key by computing the hash (AS number).

The search method will be carried out in the following ways. The original fHA sends a query with the AS-key. The search query is routed in the overlay towards the AS-key’s. This fHA is responsible of storing the information regarding the AS-key. Thus, it stores the IP addresses of all the fHAs located in the AS where the MN is currently attached. Then, fHA sends these IP addresses to the Original fHA which in turn forwards them to the MN. Finally, the MN selects one of them and sends a special BU message to the new fHA in order to obtain a new HoA.

Data packet forwarding phase

In this section, it will define that how an MN’s data packets are forwarded. If the MN is connected to the fHA’s autonomous system (AS), then it follow the same procedure as just in Mobile IP or in NEMO. But when the MN is attached to the foreign AS, then the MN should forward the packets through it’s HA. However, when the HA is an fHA, the MN encapsulate its data packets towards the BRs. Since the fHA has previously configured a new tunnel (Home Address\32 Tunnel) in the BRs, packets sent by the MNs are automatically de-capsulated and forwarded towards the packet’s destination address (the MN’s peer address). If the exit point of the MN’s peer address is another BR, then the packet traverses the network as a transit packet. When the packets addressed towards the MN’s HoA then, they will reach the fHA’s AS. The BRs have learned the location (CoA) of the MN through IBGP and will automatically encapsulate and forward the packet directly towards the MN.

III. PROGRAMMING TECHNIQUE

For programming technique, TCL language is used to implement the architecture.

This TCL is used in NS2 simulator for the simulation of the project. And NS2 will mainly works on Linux environment.

Linux Operating System

In simplest way we can say that Linux is an operating system. It is the software on a computer that enables applications and the computer operator to access the devices on the computer to perform desired functions. The operating system (OS) relays instructions from an application to, for instance, the computer's processor. The processor performs the instructed task, and then sends the results back to the application via the operating system. Explained in these terms, Linux is very similar to other operating systems, such as Windows and OS X. But something sets Linux apart from these operating systems. The Linux operating system represented a $25 billion ecosystem in 2008. Since its inception in 1991, Linux has grown to become a force in computing, powering everything from the New York Stock Exchange to mobile phones to supercomputers to consumer devices.

The development of Linux is one of the most prominent examples of free and open source software collaboration: the underlying source code may be used, modified, and

distributed—commercially or non-commercially—by

anyone under licenses such as the GNU General Public License. Typically Linux is packaged in a format known as a Linux distribution for desktop and server use. Some popular mainstream Linux distributions include Debian (and its derivatives such as Ubuntu), Fedora and opens USE. Linux distributions include the Linux kernel, supporting utilities and libraries and usually a large amount of application software to fulfill the distribution's intended use.

(4)

International Journal of Emerging Technology and Advanced Engineering

184

Current Development

Towards continues to direct the development of the kernel. Stallman heads the Free Software Foundation, which in turn supports the GNU components. Finally, individuals and corporations develop third-party non-GNU components. These third-party components comprise a vast body of work and may include both kernel modules and user applications and libraries. Linux vendors and communities combine and distribute the kernel, GNU components, and non-GNU components, with additional package management software in the form of Linux distributions. A Linux-based system is a modular Unix-like operating system. It derives much of its basic design from principles established in Unix during the 1970s and 1980s. Such a system uses a monolithic kernel, the Linux kernel, which handles process control, networking, and peripheral and file system access. Device drivers are either integrated directly with the kernel or added as modules loaded while the system is running.

Separate projects that interface with the kernel provide much of the system's higher-level functionality. The GNU user land is an important part of most Linux-based systems, providing the most common implementation of the C library, a popular shell, and many of the common Unix tools which carry out many basic operating system tasks. The graphical user interface (or GUI) used by most Linux systems is built on top of an implementation of the X Window System.

User Interface

Users operate a Linux-based system through a command line interface (CLI), a graphical user interface (GUI), or through controls attached to the associated hardware, which is common for embedded systems. For desktop systems, the default mode is usually a graphical user interface, by which the CLI is available through terminal emulator windows or on a separate virtual console. Most low-level Linux components, including the GNU user land, use the CLI exclusively. The CLI is particularly suited for automation of repetitive or delayed tasks, and provides very simple inter-process communication. A graphical terminal emulator program is often used to access the CLI from a Linux desktop. A Linux system typically implements a CLI by a shell, which is also the traditional way of interacting with a Unix system. A Linux distribution specialized for servers may use the CLI as its only interface.

On desktop systems, the most popular user interfaces are the extensive desktop environments KDE Plasma Desktop, GNOME, and Xfce, though a variety of additional user interfaces exist.

Most popular user interfaces are based on the X Window System, often simply called "X". It provides network transparency and permits a graphical application running on one system to be displayed on another where a user may interact with the application.

Other GUIs may be classified as simple X window managers, such as FVWM, Enlightenment, and Window Maker, which provide a minimalist functionality with respect to the desktop environments. A window manager provides a means to control the placement and appearance of individual application windows, and interacts with the X Window System. The desktop environments include window managers as part of their standard installations (Mutter for GNOME, Kwin for KDE, Xfwm for Xfce as of January 2013) although users may choose to use a different window manager if preferred.

IV. RESULT AND DISCUSSION

In this project, NS2 simulator is used to simulate the results. Here different snapshot shows the result of the project. Following are the results and their brief descriptions.

Network Setup

For this, two mobile nodes are taken, one node; the sender node is the packet forwarding node and other is the node to which we have to forward the data packets. Different HA (Home Agents) are present in different AS (Autonomous System). And each AS has its BGP router. These routers are responsible for forwarding the data packets.

Fig.1 Network setup

In Mobile IP Scenario

(5)

International Journal of Emerging Technology and Advanced Engineering

185

When the correspondent mobile node is in foreign network then it will get the CoA and this CoA will be announced to all BGP routers and by the help of this the sender node will send the packets to CN.

Fig.2 Simple Mobile IP

Registration

In this result, it shows that when the correspondent node moves away from its home network then it will send the BU (Binding Update) message to its original HA for new HA. And after that it will resister with other AS. Now, all the data packets will be sending to its new address called as CoA. This is the new address for correspondent mobile node for its further communication.

Fig.3 registering with new AS

Roaming

Fig.4 Roaming Scenario

Test Cases

Following are the Test cases:



In the first case, it shows the packet delivery rate. It shows at different time instants of packet delivery rate which are displayed in the following graph.

Fig.5 Packet Delivery ratio

(6)

International Journal of Emerging Technology and Advanced Engineering

186

Fig.6 Efficiency of the system

V. CONCLUSIONS

In this project, by proposing the new architecture it will enhance the mobility of the network and NEMO techniques has aided mobile networks, as it has achieved global reachable. On top of that when the pre-registration technique is integrated into NEMO, the results were firstly, the packet loss is reduced, which is one of the major factors to increase the efficiency. Secondly, it has reduced the delay, which is another major factor that decides the network efficiency.

REFERENCES

[1] Chun-Hsin Wu et al., ―Bi-directional route optimization in mobile IP over wireless LAN‖, Vehicular Technology Conference, September, 2002.

[2] G. Huston, ―Commentary on inter-domain routing in the internet‖, RFC 3221, December, 2001.

[3] K. Lua et al, ‖A survey and comparison of peer-to-peer overlay network schemes‖, IEEE Communications Surveys and Tutorials, 2005.

[4] Marcelo Bagnulo et al., ―Scalable Support for Globally Moving Networks‖, ISWCS, 2006.

[5] M. Calderon et al., ―Design and experimental evaluation of a route optimization solution for NEMO‖, IEEE JSAC, 2007.

[6] R. Cuevas, C. Guerrero, A. Cuevas, M. Caldern, C.J. Bernardos, ―P2P based architecture for global home agent dynamic discovery in IPmobility‖, 65th IEEE Vehicular Technology Conference, 2007. [7] R. Wakikawa et al.,‖Virtual mobility control domain for

enhancements of mobility protocols‖, IEEE INFOCOM, 2006 [8] T. Clauser et al,―NEMO route optimization problem statement‖,