• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2267-2273
• /
• 2016

In this paper, WiMedia Distributed-MAC protocol is adopted for development of an OSMU (One Source Multi Use) N-screen wireless multicast service. But, when considering wireless communication environment where channel error rate is time-variant, N-screen high-speed data is vulnerable to be lost. For this problem, a multicast relay scheme is proposed by analyzing Distributed-MAC protocol. In proposed multicast relay scheme, Multicast-free DRP Availability IE is combined and the relay node suitable for N-screen multicast transmissions is selected. Through this operation, it can avoid wireless channel with high errors and can transmit N-screen high-speed data. In simulation results, the proposed multicast relay scheme is compared with conventional Distributed-MAC multicast scheme in view points of throughput and energy consumption according to various numbers of multicast nodes and BER (Bit Error Rate) values in wireless channel. Through simulation results, it is explained that proposed multicast relay scheme should be adopted in WiMedia Distributed-MAC protocol to realize OSMU N-screen wireless multicast services.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.578-585
• /
• 2001

IP Multicast that provides best-efforts service does not guarantee reliable delivery of multicast packets. In recent years, there are many approaches to support reliable multicast, but those are insufficient for implementing scalable and reliable multicast over Internet. We propose a Reliable Multicast Architecture(RMA) for scalable and reliable multicast. The RMA model guarantees reliability using a receiver initiated retransmission mechanism, and scalability using a feedback suppression mechanism by Multicast Router(MR). Furthermore, it utilizes underlying multicast routing information to minimize the cost of protocol modification and overheads. Our performance analyses show that RMA is much superior to previous works in the point of scalability and compatibility.

• Journal of Computing Science and Engineering
• /
• v.5 no.4
• /
• pp.316-323
• /
• 2011

Recently, Proxy Mobile IPv6 (PMIPv6) has received much attention as a mobility management protocol in next-generation all-IP mobile networks. While the current research related to PMIPv6 mainly focuses on providing efficient handovers for unicast-based applications, there has been relatively little interest in supporting multicast services with PMIPv6. To provide support for multicast services with PMIPv6, there are two alternative approaches called Mobile Access Gateway (MAG)-based subscription and Local Mobility Anchor (LMA)-based subscription. However, MAG-based subscription causes a large overhead for multicast joining and LMA-based subscription provides non-optimal multicast routing paths. The two approaches may also cause a high packet loss rate. In this paper, we propose an efficient PMIPv6-based multicast protocol that aims to provide an optimal delivery path for multicast data and to reduce handover delay and packet loss rate. Through simulation studies, we found that the proposed protocol outperforms existing multicast solutions for PMIPv6 in terms of end-to-end delay, service disruption period, and the number of lost packets during handovers.

• ETRI Journal
• /
• v.31 no.1
• /
• pp.83-85
• /
• 2009

Compared with unicast, multicast over wireless ad-hoc networks do not support reliability due to their inability to exchange request-to-send/clear-to-send (RTS/CTS) and ACK packets with multiple recipients. Although several media access control (MAC) layer protocols have been proposed to provide reliable multicast, these introduce additional overhead, which degrades system performance. A novel MAC protocol for reliable wireless multicast is proposed in this paper. By adapting orthogonal frequency division multiple access characteristics in CTS and ACK packets, the protocol achieves reliability over wireless multicast with minimized overhead.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.118-121
• /
• 1999

Multicast addresses cannot be permanently assigned to particular application or group combination, but need to be available for re-use. So, this requires a dynamic multicast address allocation and release mechanism. For a dynamic multicast address allocation and release mechanism, we must consider low blocking probability, low delay, low control traffic overhead. In this paper, we suggest a efficient dynamic multicast address allocation and release mechanism based on the multicast scope

• ETRI Journal
• /
• v.23 no.4
• /
• pp.202-204
• /
• 2001

In this letter, we propose a new multicast scheme, named Xcast+, which is an extension of Explicit Multicast (Xcast) for an efficient delivery of multicast packets. The mechanism incorporates the host group model and a new control plane into existing Xcast, and not only does it provide the transparency of traditional multicast schemes to senders and receivers, but it also enhances the routing efficiency in networks. Since intermediate routers do not have to maintain any multicast states, it results in a more efficient and scalable mechanism to deliver multicast packets. Our simulation results show distinct performance improvements of our approach compared to Xcast, particularly as the number of receivers in a subnet increases.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.137-140
• /
• 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 of multicast tree reconstruction and the multicast service disrupt time using the RSVP scheme. The proposed multicast routing scheme is a hybrid method using the advantages of the hi-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.

• IE interfaces
• /
• v.11 no.1
• /
• pp.155-163
• /
• 1998

In multiparty multimedia communication, each participant not only receives information from other participants but also generates real-time data streams to distribute to others and therefore the difference between source and destination is not clear in terms of data transmission. During a teleconference session, many sub-multicast trees may be generated to exchange information to specific members within the multicast group and if those sub-multicast trees use the same fixed multicast tree, the blocking probability will be high and it is hard to provide QoS for each sub-multicast group. Also, even though there exits some shortcuts between each sub-multicast group, fixed multicast tree does not allow to use those shortcuts. Thus to overcome these problems. We propose a network resource reservation protocol and show that its effectiveness in terms of blocking probability and network resources usage.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.402-408
• /
• 2002

Multicast technology allows the transmission of data from one source node to a selected group of destination nodes. Multicast routes typically use trees, called multicast routing trees, to minimize resource usage such as cost and bandwidth by sharing links. Moreover, the quality of service (QoS) is satisfied by distributing data along a path haying no more than a given number of arcs between the root node of a session and a terminal node of it in the routing tree. Thus, a multicast routing tree for a session can be represented as a hop constrained Steiner tree. In this paper, we consider the hop-constrained multicast route packing problem with bandwidth reservation. Given a set of multicast sessions, each of which has a hop limit constraint and a required bandwidth, the problem is to determine a set of multicast routing trees in an arc-capacitated network to minimize cost. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a modified cover inequality is used to strengthen the integer programming formulation.