• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.40-42
• /
• 2003

We implement a 3D virtual conference using IPv6 multicast protocol suites. PIM-SM(Protocol Independent Multicast-Sparse Mode) is chosen for multicast. To provide users with the virtual reality that they are actually participating in an academic conference, 3D interface is built on VRML. Various multicast activities such as join/leave of a user into/out of sessions are represented by enter/exit of corresponding avatar to maximize the "sense of presence."nce."quot;

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.2
• /
• pp.153-172
• /
• 2002

In this paper, we propose an architecture and a protocol fur Secure Mobile Multicast(SMM) offering efficient and secure multicast services to many mobile nodes. In this framework, we use Indirect and Direct Service Mode adaptively, according to the movement of mobile nodes around the overlapped service area, to provide reliably secure multicast with low latency, minimum key update, and minimum data loss.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1187-1193
• /
• 2003

The interest for IPv6, which is next generation IP, increases, while the difficulty for adopting it into IT industries also increases too. We also expect that Internet technologies develop on basis of All-IP networks, which include various heterogeneous networks. Therefore, it is necessary for network to support mobility and multicast capability to create applications with wide-variety. In this paper, we propose a new mobile multicasting protocol called Mobile IPv6 Multicast Protocol(MIMP). The proposed scheme satisfies no packet losses from roaming and optimal routing efficiency.

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1108-1119
• /
• 2015

Multicast communication of mobile ad hoc networks is vulnerable to internal attacks due to its routing structure and high scalability of its participants. Though existing intrusion detection systems (IDSs) act smartly to defend against attack strategies, adversaries also accordingly update their attacking plans intelligently so as to intervene in successful defending schemes. In our work, we present a novel indirect internal stealthy attack on a tree-based multicast routing protocol. Such an indirect stealthy attack intelligently makes neighbor nodes drop their routing-layer unicast control packets instead of processing or forwarding them. The adversary targets the collision avoidance mechanism of the Medium Access Control (MAC) protocol to indirectly affect the routing layer process. Simulation results show the success of this attacking strategy over the existing "stealthy attack in wireless ad hoc networks: detection and countermeasure (SADEC)" detection system. We design a cross-layer automata-based stealthy attack on multicast routing protocols (SAMRP) attacker detection system to identify and isolate the proposed attacker. NS-2 simulation and analytical results show the efficient performance, against an indirect internal stealthy attack, of SAMRP over the existing SADEC and BLM attacker detection systems.

• ETRI Journal
• /
• v.22 no.1
• /
• pp.30-37
• /
• 2000

Existing tree construction mechanisms are classified into source-based trees and center-based trees. The source-based trees produce a source-rooted tree with a low delay. However, for the applications with multiple senders, the management overheads for routing tables and resource reservations are too high. The center-based trees are easy to implement and manage, but a priori configuration of candidate center nodes is required, and the optimization mature such as tree cost and delay is not considered. In this paper, we propose a new multicast tree building algorithm. The proposal algorithm basically builds a non-center based shared tree. In particular, any center node is not pre-configured. In the purposed algorithm, a multicast node among current tree nodes is suitably assigned to each incoming user: Such a node is selected in a fashion that tree cost and the maximum end-to-end delay on the tree are jointly minimized. The existing and proposed algorithms are compared by experiments. In the simulation results, it is shown that the proposed algorithm approximately provides the cost saving of 30% and the delay saving of 10%, compared to the existing approaches. In conclusion, we see that the cost and delay aspects for multicast trees can be improved at the cost of additional computations.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.3
• /
• pp.153-164
• /
• 2007

