• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1279-1282
• /
• 2007

무선 인터페이스 CDMA, WCDMA(HSDPA) 그리고 WiBro 는 대용량의 멀티미디어 컨텐츠를 제한된 무선자원에서 각 사용자에게 효율적으로 제공하기 위하여 Multicast 및 Broadcast 형태로 서비스를 제공하고 있으며, 이러한 서비스는 CDMA 에서는 BCMCS(Broadcast Multicast Service), WCDMA 에서는 MBMS(Multimedia Broadcast Multicast Service) 그리고 WiBro 에서는 MBS(Multicast Broadcast Service)라 불리고 있다. 본 논문에서는 각 서비스들의 DMB(Digital Multimedia Broadcasting)와 같은 방송형 서비스 및 다양한 멀티미디어 컨텐츠를 제공해 주기 위한 각 무선인터페이스의 Multicast 및 Broadcast 형태를 비교 및 분석하여 그에 따른 서비스의 확장성을 비교 분석하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12C
• /
• pp.208-217
• /
• 2001

In mobile Internet environment, providing multicast requires much more complex mechanism comparing with the unicast Mobile IP routing protocol. This is because multicast datagrams are sent to a group address that do not belong to a specific network. The IETF Mobile IP suggested two approaches for mobile multicasting, namely remote subscription and hi-directional tunneling. In remote subscription, a mobile node may join a group via a local multicast router on the visited subnet. Therefore remote subscription may cause much datagram loss while reconstructing the delivery tee. In bi-directional tunneling, a mobile node may join a group via a hi-directional tunnel to its home agent. Bi-directional tunneling may suffer from inefficient routing. In this paper, we proposed a new mobile multicasting protocol, Mobile If Multicast using Local Broadcast(MIMLB) which can receive multicast datagrams as fast as possible and optimize routing path for multicast delivery. The MIMLB protocol uses hi-directional tunneling to receive multicast datagrams. And the MIMLB protocol can resolve datagram duplicated problem and optimize routing path by using local broadcast. Simulation results show that MIMLB reduces delivery path length and optimizes multicast routing path when a mobile nod? moves into a foreign network.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.2
• /
• pp.77-85
• /
• 2015

This paper presents our performance evaluation after the way of minimizing waiting times between channel switching for eMBMS(evolved Multimedia Broadcast/Multicast Services) technique in LTE-Advanced systems. Existing composition of MBMS using IGMP(Internet Group Management Protocol) transfers the data with Multicast from BM-SC(Broadcast Multicast Service Center) to eNB(evolevd Node B) and with Broadcast from eNB to UE(User Equipment). Therefore, in case of channel switching, IGMP Join report should be transferred to BM-SC and then wait user's contents to be retransferred from eNB. To achieve this, Subscriber Channel technique of priorities is used for minimizing waiting times between channel switching as UE broadcasts favorite channels in advance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.248-256
• /
• 2002

In this paper, new multicast scheduling algorithms are proposed for the WDM single－hop broadcast－and－select networks. The existing multicast scheduling algorithms do not concerned the previous state of receivers, but the proposed method call H－EAR and PGM that partition a multicast group to subgroups using the tunable transmitter, state information of receivers, and pseudo group concept. the performance of proposed algorithms are evaluated through the computer simulation. They show the better Performance comparing with the existing multicast scheduling algorithm.

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.26-31
• /
• 2011

In this paper, we formulate the minimum power multicast problem in wireless networks as a mixed integer linear programming problem and then propose a Lagrangean relaxation based algorithm to solve this problem. By leveraging on the information from the Lagrangean multiplier, we could construct more power efficient routing paths. Numerical results demonstrate that the proposed approach outperforms the existing approaches for broadcast, multicast, and unicast communications.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.613-619
• /
• 2014

