• Journal of KIISE:Information Networking
• /
• v.37 no.3
• /
• pp.234-242
• /
• 2010

The demand on various broadcasting services has been greatly increasing in the area of mobile communication. In IEEE802.16e standard and mobile WiMAX, the multicast broadcast service (MBS) uses shared downlink channel for efficiently supporting a number of users. In this paper we propose a dynamic modulation and coding scheme with relay network to enhance the performance of MBS. The proposed approach employs the adaptive modulation and coding scheme for both the base station and relay station to achieve consistently high throughput. The result of computer simulation with NS-2 shows that the throughput and transmission time are significantly improved by using the proposed approach compared to the existing schemes having a fixed modulation level for the RSs.

• Convergence Security Journal
• /
• v.2 no.2
• /
• pp.19-27
• /
• 2002

This paper proposes a group key management protocol for a secure of all the multicast user in PIM-SM multicast group communication. Each subgroup manager gives a secure key to it's own transmitter and the transmitter compress the data with it's own secure key from the subgroup manager. Before the transmitter send the data to receiver, the transmitter prepares to encrypt a user's service by sending a encryption key to the receiver though the secure channel, after checking the user's validity through the secure channel. As the transmitter sending a data after then, the architecture is designed that the receiver will decode the received data with the transmitter's group key. Therefore, transmission time is shortened because there is no need to data translation by the group key on data sending and the data transmition is possible without new key distribution at path change to shortest path of the router characteristic.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.765-772
• /
• 2004

Multicast communication is simultaneous transmission of data to multiple receivers and saves considerably sender resources and network bandwidth. It has high risk to attack using group address and inherent complexity of routing packets to a large group of receivers. It is therefore critical to provide source authentication, allowing a receiver to ensure that received data is authentic. In this paper, we propose the multiple chain authentication scheme for secure and efficient multicast stream. To evaluate the performance of our scheme, we compare our technique with two other previously proposed schemes using simulation results. Our scheme provides non-repudiation of origin, low overhead by amortizing the signature operation over multiple packets, and high packet loss resistance.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.214-220
• /
• 2011

This paper attempts to address the effectiveness of physical-layer network coding (PNC) on the throughput improvement for multi-hop multicast in random wireless ad hoc networks (WAHNs). We prove that the per session throughput order with PNC is tightly bounded as ${\Theta}((n\sqrt{m}R(n))^{-1})$ if $m=(R^{-2}(n))$, where n is the total number of nodes, R(n) is the communication range, and m is the number of destinations for each multicast session. We also show that per-session throughput order with PNC is tight bounded as ${\Theta}(n^{-1})$, when $m={\Omega}(R^{-2}(n))$. The results of this paper imply that PNC cannot improve the throughput order of multicast in random WAHNs, which is different from the intuition that PNC may improve the throughput order as it allows simultaneous signal access and combination.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10B
• /
• pp.876-890
• /
• 2003

This paper proposes a protocol for the reliableand QoS-aware multicast transport, which is called the Enhanced Communications Transport Protocol (ECTP). The ECTP has so far been developed and standardized in ITU-T SG17 and ISO/IEC JTC 1/SC 6. Differently from the conventional reliable multicast, as shownin the IETF RMT WG, the ECTP additionally provides several distinct features such as tight control of multicast session, tree-based error control, and QoS management. For the tight control of multicast connections, the sender is at the heart of one-to-many group communications, and it is responsible for overall connection management such as connection creation/termination, pause/resumption, and the join and leave operations. for tree-based reliability control, ECTP configures a hierarchical tree during connection creation. Error control is performed within each local group defined by a control tree, which was partly designed like the IETF TRACK approach. Each parent retransmits lost data in response to retransmission requests from its children. For QoS management, ECTP supports QoS negotiation for resource reservation, and it also provides QoS monitoring and maintenance operations. ECTP has been implemented and tested on Linux machine, along with Application Programming Interfaces based on Berkeley sockets. For basic testing of the ECTP functionality, we give some preliminary experimental results for performance comparison of ECTP and TCP unicast transports. In conclusion, we describe the status of ECTP experimentations over APAN/KOREN testbed networks

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.159-162
• /
• 2005

