• Journal of Korea Spatial Information System Society
• /
• v.2 no.2 s.4
• /
• pp.39-48
• /
• 2000

The purpose of this study is to develop a converting algorithm for providing real-time traffic information through the FM DARC(DAta Radio Channel). The converting algorithm based on the GIS node-link system enables raw traffic data to be a standard traffic information. The standard traffic information in data quality, quantity and format is an essential to construct the FM DARC traffic information system effectively. We have developed the algorithm and applied it to the FM DARC system. After introducing FM DARC briefly, this paper presents GIS DB, the converting algorithm and the client/server FM DARC system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.68-82
• /
• 2011

Wireless mesh networks (WMNs) provide high-speed backbone networks without any wired cable. Many researchers have tried to increase network throughput by using multi-channel and multi-radio interfaces. A multi-radio multi-channel WMN requires channel assignment algorithm to decide the number of channels needed for each link. Since the channel assignment affects routing and interference directly, it is a critical component for enhancing network performance. However, the optimal channel assignment is known as a NP complete problem. For high performance, most of previous works assign channels in a centralized manner but they are limited in being applied for dynamic network environments. In this paper, we propose a simple flow estimation algorithm and a hybrid channel assignment algorithm. Our flow estimation algorithm obtains aggregated flow rate information between routers by packet sampling, thereby achieving high scalability. Our hybrid channel assignment algorithm initially assigns channels in a centralized manner first, and runs in a distributed manner to adjust channel assignment when notable traffic changes are detected. This approach provides high scalability and high performance compared with existing algorithms, and they are confirmed through extensive performance evaluations.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.1
• /
• pp.68-73
• /
• 2002

One widely-used technique by which network attackers attain anonymity and complicate their apprehension is by employing stepping stones: they launch attacks not from their own computer but from intermediary hosts that they previously compromised. We develop an efficient algorithm for detecting stepping stones by monitoring a site's Internet access link. The algorithm is based on the distinctive characteristics(packet size, timing) of interactive traffic, and not on connection contents, and hence can be used to find stepping stones even when the traffic is encrypted. We evaluate the algorithm on large Internet access traces and find that it Performs quite well. However, the success of the algorithm is tempered by the discovery that large sites have many users who routinely traverse stepping stones for a variety of legitimate reasons.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6B
• /
• pp.553-562
• /
• 2003

Supporting QoS (Quality of Service) for the multimedia applications becomes an important issue as the demand of multimedia applications increases. Thus, it is necessary for the application layer to have an efficient congestion control algorithm, which can support the multimedia applications' QoS requirements. In this paper, we propose a new application layer congestion control algorithm, called RRC-OTT (Receiver-based Rate Control with One-way Trip Time). RRC-OTT algorithm differs from the previously proposed algorithms in that the receiver takes the responsibility of the network congestion control. Thus, RRC-OTT algorithm can not only precisely estimate the network congestion using OTT (one-way Trip Time), but reduce the work load from the sender (e.g., the web server). Our simulation study shows that RRC-OTT algorithm can maintain the comparable link utilization to the previously proposed algorithms and keep the packet jitter low, which thus can help enhance the quality of multimedia applications.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.5 s.335
• /
• pp.55-62
• /
• 2005

In this paper, we propose an efficient symbol detection algorithm for space-frequency OFDM (SF-OFDM) transmit diversity scheme and present the implementation results of the SF-OFDM WLAN baseband processor with the proposed algorithm. When the number of sub-carriers in SF-OFDM scheme is small, the interference between adjacent sub-carriers may be generated. The proposed algorithm eliminates this interference in a parallel manner and obtains a considerable performance improvement over the conventional detection algorithm. The bit error rate (BER) performance of the proposed detection algorithm is evaluated by the simulation. In the case of 2 transmit and 2 receive antennas, at $BER=10^{-4}$ the proposed algorithm obtains about 3 dB gain over the conventional detection algorithm. The packet error rate (PER), link throughput, and coverage performance of the SF-OFDM WLAN with the proposed detection algorithm are also estimated. For the target throughput at $80\%$ of the peak data rate, the SF-OFDM WLAN achieves the average SNR gain of about 5.95 dB and the average coverage gain of 3.98 meter. The SF-OFDM WLAN baseband processor with the proposed algorithm was designed in a hardware description language and synthesized to gate-level circuits using 0.18um 1.8V CMOS standard cell library. With the division-free architecture, the total logic gate count for the processor is 945K. The real-time operation is verified and evaluated using a FPGA test system.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.773-774
• /
• 2005