Multicast routing algorithms designed for wireline networks are not suitable for wireless environments since they cannot efficiently exploit the inherent characteristics of wireless networks such as the broadcast advantage. There are many routing protocols trying to use these advantages to decrease the number of required transmissions or increase the reception probability of data (e.g., opportunistic routing).Reducing the number of transmissions in a multicast tree directly decreases the bandwidth consumption and interference and increases the overall throughput of the network. In this paper, we introduce a distributed multicast routing protocol for wireless mesh networks called NCast which take into account the data delivery delay and path length when constructing the tree. Furthermore, it effectively uses wireless broadcast advantage to decrease the number of forwarding nodes dynamically when a new receiver joins the tree.Our simulation results show that NCast improves network throughput, data delivery ratio and data delivery delay in comparison with on demand multicast routing protocol. It is also comparable with multichannel multicast even though it does not use channeling technique which eliminates the interference inherently.

• ETRI Journal
• /
• v.33 no.3
• /
• pp.355-365
• /
• 2011

IPTV broadcast channels and video content distribution are increasingly saturating network paths. New solutions based on inter-domain multicast protocols could contribute to the enhancement of multimedia content distribution over the Internet. The aim of this paper is to propose new capabilities for an existing inter-domain multicast protocol, the Protocol Independent Multicast-Sparse Mode. We describe the modified protocol and analyze its behavior using newly developed tools based on an open-source software simulator. The resulting protocol does not require topology information, which is advantageous for easier deployment. In addition, the adopted solution avoids inherent problems with inter-domain multicast routing, such as multiple paths and path asymmetries.

• Journal of Advanced Navigation Technology
• /
• v.20 no.4
• /
• pp.352-360
• /
• 2016

In this paper, a novel multiple multicast feed-back scheme for improving multimedia multicast and broadcast system based on IEEE 802.11. The proposed scheme improves multicast PPDU delivery ratio of next generation wireless LAN by utilizing multicast feed-back information. By using the proposed scheme, regardless of its size of multicast group, an AP STA could collect transmission failure information by receiving simultaneous NAK frame. The proposed scheme shows large performance enhancement in broadcast or multicast system of Intelligent Transport System and Passenger Entertainment Service. According to the analysis results, the proposed scheme could enhance wireless LAN multicast and broadcast performance significantly.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.255-263
• /
• 2000

A multistage interconnection network is a suitable class of interconnection architecture for constructing large-scale multicomputers. Broadcast and multicast communication are fundamental in supporting collective communication operations such as reduction and barrier synchronization. In this paper, we propose a new multicast technique in wormhole-switched bidirectional multistage banyan networks for constructing large-scale multicomputers. To efficiently support broadcast and multicast with simple additional hardware without deadlock, we propose a two-phase multicast algorithm which takes only two transmissions to perform a broadcast and a multicast to an arbitrary number of desired destinations. We encode a header as a cube and adopt the most upper input link first scheme with periodic priority rotation as arbitration mechanism on contented output links. We coalesce the desired destination addresses into multiple number of cubes. And then, we evaluate the performance of the proposed algorithm by simulation. The proposed two-phase multicast algorithm makes a significant improvement in terms of latency. It is noticeable that the two-phase algorithm keeps broadcast latency as efficient as the multicast latency of fanout 2^m where m is the minimum integer satisfying $2^m{\geq} {\sqrt{N}}$ ( N is a network size).

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.919-926
• /
• 2002

In this paper, new multicast scheduling algorithms are proposed for the WDM single-hop broadcast-and-select networks. The existing multicast scheduling algorithms are focused on the partitioning a multicast group into several subgroups to reduce the delay time of each receiver. These partitioning algorithms are grouping method of the receivers already tuned to the transmitter's wavelength. However, these algorithms ignore the state of receivers, which leads to increase the number of subgroups and the delay time. Therefore, 1 propose two new multicast scheduling algorithms called H_EAR and PGM that partition a multicast group to subgroups using the tunable transmitter, state information of receivers, and pseudo group concept. The performance of proposed algorithms are evaluated through the computer simulation. They show the better performance comparing with the existing multicast scheduling algorithm.