• Title/Summary/Keyword: Access probability

Search Result 533, Processing Time 0.021 seconds

A General Method for Error Probability Computation of UWB Systems for Indoor Multiuser Communications

  • Durisi, Giuseppe;Tarable, Alberto;Romme, Jac;Benedetto, Sergio
    • Journal of Communications and Networks
    • /
    • v.5 no.4
    • /
    • pp.354-364
    • /
    • 2003
  • A general method for the evaluation of the symbol error probability (SER) of ultra wideband (UWB) systems with various kind of modulation schemes (N-PAM, M-PPM, Bi-Orthogonal), in presence of multipath channel, multiuser and strong narrowband interference, is presented. This method is shown to be able to include all the principal multiaccess techniques proposed so far for UWB, time hopping (TH), direct sequence (DS) and optical orthogonal codes (OOC). A comparison between the performance of these multiple access and modulation techniques is given, for both ideal Rake receiver and minimum mean square error (MMSE) equalizer. It is shown that for all the analyzed multiple access schemes, a Rake receiver exhibits a high error floor in presence of narrowband interference (NBI) and that the value of the error floor is in-fluenced by the spectral characteristics of the spreading code. As expected, an MMSE receiver offers better performance, representing a promising candidate for UWB systems. When the multiuser interference is dominant, all multiple access techniques exhibit similar performance under high-load conditions. If the number of users is significantly lower than the spreading factor, then DS outperforms both TH and OOC. Finally 2PPM is shown to offer better performance than the other modulation schemes in presence of multiuser interference; increasing the spreading factor is proposed as a more effective strategy for SER reduction than the use of time diversity.

A Study on the Diversity Reception Performance of Spread Spectrum Signals in Interference and Fading Environments (간섭과 페이딩환경에서 스펙트럼 확산(SS) 통신 신호의 다이버시티 수신 특성에 관한 연구)

  • 강희조;이권현;조성준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.5
    • /
    • pp.901-911
    • /
    • 1994
  • The error performance of M-ary differential phase shift keying (MDPSK) through m-distribution fading channel in hybrid direct sequence/slow frequency hopped spread spectrum multiple access (DS/SFH-SSMA) systems has been evaluated, and also the error probability has been evaluate when adopting diversity technique and coding technique. From the results, we know that the error performance more deteriorates as depth of fading becomes deeper. In Rayleigh fading environment (m=1), increasing of the number of frequency hopping (q) reduces the effect of multiple access interference, because it decreases the probability a hit. When q is much larger than the number of user (K), the probability of error in high E/N region is dominated by the multipath interference while the multiple access interference is negligible. In lower E/N region, the probability of error is independent of q because the effect of gaussian noise becomes dominat.

  • PDF

MODELING AND ANALYSIS FOR OPPORTUNISTIC SPECTRUM ACCESS

  • Lee, Yu-Tae;Sim, Dong-Bo
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.5_6
    • /
    • pp.1295-1302
    • /
    • 2011
  • We present an analytic model of an unslotted opportunistic spectrum access (OSA) network and evaluate its performance such as interruption probability, service completion time, and throughput of secondary users. Numerical examples are given to show the performance of secondary users in cognitive networks. The developed modeling and analysis method can be used to evaluate the performance of various OSA networks.

Performance Evaluation of the Probability based MAC Protocol for Fair Transmission in WDM Metro Ring (WDM 메트로 링에서 공정한 전송을 위한 확률기반 MAC 프로토콜에 대한 성능 평가)

  • So Won-Ho;Kim Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.323-332
    • /
    • 2006
  • In this paper, we consider a WDM based metro ring connecting broadband access networks by using FT-TR (Fixed Transmitter-Tunable Receiver) type access nodes and a new MAC protocol for fair transmission is proposed. The basic channel access scheme is CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) and the transferred optical slot is changed to be empty slot by SS(Source-Stripping) which drops a packet from ring-rotated slot. This empty slot can be either used to send head-of-line packet in buffer or transmitted to next access node. In former cases, there is the improvement of network throughput, but latter case leads unfairness problem of transmission. Thus the proposed MAC protocol exploits the advantages form tow cases. It gives downstream access nodes chance to use empty slots and limits the unconditional usage of empty slots at upstream access nodes with probability as called p-Persistent MAC protocol. We use a numerical analysis to evaluate bandwidth efficiency and maximum node throughput and compares simulation results in terms of node throughput, fairness factor, transfer delay depending on probability. Under two different FT-TR type architectures for metro ring network the proposed MAC protocol is evaluated and compared.

Performance of Cooperative NOMA Systems with Cognitive User Relay (상황인지 사용자 릴레이를 채택한 협동 NOMA 시스템의 성능)

  • Kim, Nam-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.5
    • /
    • pp.69-75
    • /
    • 2018
  • Recently, Non-orthogonal multiple access (NOMA) has been focused for the next generation multiple access, which has more spectral efficiency under the limited spectrum bandwidth. Moreover, the spectrum efficiency can be improved by cognitive radio in which the unlicensed secondary users can access the spectrum that is used by the licensed primary user under the limited interference. Hence, we consider the combination of NOMA and cognitive radio, and derive the performance of the cognitive cooperative NOMA system. For the cooperation, a relay is selected among near users, and the selection combining is assumed at a far user. The outage probability of the selected relay and the far user is derived in closed-form, respectively. The provided numerical results are matched well with the Monte Carlo simulation. Numerical results showed that the performance of the relay is affected from the power allocation coefficient, the minimum outage probability is observed at 0.86 of the power allocation coefficient for far user under the given conditions. More than 15 dB of signal-to-noise ratio is required to meet the outage probability of $1{\times}10^{-13}$ for the far user with the frequency acquisition probability of 0.5 compared to that of 1. It shows that the performance of the far user is very sensitive to the acquisition probability of the cognitive relay.

