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

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

Publisher PD

Scalable IP multicast for many very small groups with many senders and its application to mobility

We consider the problem of multicast routing in a large single domain network with a very large number of multicast groups with small number of receivers. Such a case occurs, for example, when multicast addresses are statically allocated to mobile terminals, as a mechanism to manage Internet host mobility. For such networks, existing dense or sparse mode multicast routing algorithms do not scale well with the number of multicast groups. We propose an alternative solution called Distributed Core Multicast (DCM) that is based on an extension of the centre-based tree approach. We also describe how our approach can be used to support mobile terminals

ADAPTIVE ROUTING BASED ON DELAY TRUSTED ROUTING IN ADHOC NETWORK

Existing network hardware is constantly being improved and new communication technology continues to be developed. Together with the trend that computing hardware becomes smaller and portable, this network technology progress has led to dynamic networks. Next generation wireless networks are characterized as heterogeneous networks, particularly in terms of its underlying technology. One of the challenges of these heterogeneous networks is to manage handoff. Mobile IP is chosen for managing the handoff to accommodate the all-IP vision of the future interconnected networks. However, the handoff management of the mobile IP is mainly for data services where delay is not of a major concern. Therefore, it would be considerable challenge to achieve low latency handoff for real-time services. In this paper, we propose a multicasting scheme for delay-sensitive applications

The Changing Patterns of Internet Usage

Symposium: Essays from Time Warner Cable\u27s Research Program on Digital Communications