• The KIPS Transactions:PartD
• /
• v.10D no.2
• /
• pp.195-210
• /
• 2003

In this paper, we propose an enhanced concurrency control algorithm that maximizes the concurrency of multi-dimensional index structures. The factors that deteriorate the concurrency of index structures are node splits and minimum bounding region (MBR) updates in multi-dimensional index structures. The proposed concurrency control algorithm introduces PLC(Partial Lock Coupling) technique to avoid lock coupling during MBR updates. Also, a new MBR update method that allows searchers to access nodes where MBR updates are being performed is proposed. To reduce the performance degradation by node splits the proposed algorithm holds exclusive latches not during whole split time but only during physical node split time that occupies the small part of a whole split process. For performance evaluation, we implement the proposed concurrency control algorithm and one of the existing link technique-based algorithms on MIDAS-3 that is a storage system of a BADA-4 DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm in terms of throughput and response time. Also, we propose a recovery protocol for our proposed concurrency control algorithm. The recovery protocol is designed to assure high concurrency and fast recovery.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.244-254
• /
• 2006

This paper presents an efficient hybrid technique to compact the trie indexing the huge forward table small enough to be stored into cache for speeding up IP lookup. It combines two techniques, an encoding scheme called bit-map and a controlled-prefix expanding scheme to replace slow memory search with few fast-memory accesses and computations. For compaction, the bit-map represents each index and child pointer with one bit respectively. For example, when one node denotes n bits, the bit-map gives a high compression rate by consumes $2^{n-1}$ bits for $2^n$ index and child link pointers branched out of the node. The controlled-prefix expanding scheme determines the number of address bits represented by all root node of each trie's level. At this time, controlled-prefix scheme use a dynamic programming technique to get a smallest trie memory size with given number of trie's level. This paper proposes standard that can choose suitable trie structure depending on memory size of system and the required IP lookup speed presenting optimal memory size and the lookup speed according to trie level number.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.608-618
• /
• 2000

We consider the problem of placing resources in a distributed computing system so that certain performance requirements may be met while minimizing the number of required resource copies, irrespective of node or link failures. To meet the requirements for high performance and high availability, minimum number of resource copies should be placed in such a way that each node has at least two copies on the node or its neighbor nodes. This is called the fault-tolerant resource placement problem in this paper. The structure of a parallel or a distributed computing system is represented by a graph. The fault-tolerant placement problem is first transformed into the problem of finding the smallest fault-tolerant dominating set in a graph. The dominating set problem is known to be NP-complete. In this paper, searching for the smallest fault-tolerant dominating set is formulated as a state-space search problem, which is then solved optimally with the well-known A* algorithm. To speed up the search, we derive heuristic information by analyzing the properties of fault-tolerant dominating sets. Some experimental results on various regular and random graphs show that the search time can be reduced dramatically using the heuristic information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1679-1685
• /
• 2022

In this paper, we propose an optimal multi-hop transmission scheme to maximize the end-to-end data rate from the source to the destination node in a wireless powered communication network. The frame structure for multi-hop transmission is presented to transmit multi-hop data while harvesting energy. Then, the transmission time of each node that maximizes the end-to-end transmission rate is determined through mathematical analysis in consideration of different harvested energy and link quality among nodes. We derive an optimization problem through system modeling of the considered wireless powered multi-hop transmission, and prove that there is a global optimal solution by verifying the convexity of this optimization problem. This analysis facilitates to find the optimal solution of the considered optimization problem. The proposed optimal multi-hop transmission scheme maximizes the end-to-end rate by allocating the transmission time for each node that equalizes the transmission rates of all links.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.1
• /
• pp.46-53
• /
• 2012

The WBAN technology means a short distance wireless network which provides each device's interactive communication by connecting devices inside and outside of body located within 3 meters. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. It is necessary to develop the WBAN core technology that sensor node device, WBAN middleware and WBAN application service for WBAN environment. In this paper we designed the medical message structure and implemented medical application for purpose of vital information reliability. The message structure was proposed for WBAN environment and application can be check biometric information from BN on smart device through WBAN gateway.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.24 no.3
• /
• pp.58-72
• /
• 2021

In July 2021, UNCTAD classified Korea as a developed country. After the Korean War in the 1950s, economic development was promoted despite difficult conditions, resulting in epoch-making national growth. However, in order to respond to the rapidly changing global economy, it is necessary to continuously study the domestic industrial ecosystem and prepare strategies for continuous change and growth. This study analyzed the industrial ecosystem of the automobile industry where it is possible to obtain transaction data between companies by applying complexity spatial network analysis. For data, 295 corporate data(node data) and 607 transaction data (link data) were used. As a result of checking the spatial distribution by geocoding the address of the company, the automobile industry-related companies were concentrated in the Seoul metropolitan area and the Southeastern(Dongnam) region. The node importance was measured through degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality, and the network structure was confirmed by identifying density, distance, community detection, and assortativity and disassortivity. As a result, among the automakers, Hyundai Motor, Kia Motors, and GM Korea were included in the top 15 in 4 indicators of node centrality. In terms of company location, companies located in the Seoul metropolitan area were included in the top 15. In terms of company size, most of the large companies with more than 1,000 employees were included in the top 15 for degree centrality and betweenness centrality. Regarding closeness centrality and eigenvector centrality, most of the companies with 500 or less employees were included in the top 15, except for automakers. In the structure of the network, the density was 0.01390522 and the average distance was 3.422481. As a result of community detection using the fast greedy algorithm, 11 communities were finally derived.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.840-848
• /
• 2010

