• Title/Summary/Keyword: blocking set

Search Result 102, Processing Time 0.025 seconds

The Performance Analysis of a DS/CDMA Cellular System considering a Base Station Array Antenna and Imperfect Power Control (기지국 어레이 안테나와 불완전 전력 제어를 고려한 DS/CDMA 셀룰라 시스템의 성능 분석)

  • kim, Hyoung-Chae;Kim, Hang-Rae;Kim, Nam;Han, Tae-Young
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.12 no.5
    • /
    • pp.665-675
    • /
    • 2001
  • In this paper, the reverse link performance of a imperfect power controlled DS/CDMA cellular system that uses a base station array antenna which can effectively remove the multiple access interference is analyzed considering both beam forming algorithm and power control error in shadowing. The blocking probability of the DS/CDMA cellular system based on array parameters, $E_b/N_o$ and statistics of interference is derived, and then the system capacity corresponding to a certain blocking probability is calculated. On the assumption that the blocking probability is set 1%, the system capacity using MCGM algorithm with 12 antenna arrays is more increased maximum 32 times than that using a omni-directional antenna and about 2 times than that using MMSE algorithm, respectively.

  • PDF

Uniform Fractional Band CAC Scheme for QoS Provisioning in Wireless Networks

  • Rahman, Md. Asadur;Chowdhury, Mostafa Zaman;Jang, Yeong Min
    • Journal of Information Processing Systems
    • /
    • v.11 no.4
    • /
    • pp.583-600
    • /
    • 2015
  • Generally, the wireless network provides priority to handover calls instead of new calls to maintain its quality of service (QoS). Because of this QoS provisioning, a call admission control (CAC) scheme is essential for the suitable management of limited radio resources of wireless networks to uphold different factors, such as new call blocking probability, handover call dropping probability, channel utilization, etc. Designing an optimal CAC scheme is still a challenging task due to having a number of considerable factors, such as new call blocking probability, handover call dropping probability, channel utilization, traffic rate, etc. Among existing CAC schemes such as, fixed guard band (FGB), fractional guard channel (FGC), limited fractional channel (LFC), and Uniform Fractional Channel (UFC), the LFC scheme is optimal considering the new call blocking and handover call dropping probability. However, this scheme does not consider channel utilization. In this paper, a CAC scheme, which is termed by a uniform fractional band (UFB) to overcome the limitations of existing schemes, is proposed. This scheme is oriented by priority and non-priority guard channels with a set of fractional channels instead of fractionizing the total channels like FGC and UFC schemes. These fractional channels in the UFB scheme accept new calls with a predefined uniform acceptance factor and assist the network in utilizing more channels. The mathematical models, operational benefits, and the limitations of existing CAC schemes are also discussed. Subsequently, we prepared a comparative study between the existing and proposed scheme in terms of the aforementioned QoS related factors. The numerical results we have obtained so far show that the proposed UFB scheme is an optimal CAC scheme in terms of QoS and resource utilization as compared to the existing schemes.

Performance Analysis of Saturation Routing Algorithm in Non-Hierarchical Networks (비계층 통신망에서의 포화 경로 선정 알고리즘의 성능분석)

  • Park Young-Chul
    • Journal of Digital Contents Society
    • /
    • v.3 no.1
    • /
    • pp.89-99
    • /
    • 2002
  • Saturation routing algorithm is known to be an effective routing mechanism for tactical application and packet radio networks, since it minimizes the call set-up time and does not have to maintain routing tables. But, it is known that it has significant drawbacks with respect to the network efficiency, the overhead on the control messages [1]. We consider a tactical circuit-switched grid network with a maximum of tour links and two priority classes of voice traffic. Using the minimum first-derivative length (MFDL) path, we improve the blocking probability performance of a circuit-switched network without increasing the call set-up time and processor loading of the algorithm.

  • PDF

A Study on the Load Forecasting Methods of Peak Electricity Demand Controller (최대수요전력 관리 장치의 부하 예측에 관한 연구)

  • Kong, In-Yeup
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.9 no.3
    • /
    • pp.137-143
    • /
    • 2014
  • Demand Controller is a load control device that monitor the current power consumption and calculate the forecast power to not exceed the power set by consumer. Accurate demand forecasting is important because of controlling the load use the way that sound a warning and then blocking the load when if forecasted demand exceed the power set by consumer. When if consumer with fluctuating power consumption use the existing forecasting method, management of demand control has the disadvantage of not stable. In this paper, load forecasting of the unit of seconds using the Exponential Smoothing Methods, ARIMA model, Kalman Filter is proposed. Also simulation of load forecasting of the unit of the seconds methods and existing forecasting methods is performed and analyzed the accuracy. As a result of simulation, the accuracy of load forecasting methods in seconds is higher.

Erlang Capacity for the Reverse Link of a IS-95 Cellular System According to Approximation Method in Shadowing Channel (전파음영 채널에서 근사방법에 따른 IS-95 셀룰라 시스템의 역방향 링크에 대한 얼랑 용량)

  • Park, Young;Kim, Hang-Rae
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.10
    • /
    • pp.3210-3218
    • /
    • 2000
  • In a IS-95 cellular systm, blocking will occur when the reverse link user interference power reaches a predepermmed level which is set to maintam acceptable signal quality. In this paper, it is assumed that a mobile rdio channel is a shadowing channel and Erlang capacity is calculated for the reverse limk of an imperfect power controlled IS-95 cellular system. the blocking probability is derived using lognornal pproximation and the results according to guassian and lognormal approximation method are compared and analyzed respcctively. Assuming that blocking probability is 1% at the data rate of $R_b$=9.6kbps and $R_b$=14.4kbps, it is shown that Erlang capacity using Iognormal approximation is 13.68 Erlang and 7.08 Erlang and then the approximation erroris occurred about 24.4% and 40.4% inthe garssian approximation, respectively. It is also observed that if the power control becomes periect, the Erlang capacity is increased more 6.99 and 4.21 Erlang than that of the imperfect power control that the power contrl error is 2.5dB, and if voice activity is considered as 10%, the Erlang capacity is increased more 8.21 and 1.25 Erlang than that using non voice activity, respectively.

  • PDF