The knapsack problem (KP) is one of the traditional optimization problems. Specially, multiconstrained knapsack problem (MKP) is well-known NP-hard problem. Many heuristic algorithms and evolutionary algorithms have tackled this problem and shown good performance. This paper presents a novel genetic algorithm for the multiconstrained knapsack problem. The proposed algorithm is called 'Adaptive Link Adjustment'. It is based on integer random key representation and uses additional ${\alpha}$ and ${\beta}$-process as well as selection, crossover and mutation. The experiment results show that it can be archive good performance.

• Proceedings of the KIPE Conference
• /
• 2001.12a
• /
• pp.149-152
• /
• 2001

A Single-phase bi-directional inverter Using a diode bridge-type resonant circuit to implement ZVT(Zero Voltage Transition) switching is Presented. It is shown that the ZACE(Zero Average Current Error) algorithm based polarized ramptime current control can provide a suitable interface between diode bridge-type resonant circuit DC link and the inverter. The current control algorithm is analyzed about how to design the circuit with analyzed switch which m ZVT operation for the main power switch The simulation and experimental results would be shown to verify the proposed current algorithm, because the main power switch is turn on with ZVT and the bi-directional inverter is operated.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.8
• /
• pp.498-500
• /
• 2005

In a CDMA system, the capacity is variable and mainly depends on multiple access interference. The multiple access interference has a deep relationship with transmitted or received power The capacity of CDMA2000 1x system is considered to be limited by the forward link capacity Different rate data traffic requires different transmitted power and rate controlling enables the system utilize radio resource more efficiently. A very simple rate control algorithm for data calls in CDMA2000 1x system is proposed. In the proposed algorithm, by monitoring the total transmit power, we can simply adjust data rate to channel conditions and efficiently use radio resources. The proposed algorithm is easy to implement in power controlled CDMA systems.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.23-36
• /
• 1997

In the design of telecommunication network, the network configuration using hubbing topology is useful for designing and managing the network efficiently : i. e. all of central offices (COs) are grouped into clusters. Each cluster has one hub consisting of large-scale transmission facilities like digital cross-connect systems and ATMs. In clustering process, the community of interest and geographical factor should be considered. However, there exists a tradeoff between two factors. One is to minimize total link costs for geographical factor and the other is to maximize the total intra-cluster traffics for community of interest. Hence, this can be solved by multiobjective linear programming techniques. In this paper, the problem under considerations is formulated as two p-median subproblems taking into considerations total costs and total intra-traffics, respectively. Then we propose the algorithm to solve the problem based on the concept of cost-traffic tradeoff. The algorithm enables to identify efficient cost-traffic tradeoff pairs. An illustration is also presented.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.221-223
• /
• 2005

In a CDMA system, the capacity is variable and mainly depends on multiple access interference. The multiple access interference has a deep relationship with transmitted or received power. The capacity of CDMA2000 1x system is considered to be limited by the forward link capacity. Different rate data traffic requires different transmitted power and rate controlling enables the system utilize radio resource more efficiently. A very simple rate control algorithm fer data calls in CDMA2000 1x system is proposed. In the proposed algorithm, by monitoring the total transmit power, we can simply adjust data rate to channel conditions and efficiently use radio resources. The proposed algorithm is easy to implement in power controlled CDMA systems.