This paper proposes a proactive authentication scheme using credentials based on chameleon hashing in MIH environments. There is a proactive authentication structure defined by IEEE 802.21 Security Study Group for the link access in MIH environment. Both schemes based on EAP and on PKI can be applied to such structure, but the former has caused network traffic due to the complicated authentication procedure and the latter has complex structure for managing certificates. The proposed scheme performs the proactive authentication procedure only between a mobile node and a MIH Key Holder by using credentials based on chameleon hashing. Our scheme reduces the network traffic since authentication with the server is unnecessary in MIH environment and PKI structure is not required as well. In addition, the proposed scheme provides secure PFS and PBS features owing to the authenticated Diffie-Hellman key exchange of the chameleon-based credential.

• Journal of Advanced Navigation Technology
• /
• v.21 no.1
• /
• pp.36-42
• /
• 2017

An airport surface movement scheduler using first-come first-served (FCFS) algorithm is developed to efficiently manage surface traffic in an airport. It is based on the previously developed traffic flow management scheduler. Link directionality and intersection processing, which are additional constraints for ground movement, are added to the scheduler. To verify each of additional constraints, several simulations were performed by making simple scenarios, and the results show that all constraints were satisfied. Also, a simulation was performed by making a scenario based on flight operation information system (FOIS) data which is real departure and arrival flight data of Jeju airport. To determine the practicality of the developed scheduler, we compare the actual average delay time with the average delay time calculated by the scheduler.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.65-74
• /
• 2016

Ship ad-hoc network (SANET) extends the coverage of the maritime communication among ships with the reduced cost. To fulfill the growing demands of real-time services, the SANET requires an efficient clock time synchronization algorithm which has not been carefully investigated under the ad-hoc maritime environment. This is mainly because the conventional algorithms only suggest to decrease the beacon collision probability that diminishes the clock drift among the units. However, the SANET is a very large-scale network in terms of geographic scope, e.g., with 100 km coverage. The key factor to affect the synchronization performance is the signal propagation delay, which has not being carefully considered in the existing algorithms. Therefore, it requires a robust multi-hop synchronization algorithm to support the communication among hundreds of the ships under the maritime environment. The proposed algorithm has to face and overcome several challenges, i.e., physical clock, e.g., coordinated universal time (UTC)/global positioning system (GPS) unavailable due to the atrocious weather, network link stability, and large propagation delay in the SANET. In this paper, we propose a logical clock synchronization algorithm with multi-hop function for the SANET, namely multi-hop clock synchronization for SANET (MCSS). It works in an ad-hoc manner in case of no UTC/GPS being available, and the multi-hop function makes sure the link stability of the network. For the proposed MCSS, the synchronization time reference nodes (STRNs) are efficiently selected by considering the propagation delay, and the beacon collision can be decreased by the combination of adaptive timing synchronization procedure (ATSP) with the proposed STRN selection procedure. Based on the simulation results, we finalize the multi-hop frame structure of the SANET by considering the clock synchronization, where the physical layer parameters are contrived to meet the requirements of target applications.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2007.05a
• /
• pp.859-865
• /
• 2007

This paper presents a method to analyze the unbalance response of a high speed polygon mirror scanner motor supported by sintered bearing and flexible supporting structures by using the finite element method and the mode superposition method. The appropriate finite element equations for polygon mirror are described by rotating annular sector element using Kirchhoff plate theory and von Karman non-linear strain, and its rigid body motion is also considered. The rotating components except for the polygon mirror are modeled by Timoshenko beam element including the gyroscopic effect. The flexible supporting structures are modeled by using a 4-node tetrahedron element and 4-node shell element with rotational degrees of freedom. Finite element equations of each component of the polygon mirror scanner motor and the flexible supporting structures are consistently derived by satisfying the geometric compatibility in the internal boundary between each component. The rigid link constraints are also imposed at the interface area between sleeve and sintered bearing to describe the physical motion at this interface. A global matrix equation obtained by assembling the finite element equations of each substructure is transformed to a state-space matrix-vector equation, and both damped natural frequencies and modal damping ratios are calculated by solving the associated eigenvalue problem by using the restarted Arnoldi iteration method. Unbalance responses in time and frequency domain are performed by superposing the eigenvalues and eigenvectors from the free vibration analysis. The validity of the proposed method is verified by comparing the simulated unbalance response with the experimental results. This research also shows that the flexibility of supporting structures plays an important role in determining the unbalance response of the polygon mirror scanner motor.