• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제18권2호
• /
• pp.250-260
• /
• 1993

Packet Reservation Multiple Access(PRMA) protocol provides a very efficient mechanism for many number of voice and data terminals with bursty traffic characteristics to share efficiently a common transmission channel. This protocol, however, cannot operate in high load conditions. That is, there occurs a instability problem, since the reservation channel is allowed to shrink to zero. In this paper, a more stable PRMA protocol which can avoid such problems and integrates voice and data traffic efficiently is proposed. Also, the performance of the proposed protocol is analyzed by a computer simulation. According to the simulation results, it can be shown that the proposed protocol provides a more efficient mechanism for voice/data integration and ensures a more stable operation than conventional PRMA protocol in high load conditions.

• Journal of Internet Computing and Services
• /
• 제8권4호
• /
• pp.81-91
• /
• 2007

Binding update for the routing optimization in MIPv6 can make the involved nodes vulnerable to various attacks. Therefore, secure binding update becomes an important research issue in MIPv6, and several protocols have been proposed for this purpose. In this paper, we compare several existing binding update protocols such as RR, SUCV and OMIPv6 and analyze the vulnerability of nodes to the possible attacks and drawbacks of address management and scalability and overhead of encryption operations. Then, we suggest the design requirements for the secure binding update and propose an advanced protocol based on the design principle. Through the analysis, we show that our protocol can achieve a higher level of security against the various attacks and enable better management of address, provide the location privacy and reduce the computational overhead of mobile nodes with constraint computational power.

• The Transactions of the Korea Information Processing Society
• /
• 제7권1호
• /
• pp.156-165
• /
• 2000

This paper proposes an integrated system for interworking different network management protocols. The interworking system between SNMP(Simple Network Management Protocol) and CMIP(Common Management Information Protocol) has been designed. We defined new managed object architecture using MOVI(Managed Object View Interface) concept and implemented an extended GDMO(EGDMO) compiler. An access mechanism for consistency control and atomic action on the sharing resources has been defined. Thus, even if a new management protocol would be introduced, new gateway system need not to be redesigned. It can be achieved with minimum modification of the view interface of managed objects. As a managed object can support various view interfaces, several network management protocols can directly access it. This approach, therefore, provides some benefits. For instance, manager can access managed objects without additional functions and tools. Ti, also, could be achieved interworking between SNMP and CMIP with minimum modification on the view interface of the managed objects defined previously. It is able to interwork more complicated network management protocols and to increase usefulness of SNMP and CMIP.

• Journal of IKEEE
• /
• 제19권3호
• /
• pp.319-326
• /
• 2015

This paper proposes method about development of conversion software for controller without OPC stack to communicate with OPC DA client. The proposed method is composed of development of OPC server based on OPC DA standard protocol, development of GUI application can be checked the OPC tag and point informations, development of conversion module to convert from OPC protocol to open standard protocol. In the stage of development of OPC server based on OPC DA standard protocol, we develope server in the pc to transmit and receive datum through OPC DA protocol with OPC DA client. In the stage of evelopment of GUI application can be checked the OPC tag and point informations, run the OPC DA server and register to window system registry and check OPC tags, points, transmitting and receiving of data from serial communication. In the stage of development of conversion module to convert from OPC protocol to open standard protocol, convert from OPC tag data which has received from OPC DA client to protocol can be communicated with industrial controller using open standard protocol so that support to transmit and receive data. To evaluate the efficiency of the proposed software, we connected OPC DA server software and OPC client, and 5 sample industrial controller which use open standard protocol, as a result we got 96.98% average communication succeeding rate among entire transmitting and receiving packets. We also confirmed that successfully communicated between industrial building controller which uses modbus protocol and industrial OPC DA client using OPC DA conversion software proposed by this dissertation.

• Journal of Korea Society of Industrial Information Systems
• /
• 제17권3호
• /
• pp.19-26
• /
• 2012