The Access Grid (AG) provides collaboration environments over the IP multicast networks by enabling efficient exchange of multimedia contents among remote users; however, since lots of current networks are still multicast-disabled, it is not easy to deploy this multicast-based multi-party AG. For this problem, the AG provides multicast bridges as a solution by putting a relay server into the multicast networks. Multicast-disabled clients make UDP connections with this relay server and receive forwarded multicast traffics in unicast UDP packets. This solution is facing several limitations since it requires duplicate forwarding of the same packet for each unicast peer. Thus, in this paper, we propose an alternate solution for the multicast connectivity problem of the AG based on the UMTP (UDP multicast tunneling protocol). By taking advantage of flexibilities of UMTP, the proposed solution is designed to improve the efficiency of network and system utilization, to allow reuse of multicast-based AG applications without modification, and to partially address the NAT/firewall traversal issues. To verify the feasibility of proposed solution, we have implemented a prototype AG connectivity tool based on the UMTP, named as the AG Connector.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5928-5947
• /
• 2019

Multicast Mesh based Mobile Ad-hoc NETworks (MANETs) provide efficient data transmission in energy restraint areas without a fixed infrastructure. In this paper, the authors present an improved version of protocol SLIMMER developed by them earlier, and name it SLIMMER-SN. Most mesh-based protocols suffer from redundancy; however, the proposed protocol controls redundancy through the concept of forwarding nodes. The proposed protocol uses remaining energy of a node to decide its energy efficiency. For measuring stability, a new metric called Stability of Node (SN) has been introduced which depends on transmission range, node density and node velocity. For data transfer, a weighted cost function selects the most energy efficient nodes / most stable nodes or a weighted combination of both. This makes the node selection criteria more dynamic. The protocol works in two steps: (1) calculating SN and (2) using SN value in the weighted cost function for selection of nodes. The study compared the proposed protocol, with other mesh-based protocols PUMA and SLIMMER, based on packet delivery ratio (PDR), throughput, end-to-end delay and average energy consumption under different simulation conditions. Results clearly demonstrate that SLIMMER-SN outperformed both PUMA and SLIMMER.

• ETRI Journal
• /
• v.23 no.3
• /
• pp.111-120
• /
• 2001

For scalable multicast transport, one of the promising approaches is to employ a control tree known as acknowledgement (ACK) tree which can be used to convey information on reliability and session status from receivers to a root sender. The existing tree configuration has focused on a 'bottom-up' scheme in which ACK trees grow from leaf receivers toward a root sender. This paper proposes an alternative 'top-down' configuration where an ACK tree begins at the root sender and gradually expands by including non-tree nodes into the tree in a stepwise manner. The proposed scheme is simple and practical to implement along with multicast transport protocols. It is also employed as a tree configuration in the Enhanced Communications Transport Protocol, which has been standardized in the ITU-T and ISO/IEC JTC1. From experimental simulations, we see that the top-down scheme provides advantages over the existing bottom-up one in terms of the number of control messages required for tree configuration and the number of tree levels.

• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.419-428
• /
• 2004

Due to the deployment problem of the IP Multicast service, the Application Layer Multicast (or Overlay Multicast) has appeared as an alter-native of the If Multicast. However, even though plenty of the Application Layer Multicast (ALM) Protocols were designed and their applications were developed according to the diverse requirements of each multicast service, researches on the ALM Protocols are focused on only a protocol design or an efficient multicast group management algorithm. And there is little effort to provide a unified guideline for development of the ALM Protocols and provide an environment for running multiple protocols simultaneously in a system. In this paper, we propose socket APIs to be a reference in developing new ALM Protocols which enables a system to support multiple protocols in a system with other ALM Protocols and which gives an environment to support efficient protocol management.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.149-156
• /
• 2011

In wireless multi-hop network, many applications need multicast communication where the group leader needs to send data to all members of the group. Multicast routing provides a balanced, efficient, and fairness network environment for the group members. However, large load for transmission management to leader node and signal interference between several paths for multi-hop links always took long transmission delay and low throughput efficiency. In this paper, we propose a Zone-based Hierarchical Multicast Routing Protocol (ZHMP). This routing protocol is designed based on zone routing schemes, where proactive routing is applied for intra-zone node level multicasting and reactive routing is used for searching inter-zone paths. By each hierarchical and independent multicast working in separated zones, load of multicast source node will be distributed by several zone-level routings for a better load balance and signal interference between each multi-hop paths will be resisted for a maximum multicast throughput.