• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.713-716
• /
• 2003

In recent, the contactless IC card is widely used in traffic, access control system and so forth. Contactless smart cards use a technology that enables card readers to provide power for transactions and communications without making physical contact with the cards. Usually electromagnetic signal is used for communication between the card and the reader. Contactless card is highly suitable for large quantity of card access and data transaction. And its use becomes a general tendency more and more because of the development of RF technology and improvement of requirement for user convenience. This paper describes the hardware module to process contactless protocol for implementation contactless IC card. And the hardware module consists of specific digital logic circuits that analyze digital signal from analog circuit and then generate data & status signal for CPU, and that convert the data from CPU into digital signal for analog circuit.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1196-1210
• /
• 1997

Timestamp-Ordering Prltocol among trancaction scheduling alforithms can cause the priority teversion that a transaction with higher priority is processed after the teansaction the trancaction withe lower priority by assigning timestamp to transactions entering system and scheduling them based on the timestamp.To prevent this reversion,we suggest a data priority-based timestamp ordering prioity within the same timestamp group after grouping teansactions into constant time interval based on entering points.To evaluate the performance of this protocol,we compared the performance of this protocol with that of others after constructing the simulation environment with real time database system.We verified that the performance of proposed protocol is supweior to that of timestamp ordering protocol under the comdition of high load and high data conflicts.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.301-308
• /
• 2005

According to banking online transaction grows very rapidly, guarantee validity about business transaction has more meaning. To offer guarantee validity about banking online transaction efficiently, certificate status verification system is required that can an ieai-time offer identity certification, data integrity, guarantee confidentiality, non-repudiation. Existing real-time certificate status verification system is structural concentration problem generated that one node handling all transactions. And every time status verification is requested, network overload and communication bottleneck are occurred because ail useless informations are transmitted. it does not fit to banking transaction which make much account of real response time because of these problem. To improve problem by unnecessary information and structural concentration when existing real-time certificate status protocol requested , this paper handle status verification that break up inspection server by domain. This paper propose the method of real~time certificate status verification that solves network overload and communication bottleneck by requesting certification using really necessary Reduction information to certification status verification. And we confirm speed of certificate status verification $15\%$ faster than existing OCSP(Online Certificate Status Protocol) method by test.

• The KIPS Transactions:PartD
• /
• v.8D no.1
• /
• pp.24-31
• /
• 2001

In this paper, we present an advanced transaction scheduling protocol to improve the degree of concurrency and satisfy the security requirements for multilevel secure database. We adapted two-phase locking protocol, namely traditional syntax-oriented serializability notions, to multilevel secure database. Altruistic locking, as an advanced protocol, has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of altruism has also been deployed for extended altruistic locking OffiLl. This is in a way that scope of data to be early released is enlarged to include even data initially not intended to be donated. We also adapted XAL to multilevel secure database and we first of all investigated limitations inherent in both altruistic schemes from the perspective of alleviating starvation occasions for transactions in particular of short-lived nature for multilevel secure database. Our protocol is based on extended altruistic locking for multilevel secure database (XAL/MLS), but a new method, namely two-way donation locking for multilevel secure database (2DL!/-MLS), is additionally used in order to satisfy security requirements and concurrency. The efficiency of the proposed protocol was verified by experimental results.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.523-530
• /
• 2005

When a PCI 2.2 bus master requests data using Memory Read command, a target device may hold PCI bus without data to be transferred for long time because a target device needs time to prepare data infernally. Because the usage efficiency of the PCI bus and the data transfer efficiency are decreased due to this situation, the PCI specification recommends to use the Delayed Transaction mechanism to improve the system performance. But the mechanism cann't fully improve performance because a target device doesn't know the exact size of prefetched data. In the previous work, we propose a new method called Prefetch Request when a bus master intends to read data from the target device. In this paper, we design PCI 2.2 controller and local device that support the proposed method. The designed PCI 2.2 controller has simple local interface and it is used to convert the PCI protocol into the local protocol. So the typical users, who don't know the PCI protocol, can easily design the PCI target device using the proposed PCI controller. We propose the basic behavioral verification, hardware design verification, and random test verification to verify the designed hardware. We also build the test bench and define assembler instructions. And we propose random testing environment, which consist of reference model, random generator ,and compare engine, to efficiently verify corner case. This verification environment is excellent to find error which is not detected by general test vector. Also, the simulation under the proposed test environment shows that the proposed method has the higher data transfer efficiency than the Delayed Transaction about $9\%$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.892-901
• /
• 2001

