• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.17-27
• /
• 2012

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. This paper explores the issue of designing proper data allocation on multiple broadcast channels to reduce this wait time, and proposes a new data allocation scheme named near optimal data allocation(NODA). The proposed scheme first partitions all data items in K group based on the theoretical lower-bound of the average expected delay to determine data items which each broadcast channel has to broadcast. Then, NODA further partitions each group of data items in B groups using extended dynamic programming algorithm to broadcast data items allocated on the same broadcast channel in different frequencies. The proposed scheme is capable of minimizing the average expected delay time since it can broadcast data items allocated on the same channel reflecting their popularities.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.190-192
• /
• 2005

PKI(Public Key Infrastructure)에서 인증서 상태 검증은 네트워크 환경에서의 거래에 신뢰성과 안전성 및 기밀성, 무결성 등의 서비스를 제공한다. 인증서 검증 방식은 CRL, OCSP, SCVP, DVCS 등이 있다. CRL은 시간이 지남에 따라 CRL의 크기가 증가하여 검증 시간이 지연되고 실시간 검증을 할 수 없는 단점을 가지고 있다. OCSP는 CRL을 이용하지 않고 거의 실시간에 가깝게 인증서를 검증하지만 서버의 부하 증가와 느린 검증 등의 단점을 가지고 있다. 분산 OCSP는 OCSP 서버를 분산시킨 후 CRL을 중복하여 보관하거나 분개하여 보관한 상태에서 검증하는 방식으로 대리검증에 따른 느린 검증과 CA의 부하부담 등의 단점을 가지고 있다. 본 논문에서는 제기된 단점들을 해결하여 빠른 검증과 부하 분산 효과를 얻을 수 있도록 분산된 OCSP 서버를 그룹으로 분류하고, 그룹 내의 각 서버에 인증서 폐지 정보를 중복 저장하여 부하분산, 빠른 검증, CRL을 Delta CRL 방식으로 OCSP 서버에 전송하여 네트워크 부하를 감소할 수 있도록 그룹 분산 OCSP 방식을 제안하고자 한다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.04a
• /
• pp.344-348
• /
• 1998

이동 컴퓨팅 환경은 휴대용 컴퓨터의 위치에 관계없이 무선 전송 링크를 통하여 단절이 없이 네트워크 접속을 유지할 수 있는 새로운 컴퓨팅 모델로 중요성이 매우 부각되고 있는 실정이다. 본 논문에서는 이동 컴퓨팅 환경에서 멀티캐스트 그룹에 속한 이동 호스트들에게 호스트의 위치에 관계없이 효율적으로 패킷을 전송하는 이동 멀티캐스트 프로토콜을 제시한다. 본 논문에서 제시한 3-계층 이동 컴퓨팅 환경에서 멀티캐스트 패킷 전송을 위한 연결 관리 기법은 멀티캐스트 그룹에 속한 호스트의 이동으로 인한 가입지연 시간은 조금 증가하지만 Handoff 수를 크게 줄일 수 있어 전체적인 Throughput을 향상시킬 수 있다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.52-59
• /
• 2008

Most pier performance analysis results for ad-hoc routing protocols have been based upon the model which each node in the network moves independently without restriction. In most real environments, however, it is very common for a group or multiple groups to move under the direction of group leader or group leaders instead of each node's independent movement. This paper presents the performance analysis of routing protocols for mobile ad-hoc network under group mobility environment. The comparative simulations have been made between a table-driven protocol, DSDV, and two on-demand protocols, AODV and DSR, under a group mobility model, RPGM, which is suitable for the practical applications such as military tactical operation. Multiple group movements are also included. The results show that the protocol performances for single group movement are very similar to node independent movement case. However some differences have been observed by varying pause time and connectivity.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.115-121
• /
• 2009

In this paper, we propose an algorithm that reduces channel change delay time in the P2P based IPTV system. Channel change delay time is considered to be one of the most important performance measures in IPTV system. Proposed algorithm presents a method to reduce the channel change delay time effectively. The algorithm eliminates the first channel change delay time and reduces delay time on a continuous channel surfing. We will show the mathematical models to evaluate the performance of proposed scheme with respect to the channel change delay time.

• Journal of Dental Rehabilitation and Applied Science
• /
• v.29 no.1
• /
• pp.23-36
• /
• 2013