Confusion of network traffic is increased by increasing of internet user and large of network. Specially olded one and one communication caused loss of bandwidth because redundant packet by increaseing video conference and internet broadcasting. Thereupon multicast technique, method reducing loss of bandwith, for multimedia data transmission was proposed. This paper verify efficiency after analysis about seperated tree management and multicast traffic transmission method for removing complexity of multicast protocal.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.11-22
• /
• 2010

In case that group communication protocols assume every process is interested in all events occurring in a large scale group, the events multicasting to a subset of a large process group, such as a sensor network, potentially varying for every event based on their interests might lead to very high communication overhead on each individual process. Moreover, despite the importance of both guaranteeing message delivery order and supporting overlapped group using gossip based group communication for multicasting in sensor or P2P networks, there exist little research works on development of gossip-based protocols to satisfy all these requirements. In this paper, we present a new gossip-based causal message order guaranteeing multicast protocol based on local views and delegates representing subgroups and fully utilizing multi-group features to improve scalability. In the proposed protocol, the message delivery order in overlapped groups has been guaranteed consistently by all corresponding members of the groups including delegates. Therefore, these features of the proposed protocol might be significantly scalable rather than those of the protocols guaranteeing atomic order dependencies between multicast messages by hierarchical membership list of dedicated groups like traditional committee protocols and much stronger rather than fully decentralized protocols guaranteeing dependencies between multicast messages based on only local views. And the proposed protocol is a hybrid approach improving the inherent scalability of multicast nature by gossip-based technique in all communications.

• ETRI Journal
• /
• v.22 no.4
• /
• pp.1-12
• /
• 2000

Designing a reliable multicast-based network that scales to the size of a multicast group member is difficult because of the diversity of user demands. The loss inferences of internal nodes by end-to-end measurements do not require the use of complete statistics because of the use of maximum likelihood estimation. These schemes are very efficient and the inferred value converges fast to its true value. In the theoretical analysis, internal delay estimation is possible but the analysis is very complex due to the continuity property of the delay. In this paper, we propose the use of a bottleneck location estimator. This can overcome the analytical difficulty of the delay estimation using the power spectrum of the packet interarrival time as the performance metric. Both theoretical analysis and simulation results show that the proposed scheme can be used for bottleneck location inference of internal links in scalable multicasting.

• Annual Conference of KIPS
• /
• 2002.11b
• /
• pp.1563-1566
• /
• 2002

차세대 기술 기반의 네트워크에서는 불필요한 트래픽을 줄여 인프라를 효율적으로 사용할 수 있는 멀티캐스트 기술이 널리 사용될 것이다. 연구 시험망 단계에 머물고 있는 현 시점에서 멀티캐스트 네트워크에 대한 성능 분석 소프트웨어가 부족하다. 본 논문에서는 멀티캐스트 기반 그룹간 회의를 위한 AccessGrid를 위해 개발된 NLANR Beacon을 바탕으로 타임시리즈 데이터를 보여주는 성능 분석 소프트웨어를 개발하여 차세대 초고속 연구망인 KREONet2에 적용한 사례를 기술하고 측정된 결과를 분석하여 개발된 소프트웨어의 발진 가능성을 보여 주었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.926-938
• /
• 1996

In this paper, we proposed a new multicast algorithm which is efficiently applicable to overlapped process group environments where one process may be involved in several process groups. Unlike the esisting algorithms, the proposed one provides an efficient group communication mechanism by generating the processgroup information in two-level tree. Using this algorithm, we improved the shortcoming of the existing algorithms by reducing the overhead in passing through unnecessary processes for message ordering. We have provided the causal ordering method as well as the total ordering method in group communication environments. As a result, we allow one process to deliver message to other processes with a short delay time, and reduced the overhead required for the message ordering. Also, we logically proved the proposed causal ordering method, and compared the performance of the proposed algorithm with ones of other existing algorithms by computer simulation.