• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.3
• /
• pp.180-187
• /
• 2014

This paper introduces reliable multicast MAC protocol for cooperative unmanned vehicles. cooperative unmanned vehicles communicate with infrastructure and other unmanned vehicles in order to increase driving safety. They exchange information related to driving and thus it requires real-time and reliable multicast. However, the international vehicular communication standard, IEEE 802.11p WAVE, does not provide a reliable multicast scheme on the MAC layer. To address the problems of reliability, we propose a reliable multicast protocol called WiVCL, which avoids contention and collision. Our evaluation shows that the WiVCL achieves a high degree of reliability and real-time features.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.525-527
• /
• 2005

the multicast services with multiple senders is interested according to the internet services such as multiple audio/video conference services. With the N-plex multicast protocols, multicast session manager is also needed for membership control and session control. RMCP-3 is designed for N:N group communications which is standardizing in ITU-T and supports multiple senders who join sessions. In this paper, we consider requirements of multicast manager for multiplex multicast communication protocol which many a joiner has a role in sender such conference application.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.525-535
• /
• 2011

In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multi-packet transmission (MPT) and multi-packet reception (MPR) capabilities. We show that a per session throughput capacity of ${\Theta}$(nT$^3$(n)) can be achieved as a tight bound when each session contains a constant number of sinks where n is the total number of nodes and T(n) is the transmission range. Surprisingly, an identical order capacity can be achieved when nodes have only MPR and MPT capabilities. This result proves that NC does not contribute to the order capacity of multicast traffic in wireless ad hoc networks when MPR and MPT are used in the network. The result is in sharp contrast to the general belief (conjecture) that NC improves the order capacity of multicast. Furthermore, if the communication range is selected to guarantee the connectivity in the network, i.e., ${\Omega}$($\sqrt{log\;n/n}$)=T(n) = O(log log n / log n), then the combination of MPR and MPT achieves a throughput capacity of ${\Theta}$(log$^{\frac{3}{2}}$ n/$\sqrt{n}$) which provides an order capacity gain of ${\Theta}$(log$^2$ n) compared to the point-to-point multicast capacity with the same number of destinations.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.109-116
• /
• 2002

Through the increment of requirement for group oriented communication services, on the open network, the multicast infrastructure has become a widely discussed researching topic. However the research of the security properties that safety, efficiency and scaleability in a multicast structure, has not been enough. In this study, we discuss conventional multicast key management structures and propose a scalable secure multicast key management structure based on PKI(Public Key Infrastructure), IPSec, domain subgroup and structural two mode scheme. Also we certify to the usability of new proposed scheme from comparing it with conventional schemes in the part of safety, efficiency and scaleability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.8
• /
• pp.2648-2665
• /
• 2022

Device-to-device (D2D) multicast has become a promising technology to provide specific services within a small geographical region with a high data rate, low delay and low energy consumption. However, D2D multicast communications are allowed to reuse the same channels with cellular uplinks and result in mutual interference in a cell. In this paper, an intelligent channel assignment algorithm is designed in D2D underlaid cellular networks with the target of maximizing network throughput. We first model the channel assignment problem to be a throughput maximizing problem which is NP-hard. To solve the problem in a feasible way, a novel channel assignment algorithm is proposed. The key idea is to find the appropriate cellular communications and D2D multicast groups to share a channel without causing critical interference, i.e., finding a channel for a D2D multicast group which generates the least interference to network based on current channel assignment status. In order to show the efficacy and effectiveness of our proposed algorithm, a novel search algorithm is proposed to find the near-optimal solution as the baseline for comparisons. Simulation results show that the proposed algorithm improves the network throughput.

• Journal of Korea Multimedia Society
• /
• v.3 no.3
• /
• pp.280-289
• /
• 2000

This paper presents an efficient method to provide seamless communication in mobile wireless networks. The goal of seamless communication is to provide disruption free service to a mobile user. A disruption in service could occur due to active handoffs. There are many user applications that do not require a total guarantee for disruption free service but would also not tolerate very frequent disruptions. This paper proposes an extended staggered multicast that provides a probabilistic guarantee for disruption free service. The proposed multicast forecasts the direction and velocity for a mobile host. It is possible that data packets for a mobile host are multicasted to not all neighbor cells but a par\ulcorner of neighbor cells those the mobile host will be handoff potentially on the basis of these information. Therefore, the extended staggered multicast significantly reduces the static network bandwidth usage also provides a probabilistic guarantee for disruption free service.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.3
• /
• pp.63-73
• /
• 2004

This paper proposes an efficient authentication scheme for multicast packet using recovery layer to provide source authentication. The problems of the existing schemes are as follows ： TESLA requires time synchronization between the sender and the receiver, md hash-based schemes have high communication overheads due to additional hash values and require many buffers and delay for verification on receivers. Our main focus is reducing the buffer size, communication and computation burden of the receiver. The proposed scheme in this paper is highly robust to packet loss using the recovery layer based on XOR operation. It also provides low communication overhead, low verification cost, non-repudiation of the origin, immediate verification and robustness against DoS attack on the receiver.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.273-279
• /
• 2003

Hypercube multicomputers have been drawing considerable attention from many researchers due to their regular structure and short diameter. One of keys to the performance of Hypercube is the efficiency of communication among processors. Among several communication patterns, multicast is important, which is found in a variety of applications as data replication and signal processing. As the number of processors increases, the probability of occurrences of fault components also increases. So it would be desirable to design an efficient scheme that multicasts messages in the presence of faulty component. In fault-tolerant routing and multicast, there are local information based scheme, global information based scheme and limited information based scheme in terms of information. In general, limited information is easy to obtain and maintain by compressing information in a concise format. In this paper, we propose a new routing scheme and a new multicast scheme using recently proposed fully reachability information scheme and new local information scheme. The proposed multicast scheme increases multicast success possibility and reduce deroute cases. Experiments show that multicast success possibility can increase at least 15% compared to previous method.

• Journal of information and communication convergence engineering
• /
• v.8 no.3
• /
• pp.295-300
• /
• 2010

Recent researches of network structure are moving to high-level networks because there are already many research results of low-level network. Especially, current network services has been changed to the multimedia service using multicast routing such as IPTV(Internet Protocol Television) service. And then previous multicast services were provider oriented. So previous multicast structures were organized server/client model. But future multicast services will make user oriented services. Therefore there will be many service providers in the future. At this point, we study P2P network for supporting multi provider. So we research load balancing and contents lookup protocols in P2P network. In this paper, we propose network protocol and system based on super peer P2P for load balancing and efficiently service search. And we considered mobile environment for mobile IPTV.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1525-1535
• /
• 2000

Multicast is the multiparty communication that allows one-to-many communications. There are some multicast applications which are the ways of multiparty communications such as video conference system and white board. This paper proposes a dynamic allocation mechanism of designated receiver by using designated receiver list and a retransmission mechanism with designated receiver for the effective multicasting dta transmission. We designed voice conference system with multicast based on RTP/RTCP. This voice conference system increases the effect of standardization work and enables to exchange reliable standard dta with real time.