• Title/Summary/Keyword: 그룹원

Search Result 1,144, Processing Time 0.028 seconds

An Efficient Multicast Routing Protocol for Ad-Hoc Networks with Mobility (이동성이 큰 에드-혹 네트워크를 위한 효율적인 멀티캐스트 라우팅 프로토콜)

  • Kim, Ye-Gyeong;Lee, Mi-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.1
    • /
    • pp.143-153
    • /
    • 2001
  • 본 논문에서는 에드-혹 망의 멀티캐스트 라우팅 프로토콜인 ODMRP(On-Demand Multicast Routing Protocol)를 확장한 PatchODMRP를 제안한다. ODMRP는 네트워크 상에서 멀티캐스트그룹의 송신원으로부터 수신원에 이르는 경로 상에 있는 노드들을 FG(Forwarding Group) 노드로 선출하여 이들이 해당 멀티캐스트그룹에 속하는 패킷을 모두 플러딩하도록 함으로써 멀티캐스트 그룹데이타 전송을 담당하는 메쉬를 구성하도록 하는 방안이다. 그런데 ODMRP는 주기적으로 이 메쉬를 구성하는 FG 노드들을 재 선정하기 때문에 이 주기가 길어지면 메쉬 구성이 네트워크 노드들의 이동성을 따라가지 못해 메쉬분리가 발생하고 데이터가 손실될수 있다. 반면에 이 주기를 짧게 하면 오버헤드가 지나치게 커질수 있다. 특히 송신원의 수가 적은 경우 ODMRP의 메쉬는 매우 성기게 형성되는데 이때 호스트들의 이동성이 크면 메쉬 연결을 유지하기 위하여 이 주기를 짧게 잡아주거나 높은 데이터 손실율을 감수해야한다. 본 논문에서는 이 문제점을 해결하고자 각 FG 노드들이 BEACON 신호를 이용해 자신에 인접한 메쉬에 손실이 발생한 것을 인지하고 이를 국부적인 플러딩을 통하여 빠르게 복구하는 메커니즘을 ODMRP에 추가한 PatchODMRP 방식을 제안한다. 시뮬레이션을 통하여 기존의 ODMRP와 제안하는 PatchODMRP의 성능을 비교한 결과 PatchODMRP가 호스트의 이동성에 훨씬 강하며 ODMRP에 비하여 낮은 오버헤드로 높은 데이터 전송률을 제공할 수 있음을 보여주었다.

  • PDF

Dominant Source Based Tree for Dynamic Multicasting (동적 멀티캐스트를 위한 주 송신원 기탄 트리)

  • 남홍순;김대영;이규욱
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.6
    • /
    • pp.633-642
    • /
    • 2000
  • This paper proposes a dominant source-based tree (DSBT) that constructs a localized multicast routing tree for dynamic multicasting without rerouting. To constrain end-to-end delays a multicast tree needs to be reconstructed when a new node joins the group due to additive tree constraint. In DSBT, a multicast group G is expressed by a (DS, NCM) pair, where DS is a dominant source address and NCM is a normalized cost margin. A node wishing to participate in a group selects a path that complies with NCM toward DS such that the end-to-end cost is constrained without any rerouting. Simulation results show that the proposed method performed better in terms of the overall tree cost compared with the Nave algorithm and in terms of the end-to-end delays between any two members compared with the Greedy algorithm.

  • PDF

업계탐방 - 금호아시아나 인재개발원

  • O, Jeong-Gyu
    • 방재와보험
    • /
    • s.115
    • /
    • pp.64-66
    • /
    • 2006
  • 이번 탐방은 그룹의 경영이념과 전략에 대한 심도 있는 연구를 통해 임직원들이 급변하는 경영환경에 대응할 수 있는 능력을 배양하도록, 지식경영의 핵심요새로 자리매김하고 있는 금호 아시아나 인재개발원을 방문하였다. 경기도 용인시 처인구 양지면 대대리에 위치한 인재개발원은 국내 유명골프장 중의 하나인 아시아나 컨트리클럽과도 인접해 있어 아름다운 숲의 전경이 한눈에 내려다보이는 탁 트인 전망과 맑은 공기, 빼어난 경관을 자랑한다.

  • PDF

Tree-based Group Key Agreement Protocol using Pairing (Pairing을 이용한 트리 기반 그룹키 합의 프로토콜)

  • 이상원;천정희;김용대
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.13 no.3
    • /
    • pp.101-110
    • /
    • 2003
  • Secure and reliable group communication is an increasingly active research area prompted by the growing popularity of many types of group-oriented and collaborative applications. The central challenge is secure and efficient group key management. While centralized methods are often appropriate for key distribution in large multicast-style groups, many collaborative group settings require distributed key agreement techniques. Most of prior group key agreement protocols have been focused on reducing the computational costs. One exception is STR protocol that optimizes communicational cost. On the other hand, it requires O(n) number of modular exponentiations. In this paper, we propose a new group key agreement protocol that modifies STR protocol by utilizing pairing based cryptography. The resulting protocol reduces computational cost of STR protocol while preserving the communication cost.

A Cognitive Evaluation Technique for Group Tasks (그룹 과업의 인지적 분석 방안)

  • 민대환;정운형;김복렬
    • Journal of Information Technology Application
    • /
    • v.2 no.1
    • /
    • pp.139-160
    • /
    • 2000
  • This paper suggests a technique for evaluating cognitive process when a working group performs its group tasks. First, it review a theory of distributed cognition which provides a theoretical background for investigating group's cognitive process. Then, it presents a procedure for DGOMS(Distributed GOMS) evaluation which is an extension from GOMS. GOMS is an analytica evalutation technique that has been used at the individual level. DGOMS analyzes task completion time and compares workload among group members on the basis of each member's task execution time, communication time, and cognitive workload. DGOMS can be applied to a situation where a group of people are working together for a common goal using a technical subsystem such as information systems.

  • PDF

