• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.1
• /
• pp.8-14
• /
• 2003

In this paper, we investigate a rekey mechanism for a secure multicast group communications and relate the mechanism to the loss of information from group key exposal. We also combine cost for the information loss and cost for group key updates and analyze the optimum rekey interval. Using the results of the analysis in this paper, we can manage a secure multicast group efficiently with the minimal cost on the bases of number of group members, each member's security level and withdrawal rates.

• Electronics and Telecommunications Trends
• /
• v.19 no.1 s.85
• /
• pp.43-51
• /
• 2004

IPv6 프리픽스를 자동으로 할당 받기 위한 메커니즘으로 IETF 워킹그룹을 중심으로 DHCPv6 프리픽스 옵션을 이용한 방식과, APD 기술을 이용한 방식으로 나눌 수 있다. 본 고에서는 IPv6 네트워크 환경에서 라우터의 프리픽스 할당 및 플러그 앤 플레이 기능을 지원하는 DHCPv6 프리픽스 옵션을 이용한 기술을 중심으로 현재 표준화 동향 및 프로토콜 동작과정에 대해서 살펴보고자 한다.

• Journal of Broadcast Engineering
• /
• v.15 no.3
• /
• pp.407-413
• /
• 2010

In DCA (Dynamic Channel Allocation) scheme of uplink cellular system appling a frequency reuse factor of one, when a new call requests a channel, the new call will be blocked if its SINR (Carrier to Noise and Interference Ratio) is less than the required SINR or there is no available channel. The additional channel allocation for the blocked new call can be performed with channel borrowing in the adjacent cells. The channel borrowing causes the CCI (Co-Channel Interference), thus the SINR of the existing calls is deteriorated and the channel reallocation for the existing calls is required. As a result, the channel borrowing leads to a complex calculation so that it is a NP-hard problem. Therefore, to overcome the problem, we propose a novel Group Search-based DCA scheme which decreases the number of the blocked new calls and then reduces the number of the channel reallocation by the channel borrowing for the blocked new calls. The proposed scheme searches the all channels in a group of the adjacent cells and home cell at the same time in order to minimizes the number of the blocked new calls. The simulation results show that proposed Group Search-based DCA scheme provides better new call blocking probability and system throughput than the existing Single Search-based DCA scheme which searches only the channels in home cell.

• 한국IT서비스학회:학술대회논문집
• /
• 2010.05a
• /
• pp.202-206
• /
• 2010

무선 메쉬 네트워크(Wireless Mesh Network, WMN)는 유비쿼터스 환경 및 무선 브로드 밴드 액세스를 제공하기 위한 차세대 핵심기술로 떠오르고 있다. 다양한 멀티미디어 서비스가 존재하는 유비쿼터스 환경에서 실시간 서비스 제공을 위해서는 네트워크 용량 증대가 요구되며, 이를 위하여 WMN에서 네트워크 용량을 증대시키기 위한 다중 인터페이스 활용 기술이 중요한 이슈로 대두되고 있다. 하지만 WMN에서 주로 사용하는 인터페이스 기술인 IEEE 802.11 표준에서는 IEEE 802.11b/g 또는 IEEE 802.11a와 같은 스펙에 따라 간섭 없이 사용할 수 있는 채널은 3개 또는 12개로 한정되어 있기 때문에 다중 인터페이스 활용을 통해 증대된 가용 자원 효율성을 극대화하기 위해서 효율적인 채널 할당 기법의 연구가 요구되며, 이에 따라 본 논문에서는 채널 그룹 설정을 통하여 간섭 발생을 최소화하며 채널스캐닝 과정을 수행하지 않고 채널 변경을 진행함으로써 채널 스캐닝 과정으로 발생하는 전송 지연을 최소화하여 네트워크 성능을 향상시킬 수 있는 채널 할당 기법을 제안한다.

• Journal of IKEEE
• /
• v.1 no.1 s.1
• /
• pp.31-46
• /
• 1997

