Roaming Real-Time Applications - Mobility Services in IPv6 Networks

Emerging mobility standards within the next generation Internet Protocol, IPv6, promise to continuously operate devices roaming between IP networks. Associated with the paradigm of ubiquitous computing and communication, network technology is on the spot to deliver voice and videoconferencing as a standard internet solution. However, current roaming procedures are too slow, to remain seamless for real-time applications. Multicast mobility still waits for a convincing design. This paper investigates the temporal behaviour of mobile IPv6 with dedicated focus on topological impacts. Extending the hierarchical mobile IPv6 approach we suggest protocol improvements for a continuous handover, which may serve bidirectional multicast communication, as well. Along this line a multicast mobility concept is introduced as a service for clients and sources, as they are of dedicated importance in multipoint conferencing applications. The mechanisms introduced do not rely on assumptions of any specific multicast routing protocol in use.Comment: 15 pages, 5 figure

Multicast Mobility in Mobile IP Version 6 (MIPv6) : Problem Statement and Brief Survey

Publisher PD

Mobile IP: state of the art report

Due to roaming, a mobile device may change its network attachment each time it moves to a new link. This might cause a disruption for the Internet data packets that have to reach the mobile node. Mobile IP is a protocol, developed by the Mobile IP Internet Engineering Task Force (IETF) working group, that is able to inform the network about this change in network attachment such that the Internet data packets will be delivered in a seamless way to the new point of attachment. This document presents current developments and research activities in the Mobile IP area

Performance Analysis of Multicast Mobility in a Hierarchical Mobile IP Proxy Environment

Mobility support in IPv6 networks is ready for release as an RFC, stimulating major discussions on improvements to meet real-time communication requirements. Sprawling hot spots of IP-only wireless networks at the same time await voice and videoconferencing as standard mobile Internet services, thereby adding the request for multicast support to real-time mobility. This paper briefly introduces current approaches for seamless multicast extensions to Mobile IPv6. Key issues of multicast mobility are discussed. Both analytically and in simulations comparisons are drawn between handover performance characteristics, dedicating special focus on the M-HMIPv6 approach.Comment: 11 pages, 7 figure

Efficient Micro-Mobility using Intra-domain Multicast-based Mechanisms (M&M)

One of the most important metrics in the design of IP mobility protocols is the handover performance. The current Mobile IP (MIP) standard has been shown to exhibit poor handover performance. Most other work attempts to modify MIP to slightly improve its efficiency, while others propose complex techniques to replace MIP. Rather than taking these approaches, we instead propose a new architecture for providing efficient and smooth handover, while being able to co-exist and inter-operate with other technologies. Specifically, we propose an intra-domain multicast-based mobility architecture, where a visiting mobile is assigned a multicast address to use while moving within a domain. Efficient handover is achieved using standard multicast join/prune mechanisms. Two approaches are proposed and contrasted. The first introduces the concept proxy-based mobility, while the other uses algorithmic mapping to obtain the multicast address of visiting mobiles. We show that the algorithmic mapping approach has several advantages over the proxy approach, and provide mechanisms to support it. Network simulation (using NS-2) is used to evaluate our scheme and compare it to other routing-based micro-mobility schemes - CIP and HAWAII. The proactive handover results show that both M&M and CIP shows low handoff delay and packet reordering depth as compared to HAWAII. The reason for M&M's comparable performance with CIP is that both use bi-cast in proactive handover. The M&M, however, handles multiple border routers in a domain, where CIP fails. We also provide a handover algorithm leveraging the proactive path setup capability of M&M, which is expected to outperform CIP in case of reactive handover.Comment: 12 pages, 11 figure

FastM: Design and Evaluation of a Fast Mobility Mechanism for Wireless Mesh Networks