A Study on the New Code Grouping Interference Cancellation for WCDMA Systems (WCDMA 시스템을 위한 새로운 코드 그룹화 간섭제거기)

  • Kim, Nam-Sun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1A
    • /
    • pp.16-23
    • /
    • 2008
  • In this paper, we propose a new code grouping interference cancellation(IC) receiver for multirate wideband code division multiple access(WCDMA) system based on orthogonal variable spreading factor(OVSF) code. The users are assigned different lengths of OVSF codes as a spreading code according to their data rates and divide the active users having same representative code split into a group for effective cancellation. The code grouping IC receiver performs cancellation between the groups first and cancellation within group. This proposed IC receiver can cancel the interferences using desired user's code information and then desired signals are detected. The results show that the large improvement in performance can be attained by groupwise IC scheme and we can make the effective systems compare to conventional ones.

Group Key Management using (2,4)-Tree ((2,4)-트리를 이용한 그룹키 관리)

  • 조태남;이상호
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.11 no.4
    • /
    • pp.77-89
    • /
    • 2001
  • Recently, with the explosive growth of communication technologies, group oriented services such as teleconference and multi-player game are increasing. Access control to information is handled by secret communications with group keys shared among members, and efficient updating of group keys is vital to such secret communications of large and dynamic groups. In this paper, we employ (2,4)-tree as a key tree, which is one of height balanced trees, to reduce the number of key updates caused by join or leave of members. Especially, we use CBT(Core Based Tree) to gather network configurations of group members and reflect this information to key tree structure to update group keys efficiently when splitting or merging of subgroups occurs by network failure or recovery.

A study on the properties of SmBCO coated conductors with stabilizer tape (SmBCO 고온 초전도 선재의 안정화재 특성)

  • Kim, Tae-Hyung;Oh, Sang-Soo;Kim, Ho-Sup;Ko, Rock-Kil;Song, Kyu-Jeong;Ha, Hong-Soo;Lee, Nam-Jin;Park, Kyung-Chae;Ha, Dong-Woo
    • Progress in Superconductivity and Cryogenics
    • /
    • v.9 no.3
    • /
    • pp.9-12
    • /
    • 2007
  • In this study. we searched for the mechanical and electrical properties of laminated coated conductors with stabilizer tape. Stabilizer tape plays a role for mechanical and electrical stability and environmental protection. Cu material stabilizer was laminated to Ag capping layer on SmBCO conductor layer. This architecture allows the wire to meet operational requirements including the stressless at cryogenic temperature and winding tension as well as mechanical bending requirements including thermal and electrical stability under fault current conditions. First, we have experimentally studied mechanical bonding properties of the laminated Cu stabilizers on SmBCO coated conductors. We have laminated SmBCO coated conductors by continuous dipping soldering process, Second, we have investigated electrical properties of the SmBCO coated conductors with stabilizer lamination. We evaluated bonding properties, peeling strength and critical current for laminated SmBCO coated conductors with Cu stabilizers.

Analysis of Important of Port Selection Factors to Attract Shippers for Mokpo New Port (목포 신외항 선·화주 유치를 위한 항만선택 요인의 중요도 분석)

  • Son, Yoomi;Kim, Jihyun;Lee, Kyongseok;Kim, Hwayoung
    • Journal of Korea Port Economic Association
    • /
    • v.38 no.4
    • /
    • pp.199-214
    • /
    • 2022
  • A relative important analysis was conducted to determine what factors are required for port selection in Mokpo New Port and what needs to be addressed first in order to expand automobile and steel cargo handling. The port selection factors of Mokpo New Port were classified into 4 major and 13 intermediate categories, and AHP analysis was used. As a result, items such as 'port facilities', 'accessibility to international ports', 'port facility usage fees', and 'connectivity with neighboring cities/ports' were evaluated as important. The respondent groups were divided into shipowner and shipper, port operator and stevedore, and public official, and an analysis of variance (ANOVA) was conducted to verify if there was a difference in perception between the groups. As a result, shipowner and shipper, port operator and stevedore were similar, but there was a difference from public official group. Shipowner and shipper, port operator and stevedore with similar response characteristics were classified into the 'port practitioner' group, and public official were classified into the 'port policy maker' group, and the difference in perception between the group was tested. Therefore, there were differences in some major category items, and even in the intermediate category items such as 'possession of adjacent hinterland industrial complex', 'cargo equipment', '24-hour port operation', 'inland transportation cost', 'accessibility to international ports', 'marketing and incentives' with statistical. In other words, the 'port practitioner' group evaluated items that can increase cargo creation and handling productivity as important whereas the 'port policy maker' group considers port development and policies such as port infrastructure, connectivity with other ports, and incentive support items are more important.

A Logical Group Formation and Key Distribution Scheme in WSN (WSN 환경에서 논리적 그룹 형성과 키 분배 방법)

  • Lee, Jae-Won;Heo, Joon;Hong, Choong-Seon
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.4
    • /
    • pp.296-304
    • /
    • 2007
  • This paper deals with essentially secure group management and key transfer methods in a wireless sensor network environment. To provide an efficient security service to a widespread network with a large number of sensor nodes, the network has to be made up by several security groups, and Group Key distribution and group management are needed. In this paper we propose a mechanism for efficiently constructing and managing a security node by constructing a group using an algorithm to construct a logical group. Previous Group Key Transport method has special condition. When Base Station transports Group Key, all sensor nodes must share Secret Key with Base Station before it is intended to be deployed. Hence, we also propose a Key transport mechanism without sharing Secret Key between Base Station and sensor node.