• 한국통신학회논문지
• /
• 제31권2B호
• /
• pp.98-106
• /
• 2006

본 논문에서는 무선LAN에서 실시간 트래픽의 효율적인 전송을 위해 새로운 재밍방식을 사용한 충돌 방지 방안을 제안하고 기존 MAC과의 성능을 비교 분석하였다. 기존의 무선LAN에서는 단말들간 프레임 전송 충돌을 방지하기 위하여 이진 지수 분포(BinaryExponential) 백오프 알고리즘을 사용하기 때문에, 망의 부하가 크거나, 망에 존재하는 무선 단말의 수가 많을수록 프레임 충돌이 발생할 확률이 증가하므로 실시간 트래픽 전송에 불리하다. 이 점에 착안하여 본 논문에서 제안한 재밍 기반의 재전송 방식은 실시간 트래픽의 전송 중 충돌이 발생하면, 충돌에 개입한 각 무선 단말이 동시에 충돌을 감지하고 자신의 채널 사용 횟수를 기록한 데이터 베이스를 참조하여, 서로 상이한 재밍 윈도우 기간 동안 재밍 신호를 송신함으로써, 다른 단말의 접근을 일단 차단시킨다. 이후, 자신의 재밍 윈도우 기간 만기시 채널이 비어있는 경우에만 자신의 프레임을 재전송하도록 함으로써 해당 프레임의 재충돌을 방지한다. 이 과정에서 송신단말이 동시에 충돌을 감지할 수 있도록 모든 연결의 실시간 프레임들은 고정된 길이를 가지도록 하여 전송한 프레임에 대한응답 프레임을 수신하기까지 걸리는 시간은 동일한 것으로 가정하였다. 제안된 방식과 기존 MAC의 성능을 모의 실험으로 비교 분석한 결과, 제안 방식의 경우 프레임의 평균 충돌횟수, 평균 백오프 시간 그리고 프레임의 평균 전송대기 시간이 기존 방식보다 우수하였다. 제안된 방식을 실시간 트래픽 양이 많은 무선랜에서 활용한다면, 실시간 트래픽의 전송 지연 시간을 단축시킴으로써, 무선LAN의 실시간 응용에 적절하게 적용될 수 있을 것이다.

• 대한기계학회논문집A
• /
• 제24권7호
• /
• pp.1689-1696
• /
• 2000

This paper proposes a new adaptive control scheme for flexible-link robots. A model-based nonlinear control scheme is designed based on a V-shape Lyapunov function, and then the nonlinear control i s extended to a model-based adaptive control to cope with parametric uncertainties in the dynamic model. The proposed control guarantees the global exponential or global asymptotic stability of the overall control system with all internal signals bounded. The effectiveness of the proposed control is shown by computer simulation.

• 대한기계학회논문집
• /
• 제12권1호
• /
• pp.163-172
• /
• 1988

본 논문에서는 GAC방법을 이용하여 공작기계의 안내면오차를 수치제어 공작기계가 가지고 있는 가공조건의 조절 능력을 이용하여 가공오차를 보상제어 함으로써 규명(identification)할 수 있는 방법을 제시한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.176-180
• /
• 2004

In this paper we introduce a bandwidth allocation algorithm and admission control policy for IEEE 802.16 broadband wireless access standard. The proposed mechanism is practical and compatible to the IEEE 802.16. Our scheme provides QoS support to high priority traffic and high throughput in low priority traffic. The simulation show that the proposed scheme includes QoS support for real-time traffic and we presented that BS determine a efficient contention mini-slot size. We have shown the relationship between traffic size and its QoS requirements and the network performance.

• Journal of information and communication convergence engineering
• /
• 제5권3호
• /
• pp.205-208
• /
• 2007

The IEEE 802.11 is a MAC protocol which has been standardized by IEEE for Wireless Local Area Networks (WLANs). In the IEEE 802.11 WLANs, network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW). This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. However, the BEB scheme suffers from a fairness problem; some nodes can achieve significantly larger throughput than others. This paper proposes a new backoff algorithm for the IEEE 802.11 DCF scheme. This algorithm uses the hop count for considering fairness. It causes flows with high hop count to generate short backoff interval than those with low hop count, thus getting high priority. Therefore, when a collision occurs, the modified IEEE 802.11 DCF assigns higher priority to flow to be close to a destination.

