• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.143-158
• /
• 1994

X.435 is the EDI communication protocol published by CCITT and ISO/IEC in 1990. The message types and abstract services of EDI-MS are specified in X.435 recommendation. In this paper, the design methodology on implementation of MSIB in the case that MHS-MS is required to be extended into EDI-MS has been studied. The design methodology presented in this paper is the one using the mapping function of the object relation. This methodology considers the EDI message types and characterictics. The proposed design methodology han an advantage that is able to design the component tables of MSIB satisfying the third normal form and it does not require the normalization processing. The MSIB constructed by the proposed method can store and retrieve multi-values efficiently.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.1003-1019
• /
• 2019

Threshold ring signature scheme enables any t entities from N ring members to spontaneously generate a publicly verifiable t-out-of-N signature anonymously. The verifier is convinced that the signature is indeed generated by at least t users from the claimed group, but he cannot tell them apart. Threshold ring signatures are significant for ad-hoc groups such as mobile ad-hoc networks. Based on the lattice-based ring signature proposed by Melchor et al. at AFRICRYPT'13, this work presents a lattice-based threshold ring signature scheme, employing the technique of message block sharing proposed by Choi and Kim. Besides, in order to avoid the system parameter setup problems, we proposed a message processing technique called "pad-then-permute", to pre-process the message before blocking the message, thus making the threshold ring signature scheme more flexible. Our threshold ring signature scheme has several advantages: inherits the quantum immunity from the lattice structure; has considerably short signature and almost no signature size increase with the threshold value; provable to be correct, efficient, indistinguishable source hiding, and unforgeable.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.7
• /
• pp.1018-1027
• /
• 1993

In this thesis, we evaluate the performance of the TDX-IB/ISDN Switching System ISS (ISDN Subscriber Subsystem) which is the ISDN user-network interface module. For this evaluation, performance indices are established and major performance parameters which influence message processing are extracted by studying the ISS structure and mechanism. To reflect these parameters, simulation model is developed and simulated. From the result of maximum throughput, message delay time, etc. , ISS message processing capability is evaluated and several method to enhance the system performance is proposed, by analyzing the system bottleneck element.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.909-937
• /
• 2011

Energy efficiency is one of the most critical issues in the design of wireless sensor networks. In object-tracking sensor networks, the data storage and query processing should be energy-conserving by decreasing the message complexity. In this paper, a Prediction-based Energy-conserving Approximate StoragE schema (P-EASE) is proposed, which can reduce the query error of EASE by changing its approximate area and adopting predicting model without increasing the cost. In addition, focusing on reducing the unnecessary querying messages, P-EASE enables an optimal query algorithm to taking into consideration to query the proper storage node, i.e., the nearer storage node of the centric storage node and local storage node. The theoretical analysis illuminates the correctness and efficiency of the P-EASE. Simulation experiments are conducted under semi-random walk and random waypoint mobility. Compared to EASE, P-EASE performs better at the query error, message complexity, total energy consumption and hotspot energy consumption. Results have shown that P-EASE is more energy-conserving and has higher location precision than EASE.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.991-994
• /
• 2003

본 논문에서는 이동 컴퓨팅 시스템 간 분산응용 프로그래밍을 위한 Smart Message(SM) 메커니즘을 이용하여, 애드혹 네트워크와 유선망과의 유동적 연결 방법을 제안한다. 네트워크연동 아키텍처에 응용되는 기술들은 애드혹 네트워크, Mobile-IP, Smart Message 아키텍처 등이 있다. 애드혹 네트워크는 라우팅 장비 없이 각각의 무선 노드들로써 구성되는 네트워크로서 각 노드들은 각기 라우팅 기능과 호스트 기능을 수행한다. Mobile-IP는 무선노드들이 유선망과의 연결을 위한 IP의 확장 프로토콜이다. 본 논문은 애드혹 네트워크 내의 일부 이동 노드가 유선망의 에이전트에 접속 할 수 없을 시에, 해당 유선망의 에이전트에 접속할 수 있는 애드혹 네트워크에 소속된 노드를 대표 노드로 지정하여, 그 대표노드를 통해 유선망에 접속하는 방안을 제시한다. 애드혹 네트워크상의 분산 애플리케이션 개발을 위한 프로그래밍 아키텍처인 SM은 본 논문에서 제안하고자 하는 유연한 라우팅을 구현하기 위해 응용된다. 또한 대표노드를 통한 간접적 접속 방안의 장단점을 전송오버헤드, 네트워킹 비용 등의 관점에서 분석하고, 최적의 유무선 네트워크 연동에 관련된 프로토타입 구현을 위한 방향을 제시한다.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.406-416
• /
• 1995

