• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.451-453
• /
• 1999

멀티미디어 멀티캐스트에서의 통신 관리를 위한 기존의 많은 방법들은 인터넷이나 ATM망 같은 특정 전송환경에 의존적이었고, 효율적인 통신 관리 메카니즘이 부족했다. 본 논문에서는 다양한 멀티미디어 멀티캐스트 어플리케이션에 적용될 수 있는 유연하고 확장 가능한 통신 관리 구조를 정의한다. 이 구조는 제어와 터미널의 분리를 통해 원격제어 및 이동 제어가 가능하게 함으로서 다양한 방법으로 서비스를 이용할 수 있는 환경을 제공하며, 호 제어와 연결 제어를 분리하여 연결자원의 효율적인 사용을 가능케 했으며, 연결제어를 위해 기존의 프로토콜의 접합을 사용함으로서 네트워크 환경에 독립적인 환경을 제공할 수 있고, 기존 전송 네트워크의 최소한의 수정 및 구조의 실용성 증가를 기대할 수 있다.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.3
• /
• pp.43-51
• /
• 2017

MANET consists of only wireless nodes having limited processing capability. It processes routing and data transmission through cooperation among each other. And it is exposed to many attack threats due to the dynamic topology by movement of nodes and multi-hop communication. Therefore, the reliability of transmitted data between nodes must be improved and security of integrity must be high. In this paper, we propose a method to increase the reliability of transmitted data by providing a secure cryptography protocol. The proposed method used a hierarchical structure to provide smooth cryptographic services. The cluster authentication node issues the cluster authentication key pair and unique key to the nodes. The nodes performs the encryption through two steps of encryption using cluster public key and block encryption using unique key. Because of this, the robustness against data forgery attacks was heightened. The superior performance of the proposed method can be confirmed through comparative experiment with the existing security routing method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.400-402
• /
• 2001

그룹 통신에서는 일대일 통신과는 달리 통신에 참여하고 있는 참여자들에 대한 관리가 필요하다. 이러한 참여자 관리는 참여자들의 정보, 현재 상태 등을 체크하는 기능이 필요하며 이러한 참여자들의 정보 및 상태를 멤버쉽이라고 부른다. 본 논문에서는 이러한 참여자들의 멤버쉽을 관리하고 유지하는 멤버쉽 관리 프로토콜(MMP Membership Management Protocol)을 설계하였다. MMP는 서버/클라이언트 기반으로 동작하며, 서버가 모든 클라이언트들의 멤버쉽을 관리한다. 클라이언트는 주기적으로 서버에게 자신의 상태를 보고하고, 멤버쉽 갱신을 원할 경우 서버에게 요청한다. 설계된 MMP는 알고리즘이 간단하기 때문에 그룹 통신에서 간단하고 효율적인 멤버쉽 관리를 할 수 있으며, 서버가 모든 멤버쉽을 관리하기 때문에 송신자의 부담이 줄어든다.

• Annual Conference of KIPS
• /
• 2012.04a
• /
• pp.481-484
• /
• 2012

차로에서 차량의 많은 증가는 안전과 무선통신의 가용성에 대한 필요성을 높여 왔다. Vehicular ad hoc networks(VANETs)은 다양한 차량 어플리케이션을 위한 용도와 상용분야로의 개발을 점차적으로 해오고 있다. 차량 간의 효과적인 통신범위를 제공하기 위해서 최적화된 라우팅 프로토콜이 필요하다. 지금까지 목적지까지 최적의 경로를 찾는 mobile ad hoc networks(MANETs)를 위한 많은 기존의 프로토콜들이 존재한다. 본 논문에서는 두 개의 라우팅 프로토콜들을 비교함으로써 VANET 환경을 위한 프로토콜 개선방향을 제시하였다. Multicast Ad-hoc On-Demand Distance Vector(MAODV)[1][2] 라우팅 프로토콜의 솔루션은 목적지 대상으로 최적의 경로를 탐색함으로써 더욱 향상된 결과를 보여준다. NS-2[3]는 라우팅 프로토콜 실험을 수행하고 결과를 도출하는데 사용되어 왔다. 실험을 통하여 최적의 라우팅 프로토콜에 대한 연구방향 및 개선될 사항을 찾고자 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.5
• /
• pp.1735-1754
• /
• 2022

The reliability and performance of WiFi need optimization because of the rising number of WiFi users day by day. A highlighted point is saving power while transmitting and receiving packets using WiFi devices. Wake-on-Wlan (WoW) is also implemented to improve energy consumption, but it also needs betterment. This paper will introduce universal ideas to transmit and receive packets using low-power technology like Bluetooth or BLE (Bluetooth low energy). While looking for power-saving ways in this research, WiFi connection and maintenance also take care using lesser power-consuming technology. Identifying different use-cases where low power technology can help save energy and maintain 802.11 connection is part of the research. In addition, the proposed method discuss energy saving with unicast and broadcast/multicast data. Calculation of power-saving and comparison with standalone WiFi usage clearly shows the effectiveness of the proposed method.

• International journal of advanced smart convergence
• /
• v.12 no.2
• /
• pp.173-181
• /
• 2023

Data collection is an essential element in the construction and operation of a smart factory. The quality of data collection is greatly influenced by network conditions, and existing wireless network systems for IoT inevitably lose data due to wireless signal strength. This data loss has contributed to increased system instability due to misinformation based on incorrect data. In this study, I designed a distributed MQTT IoT smart sensor and gateway structure that supports wireless multicasting for smooth sensor data collection. Through this, it was possible to derive significant results in the service latency and data loss rate of packets even in a wireless environment, unlike the MQTT QoS-based system. Therefore, through this study, it will be possible to implement a data collection management system optimized for the domestic smart factory manufacturing environment that can prevent data loss and delay due to abnormal data generation and minimize the input of management personnel.

• Journal of Internet Computing and Services
• /
• v.3 no.1
• /
• pp.81-90
• /
• 2002

Large-scale distributed applications based on Internet and client/server applications have to deal with series of problems. Load balancing, unpredictable communication delays, and networking failures can be the example of the series of problems. Therefore. sophisticated applications such as teleconferencing, video-on-demand, and concurrent software engineering require an abstracted group communication, CORBA does not address these paradigms adequately. It mainly deals with point-to-point communication and does not support the development of reliable applications that include predictable behavior in distributed systems. In this paper, we present our design, implementation and performance analysis of the group communication using the CORBA-ORB. JAVA-RML and Socket based on distributed computing Performance analysis will be estimated latency-lime according to object increment, in case of group communication using ORB of CORBA the average is 14.5172msec, in case of group communication using RMI of Java the average is 21.4085msec, in case of group communication using socket the average is becoming 18.0714msec. Each group communication using multicast and UDP can be estimated 0.2735msec and 0.2157msec. The performance of the CORBA-ORB group communication is increased because of the increased object by the result of this research. This study can be applied to the fault-tolerant client/server system, group-ware. text retrieval system, and financial information systems.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.502-512
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1320-1332
• /
• 1998

We propose Multiph which is a virtual topology for a reliable group communication platform on dynamic high speed network. We also define group communication primitives for transmission of messages and group management. Multiph consists of a set of nodes which are process groups and a set of edges which are the connection between nodes providing the route of messages. Processes can send and receive messages overlapped in a several multicast groups. Overlapped process organizes non-overlapped logical group, which called meta-group. Multiph guarantees ordering of messages that received at the destination group. It has no extra node that decreases system performance. Although the group has dynamic group change to leave and add process, it does not reconstruct the existing platform structure.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.500-500
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.