• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.5
• /
• pp.555-564
• /
• 2016

This paper proposes a time slot allocation scheme for military patrol environments. This proposal comes from analysis of traffic properties in a military patrol environment. In the near future, robots are expected to explore enemy grounds and measure threat, taking the place of human patrol. In order to control such robots, control messages must be extremely accurate. One mistake from the control center could cause a tragedy. Thus, high reliability must be guaranteed. Another goal is to maintain a continual flow of multimedia data sent from patrol robots. That is, QoS (Quality of Service) must be guaranteed. In order to transmit data while fulfilling both attributes, the per-path based centralized TDMA slot allocation scheme is recommended. The control center allocates slots to robots allowing synchronization among robots. Slot allocation collisions can also be avoided. The proposed scheme was verified through the ns-3 simulator. The scheme showed a higher packet delivery ratio than the algorithm in comparison. It also performed with shorter delay time in the downlink traffic transmission scenario than the algorithm in comparison.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.3
• /
• pp.248-256
• /
• 2009

EB(Eigen-Beamforming) has widely been applied to MIMO(Multiple-Input Multiple-Output) systems to form beams which maximize the effective signal-to-interference plus noise ratio(SINR) of the receiver using the singular value decomposition(SVD) of the MIMO channel. However, the signal detection performance for the mobile station near the cell boundary is severely degraded and the transmission efficiency decreases due to the influence of the interference signal from the adjacent cells. In this paper, we propose an adaptive interference mitigation method for the EB transmission, and evaluate the reception performance. In particular, a reception strategy which adaptively utilizes optimal combining(OC) and minimum mean-squared error for Intercell spatial demultiplexing(MMSE-lSD) is proposed, and the reception performance is investigated in terms of the effective SINR and system capacity. For the average system capacity, the proposed adaptive reception demonstrates the performance enhancement compared to the conventional EB reception using the receiver beamforming vector, and up to 2 bps/Hz performance gain is achieved for mobile station located at the cell edge.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.3
• /
• pp.566-576
• /
• 2017

Key-value stores proved its superiority by being applied to various NoSQL databases such as Redis, Memcached. Lookup performance is important because key-value store applications performs more lookup than insert operations in most environments. However, in traditional applications, lookup may be slow because hash tables are constructed out of linked-list. Therefore, cuckoo hashing has been getting attention from the academia for constant lookup time, and bucketized cuckoo hashing (BCH) has been proposed since it can achieve high load factor. In this paper, we introduce Sorting Cuckoo which inserts data using insertion sort in BCH structure. Sorting Cuckoo determines the existence of a key with a relatively small memory access because data are sorted in each buckets. In particular, the higher memory load factor, the better lookup performance than BCH's. Experimental results show that Sorting Cuckoo has smaller memory access than BCH's as many as about 19 million (25%) in 10 million negative lookup operations (key is not in the table), about 4 million times (10%) in 10 million positive lookup operations (where it is) with load factor 95%.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.1
• /
• pp.64-71
• /
• 2020

eFuse OTP memory IP is required to trim the analog circuit of the gate driving chip of the power semiconductor device. Conventional NMOS diode-type eFuse OTP memory cells have a small cell size, but require one more deep N-well (DNW) mask. In this paper, we propose a small PMOS-diode type eFuse OTP memory cell without the need for additional processing in the CMOS process. The proposed PMOS-diode type eFuse OTP memory cell is composed of a PMOS transistor formed in the N-WELL and an eFuse link, which is a memory element and uses a pn junction diode parasitic in the PMOS transistor. A core driving circuit for driving the array of PMOS diode-type eFuse memory cells is proposed, and the SPICE simulation results show that the proposed core circuit can be used to sense post-program resistance of 61㏀. The layout sizes of PMOS-diode type eFuse OTP memory cell and 512b eFuse OTP memory IP designed using 0.13㎛ BCD process are 3.475㎛ × 4.21㎛ (= 14.62975㎛2) and 119.315㎛ × 341.95㎛ (= 0.0408mm2), respectively. After testing at the wafer level, it was confirmed that it was normally programmed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.3
• /
• pp.527-533
• /
• 2018

Recently, the device-to-device (D2D) communication has been conceived as the key technology for the next-generation mobile communication systems. The neighbor discovery in which the nearby users are found, is essential for the proper operation of the D2D communication. In this paper, we propose new neighbor discovery scheme based on deep learning technology which has gained a lot of attention recently. In the proposed scheme, the neighboring users can be found using the uplink pilot transmission of users only, unlike conventional neighbor discovery schemes in which direct pilot communication among users is required, such that the signaling overhead can be greatly reduced in our proposed scheme. Moreover, the neighbors with different proximity can also be classified accordingly which enables more accurate neighbor discovery compared to the conventional schemes. The performance of our proposed scheme is verified through the tensorflow-based computer simulations.

• Journal of Navigation and Port Research
• /
• v.30 no.10 s.116
• /
• pp.809-817
• /
• 2006