To evaluate the 3-dimensional features of the grafted bone with maxillary sinus augmentation and to assess the relation between the degree of bone resorption and the type of bone grafting source and implant, and the operation method. A retrospective chart review of patients receiving sinus augmentation procedures for implant positioning was conducted: radiographic analysis of the volume and area of bone grafts was performed. The volumetric remodeling.measured at 6 months after implant positioning as the percentage of residual bone graft.was correlated to type of graft materials and operation methods. 53 dental implants positioned with sinus bone graft in 15 patients at Wonkwang University Sanbon Dental Hospital. Computed tomography scans,taken implant positioning after 6 months, showed greater resorption values for the group of $Puros^{(R)}$ graft alone from the group of mixed with $Puros^{(R)}$ and various bone graft (P<0.05, respectively). And resorption values according to operation methods have statistically significant difference(P<0.05). Volume change ratio of bone graft showed greater values for the group of delayed implant position from the group of simultaneously implant placement with bone graft. Retrospective data analysis shows that the method of graft with $Puros^{(R)}$ alone may occur greater resorption of graft materials than mixed graft material with $Puros^{(R)}$ and other graft materials. The group of simultaneously implant placement with bone graft also display smaller resorption ratio of bone graft than the group of delayed implant placement.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.4
• /
• pp.929-935
• /
• 2008

As internet telephony services based on Session initiation Protocol (SIP) enter the spotlight as marketable technology, many products based on SIPs have been developed and utilized for home and office telephony services. The call connection of an internet phone is classified into specific call connections and group call connections. Group call connections have a forking function which delivers the message to all of the group members. This function requires excessive message control for a call connection and creates heavy traffic in the network. In the internet cail system model. most of the call-setup messages are directed to the proxy server during a short time period. This heavy message load brings an unwanted delay in message processing and. as a result, call setup can not be made. To solve the delay problem, we simplified the analysis of the call-setup message in the proxy server, and processed the forking function distributed for the group call-setup message. In this thesis, a new system model to minimize the load is proposed and the subsequent implementation of this model demonstrates the performance improvement.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.88-97
• /
• 2000

Applied with multicast transmission techniques in mobile computing environments, a mobile host will experience join and graft delay, happened when a host wants to join a multicast group in the fixed network, if there are no same multicast group member in the new cell the mobile host enters. Due to low bandwidth and higher error rate, there happens many additional traffic. In this paper, we propose a pre-join technique which new mobile support station joins the multicast group in advance based on signal strength hint in the current cell. We use the multiple level acknowledgement strategy that executes acknowledgment separately between the fixed part and the wireless transmission path. Using our strategy, it is an efficient technique in case there are more cells that has no multicast group members and less mobile host movements.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.14 no.1
• /
• pp.98-103
• /
• 2021

In this study, we propose a group communication technique that guarantees security and expandability by configuring a network consisting of IoT terminals equipped with security functions. As the number of devices participating in the network increases, network resources are proportionally reduced, and adding a security function to the IoT device increases the delay time due to encryption in the IoT device. If the error rate that occurs in the network increases, network resources are quickly consumed due to retransmission. Therefore, IoT terminals are grouped to ensure scalability while supporting security, reducing the consumption of network resources even when the number of participating nodes increases, thus ensuring scalability. For the future implementation, the encryption method used in IoT terminals considered the standard of IEEE802.5.4, and the standardization trend was investigated and classified. The proposed method applies IoT devices that provide security functions of the IEEE802.5.4 standard to the group communication base to ensure reliability and scalability. In the performance evaluation, the effectiveness of the proposed method was confirmed by comparing the delay times when grouping IoT devices with security functions through simulation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.1
• /
• pp.436-444
• /
• 2011

As practical use degree of multicasting increase, security for multicast is recognized as an important issue. Previous research in the area of secure multicast has mainly focused on group key management. The most important thing about the security of multicast is that only authorized members of this group will be able to access the data. The member of access to multicast communication is to use cryptography with a common shared session encryption key. We propose decentralized group key management based on agent for dynamic multicast with large groups and frequent joins or leaves in this paper. Whole group divide to several subgroup using agent technology and each agent manage members of each subgroup. Also, when rekeying updates that using one-way hash function can prevent the key exposure, and reduce the key distribution delay.