Although there is a large volume of work in the literature in terms of mobility approaches for Wireless Mesh Networks, usually these approaches introduce high latency in the handover process and do not support realtime services and applications. Moreover, mobility is decoupled from routing, which leads to inefficiency to both mobility and routing approaches with respect to mobility. In this paper we present a new extension to proactive routing protocols using a fast mobility extension, FastM, with the purpose of increasing handover performance in Wireless Mesh Networks. With this new extension, a new concept is created to integrate information between neighbor wireless mesh routers, managing locations of clients associated to wireless mesh routers in a certain neighborhood, and avoiding packet loss during handover. The proposed mobility approach is able to optimize the handover process without imposing any modifications to the current IEE 802.11 MAC protocol and use unmodified clients. Results show the improved efficiency of the proposed scheme: metrics such as disconnection time, throughput, packet loss and control overhead are largely improved when compared to previous approaches. Moreover, these conclusions apply to mobility scenarios, although mobility decreases the performance of the handover approach, as expected

Analysis of IPv6 Neighbor Discovery for Mobile and Wireless Networks

The majority of the current 3GPP and M2M networks use or will use IPv6 for accessing the internet. These IPv6 networks use Neighbor Discovery as defined in RFC 4861 to identify their neighbors on the link and see if they are active. The increase in the complexity of wireless networks and introduction of battery operated devices sets forth notable challenges to certain assumptions in the RFC 4861. The RFC 4861 is more suited for wired networks and its implementation in wireless networks makes it more inefficient. This thesis work focuses on the energy efficient implementation of RFC 4861 using the protocols mentioned in draft-chakrabarti-nordmark-6man-efficient-nd-06. The draft suggests a method of registering all the nodes in the network to their default router, so that the router takes care of all the basic neighbor discovery functionalities without disturbing the battery operated devices which are in sleepy mode. Alongside the legacy Neighbor Discovery, the optimizations proposed by the draft are implemented, on a RADVD based router and an Ubuntu host, to reduce redundant multicast signaling in mobile networks. These optimizations are theoretically analyzed to check if the draft is beneficial for the scalability and transient nature of the wireless networks.Popular Science Report With the rise of Internet of Things (IoT) and Machine to Machine communication (M2M) based networks, more and more wireless devices are communicating to each other and hence there is a need for IPv6 (Internet Protocol version 6) addressing. This new type of addressing forces us to make some design changes in the existing protocols. Wireless devices are mostly mobile, battery operated (hence a power constraint exists) and can undergo several disconnections and reconnections while moving inside the network, whereas wired devices are less prone to network instabilities and almost always connected to a power source. Because of these differences, the protocols of wired devices are not always suitable for wireless networks. Still today’s wireless devices often use protocols that were designed for wired devices and tend to be inefficient. This thesis work deals with one such protocol called Internet Control Message Protocol (ICMP), which is widely used to send control messages across the network between different nodes. Neighbor Discovery Protocol (NDP) is a part of ICMPv6 that helps a node in the network identify its Neighbors on the other side of the link. Present generation wireless devices use the protocols defined in RFC 4861 (a common reference used by major communication companies while creating products) for Neighbor discovery. But this protocol proves to be inefficient by flooding the network with unwanted multicast control messages. Hence we analyze a modified version of the existing NDP against the legacy protocol. RFC 4861 based ‘legacy NDP’ works based on multicasting. Every IPv6 host is a part of several solicited node multicast groups. All nodes with the same last 24 IPv6 address bits belong to the same solicited node multicast group. NDP is also performed based on 4 major control message packets namely, Router Solicitation (RS), Router Advertisement (RA), Neighbor Solicitation (NS) and Neighbor Advertisement (NA). RA is the packet from the router which contains all the information about the network and the router. It is flooded periodically through an all node multicast group to all IPv6 nodes. When a node wants a particular router to send some information about the network immediately without waiting for periodic RAs, it sends an RS. Neighbor Advertisement is used by a node to send information about itself to other nodes in the network. Neighbor Solicitation, as name suggests, is used by a particular node to request for information about another node. Consider the case of a network with a host and a router, and a new node enters the network. It sends out RS to the all routers multicast group, and the router responds with an RA. The new host reads the information about the network and begins address configuration. Stateless Address Auto Configuration (SLAAC) is the most suitable method of address configuration for M2M networks. Hence according to SLAAC, the new host chooses an IP address and checks if the address has already been used by some other host. This process is called as Duplicate Address Detection (DAD) and is carried out by sending out NS for that chosen IP address at the solicited node multicast group address. This means that the new host asks information about a node with that IP address, which may or may not exist at all. If a reply comes, it means that there is a node using this address. If a reply does not come, then it is free to choose the address. The response NA in case of a duplicate address, will be broadcast to all IPv6 nodes. A NS-NA pair is also used to resolve each other’s IP addresses against their MAC addresses. One of the major reasons why this method seems to be inefficient is that current wireless devices are programmed to be in sleep modes when not in use. The flow of control messages to unrelated nodes (because of multicast) will only lead to disrupted sleep. Consider a host A in the network which is in sleep mode, and has an IP address aaaa::aaaa:aaaa:a. When a new host arrives and wants to register itself with an address of aaaa::baaa:aaaa:a, it sends out NS to the multicast group of A (because A has the same last 24 bits). When a packet reaches A, it wakes up from sleep mode, reads the message and identifies that this message was not destined to it. If there was another host in the group which used the same IP address, then host A will also receive another NA, which again is not of any use. Hence this protocol proves to be inefficient. The new proposed protocol works with an efficient implementation of the NDP. It introduces a concept of registering a host with a router. And the router sends out NS and NA instead of the host. Hence each router’s NCE will be the source of information for those hosts which are registered to that router. If a node will request for details about another host, the details will either be fetched from that router’s NCE or the NS will be forwarded to that particular host instead of being multicast. The router to whom the destination host is registered will then send NAs on behalf of its host. Hence in this protocol, the router performs more work and the host less, allowing the host to stay in sleep modes without any problems. The analysis of the two protocols begins with their implementation. We decided to test the working of the two protocols at two specific case scenarios: when several hosts join the network and when the channel links are unsteady. Both protocols were implemented and compared. The implementation of the legacy NDP began with a router and a host system. We used an Ubuntu PC (which generally works as a host) as a router. RADVD is an open source software that helps to generate RAs and Wireshark the software used to analyze packets in the network. To make a host work as a router, the following changes were made: 1. Turn on forwarding in the PC 2. Configure the router with a static IP address 3. Configure the interfaces and add corresponding routing information 4. Install RADVD and include all the network parameters in the config file 5. Turn on Wireshark 6. Turn on RADVD Once all these steps are done in order, the RADVD sends out periodic RAs that can be viewed on the Wireshark. When the host is connected to the network, the entire process of address configuration and DAD can be identified. When pinged, the address resolution process can also be verified. To implement the new protocol, we downloaded the source code of the open source RADVD from GitHub and change the packet formats of the RA, NS and NA. When the router works as a NEAR (Neighbor Discovery Efficiency Aware Router), the host has to understand that it should not use legacy NDP anymore and must act as an Efficiency Aware host (EAH). This information comes with the RA in the form of a flag. When this is done, the host sends an NS in the form of registration request. The details of the host go in the Address Resolution Option (ARO) of the NS. The router responds with an NA which is the acknowledgement for the registration request. Now the host can enter into sleep mode and the router will send control packets to it only when required. When the registration expires, a new registration process has to be setup or a de-registration process has to happen by setting the ARO option in the NS to 0. To implement the changes in the host side, we downloaded the source code for Linux from GitHub and led the decoder side. The process ends by making all the necessary code changes, recompiling a new Kernel and installing the new version of Linux on the hosts. However, the complete reprogramming of the kernel is not handled in this thesis work. But the entire plan for the programming and the rest of the implementation is included in this report. The theoretical analysis of the protocols is also included in this report. This report concludes with a general analysis of the whole protocol. The whole protocol which was completely decentralized has a certain degree of centralized control now. As with all systems, centralization introduces better control but there is always a problem of device failure which can completely collapse the system. The protocol also provides solutions for router failure and recovery and hence the system is a good compromise between centralized and decentralized systems. If properly implemented, there will be an increase in the network efficiency (inversely proportional to the number of control packets for every single data point). This thesis ends with the theoretical analysis. A proper implementation followed by a practical analysis would be a natural future amendment to the projec