• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.6 s.360
• /
• pp.31-39
• /
• 2007

In this paper, a system for real-time or periodic measurement and analysis of RF parameters such as forward transmit power and pilot power in CDMA base station systems is proposed. Such RF characteristic parameter measurement can be prevented from system fault and used to achieve optimal service quality and maximum investment return through cell coverage expansion, subscriber capacity increase and so on. For forward power measurement, the local oscillator frequency for the detector is varied so that the transmit power for all channels can be measured. The channel power measurement can be used to analyze the variation in transmit power for changes in voice traffic. By comparing to forward $E_c/I_o$, the pilot channel power can be deducted, which can be used to determine uy degradation in transmit section modules such as the high dover amplifier. Since an accurate analysis of carefully measured data using the CDMA level detector must be made, the system is designed so that measurement errors due to changes in crest factor with modulation method can be overcome.

• KIISE Transactions on Computing Practices
• /
• v.21 no.10
• /
• pp.651-657
• /
• 2015

The amount of web traffic has increased as a result of the rapid growth of the use of web-based applications. In order to obtain valuable information from web logs, we need to develop systems that can support interactive, flexible, and efficient ways to analyze and handle large amounts of data. In this paper, we present CERES, a log-based, interactive web analytics system for backbone networks. Since CERES focuses on analyzing web log records generated from backbone networks, it is possible to perform a web analysis from the perspective of a network. CERES is designed for deployment in a server cluster using the Hadoop Distributed File System (HDFS) as the underlying storage. We transform and store web log records from backbone networks into relations and then allow users to use a SQL-like language to analyze web log records in a flexible and interactive manner. In particular, we use the data cube technique to enable the efficient statistical analysis of web log. The system provides users a web-based, multi-modal user interface.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.06a
• /
• pp.304-305
• /
• 2022

Recently, as digital communication technology is widely applied to the maritime field, large amounts of maritime data are being accumulated. Accordingly, attempts to create new value by applying data science and Artificial Intelligence(AI) technologies are emerging. Typically, Ministry of Oceans and Fisheries has been providing korean e-Navigation service since 2021 based on LTE-Maritime communication network, as well as R&D for creating value-added service through analyzing huge-sized maritime traffic data is underway. By the way, to do any data-based research, legal system, as a research infra, that researchers can get the data whenever they need is essential. This paper looked at types of data in maritime fields, checked related legal system about scientific analysis and utilization. It is confirmed that there are some legal factors which restrict its scientific analysis and utilization, and suggested ways of improvement to boost R&D using maritime data as a conclusion.

• Journal of the Korean Society of Safety
• /
• v.38 no.6
• /
• pp.50-59
• /
• 2023

As the diversity of disasters continues to increase, the concept of "complex disasters" has gained prominence in various policies and studies related to disaster management. However, there has been a certain limitation in the availability of the systematic statistics or data in advancing policies and research initiatives related to complex disasters. This study aims to analyze the macro-level characteristics of the complex disasters that have occurred domestically utilizing a 30-year span of a news data. Initially, we categorize the complex disasters into the three types: "Natural disaster-Natural disaster", "Natural disaster-Social disaster", and "Social disaster-Social disaster". As a result, the "natural diaster-social disaster" type is the most prevalent. It is noted that "natual disaster-natural disaster" type has increased significantly in recent 10 years (2011-2020). In terms of specific disaster types, "Storm and Flood", "Collapse", "Traffic Accident", "National Infrastructure Paralysis", and "Fire⋅Explosion" occur the most in conjunction with other disasters in a complex manner. It has been observed that the types of disasters co-ocuuring with others have become more diverse over time. Parcicularly, in recent 10 years (2011-2020), in addition to the aforementioned five types, "Heat Wave", "Heavy Snowfall⋅Cold Wave", "Earthquake", "Chemical Accident", "Infectious Disease", "Forest Fire", "Air Pollution", "Drought", and "Landslide" have been notable for their frequent co-occurrence with other disasters. These findings through the statistical analysis of the complex disasters using long-term news data are expected to serve as crucial data for future policy development and research on complex disaster management.

• Journal of Internet Computing and Services
• /
• v.13 no.2
• /
• pp.41-49
• /
• 2012

Wireless network support and extended mobile network environment with exponential growth of smart phone users allow us to utilize the network anytime or anywhere. Malicious attacks such as distributed DOS, internet worm, e-mail virus and so on through high-speed networks increase and the number of patterns is dramatically increasing accordingly by increasing network traffic due to this internet technology development. To detect the patterns in intrusion detection systems, an existing research proposed an efficient algorithm called the jumping window algorithm and analyzed approximately 2,000 patterns in Snort 2.1.0, the most famous intrusion detection system. using the algorithm. However, it is inappropriate from the number of TCAM lookups and TCAM memory efficiency to use the result proposed in the research in current environment (Snort 2.9.0) that has longer patterns and a lot of patterns because the jumping window algorithm is affected by the number of patterns and pattern length. In this paper, we simulate the number of TCAM lookups and the required TCAM size in the jumping window with approximately 8,100 patterns from Snort-2.9.0 rules, and then analyse the simulation result. While Snort 2.1.0 requires 16-byte window and 9Mb TCAM size to show the most effective performance as proposed in the previous research, in this paper we suggest 16-byte window and 4 18Mb-TCAMs which are cascaded in Snort 2.9.0 environment.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.5
• /
• pp.25-36
• /
• 2016

