• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.16-18
• /
• 2001

Despite extensive research on R-trees, most of the proposed schemes have not been integrated into existing DBMS due to the lack of protocol to provide consistency in concurrent environment. R-link tree is an acceptable data structure to deal with this issue., but still not enough. In this paper, we focus on a simplified predicate locking mechanism based on R-link tree for concurrency control and phantom protection. An in-memory operation control list (OCList) used to suspend some conflicting operations is designed here. The main features of this approach are (1) it can be implemented easily and do not need any extra information. (2) Only-one-lock is held when descending R-tree even when node split happens, while lock-coupling scheme is performed when ascending. No deadlocks are possible. (3) Searches and insertions are not unnecessarily restricted. (4) Insert and Delete phantom in R-link tree are avoid through beforehand predication.

• Journal of information and communication convergence engineering
• /
• v.17 no.4
• /
• pp.255-260
• /
• 2019

A pendubot is a representative example of an underactuated system that has fewer actuators than the degree of freedom of the system. In this study, the characteristics of the pendubot are first reviewed; each part is then designed using Solidworks by dividing the pendubot into three parts: the base frame, first link frame, and second link frame. These three parts are then imported into the Simulink environment via a STEP file format, which is the standard protocol used in data exchange between CAD applications. A 3D model of the pendubot is then constructed using Simscape, and the usefulness of the 3D model is validated by a comparison with a dynamic equation derived using the Lagrangian formulation. A linearized model around an upright equilibrium position is finally obtained, and a sliding mode controller is designed based on the linear quadratic regulator. Simulation results showed that the designed controller effectively maintained upright balance of the pendubot in the presence of disturbance.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.9
• /
• pp.57-64
• /
• 2017

CCSDS Standard is widely used in the international space telecommunication area. But standard recommendation of CCSDS is not restrictive, so, we can select an appropriate encryption protocol among the layer. For synchronization, encryption sync is attached in the beginning of the encrypted data. In the exceptional environmental condition, although the receiver can not decrypt the normal data, the sender have no conception of that situation. In this paper, we propose a two-stage SES alarmed link encryption synchronization method having optimized threshold value necessary to decide whether the receiver has a correct decryption or not. first, through the experiment of mutual relations between error rate and encryption synchronization detection error, we can predict worst communication environment for the selected encryption synchronization pattern. second, through the experiment for finding what number of consecutive frame synchronization error is an appropriate reference value and analysis of that experiment, we suggest an optimized threshold value for resynchronization request. lastly, through the output images we can predict the probability error that should be guaranteed by channel coder.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.778-798
• /
• 2014

This paper proposes a novel exposed-terminal-eliminated medium access control (ETE-MAC) protocol by combining channel reservation, collision avoidance and concurrent transmissions to improve multi-access performance of the multihop wireless networks. Based on the proposed slot scheduling scheme, each node senses the control channel (CCH) or the data channel (DCH) to accurately determine whether it can send or receive the corresponding packets without collisions. Slot reservation on the CCH can be simultaneously executed with data packet transmissions on the DCH. Therefore, it resolves the hidden-terminal type and the exposed-terminal type problems efficiently, and obtains more spatial reuse of channel resources. Concurrent packet transmissions without extra network overheads are maximized. An analytical model combining Markov model and M/G/1 queuing theory is proposed to analyze its performance. The performance comparison between analysis and simulation shows that the analytical model is highly accurate. Finally, simulation results show that, the proposed protocol obviously outperforms the link-directionality-based dual-channel MAC protocol (DCP) and WiFlex in terms of the network throughput and the average packet delay.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.34-43
• /
• 2000

