• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.217-223
• /
• 2004

This paper proposes a new backoff scheme to improve the throughput of stations over wireless local area networks. It is designed to carry out the proposed backoff scheme using information of basic service area, such as number of stations, in terms of the throughput. Basic idea of the proposed backoff scheme is that we change the contention window size for backoff time as collisions increase. We evaluate the performance of the proposed backoff scheme using Markov model analysis and compare it with the IEEE 802.11e backoff scheme. The numerical results indicate that the Proposed backoff scheme may offer better performance than the conventional backoff scheme in terms of the throughput.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.2
• /
• pp.83-88
• /
• 2001

In this paper, System performance parameters such as throughput, blocking probability and delay have been analyzed and expressed as a function of demanding traffic and service terminating probability, and we centers our discussion at particular downlink port of satellite switch which is capable of switching the individual spot beam and processing the information signals in the packet satellite communications with demand assigned multiple access technique. Delay versa throughput as a function of traffic parameters with several service terminating probability can be derived via mathematical formulation and simulation and the relative change of transmission delay was compared.

• Economic and Environmental Geology
• /
• v.18 no.1
• /
• pp.41-47
• /
• 1985

The filtering ability of $J_0$ and $J_1$ digital linear filters is compared by means of an adaptive linear filter. Any $J_0$ domain Hankel transform integral can be transformed mathematically into its corresponding $J_1$ domain integral. The apparent resistivities for any electrode configuration employed in resistivity soundings can be evaluated with a single $J_1$ filter. The $J_1$ filter usually has similar accuracy to, but shorter length than, the corresponding $J_0$ filter. The domain transformation from $J_0$ to $J_1$ enables us to use effective expressions of apparent resistivity, involving $J_1$ alone, not only for Schlumberger but also for dipole-dipole array.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.11
• /
• pp.22-27
• /
• 2011

In spectrum sensing, an energy detector compares the energy of a received signal with a predetermined detection threshold and decides whether a primary user is active or not in a licensed frequency band. Here the detection threshold is related to the noise power level in the band. Most previous works on energy detection have assumed that the noise power is exactly known a priori. However, this assumption does not hold in practice since there may be some uncertainty about the noise power. So it is necessary to investigate its effects on the performance of energy detection for spectrum sensing. In this paper, we analyze the effects using the residue theorem for contour integral and present the associated numerical results.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.319-326
• /
• 1994

Automatic control has been for the most part applied to linear systems where ti can be approximately formalized. In case that it is not definitely established the mathematical modelling to control objects, it requires manual control strategies which put under the human rule. In this paper, it constructs an FLC (Fuzzy Logic Controller) in order to turn a hand control into an automatic control in the domain of swimming pool that has been almost absolutely dependant on a skilled worker's experience. Genetic algorithms upgrade the knowledge which is acquired from human expert, using by FLC, so as to maintain knowledge in the very optimal way. It also designs an algorithm that modifies the rule base and the membership function at the same time, and ultimately will show that it can get better result than human controllers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.10A
• /
• pp.1615-1624
• /
• 2001

이동 컴퓨팅 환경에서는 충분하지 못한 자원으로 인해 기존의 분산 알고리즘이 비효과적인 경우가 많다. 특히 이동 호스트의 낮은 가용성으로 인하여 중단 없는 서비스를 보장받기 힘들다. 이들의 원인은 낮은 대역폭과 호스트들의 이동성, 작은 저장장치 및 안전하지 않은 저장장치, 이동 호스트와 이동 호스트, 이동 호스트와 기지국간의 통신 오버헤드 그리고 충분하지 못한 배터리 수명들을 들 수 있다. 특히 통신 오버헤드(이동 호스트를 찾는 오버헤드, 이동 호스트의 정보를 저장하는 오버헤드 등)로 인해 호스트의 배터리 수명을 단축시키고 통신비용을 증가시킨다. 이러한 통신 오버헤드를 최소화함으로써 이동 호스트의 배터리 수명이나 고장으로부터 좀 더 안전한 시스템을 구성할 수 있다. 본 논문에서는 셀룰라 네트워크를 기반으로 하는 이동 컴퓨팅 환경에서 통신비용과 이동 호스트의 작업을 최소화시키는 조정된 2-계층 체크포인팅(coordinated checkpointing) 알고리즘을 제안하고 수학적으로 비용을 분석하였으며 기존 알고리즘과 성능을 비교하였다. 기존의 조정된 체크포인팅 알고리즘에서 통신비용(메시지 수)의 복잡도는 이동 호스트의 수의 제곱(O(n$^2$))이지만, 제안한 알고리즘은 기지국의 수 더하기 이동 호스트의 수의 제곱(O(n+$m^2$))이다. 일반적으로 기지국의 수에 비해 이동 호스트의 수가 상대적으로 훨씬 많기 때문에 (n>>m) 기존의 알고리즘에 비해 제안한 알고리즘은 상대적으로 많은 통신비용을 감소시킬 수 있다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.11
• /
• pp.32-41
• /
• 1990

This paper proposes a method of using image features in serving a robot manipulator. Specifically, the con-cept 'feature' is first mathematically defined and then differential relationship between the robot motion and feature vector is derived in terms of Feature Jacobian Matrix and its generalized inverse. Also, by using more features than the number of DOFs of the robot, the visual servoing performance is shown to be improv-ed. Via various examples, the method of feature-based servoing of a robot proposed in this paper is proved to be effective for conducting object-oriented robotic tasks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1282-1289
• /
• 2000

In this paper we propose a Fractional Channel Reservation (FCS) scheme to satisfy a desired handoof dropping probability and to reduce the blocking probability of new calls using mobility characteristics and incoming handoff rate in mobile communication networks. When the ratio of the handoff call arrival rate is less then the ratio of the new call arrival rete, the proposed scheme is capable of determining the number of the guard channels which can guarantee the Quality of Service(QoS) in terms of the request handoff dropping probability and allocating dynamically the wireless channels the new calls according to the rest of the guard channels to reduce the new call blocking probability. Also we perform mathematical analysis and simulation to evaluate the performance of proposed scheme and compare to conventional guard channel scheme in terms of dropping probability blocking probability and the utilization efficiency of wireless channels.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.404-415
• /
• 2002

In this paper, we address the issue of ensuring consistency of multiple data items requested in a certain order by read-only transactions in a wireless data broadcast environment. To handle the inherent property in a data broadcast environment that data can only be accessed strictly sequential by users, we explore a predeclaration-based query optimization and devise two practical transaction processing methods in the context of local caching. We also evaluate the performance of the proposed methods by an analytical study Evaluation results show that the predeclaration technique we introduce reduces response time significantly and adapts to dynamic changes in workload.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2696-2705
• /
• 1997

An exact experssion for the average symbol error rate(SER) of L-order selection diversity for MPSK signals in a frequency-nonselective slowy m-distributed Nakagami fading and additive white Gaussian noise(AWGN) is determs of finite sums is obtained. To derive the SER of MPSK signals with selection combining, the new expression of pdf is introduced and many other mathmatical methods are used. When fading index m is 1, the derived exppression lead to those of MPSK with selection combining in Rayleight fading channels. The results show that the error probability decreases as the order of diversity increases.