• 스마트미디어저널
• /
• 제4권3호
• /
• pp.24-30
• /
• 2015

갑자기 마주친 응급상황에 대해 대부분의 사람들은 당황하게 되고, 신고 시 정확한 메시지 전달이 되지 않는 경우가 많다. 최근 일상화된 스마트 소프트웨어 환경에서 개인의 응급상황을 정확하고 구조화된 형태로 전송하여 최적의 서비스를 받을 수 있도록 하거나, 주위의 여타 응급상황에 실시간으로 대처할 수 있도록 하는 효율적인 응급 의료 서비스 시스템을 제공하는 것이 중요하다. 본 논문에서는 효율적이고 구조화된 응급의료 서비스를 제공할 수 있도록 빠르고 정확한 XML-기반 메시지 전송 기술에 대한 표준 프로토콜을 설계하고, 이를 이용하여 효율적이고도 신속하고, 정확한 처리를 할 수 있는 환경을 제공한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권12호
• /
• pp.3081-3099
• /
• 2012

We propose a new multipath-based reliable routing protocol on MANETs, Multipath-based Reliable routing protocol with Fast-Recovery of failures (MRFR). For reliable message transmission, MRFR tries to find the most reliable path between a source and a destination considering the end-to-end packet reception reliability of the routes. The established path consists of a primary path that is used to transmit messages, and the secondary paths that are used to recover the path when detecting failures on the primary path. After establishing the path, the source transmits messages through the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to locally recover the route failure, the proposed protocol can handle the dynamic topological change of the MANETs efficiently. The simulation result using the QualNet simulator shows that the MRFR protocol performs better than other protocols in terms of the end-to-end message delivery ratio and fault-tolerance capability.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권7호
• /
• pp.294-301
• /
• 2002

A new dynamic scheduling algorithm is proposed for CAN-based real-time system in this paper. The proposed algorithm is extended from an existing EDS(Earliest Deadline Scheduling) approach having a solution to the priority inversion. Using the proposed algorithm, the available bandwidth of network media can be checked dynamically, and consequently arbitration delay causing the miss of deadline can be avoided. Also, non-real time messages can be processed with their bandwidth allocation. Full network utilization and real-time transmission feasibility can be achieved through the algorithm. To evaluate the performance of algorithm, two simulation tests are performed. The first one is transmission data measurement per minute for periodic messages and the second one is feasibility in the system with both periodic messages and non-real time message.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.246-248
• /
• 2005

The Controller Area Network (CAN) is being widely used for real-time control application and small-scale distributed computer controller systems. However, CAN may exhibit unfair behavior under heavy traffic conditions. When there are both high and low priority messages ready for transmission, the proposed precedence priority filtering method allows one low priority message to be exchanged between any two adjacent higher priority messages. In this way, the length of each transmission delays is upper bounded. These procedures are implemented as local controllers for the ISHURO (Inha Semyung Humanoid RObot).

• 전자공학회논문지S
• /
• 제35S권4호
• /
• pp.30-39
• /
• 1998

Currently, LAMA(Local Automatic Message Accounting) is a billing mechanism which is being used for billing process, in which billing dat is written on MT(Magnetic Tape), collected at each regional billing center and then processed once a month. However, in order to prepare further development of telecommunication network and future new services, computerization of billing process and new daily billing processing system are urgently needed. Therefore Korea Telecom had developed a CAMA (Centralized Automatic Message Accounting) system for M10CN switch. In the CAMA system, billing data generated in switches is transfered on-line using approproate protocols and various transmission media and immediately processed. The CAMA system for M10CN switch consists of three parts such as ED (Extraction Device), TD(Transmission Device) and HC(Host Collector). The system also has redundancy to maintain continuance and confidence of system operation.

• 한국컴퓨터정보학회논문지
• /
• 제22권11호
• /
• pp.39-47
• /
• 2017

In this paper, we propose a message transmission processing structure for efficient use of radio resources. Existing tactical data links have more data and accumulate more data than the amount of tactical data planned according to the situation. This may result in delays in operations and additional problems. To prevent this, priority is assigned to the message and transmission is performed according to the priority on a single basis. And we design a processing structure that can update duplicate messages and delete old messages in order to prevent waste of radio resources. Experiments are conducted to verify that these structures can be implemented and applied to data links.

• 한국정보시스템학회지:정보시스템연구
• /
• 제8권1호
• /
• pp.109-129
• /
• 1999

This study deals with the problem of information dissemination in a communication network, which is defined to be the process whereby a set of messages, generated by an originator, is transmitted to all the members within the network. Since this type of message generally includes control data to manage the network or global information that all members should know, it is to be required to transmit it to all the members as soon as possible. In this study, it is assumed that a member can either transmit or receive a message and an informed member can transmit it to only one of its neighbors at time. This type of transmission is called 'local broadcasting' Several schemes of call sequencing are designed for a general-type network with nonuniform edge transmission times, and then computer simulations are performed. Some heuristics for information dissemination are proposed and tested. For this, optimal call sequence in a tree-type network, sequencing theory and graph theory are applied. The result shows that call sequencing based on the shortest path tree is the most desirable.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권2호
• /
• pp.440-456
• /
• 2011

In this paper, we introduce a novel Public Key Infrastructure (PKI) based message authentication scheme that takes advantage of temporal and spatial uniqueness in physical layer channel responses for each transmission pair in vehicular communication networks. The proposed scheme aims at achieving fast authentication and minimizing the packet transmission overhead without compromising the security requirements, in which most messages can be authenticated through an extreme fast physical-layer authentication mechanism. We will demonstrate that the proposed secure authentication scheme can achieve very short message delay and reduced communication overhead through extensive analysis and simulation.

• 한국ITS학회:학술대회논문집
• /
• 한국ITS학회 2010년도 춘계학술대회
• /
• pp.1-4
• /
• 2010

• 한국콘텐츠학회논문지
• /
• 제8권10호
• /
• pp.37-44
• /
• 2008

논문은 암호문 송신 중 전송 오류에 의한 암복호화의 문제에 대한 해결책을 제시 한다. 블록 암호 알고리즘은 산사태(avalanche) 효과로 인해 단일 비트 오류에 대해서도 많은 비트에 오류를 발생시킨다. 이를 해결하기 위해 재배열 과정과 간단한 오류 정정 코드를 이용해서 산사태(avalanche) 효과에 강인한 방안을 제안한다. 재배열 과정은 간단한 오류 정정 코드를 사용하기 위한 것이다. 재배열 과정은 한 프레임 내에서 전송의 기본 단위인 n-비트 블록 내에 1비트의 단일 오류만이 존재 할 수 있도록 오류를 여러 단위에 분산시키는 역할을 하게 된다. 즉, n-비트 내에서 단일 오류만이 존재하게 되어 단일 오류 정정 코드로 쉽게 복원이 가능하게 된다. 이 방식은 보다 큰 데이터 단위에 확장하여 사용 될 수 있다.