Replicated data that is used for fault tolerant distributed system requires replica control protocol to maintain data consistency. The one of replica control protocols is quorum consensus method which accesses replicated data by getting majority approval. If site failure or communication link failure occurs and any one can't get quorum consensus, it degrades the availability of data managed by quorum consensus protocol. So it needs for ghost to replace the failed site. Because ghost is not full replica but process which has state information using meta data, it is important to simplify meta data. In order to maintain availability and simplify meta data, we propose a method to use cohort set as ghost's meta data. The proposed method makes it possible to organize meta data in 2N+logN bits and to have higher availability than quorum consensus only with cohort set and dynamic linear voting protocol. Using Markov model we calculate proposed method's availability to analyze availability and compare it with existing protocols.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.131-142
• /
• 2011

In this paper, we propose a new multipath routing protocol and compare it with other multipath routing protocols in mobile ad hoc network (MANET) environments. The new multipath routing establishes the main route using a mechanism based on Ad Hoc On-demand Distance Vector(AODV), after which data transmission starts immediately. The backup route search process takes place while data are transmitted, to reduce the transmission delay. The protocol can also operate in a hybrid node-disjoint/link-disjoint mode, where the protocol finds the node-disjoint backup route first; if the node-disjoint does not exist, the protocol discovers the link-disjoint backup route from the main route. When either of the main route or the backup route is broken, data are transmitted continuously through the other route and the broken route is recovered by the route maintenance process. The results of simulations, based on the Qualnet simulator, show that the proposed multipath routing protocol increases the packet transmission success rate and reduces end-to-end delays, when compared with AODV and AOMDV protocols.

• Journal of Internet Computing and Services
• /
• v.7 no.6
• /
• pp.175-183
• /
• 2006

An ad-hoc network is a group of mobile nodes acting as routers. The of hoc node has a precondition of mobility, allowing path to be easily disconnected when transmitting data, thereby increasing network overhead. However, most of hoc routing protocols set up the path based only on the number of hops without considering other practical factors. Here we consider a path with the least substantial number of transmission (SNT) from source to destination based on reliabilities of links. This includes retransmissions due to unreliable links. In this paper, an efficient ad-hoc link reliability based routing (PU) protocol suitable for mobile ah-hoc network in terms of SNT, is proposed. The network overhead and data transmission delay ore reduced, by considering both ad-hoc link reliability and the number of hops. Our empirical performance evaluation comparing to AODV (8) shows that the enhancement is up to about 31% for SNT depending upon the mobility of nodes.

• Proceedings of the KIEE Conference
• /
• 2001.07b
• /
• pp.1266-1268
• /
• 2001

ProfiBus provides real-time data communication among field devices in the EMU (Electrical Multiple Unit) and TCMS (Train Control Monitoring System). This paper presents an adapt to Train Communication Network for EMU using ProfiBus DP(Decentralized Periphery) mathod, which is the layer 2 DDLM(Direct Data Link Mapper) protocol of ProfiBus.

• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.168-172
• /
• 2010

The Network-based handover still has problems such as the transmission delays and the packet losses in the case of macro mobility, though technological advances have been made in the wireless and mobile communication. For end-to-end handover, the link bandwidth has been reduced in the wireless network due to its burst errors and congestion control. To overcome such problems, we propose a new scheme of the macro handover according to the protocol layer. The proposed macro handover is implemented on the network layer to partially substitute wired signaling for wireless signaling, to flexibly employ buffers, and on the transport layer to postpone its retransmission time. We have performed extensive simulation using ns-2 and the result shows that our proposed scheme outperforms the other existing schemes in terms of transmission delay, packet loss, and data transfer rate during the handovers.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.28A no.10
• /
• pp.782-790
• /
• 1991

In this paper, we implement the function of the IEEE802.2LLC(logical link control) sublayer one of the 7layers in MAP(manufacturing automation protocol), a standard communication protocol for manufacturing automation. With the assembly language we designed the class 3 function based on the IEEE standards and verified on the network adaptor hardware. In this experiment, we tested the function using the simplified variables considering that the retransmission value was chosen to be 1 and the life-time of the transmission variable infinite. According to the result of the service procedures, we confirmed that user data were transmitted to the corresponding station without any error.