Despite of many advantages over conventional radio paths, application of the Meteor Burst Path in commercial communication system is so far limited to a few extent because of its low duty rate, which is, less than several percent at best. In order to get through maximum number of data bits during the short interval of each burst, which normally lives a fractions of a second, a sophisticated communication protocol is called for. In this paper, author introduces a communication protocol which can effectively locate and fetch burst signal by sending out periodic detection signal from master station and, with minimal delay, switch over to transmission states so as to put as many data bits through the detected burst as the burst length permits. By analyzing time period required for each transaction steps, the author derives optimal packet length for various bursts which assures to get a message string through in minimum delay. According to the analysis, the author proposes a protocol including a routine which automatically accesses average length of bursts at each environment and automatically adapt length of data packet so as to maximize data throughput under Riven burst conditions.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.761-766
• /
• 2005

This paper presents a dynamic precedence queue mechanism to resolve unexpected transmission delay of a lower priority transaction in a CAN based system which keeps a fixed priority in data transactions. The mechanism is implemented in the upper sub-layer of the data link layer (DLL), which is fully compatible with the original medium access control layer protocol of CAN. Thus the mechanism can be implemented dynamically while the data transactions are going on without any hardware modification. The CAN protocol was originally developed to be used in the automotive industry and it was recently applied for a broader class of automated factories. Even though CAN is able to satisfy most of real-time requirements found in automated environments, it is not to enforce either a fair subdivision of the network bandwidth among the stations or a satisfactory distribution of the access delays in message transmissions. The proposed solution provides a superset of the CAN logical link layer control, which can coexist with the older CAN applications. Through the real experiments, effectiveness of the proposed mechanism is verified.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.4
• /
• pp.51-59
• /
• 2009

Many failures are due to incorrectly programmed transactions and data entry errors. System failure causes the loss or corruption of the contents of volatile storage. Although global processing protects data values to detect direct or indirect information effluence, security environments are very important in the recovery management of heterogeneous systems. Although transaction can't control system fault, the restart for the system can cause information effluence by low bandwith. From various faults, it is not easy to maintain the consistency and security of data. This paper proposes recovery management protocols to assure global multilevel secure one-copy quasi-serializability in security environments of heterogeneous systems with replicated data and proves its correctness. The proposed secure protocols guarantee the reliability and security of system when the system fault is happened.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.235-242
• /
• 2002

We propose an advanced transaction scheduling protocol for concurrency control of multilevel secure databases in wireless mobile network environment. Wireless communication is characterized by frequent spurious disconnections. So short-lived transaction must quickly access database without any delay by long-lived one. We adapted two-phase locking protocol, namely traditional syntax-oriented serializability notions, to multilevel secure databases in wireless mobile network environment. Altruistic locking, as an advanced protocol, has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of a1truism has also been deployed for extended a1truistic locking. This is in a way that scope of data to he early released is enlarged to include even data initially not intended to be donated. Our protocol is based on extended altruistic locking, but a new method, namely bi-directional donation locking for multilevel secure databases (MLBiDL), is additionally used in order to satisfy security requirements and concurrency. We showed the Simulation experiments that MLBiDL outperforms the other locking protocols in terms of the degree of throughput and average waiting time.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.259-268
• /
• 2004

For supporting Interoperability among heterogeneous data sources in different geographic information systems, it is required to use open API like OGIS OLE DB Proposed in OGC. The OLE/COM Implementation Specification of OGIS only provides interfaces to discover and access spatial data, but does not support interfaces for updating distributed spatial data. To solve this problem, we propose and add interfaces for updating spatial objects distributed over heterogeneous data sources and examining the consistency of spatial relationships between updated objects. We also devise a 2-phase commit protocol based on spatial relationships in order to guarantee the consistency of updated objects. To justify the update scheme using the proposed Interfaces and 2-phase commit prototype we design and implement a prototype system for updating distributed spatial objects.