Performance Analysis of CDMA Reservation ALOHA for Multi-traffic Services (다중 트랙픽 지원을 위한 CDMA 예약 ALOHA 방안의 성능 분석)

  • Jo, Chun Geun;Heo, Gyeong Mu;Lee, Yeon U;Cha, Gyun Hyeon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12A
    • /
    • pp.1852-1861
    • /
    • 1999
  • In this paper, CDMA Reservation ALOHA scheme which can reduce multiple access interference and packet collision is proposed to support multi-traffic such as voice and random data with and without priority. In this scheme, the time slot is divided into two stage, access and transmission stage. Only packets with spreading codes assigned from base station in access stage can transmit their packets in transmission stage, so MAI can be reduced. To reduce packer collision in access stage, the code reservation and access permission probability are used. Code reservation is allowed for voice traffic and continuous traffic with priority using piggyback and access permission probability based on the estimation of the number of contending users in the steady-state is adaptively applied to each traffic terminal. Also, we analyzed and simulated the numerical performances required for each traffic using Markov chain modeling in a single cell environment.

  • PDF

Fast Congestion Control to Transmit Bursty Traffic Rapidly in Satellite Random Access Channel (위성 랜덤 액세스 채널에서 Bursty 트래픽의 신속한 전송을 위한 빠른 혼잡 제어 기법)

  • Noh, Hong-Jun;Lee, Yoon-Seong;Lim, Jae-Sung;Park, Hyung-Won;Lee, Ho-Sub
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.11
    • /
    • pp.1031-1041
    • /
    • 2014
  • In this paper, we propose a traffic load control scheme, called fast congestion control (FCC), for a satellite channel using enhanced random access schemes. The packet repetition used by enhanced random access schemes increases not only the maximum throughput but also the sensitivity to traffic load. FCC controls traffic load by using an access probability, and estimates backlogged traffic load. If the backlogged traffic load exceeds the traffic load corresponding to the maximum throughput, FCC recognizes congestion state, and processes the backlogged traffic first. The new traffic created during the congestion state accesses the channel after the end of congestion state. During the congestion state, FCC guarantees fast transmission of the backlogged traffic. Therefore, FCC is very suitable for the military traffic which has to be transmit urgently. We simulate FCC and other traffic load control schemes, and validate the superiority of FCC in latency.

Group-based Random Access Using Variable Preamble in NB-IoT System (NB-IoT 시스템에서 가변 프리앰블을 이용한 그룹 랜덤 액세스)

  • Kim, Nam-Sun
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.13 no.5
    • /
    • pp.370-376
    • /
    • 2020
  • In this study, we consider a group-based random access method for group connection and delivery by grouping devices when H2H devices and large-scale M2M devices coexist in a cell in NB-IoT environment. H2H devices perform individual random access, but M2M devices are grouped according to a NPRACH transmission period, and a leader of each group performs random access. The preamble is allocated using the variable preamble allocation algorithm of the Disjoint Allocation(DA) method. The proposed preamble allocation algorithm is an algorithm that preferentially allocates preambles that maximizes throughput of H2H to H2H devices and allocates the rest to M2M devices. The access distribution of H2H and M2M devices was set as Poisson distribution and Beta distribution, respectively, and throughput, collision probability and resource utilization were analyzed. As the random access transmission slot is repeated, the proposed preamble allocation algorithm decreases the collision probability from 0.93 to 0.83 and 0.79 when the number M2M device groups are 150. In addition, it was found that the amount of increase decreased to 33.7[%], 44.9[%], and 48.6[%] of resource used.

Access Control Protocol for Bursty Traffic in TDMA/TDD-based Wireless ATM Networks (TDMA/TDD 기반 무선 ATM망에서 버스트 트래픽을 위한 접속 제어 프로토콜)

  • 임인택
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.4
    • /
    • pp.684-690
    • /
    • 2003
  • In this paper, a contention-based reservation access control algorithm and a slot allocation algorithm are proposed for non-real-time bursty traffic services in the wireless ATM networks. In order to reduce the collisions of the reservation request packets, the base station scheduler calculates the transmission probability using the number of RAS minislots and the estimated load of the reservation request packets. And it broadcasts the calculated transmission probability over the downlink control channel. Mobile terminals, which have traffic burst, select randomly a RAS minislot and transmit the reservation request packet by the received transmission probability. The reservation request packet contains the number of packets in the buffer. The slot allocation is based on the buffer status of the received reservation request packets. The base station scheduler allocates slots in proportion to the total number of slots that are requested by each terminal.

Does Paid Sick Leave Induce Welfare Burden?

  • Namhoon KIM
    • Asian Journal of Business Environment
    • /
    • v.14 no.2
    • /
    • pp.11-18
    • /
    • 2024
  • Purpose: The purpose of this study is to empirically evaluate the unintended welfare losses induced by paid sick leave, examine the severity of the unintended moral hazard loss caused by paid sick leave, and evaluate how much moral hazard cost society can accept to obtain paid sick leave benefits. Research Design, Data and Methodology: We examine the Medical Expenditure Panel Survey data collected in 2013 and 2014 by employing a panel probit analysis to control for individual heterogeneity. Results: The estimation result shows that the probability of absence due to paid sick leave increases from 4.91% to 7.84%. Among them, excluding the probability of increasing absence from 1.29% to 2.69% due to the actual disease, the probability of absence due to the moral hazard was estimated to be 2.41% to 6.49% in the proposed models. Based on the result, if we evaluate the increase in absence caused by moral hazard as a social cost, the estimated cost is approximately $174 to $297 per worker per year. Conclusion: Considering these expected costs, our society can obtain the access benefit from paid sick leave if we are willing to accept the moral hazard cost.