Taekyoung Kwon

Recently there is a growing interest in adaptive mtitimetia networhng where the bandwidth of an ongoing mdtirnedia cdl is variable k this paper we propose a d admission control framework for adaptive mtitimedia servic~in wire l&s/mobile networks. We introduce the degradation period ratio (DPR) QoS parameter, whia represents the portion of a cdl's fifetime that it is ~ocated bandwidth below a pre defined target b=dwidth to the whole stice time of the cdl. Based on DP& we present how to guarantee

Devising a user authentication scheme based on personal identification numbers (PINs) that is both secure and practically usable is a challenging problem. The greatest difficulty lies with the susceptibility of the PIN entry process to direct observational attacks, such as human shoulder-surfing and camera-based recording. This paper starts with an examination of a previous attempt at solving the PIN entry problem, which was based on an elegant adaptive black-and-white coloring of the 10-digit k

Limitations to the bandwidth of wireless links has motivated the development of adaptive multimedia services where the bandwidth of a call can be dynamically adjusted. A threshold-type call admission control algorithm is proposed for quality of service provisioning; a nonlinear programming model is formulated for determining the optimal threshold values.

Recently there is a growing interest in adaptive multimedia networking where the bandwidth of an ongoing multimedia call is variable. In this paper, we propose a measurement-based call admission control (CAC) which guarantees the upper bound of the call degradation probability defined herein. Our CAC measures the state of the cellular system in a distributed manner and reflects the observed history of the system on making call admission decisions. Also, a bandwidth adaptation algorithm to minimi

Article Bandwidth adaption algorithms with multi-objectives for adaptive multimedia services in wireless/mobile networks Share on Authors: Taekyoung Kwon Department of Computer Engineering, Seoul National University, Seoul, Korea Department of Computer Engineering, Seoul National University, Seoul, KoreaView Profile , Ilkyu Park Department of Computer Engineering, Seoul National University, Seoul, Korea Department of Computer Engineering, Seoul National University, Seoul, KoreaView Profile , Yan

Abstract Routing protocols in wireless sensor networks (WSNs) typically employ a transmitter‐oriented approach in which the next hop node is selected based on neighbor or network information. This approach incurs a large overhead when the accurate neighbor information is needed for efficient and reliable routing. In this paper, a novel receiver‐oriented load‐balancing and reliable routing (RLRR) protocol is proposed. In RLRR, an intermediate node solicits next hop candidates, each of which is to

We propose a new authentication and key distribution protocol which is adaptable and reliable for communication networks. The secrets for authentication, which are chosen from a relatively small space by common users, are easy to guess. Our protocol gives a solution to protect the weak secrets from guessing attacks. Compared with other related work, our protocol is more reliable because it is resistant to various kinds of attacks including guessing attacks, and more adaptable because it reduces