Shipping and ports have important roles as the nodes and links in maritime logistics. The environment between shipping and ports is interrelated and has been changing' together. Recently, the changes of shipping and ports are rapidly in progress and it is expected to be developed complementarily. Especially, mega carriers reduce the number of ports of calls because the size of ships is becoming bigger and bigger and the 'hub and spokes' strategy is appeared. Therefore, the position of a hub port by the region has questioned This paper aims to research the competitive ports by the region on the basis of the patterns when mega carriers call at ports. Six regions, Far East, Southeast Asia, Northwest America, Northeast America, West Europe and Mediterranean, are organized for this research. According to the volume of cargoes, the top five ports of each region are analyzed. As a result, the competitive ports by the region are Shanghai, Hong Kong, Los Angeles, New York New Jersey, Rotterdam and Gioia Tauro.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.5
• /
• pp.1525-1534
• /
• 2014

In recent years, the passengers are likely to decide their route on impulse due to the development of the integrated public transport system, and real-time information system. Especially, public transport fare integration in Seoul Metropolitan area, 2004 makes them not to have resistance about changing the modes or routes and their route choice is most effected by the degree of congestion. Assignment model have limitations to describe route changes by congestion. In this study, the concept of a link cost function used in road assignment and Effective frequency is introduced to describe the passengers' behavior when the capacity of public transport is over and the waiting time variation. Two situations, new transit line operation and accident, are set up to validate the model, as a result of the transit assignment by this model, the traffic on networks is not over the capacity. It is expected that this study will be of help to reflect the various behaviors in transit assignments.

• Journal of Korea Water Resources Association
• /
• v.45 no.2
• /
• pp.203-215
• /
• 2012

The objective of this study is to develop a catchment hydrologic cycle assessment model which can assess the impact of urban development and designing water cycle improvement facilities. Developed model might contribute to minimize the damage caused by urban development and to establish sustainableurban environments. The existing conceptual lumped models have a potential limitation in their capacity to simulate the hydrologic impacts of land use changes and assess diverse urban design. The distributed physics-based models under active study are data demanding; and much time is required to gather and check input data; and the cost of setting up a simulation and computational demand are required. The Catchment Hydrologic Cycle Assessment Tool (hereinafter the CAT) is a water cycle analysis model based on physical parameters and it has a link-node model structure. The CAT model can assess the characteristics of the short/long-term changes in water cycles before and after urbanization in the catchment. It supports the effective design of water cycle improvement facilities by supplementing the strengths and weaknesses of existing conceptual parameter-based lumped hydrologic models and physical parameter-based distributed hydrologic models. the model was applied to Seolma-cheon catchment, also calibrated and validated using 6 years (2002~2007) hourly streamflow data in Jeonjeokbigyo station, and the Nash-Sutcliffe model efficiencies were 0.75 (2002~2004) and 0.89 (2005~2007).

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.5 s.347
• /
• pp.94-103
• /
• 2006

Ethernet passive optical network (EPON) has drawn many attention as a promising access network technology for FTTH because it can provide a high bandwidth with a low cost. Since the uplink bandwidth in the EPON system is shared by many users, it is necessary for an EPON system to have an efficient bandwidth allocation mechanism. To support QoS in EPON, the previous bandwidth allocation schemes employ strict priority queueing (SPQ). Since SPQ gives unlimited priority to higher service class, the QoS of lower service classes gets worse. In this paper, we propose Class Gated DBA (Dynamic Bandwidth Allocation) algorithm in which the bandwidth is requested / granted in a service class basis. To avoid the monopoly in bandwidth usage by higher classes the maximum bandwidth that is allocate to each service class is limited (fairness between services classes). In addition, to avoid the monopoly in bandwidth usage by some particular users, each ONU runs fairness bandwidth allocation algorithm within each service classes. Through computer simulations, it is verified that the proposed algorithm achieves a good level of QoS, and at the same time maintains a good level of fairness between both service classes and users.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.11-18
• /
• 2009

In this paper, a hierarchical link allocation algorithm between mobile stations (MSs) and the corresponding base station (BS) by an optimal utilization of relay stations (RSs) is proposed to improve throughput of RS systems. In the proposed hierarchical algorithm, each RS operates cognitive radio functions to sense the degree of satisfaction in the quality of services (QoSs) and then selects the candidate set of MSs to have links with the RS. Such information is reported to the BS, where an auction process is performed to get an optimal allocation of communication links between the MSs and the BS. To maximize system throughput, the proposed auction algorithm is conducted upon bidding prices of communication links, considering both the co-channel interference (CCI) information shared among adjacent cells and the QoS enhancement information for each MS collected from RSs. The BS then switches the communication links of the auction winner MSs through the corresponding RS. The computer simulation shows that the proposed algorithm enhances the user QoS more than the conventional algorithm, especially for RS systems with more users requiring higher QoS. The proposed algorithm has also been proved to have more robust performance than the conventional one when the traffic load is higher and the CCI becomes stronger.