• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.173-179
• /
• 2008

An ad hoc network is multi-hop wireledss formed by mobile node without infrastructure. Due to the mobility of nodes in mobile ad hoc networks, the topology of network changes frequently. In this environments, multicast protocols are faced with the challenge of producing multi-hop routes and limitation of bandwidth. We compare the performance of two multicast routing protocols for mobile ad hoc networks - Serial Multiple Disjoint Tree Multicast Routing Protocol (Serial MDTMR) and Adaptive Core Multicast Routing Protocol (ACMRP). The simulator is implemented with GloMoSim.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.5
• /
• pp.1-9
• /
• 2004

In this paper, we propose a multicast routing protocol for the seamless delivery of multicast data to mobile hosts through the optimal route in IPv6-Based mobile networks. The proposed multicast routing protocol reduces the tree reconstruction overhead by limiting the tunneling length according to the mobility of mobile hosts. In this way, our protocol satisfies the bound of the end-to-end delay and supports the seamless handoff. Analytical and simulation results show that the proposed protocol has better performance in terms of the tree reconstruction, tunneling service and multicast packet loss than the previous protocols does.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.7
• /
• pp.41-46
• /
• 2004

Two multicast delivery schemes are proposed to minimize the packet loss that occurs in the mobile multicast (MoM) protocol due to the handoff and relocation. The proposed schemes use a primary designated multicast service provider (DMSP) and a redundant or non-redundant backup DMSP. The simulation results verify that the proposed schemes greatly reduce the packet loss rate at the expense of the increased network traffic or the extra protocol overhead related to the operation of the non-redundant backup DMSP.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.685-694
• /
• 2003

Recently as the mobile computing is burgeoning, multimedia services have become very popular. Multimedia services require large data volume and have to send the same data to several users. In order to provide efficient multimedia services that have those characteristic to mobile users, efficient multicast technique to support host mobility is required. Previous research that support multicast services in mobile computing based on Mobile IP have the non-optimization problem of data delivery path, overhead by frequent reconstruction of the multicast tree, and service disruption problem. In this paper, we propose the mobility pattern based multicast technique using variable service range according to the mobility of mobile hosts and resource reservation to solve this problems. The experimental results show that our proposed mechanism has improved performance than previous research.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1A
• /
• pp.46-54
• /
• 2005

This paper presents an effcient mobile multicast method using the user pattern. We exploit the repetitive movement pattern of mobile node to reduce the total number of experience of graft and join procedure. We defined the locality scope by a movement pattern. While the network is included in the locality scope, the network should maintain a multicast tree even when the mobile node moves to the other network. In this way, the mobile host can receive a multicast service without a delay when it moves to the network in the locality scope later. We compare our scheme with existing schemes under the total signaling cost and the service delay time by using a discrete analytical model for cost analysis. Analytical results demonstrated that the total signaling cost and service delay time was significantly reduced through our proposed scheme.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.307-315
• /
• 2003

This paper proposes a Multicast Tree Extension (MTE) scheme for multicast in IP-based wireless networks. If a group receiver Joins a multicast group in a visited foreign network, multicast service may be disrupted when the foreign network does not have a multicast router. To avoid disruption, our scheme creates a bi-directional tunnel between the previous foreign agent (FA) and new foreign agent, if a mobile node (MN) moves from a foreign network with multicast capability to another foreign network with non-multicast capability. The MN thus continues to receive the multicast packets through the tunnel from the previous FA. Our scheme can avoid a long latency due to a long tunneling for group membership as well as multicast service disruption, even if the MN enters foreign networks with non-multicast capability. Simulation results show that our scheme offers lower costs for multicast delivery, tunneling and handoff latency than the existing scheme.

• The KIPS Transactions:PartC
• /
• v.19C no.2
• /
• pp.153-166
• /
• 2012

Multicast service will be required to be an important form of communication without interruption to the delivery of multicast service in mobile networks increasing MNs. In this paper, we review current status of PMIPv6(Proxy Mobile IPv6) multicast listener support being standardized in the IETF and point out limitations of the current approach and we proposed a fast multicast handover procedure in inter domain PMIPv6 network of network-based mobility management. The proposed Fast multicast handover procedure in inter domain optimizes multicast management by using the context of the MNs. We evaluate the proposed fast multicast handover procedure compared to the based one through the developed analytical models and confirm that introduced fast multicast handover procedure provides the reduced service interruption time and total network overhead compared to the based one during handovers.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.6
• /
• pp.265-278
• /
• 2013

With the recent advancements in various wireless communication technologies, the importance of mobile multicasting is coming to the fore, in an effort to use network resources more efficiently. In the past, when various mobile IP-based multicast techniques were proposed, the focus was put on the costs needed for network delivery for providing multicast services, as well as on minimizing the multicast handover delay. For techniques using MIPv6 (Mobile IPv6), a host-based mobility management protocol, however, it is fundamentally difficult to resolve the problems of handover delay and tunnel convergence. To resolve these problems, a network-based mobility management protocol called PMIPv6 (Proxy Mobile IPv6) was standardized. Although performance is improved in PMIPv6 over MIPv6, it still suffers from the problems of handover delay and tunnel convergence. In this paper, to overcome these limitations, a technique called LFH (Low-cost and Fast Handoff) is proposed for fast and low-cost mobility management with multicasting support in PMIPv6 networks. To reduce the interactions between the complex multicast routing protocol and the multicast messages, a simplified proxy method called MLD (Multicast Listener Discovery) is implemented and modified. Furthermore, a TCR (Tunnel Combination and Reconstruction) algorithm was used in the multicast handover procedure within the LMA (Local Mobility Anchor) domain, as well as in the multicast handover procedure between domains, in order to overcome the problem of tunnel convergence. As a result, it was found that LFH has reduced multicast delay compared to other types of multicast techniques, and that it requires lower costs as well.

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.546-558
• /
• 2017

The amount of multimedia traffic over the Internet has been increasing because of the development of networks and mobile devices. Accordingly, studies on multicast, which is used to provide efficient multimedia and video services, have been conducted. In particular, studies on centralized multicast tree construction have attracted attention with the advent of software-defined networking. Among the centralized multicast tree construction algorithms, the group Takahashi and Matsuyama (GTM) algorithm is the most commonly used in multiple multicast tree construction. However, the GTM algorithm considers only the network-cost overhead when constructing multicast trees; it does not consider the temporary service disruption that arises from a link change for users receiving an existing service. Therefore, in this study, we propose a multiple multicast tree construction algorithm that can reduce network cost while avoiding considerable degradation of service quality to users. This is accomplished by considering both network-cost and link-change overhead of users. Experimental results reveal that, compared to the GTM algorithm, the proposed algorithm significantly improves the user-experienced quality of service by substantially reducing the number of linkchanged users while only slightly adding to the network-cost overhead.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.8
• /
• pp.11-18
• /
• 2001

In this paper, we propose a multicast routing scheme for an efficient and reliable support of multicast service to mobile hosts in IPv6 based networks. The purpose of this paper is to develop an algorithm to reduce both the number or multicast tree reconstruction and the multicast service disrupt time. The proposed multicast routing scheme is a hybrid method using the advantages of the bi-directional tunneling and the remote subscription proposed by the IETF Mobile IP working group. The proposed scheme satisfies the maximum tolerable transfer delay time and supports the maximum tunneling service. The simulation results show that the proposed scheme has better performance in the number of multicast tree reconstruction and the time of multicast service disrupt than the previous schemes does.