• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.429-437
• /
• 2004

The mobileip working group is equipped with the RR(Return Routabilit) taking the simple procedures and small amount of cryptographic operations by considering the processing capability of the mobile node however it dose not provide security features enough. To replace with enhanced methods, mobileip WG is making an effort to find the approved solutions include CGA(Craptographically Generated Address), IPsec(Internet Protocol Security) as well as the existing infrastructure such as AAA(Authentication, Authorization and Account) and PKI(Public Key Infrastructure). In this paper, we propose the authentication and route optimization based on AAA suitable for the requested security service for its successful story in wireless network such as 802.11 and 3GPP(3rd Generation Partnership Project) as well as wired one. We analyze the effectiveness of our scheme according to the traffic and mobility properties. The result shows the cost reduction up to 20 percent comparing with RR.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.69-76
• /
• 2005

To effectively use limited resources in wireless cellular networks it is necessary to predict exactly the amount of resources required by handoff calls at a future time. In this paper we propose a method which predicts the amount of resources needed by handoff calls more accurately than the existing method based on Wiener processes. The existing method uses the current demands to predict future demands. Although this method is much simpler than using traffic information from neighbor cells, its prediction error increases as time elapses, leading to waste of wireless resources. By using an exponential parameter to decrease the magnitude of error over time, we show in simulation how to outperform the existing method in resource utilization as well as in prediction of resource demands.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.6
• /
• pp.23-35
• /
• 2009

This study proposes a methodology for estimating representative section travel times using individual vehicle travel information under the ubiquitous transportation environment (UTE). A novel approach is to substantialize a concept of dynamic node-links in processing trajectory data. Also, grouping vehicles was conducted to obtain more reliable travel times representing characteristics of individual vehicle travels. Since the UTE allows us to obtain higher accuracy of vehicle positions, travel times for each lane can be estimated based on the proposed methodology. Evaluation results show that less than 10% of mean absolute percentage error was achievable with 20% of probe vehicle rate. It is expected that outcome of this study is useful for providing more accurate and reliable traffic information services.

• The KIPS Transactions:PartC
• /
• v.9C no.3
• /
• pp.399-406
• /
• 2002

We consider design of multiservice network link, in which connections of constant- and adaptive-rate services arrive and leave dynamically. We propose performance analysis and design methods of these dynamic multiservice networks. A multiservice network link is modeled by a Markov chain, and data rates for adaptive-rate connections are derived using QBD (Quasi-Birth-Death) processes and matrix-geometric equations. We estimate average number of adaptive-rate connections, average data rate and average connection delay. The performance of constant-rate connections is determined from the blocking probability of the connections. Based on the performance of constant-and adaptive- rate connections, we propose a design methods of a network link to satisfy performance requirements of constant- and adaptive-rate connections (data rates, delay, blocking probability). Our methods can be used for the analysis and design of network switch supporting dynamic data and voice (video) traffic simultaneously.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.419-427
• /
• 2009

This paper propose DA-UDC(Double Authentication User, Device, Cross) Module which solves the cost problem and the appropriation of Certificate using User Authentication, Device Authentication and Cross Authentication with OTA(One Time Authentication) Key, and which is designed not to subscribe to the service of Home network business. Home Server transmits its public key which is needed to create OTA to the user which passed the first step of authentication which verifies User ID, Device ID and Session Key. And it performs the second step of authentication process which verifies the OTA key created by a user. Whenever the OTA key of DA-UDC module is generated, the key is designed to be changed. Therefore, DA-UDC Module prevents the exposure of User and Device ID by performing the two steps of authentication and enhances the authentication security of Home Network from malicious user with OTA key. Also, DA-UDC Module is faster than the existing authentication system in processing speed because it performs authentication calculation only once. Though DA-UDC Module increases data traffic slightly because of the extra authentication key, it enhances the security more than the existing technique.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.73-79
• /
• 2014

In this paper, we proposed the mechanism which can measure traffic flow and vehicle speed on the highway as well as road by using the video and image processing to detect and track cars in a video sequence. The proposed mechanism uses the first few frames of the video stream to estimate the background image. The visual tracking system is a simple algorithm based on the sum of absolute frame difference. It subtracts the background from each video frame to produce foreground images. By thresholding and performing morphological closing on each foreground image, the proposed mechanism produces binary feature images, which are shown in the threshold window. By measuring the distance between the "first white line" mark and the "second white line"mark proceeding, it is possible to find the car's position. Average velocity is defined as the change in position of an object divided by the time over which the change takes place. The results of proposed mechanism agree well with the measured data, and view the results in real time.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.4
• /
• pp.421-429
• /
• 2018

While IoT device sensing data or financial transaction data is transmitted in real time, huge data traffic is generated in processing it. This huge data can be effectively compressed or transmitted using universal code, which is a real-time lossless compressor. In this paper, we propose our BL-beta code, which is newly developed universal code for compressing stock trading data, which the maximum range of measured values is difficult to predict and is generated within a relatively constant range over a very short period of time. For compressing real-time stock trading data, Compared with the fixed length bit transmission, the compression efficiency is at least 49.5% higher than that of the fixed length bit transmission, and the compression transmission performance is 16.6% better than the Exponential Golomb code.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.345-348
• /
• 2013

This paper provides a method for compression and transmission of on-chip bus data. As the data traffic on on-chip buses is rapidly increasing with enlarged video resolutions, many video processor chips suffer from a lack of bus bandwidth and their IP cores have to wait for a longer time to get a bus grant. In multimedia data such as images and video, the adjacent data signals very often have little or no difference between them. Taking advantage of this point, this paper develops a simple bus data compression method to improve the chip performance and presents its hardware implementation. The method is applied to a Video Codec - 1 (VC-1) decoder chip and reduces the processing time of one macro-block by 13.6% and 10.3% for SD and HD videos, respectively.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.33-38
• /
• 2003

Most of the existing algorithms try to disseminate the multimedia contents of internet service provider (ISP), without taking into account characteristics and capacities of duplicated servers. However, they are less reliable without prior information on capacities of duplicated servers. In this paper we propose two algorithms, performance rating algorithm of hardware and capacity algorithm, inspired by the need of improving QoS of delivering multimedia contents without incurring long access delays when the capacities of duplicated servers are significantly different and clients locate in a fixed geographical domain Our simulation results show that they are better than HTTP response time algorithm when the multimedia contents are large and quite different from performances between duplicated servers.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.387-394
• /
• 2004

One of the main challenges in personal communication services(PCS ) Is to locate many mobile terminals that nay move from place to place frequently. This kind of system operation is called location management. This task entails sophisticated signaling traffic and database queries. Several strategies have been proposed to improve the efficiency of location management. These strategies use location register databases to store the current locations of mobile terminals, and are vulnerable to failure of the location register databases. In this paper, we propose a fault-tolerant pointer forwarding scheme with distributed home location register in order to tolerate the failure of location registers. The performance of the proposed scheme is evaluated analytically by simulation, and Is compared with Biaz's bypass forwarding strategy and two-path forwarding strategy.