• Wind and Structures
• /
• 제3권1호
• /
• pp.1-10
• /
• 2000

Recently, an efficient and practical method has been developed for the generation of univariate non-Gaussian wind pressure time histories on low building roofs; this methodology requires intermittent exponential random numbers for the simulation. On the other hand, the conventional spectral representation scheme with random phase is found suitable for the generation of univariate Gaussian wind pressure time histories on low building roofs; this simulation scheme requires uniform random numbers. The dependency of these simulation methodologies on the random number generator is one of the items affecting the accuracy of the simultion result; therefore, an attempt has been made to investigate the issue. This note presents the observed sensitivity of random number sets in repetitive simulations of Gaussian and non-Gaussian wind pressures.

• Journal of Communications and Networks
• /
• 제15권6호
• /
• pp.606-613
• /
• 2013

This paper proposes a complete solution of a contention-based medium access control in wireless local networks to provide station level quality of service guarantees in both downstream and upstream directions. The solution, based on the mature distributed coordination function protocol, includes a new fixed contention window backoff scheme, a tuning procedure to derive the optimal parameters, a super mode to mitigate the downstream bottleneck at the access point, and a simple admission control algorithm. The proposed system guarantees that the probability of the delay bound violation is below a predefined threshold. In addition, high channel utilization can be achieved at the same time. The numerical results show that the system has advantages over the traditional binary exponential backoff scheme, including efficiency and easy configuration.

• Journal of Power Electronics
• /
• 제19권5호
• /
• pp.1162-1170
• /
• 2019

Finite-control-set model predictive control (FCS-MPC) is a promising control scheme for two-level voltage-source inverters (TL-VSIs). However, two main issues arise in the classical FCS-MPC method: an exponentially-increasing computational time and a low steady-state performance. To solve these two issues, a novel FCS-MPC method has been proposed for n-phase TL-VSIs in this paper. The basic idea of the proposed method is to carry out the FCS-MPC scheme of TL-VSIs for one leg by one leg, like a "pipeline". Based on this idea, the calculations are reduced from exponential time to linear time and its current waveforms are improved by applying more switching states per sampling period. The cases of three-phase and five-phase TL-VSIs were tested to verify the effectiveness of proposed method.

• Journal of information and communication convergence engineering
• /
• 제16권4호
• /
• pp.213-220
• /
• 2018

With the exponential developments of social network, their fundamental role as a medium to spread information, ideas, and influence has gained importance. It can be expressed by the relationships and interactions within a group of individuals. Therefore, some models and researches from various domains have been in response to the influence maximization problem for the effects of "word of mouth" of new products. For example, in reality, more than two related social groups such as commercial companies and service providers exist within the same market issue. Under such a scenario, they called social adversaries competitively try to occupy their market influence against each other. To address the influence maximization (IM) problem between them, we propose a novel IM problem for social adversarial players (IM-SA) which are exploiting the social network attributes to infer the unknown adversary's network configuration. We sophisticatedly define mathematical closed form to demonstrate that the proposed scheme can have a near-optimal solution for a player.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권6호
• /
• pp.3166-3187
• /
• 2017

For "generic" multivariate public key cryptography (MPKC) systems, experts believe that the Unbalanced Oil-Vinegar (UOV) scheme is a feasible signature scheme with good efficiency and acceptable security. In this paper, we address two problems that are to find inversion solution of quadratic multivariate equations and find another structure with some random Oil-Oil terms for UOV, then propose a novel signature scheme based on hyper-sphere (HS-Sign for short) which directly answers these two problems. HS-Sign is characterized by its adding Oil-Oil terms and more advantages compared to UOV. On the one side, HS-Sign is based on a new inversion algorithm from hyper-sphere over finite field, and is shown to be a more secure UOV-like scheme. More precisely, according to the security analysis, HS-Sign achieves higher security level, so that it has larger security parameters choice ranges. On the other side, HS-Sign is beneficial from both the key side and computing complexity under the same security level compared to many baseline schemes. To further support our view, we have implemented 5 different attack experiments for the security analysis and we make comparison of our new scheme and the baseline schemes with simulation programs so as to show the efficiencies. The results show that HS-Sign has exponential attack complexity and HS-Sign is competitive with other signature schemes in terms of the length of the message, length of the signature, size of the public key, size of the secret key, signing time and verification time.