The Reverse Link Performance Analysis of cdma2000 Cellular System considering Adaptive Array Antenna (적응 배열 안테나를 고려한 cdma2000 셀룰러 시스템의 역방향 링크 성능 분석)

  • Park, Jong-Yong;Kim, Hang-Rae;Han, Tae-Young;Kim, Nam
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.4
    • /
    • pp.313-322
    • /
    • 2003
  • In this paper, the reverse link performance of imperfect power controlled cdma2000 cellular system that using array at a base station is analyzed, when MCGM beamforming algorithm and power control error is considered in shadowing. The blocking probability of the cdma2000 cellular system based on array parameters, E$\_$b//N$\_$0/ and interference statistics is calculated, and then the system capacity is calculated at a specific blocking probability. When the blocking probability is set 1 %, PCE(power control error) is 2 dB, M=2, 4, 8, 10, the capacity of cdma2000 is increased 2.3 ∼ 2.5 times higher than IS-95.

Low Power Real-Time Scheduling for Tasks with Nonpreemptive Sections (비선점 구간을 갖는 태스크들을 위한 저전력 실시간 스케줄링)

  • Kim, Nam-Jin;Kim, In-Guk
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.1
    • /
    • pp.103-113
    • /
    • 2010
  • The basic real-time scheduling algorithms based on RM or EDF approaches assume that the tasks are preemptive, but the tasks may contain nonpreemptive sections in many cases. Also the existing scheduling algorithm for reducing the power consumption of the processor is based on the task utilizations and determines the processor speed $S_H$ or $S_L$ according to the existence of the blocking intervals. In this algorithm, the $S_H$ interval that operates in high speed is the interval during which the priority inversion by blocking occurs, and the length of this interval is set to the task deadline that includes the blocking intervals. In this paper, we propose an improved algorithm that can reduce the power consumption ratio by shortening the length of the $S_H$ interval. The simulation shows that the power consumption ratio of the proposed algorithm is reduced as much as 13% compared to the existing one.

A Designing Method of Intranet Security Architecture Model for Network Security Efficiency (보안 효율성 제고를 위한 인트라넷 네트워크 아키텍쳐 모델)

  • Noh, Si-Choon
    • Convergence Security Journal
    • /
    • v.10 no.1
    • /
    • pp.9-17
    • /
    • 2010
  • Internet network routing system is used to prevent spread and distribution of malicious data traffic. The penetration of malicious code and the function of security blocking are performed on the same course of traffic pathway. The security architecture is the concept to distinguish the architecture from the group handling with the traffic on the structure of network which is performed with the function of penetration and security. The security architecture could be different from the criterion of its realm and function, which requires the development and the application of security mechanism for every architecture. For the establishment of security architecture it is needed to show what criterion of net work should be set up. This study is based on analysis of diagnostic weakness structure in the network security architecture and research the criterion for topology factor, security architecture structure map selection, and blocking location and disinfection net. It is shown to increase the effective rate blocking the virus with the proposed method in this paper rather than the traditional network architecture.

Evaluation of performance characteristics in the seeress of team attack during volleyball game (배구 경기에서 팀 공격 성공을 위한 선수들의 수행 특성 평가)

  • Lee, Ki-Chung;Lee, Jong-Kyung;Chun, Young-Jin
    • Korean Journal of Applied Biomechanics
    • /
    • v.13 no.3
    • /
    • pp.241-252
    • /
    • 2003
  • The purpose of this study was to evaluate performance characteristics in the success of team attack during volleyball game. Three dimensional analysis was performed with games of business teams. Analyzed variables were followed by the movement distance of a setter when A-quick was occurred, the position during the spike, the possibility area during the attack, the right and left distance of the assistance attacker, the distance between attacker and blocker, and the distance between blockers each others. 1. It is recommended that the movement distance of the setter be decreased in order to make stable set condition. 2. In order to make one person blocking, the formation was to be consisted of the right and left formation which was associated with the progressive attack performance of the assistance attacker. 3. It is useful to widen attack area. Also it is necessary to improve the enhancement of passing the ball against the blocking of an opponent player. Finally, it is necessary to develop kinematic variables to evaluate performance characteristics of players. Further study may consider the best defense position against the attack of the opponent player.

Performance Comparison of SCTP and TCP over Linux Platform (리눅스 환경에서 SCTP와 TCP 프로토콜의 성능 비교)

  • Park, Jae-Sung;Koh, Seok-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8B
    • /
    • pp.699-706
    • /
    • 2008
  • This paper compares throughput performance of TCP and SCTP in a variety of network environments. For experiments, we construct a Linux-based testbed and consider a set of performance metrics such as MSS(Maximum Segment Size), transmission delay, and packet loss rate. In addition, we analyze the effect of SCTP multi-streaming on throughput. From the experimental results, we can see that SCTP provides throughput gain of approximately $20%{\sim}50%$ over TCP. This performance gain comes from the distinctive features of SCTP such as chunk bundling, initial congestion window of 2 MTU and SACK(Selective ACK) based error control. In the lossy networks, we can see that SCTP multi-streaming transmissions can effectively overcome the so-called HoLB(Head-of-Line Blocking) phenomenon of TCP.