To resist the relay attacks in RFID system, it is commonly used RFID distance bounding protocols using the round trip time measurement for 1 bit challenge and response between a reader and a tag. If the success probability of relay attacks for the 1 bit challenge and response can be reduced in these protocols, it is possible to make an efficient distance bounding protocol. In this paper, we propose an efficient RFID distance bounding protocol based on 2 bit challenge and response which is modified the RFID distance bounding protocol proposed by Hancke and Khun based on 1 bit challenge and response. The success probability of relay attack for the proposed protocol is (7/16)n for the n times of challenge and response, which is much lower than (3/4)n given by Hancke and Khun's protocol.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제19권5호
• /
• pp.251-255
• /
• 2019

On today, Protocol reverse-engineering technique can be used to extract the specification of an unknown protocol. However, there is no standardized method, and in most cases, the extracting process is executed manually or semi-automatically. If the information about the structure of an unknown protocol could be acquired in advance, it would be easy to conduct reverse engineering. the feature extraction is an important step in unknown protocol classification. However, in this paper, we present a comparison several feature extraction techniques and suggests a method of feature extraction algorithm for recognizing unknown protocol. In order to verify the performance of the proposed system, we performed the training using eight open protocols to evaluate the performance using unknown data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제18권7호
• /
• pp.1565-1570
• /
• 2014

In networking communication, nodes and base station send data to each nodes and destination nodes. In this perspective, it is very important to determine the direction in which data sent to each nodes or destination nodes. Ad-hoc routing protocol is a standard routing protocol that determines how the packets sent to destination. Ad-hoc routing protocol includes protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). In our efficient proposed protocol based on small end-to-end sequence numbers, route direction can be changed properly with the assistance of helper nodes. In this paper, we focus on the simulation analysis of proposed protocol and comparison with other routing protocol models such as AODV and DSR. We simulated using Network Simulator (NS-2) by parameters such as simulation time, number of nodes and packet size based on our metrics (packet delivery fraction, routing load, data throughput). Our proposed protocol based on small end-to-end sequence numbers shows better performance and superior to other two protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제35권9B호
• /
• pp.1350-1359
• /
• 2010

Recently many researchers have been proved that general RFID system for proximity authentication is vulnerable to various location-based relay attacks such as distance fraud, mafia fraud and terrorist fraud attacks. The distance-bounding protocol is used to prevent the relay attacks by measuring the round trip time of single challenge-response bit. In 2008, Munilla and Peinado proposed an improved distance-bounding protocol applying void-challenge technique based on Hancke-Kuhn's protocol. Compare with Hancke-Kuhn's protocol, Munilla and Peinado's protocol is more secure because the success probability of an adversary has (5/8)n. However, Munilla and Peinado's protocol is inefficient for low-cost passive RFID tags because it requires large storage space and many hash function computations. Thus, this paper proposes a new RFID distance-bounding protocol for low-cost passive RFID tags that can be reduced the storage space and hash function computations. As a result, the proposed distance-bounding protocol not only can provide both storage space efficiency and computational efficiency, but also can provide strong security against the relay attacks because the adversary's success probability can be reduced by $(5/8)^n$.

• Journal of the Korea Society of Computer and Information
• /
• 제17권9호
• /
• pp.57-64
• /
• 2012

The existing protocols proposed in network mobility (NEMO) environment can require many computational costs and can bring about a delay of binding update. To solve these problems, in this paper we propose an authentication protocol supporting secure seamless handover in NEMO environment. The proposed protocol can handle quickly mutual authentication between a mobile router (MR) and an access router (AR), which uses group key among ARs and a master key (MK) issuing from key issuing server (KIS) for reducing the time of binding update as much as possible. In performance, the proposed protocol can process quickly binding update with little computational cost comparison with the existing binding update protocols and it results in robustness against existing attacks.

• Review of KIISC
• /
• 제12권2호
• /
• pp.62-76
• /
• 2002

Incautiously designed and informally verified cryptographic protocols are error-prone and can allow an adversary to have the ideal starting point for various kinds of attacks. The flaws resulting from these protocols can be subtle and hard to find. Accordingly we need formal methods for systematic design and verification of cryptographic protocols. This paper surveys the state-of-the-art and proposes a practical developing method that will be implemented in the future study.