In this paper, a parallel Optimal Best-First search Branch-and-Bound(B&B) algorithm(pobs) is designed and evaluated for MIN-based multiprocessor systems. The proposed algorithm decomposes a problem into G subproblems, where each subproblem is processed on a group of P processors. Each processor group uses tile sub-Global Best-First search technique to find a local solution. The local solutions are broadcasted through the network to compute the global solution. This broadcast provides not only the comparison of G local solutions but also the load balancing among the processor groups. A performance analysis is then conducted to estimate the speed-up of the proposed parallel B&B algorithm. The analytical model is developed based on the probabilistic properties of the B&B algorithm. It considers both the computation time and communication overheads to evaluate the realistic performance of the algorithm under the parallel processing environment. In order to validate the proposed evaluation model, the simulation of the parallel B&B algorithm on a MIN-based system is carried out at the same time. The results from both analysis and simulation match closely. It is also shown that the proposed Optimal Best-First search B&B algorithm performs better than other reported schemes with its various advantageous features such as: less subproblem evaluations, prefer load balancing, and limited scope of remote communication.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.4
• /
• pp.1581-1589
• /
• 2013

The aim of this study is to suggest a methodology for calculating the peak-hour ratio of passengers at urban railway stations by reflecting the characteristics of passenger demand patterns and the land use inventory of stations. To achieve this, urban railway stations in Seoul are divided into three groups by using factor analysis and cluster analysis. For each station group, we calculate five and four variables related to the passenger demand patterns and the land use inventory of stations, respectively, as well as the peak-hour ratios of passengers. Among these nine variables, average daily passengers and the location quotient (LQ) index for business services are selected as the classification criteria for station groups based on statistical tests. Using the two variables, a group allocation process is suggested to estimate the peak-hour ratio of passengers for a newly-constructed station. Evaluation results based on thirteen stations show that the proposed methodology produces lower errors than the currently-used guideline does. The results of this study contribute to establishing efficiently construction and operation plans for newly-constructed stations.

• Journal of Software Engineering Society
• /
• v.26 no.4
• /
• pp.77-92
• /
• 2013

To plan a software project, the manager (1)make a work breakdown structure (WBS), (2) estimate efforts for each task, (3) assign employee to each task, and (4) estimate overall schedule. When software project becomes complicated, the possible combination of WBS, effort, and employee assignments dramatically becomes larger. Software planning tool can help software project managers to deal with this complexity. In this research, we discuss with a group of experts who work in software industry, to elicit practical requirements that should be considered in the software planning technique. Considering these requirements, we develop a software project planning tool APP (Automatic Project Planner) which provide effort estimation based on historical knowledge data and automatic human resource allocation. Our technique can be the basis of reasonable and practical software project planing.

• Journal of Broadcast Engineering
• /
• v.27 no.2
• /
• pp.216-227
• /
• 2022

The MPEG-I (Immersive) group is working on a standardization project for immersive video that provides 6 degrees of freedom (6DoF). The MPEG Immersion Video (MIV) standard technology is intended to provide limited 6DoF based on depth map-based image rendering (DIBR) technique. Many efficient coding methods have been suggested for MIV, but efficient transmission strategies have received little attention in MPEG-I. This paper proposes group-based adaptive rendering method for immersive video streaming. Each group can be transmitted independently using group-based encoding, enabling adaptive transmission depending on the user's viewport. In the rendering process, the proposed method derives weights of group for view synthesis and allocate high quality bitstream according to a given viewport. The proposed method is implemented through the Test Model for Immersive Video (TMIV) test model. The proposed method demonstrates 17.0% Bjontegaard-delta rate (BD-rate) savings on the peak signalto-noise ratio (PSNR) and 14.6% on the Immersive Video PSNR(IV-PSNR) in terms of various end-to-end evaluation metrics in the experiment.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.4
• /
• pp.19-25
• /
• 2010

In this paper, the performance of the DoS information security algorithm is evaluated to provide the multimedia traffic between the nodes using the multicasting services. The essence technology for information security to distribute the multimedia contents is presented. Under the multicasting services, a node participating new group needs a new address and the node compares the collision with the existing nodes, then DoS attack can be occurred between the nodes by a malicious node. Using the NS2 simulator, the number of DoS attacks, the average number of trials to generate new address, and the average time to create address are analyzed. From simulation results, the efficient algorithm with relevant random number design according to the DRM network is needed to provide secure multimedia contents distribution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.24-33
• /
• 2002

The cell search scheme for W-CDMA consists of the following three stages: slot synchronization(1st stage), group identification and frame boundary detection(2nd stage), and long code identification(3rd stage). The performance of the cell search when a mobile station is switched on, which is referred to as initial cell search, is decreased by the initial frequency and timing error. In this paper, we propose the pipeline structured initial cell search scheme using time trackers to compensate for the impact of the initial timing error in the stage 2 and stage 3. The simulation results show that the performance of the proposed scheme is maximal 1.5dB better than that of the conventional one when the initial timing error is near ${\pm}T_c$/2.