The goal of the SmartGrid is to maximize energy efficiency by exchanging bi-directional real-time power information with the help of ICT(Information and Communication Technology). In this paper, we propose a "JRS-MS" (Joint Routing and Scheduling for Multi-channel SmartGrid) algorithm that uses numerical modeling methods in IEEE 802.11s based STDMA multi-channel SmartGrid NAN networks. The proposed algorithm controls the amount of data transmission adaptively at the link layer and finds a high data-rate path which has the least interference between traffic flows in multi-channel SmartGrid NAN networks. The proposed algorithm improve transmission performance by enhancing network utilization. By comparing the results of performance analysis between the proposed algorithm and the JRS-SG algorithm in the previous paper, we showed that the JRS-MS algorithm can improve transmission performance by maximally utilizing given network resources when the number of flows are increasing in the multi-hop NAN wireless mesh networks.

• Journal of Korean Society of Transportation
• /
• v.21 no.2
• /
• pp.71-82
• /
• 2003

The shortest path problems(SPP) are critical issues in the military logistics such as the simulation of the War-Game. However, the existing SPP has two major drawbacks, one is its accuracy of solution and the other is for only one solution with focused on just link cost in the military transportation planning models. In addition, very few previous studies have been examined for the multi-shortest path problems without considering link capacity reflecting the military characteristics. In order to overcome these drawbacks, it is necessary to apply the multi-shortest paths algorithm reflecting un-expected military incidents. This study examines the multi-shortest paths in the real networks using Shier algorithm. The network contains both military link capacity and time-based cost. Also, the modes are defined as a platoon(group) rather than unit which is used in most of previous studies in the military logistics. To verify the algorithm applied in this study. the comparative analysis was performed with various sizes and routes of network which compares with Dijkstra algorithm. The major findings of this study are as follows ; 1) Regarding the unique characteristics of the military transportation plan, Shier algorithm, which is applied to this study, is more realistic than Dijkstra algorithm. Also, the time based concept is more applicable than the distance based model in the military logistics. 2) Based on the results from the various simulations of this study the capacity-constraint sections appeared in each scenarios. As a consequence, the alternatives are necessary such as measures for vulnerable area, improvement of vehicle(mode), and reflection of separated-marching column in the military manuals. Finally. the limits and future research directions are discussed : 1) It is very hard to compare the results found in this study. which is used in the real network and the previous studies which is used in arbitrary network. 2) In order to reflect the real military situations such as heavy tanks and heavy equipment vehicles. the other constraints such as the safety load of bridges and/or the height of tunnels should be considered for the future studies.

• Journal of Korean Society for Geospatial Information Science
• /
• v.1 no.1 s.1
• /
• pp.127-140
• /
• 1993

The purpose of this paper is to examine the possible benefits of combining transportation planning models with geographic information systems (GIS) in the hope that intergrating these systems can alleviate the inherent problems of transportation planning models such as user unfriendliness, labor intensiveness, and theoretical limitations. Specially, this paper focuses on the issue of incompatiblity between GIS and the conventional transportation planning models in dealing with network topologies. Resolving this conflict in topologies is a conerstone for eliminating the user-unfriendliness and labor-intensiveness issues. This paper presents the development of an algorithm that converts GIS topology into transportation network topology. The FORTRAN-based topology conversion algorithm generates transportation networks from the GIS cartographic file and establishes a communication charmel between the two systems.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.10
• /
• pp.30-39
• /
• 1999

In this paper, the size of IWU frame cell buffer is analyzed that receives FR frame cells from other FR networks through ATM backbone network. The frame cell buffer receives multiplexed ATM cells from other IWUs that provide interworking with ATM network for other FR networks A receiving IWU reassembles frames from multiplexed ATM cells by identifying the VPI/VCIs. The reassembled frames are transmitted on FR network links according to their destination. Therefore, IWU needs sufficient amount of buffers for the assembly of the frames and for providing the assembled frames with the queue to wait until the frame is transmitted by FR network link. In this paper, the probability of frame loss at the frame cell buffer is derived in terms of traffic parameters, the number of multiplexed FR connections, the number of FR links and the transmission capacity. By applying the derived results, we analyzed the required buffer size for a given probability of frame loss. Also, it is presented that how the probability and the required size are effected by the number of multiplexed FR connections and FR transmission links.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8B
• /
• pp.1105-1114
• /
• 2010

The Proxy Mobile IPv6 (PMIPv6) has been standardized by the IETF NETLMM WG for network-based mobility management. The PMIPv6 can provide IP mobility for Mobile Nodes (MNs) with low handover latency and less wireless resource usage. But, since the PMIPv6 is basically designed for local mobility management, it cannot support directly global mobility management between different PMIPv6 domains. In the PMIPv6, since all traffic is routed through a Local Mobility Anchor (LMA), it causes a long end-to-end delay and triangular routing problem. Therefore, in this paper, we propose a fast network-based global mobility management scheme and route optimization scheme with a new network entity, called Global Mobility Agent (GMA). Numerical analysis and simulation results show that the proposed scheme is able to support global mobility between different public domains with low handover latency and low end-to-end delay, compared with the PMIPv6.