This paper is concerned with a routing protocol for cost-effective communications between mobile hosts on computer networks in which mobile hosts can move freely their physical positions. The proposed routing protocol consists of two protocols : one is called location registration protocol performing registration of the location information as the mobile host does move; the other one is called message transfer protocol which actually delivers a message to the destination mobile host. The detailed protocol's operational behavior and major characteristics are presented. And it is shown that our protocols are superior to previous ones, in terms of the communication cost(i.e, number of messages) required for routing a message, and are functionally improved ones.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.4
• /
• pp.422-429
• /
• 2013

MIL-STD-1553B communication is globally used in the area of aerospace and defense which require safety and reliability in spite of its low communication speed. As recently increased requirements for high precision and robust guidance ability of missiles, missile sensor equipment needs more data to satisfy those requirements. Therefore, missile systems to adopt MIL-STD-1553B requires higher data transfer and processing capability than those of the current systems. In this paper, we describe the result of analysis and implementation of the existing methods that applied multi-message chain and double buffers to improve the current missile system.

• Journal of Information Processing Systems
• /
• v.4 no.4
• /
• pp.133-144
• /
• 2008

Clusters have become a popular alternative for building high-performance parallel computing systems. Today's high-performance system area network (SAN) protocols such as VIA and IBA significantly reduce user-to-user communication latency by implementing protocol stacks outside of operating system kernel. However, emerging parallel applications require a significant improvement in communication latency. Since the time required for transferring data between host memory and network interface (NI) make up a large portion of overall communication latency, the reduction of data transfer time is crucial for achieving low-latency communication. In this paper, Eager Data Transfer (EDT) mechanism is proposed to reduce the time for data transfers between the host and network interface. The EDT employs cache coherence interface hardware to directly transfer data between the host and NI. An EDT-based network interface was modeled and simulated on the Linux-based, complete system simulation environment, Linux/SimOS. Our simulation results show that the EDT approach significantly reduces the data transfer time compared to DMA-based approaches. The EDTbased NI attains 17% to 38% reduction in user-to-user message time compared to the cache-coherent DMA-based NIs for a range of message sizes (64 bytes${\sim}$4 Kbytes) in a SAN environment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.206-209
• /
• 2014

Control message exchange is major job for cognitive radio to exist and use spectrum opportunistically. For this control message exchange they need a common control channel (CCC). Once this channel is affected by a primary user, communication stops until new CCC is setup. This takes substantial time and if they could not get free channel, this halt continues for long time. To prevent such cease of communication, we propose a combination of two networks, namely WLAN and UWB, to let the communication continue. In our proposed idea if the CCC of a certain CR in WLAN is affected, the CR changes its network from WLAN to UWB and keeps the communication because UWB cannot be affected by PU. In the proposed idea every cognitive radio has two transceivers; one for the overlay network (WLAN) and another UWB network. If a primary user is detected in the spectrum of a cognitive radio, it continues exchanging control messages under the UWB network and in parallel negotiates for a new CCC using the WLAN network. This idea solves the communication interruption until new CCC is setup.

• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.525-532
• /
• 2006

Compared with the previous recovery algorithms for causal message logging, Elnozahy's recovery algerian considerably reduces the number of stable storage accesses and enables live processes to execute their computations continuously while performing its recovery procedure. However, if causal message logging is used with asynchronous checkpointing, the state of the system may be inconsistent after having executed this algorithm in case of concurrent failures. In this paper, we show these inconsistent cases and propose a low-cost recovery algorithm for causal message logging to solve the problem. To ensure the system consistency, this algorithm allows the recovery leader to obtain recovery information from not only the live processes, but also the other recovering processes. Also, the proposed algorithm requires no extra message compared with Elnozahy's one and its additional overhead incurred by message piggybacking is significantly low. To demonstrate this, simulation results show that the first only increases about 1.0%$\sim$2.1% of the recovery information collection time compared with the latter.