• Title/Summary/Keyword: Access probability

Search Result 536, Processing Time 0.022 seconds

Performance on Channel Multiple Access for the OBP Satellite (OBP(On-Board Processing)위성의 채널 다중 접속 방식에 대한 성능 연구)

  • 이정렬;김덕년
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.12a
    • /
    • pp.5-8
    • /
    • 2000
  • In this paper, The new scheme for Demand Assigned Multiple Access(DAMA) system is proposed. To focus on the onboard processor's specific monitoring of output port of the downlink, we found the Throughput and Blocking probability by the request traffic(λ) and channel's departure probability(Ρ).

  • PDF

A Novel Spectrum Access Strategy with ${\alpha}$-Retry Policy in Cognitive Radio Networks: A Queueing-Based Analysis

  • Zhao, Yuan;Jin, Shunfu;Yue, Wuyi
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.193-201
    • /
    • 2014
  • In cognitive radio networks, the packet transmissions of the secondary users (SUs) can be interrupted randomly by the primary users (PUs). That is to say, the PU packets have preemptive priority over the SU packets. In order to enhance the quality of service (QoS) for the SUs, we propose a spectrum access strategy with an ${\alpha}$-Retry policy. A buffer is deployed for the SU packets. An interrupted SU packet will return to the buffer with probability ${\alpha}$ for later retrial, or leave the system with probability (1-${\alpha}$). For mathematical analysis, we build a preemptive priority queue and model the spectrum access strategy with an ${\alpha}$-Retry policy as a two-dimensional discrete-time Markov chain (DTMC).We give the transition probability matrix of the Markov chain and obtain the steady-state distribution. Accordingly, we derive the formulas for the blocked rate, the forced dropping rate, the throughput and the average delay of the SU packets. With numerical results, we show the influence of the retrial probability for the strategy proposed in this paper on different performance measures. Finally, based on the trade-off between different performance measures, we construct a cost function and optimize the retrial probabilities with respect to different system parameters by employing an iterative algorithm.

A Study on analysis of architecture and user interface at cyber museum (Cyber Museum User Interface의 구성과 구조에 관한 고찰)

  • 구세연;임채진
    • Proceedings of the Korean Institute of Interior Design Conference
    • /
    • 2001.05a
    • /
    • pp.121-127
    • /
    • 2001
  • An unified measure of user interface efficiency and aesthetics for cyber museum is proposed. First, general structure of cyber museum is discussed and hierarchical analyses are done for sample sites. Usability tests based on the hierarchical analyses yield statistics of user access frequency and persistency for each page, on which access probability is deduced. Second, visual occupancy, a measure of efficiency of user interface element based on access probability is defined. The hierarchical statistics of visual occupancy can be an index for characterization and classification of cyber museums. Examples are provided.

  • PDF

Performance Analysis of Packet CDMA R-ALOHA for Multi-media Integration in Cellular Systems with Adaptive Access Permission Probability

  • Kyeong Hur;Eom, Doo-Seop;Tchah, Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.12B
    • /
    • pp.2109-2119
    • /
    • 2000
  • In this paper, the Packet CDMA Reservation ALOHA protocol is proposed to support the multi-traffic services such as voice and videophone services with handoff calls, high-rate data and low-rate data services efficiently on the multi-rate transmission in uplink cellular systems. The frame structure, composed of the access slot and the transmission slot, and the proposed access permission probability based on the estimated number of contending users for each service are presented to reduce MAI. The assured priority to the voice and the videophone handoff calls is given through higher access permission probability. And through the proposed code assignment scheme, the voice service can be provided without the voice packet dropping probability in the CDMA/PRMA protocols. The code reservation is allowed to the voice and the videophone services. The low-rate data service uses the available codes during the silent periods of voice calls and the remaining codes in the codes assigned to the voice service to utilize codes efficiently. The high-rate data service uses the assigned codes to the high-rate data service and the remaining codes in the codes assigned to the videophone service. Using the Markov-chain subsystem model for each service including the handoff calls in uplink cellular systems, the steady-state performances are simulated and analyzed. After a round of tests for the examples, through the proposed code assignment scheme and the access permission probability, the Packet CDMA Reservation ALOHA protocol can guarantee the priority and the constant QoS for the handoff calls even at large number of contending users. Also, the data services are integrated efficiently on the multi-rate transmission.

  • PDF

Performance Evaluation of Access Channel Slot Acquisition in Cellular DS/CDMA Reverse Link

  • Kang, Bub-Joo;Han, Young-Nam
    • ETRI Journal
    • /
    • v.20 no.1
    • /
    • pp.16-27
    • /
    • 1998
  • In this paper, we consider the acquisition performance of an IS-95 reverse link access channel slot as a function of system design parameters such as postdetection integration length and the number of access channel message block repetitons. The uncertainty region of the reverse link spreading codes compared to that of forward link is very small, since the uncertainty region of the reverse link is determined by a cell radius. Thus, the parallel acquisiton technique in the reverse link is more efficient than a serial acquisition technique in terms of implementation and of acquisition time. The parallel acquisition is achieved by a bank of N parallel I/Q noncoherent correlator are analyzed for band-limited noise and the Rayleigh fast fading channel. The detection probability is derived for multiple correct code-phase offsets and multipath fading. The probability of no message error is derived when rake combining, access channel message block combining, and Viterbi decoding are applied. Numerical results provide the acquisition performance for system design parameters such as postdetection integration length and number of access channel message block repetitions in case of a random access on a mobile station.

  • PDF

Synch. RA-based Uplink Packet Transmission in OFDMA Systems (OFDMA 시스템에서 동기 RA 방식 기반의 상향링크 패킷 전송)

  • Oh, Sang-Kyu;Moon, Jin-Soo;Shin, Seok-Joo
    • Journal of Internet Computing and Services
    • /
    • v.9 no.2
    • /
    • pp.25-33
    • /
    • 2008
  • In this paper we propose uplink packet transmission scheme based on Synchronized RA. The scheme can afford to support diverse QoS required from diverse multimeda traffics. In order to minimze the collision probability occurred in contention based channel access, we assign a reservation access channel additionally to the traffic channels. Access probability function for controlling collisions occurred in the reservation access channel is applied. Through assigning different access probability to each traffic user with respect to priority issued by his required QoS, the proposed scheme guarantees minimum throughput required by higher priority users in the whole range of system load.

  • PDF

Dynamic CSMA Protocol Based on the Network Status (네트워크 상태에 따른 동적 CSMA 프로토콜)

  • Lee, Wang-Jong;Rhee, Seung-Hyong
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.2
    • /
    • pp.70-80
    • /
    • 2008
  • CSMA(Carrier Sense Multiple Access) is a media access control protocol when nodes use a shared channel. To reduce the probability of collision and increase the performance, the station lust checks the state of the channel. In this paper, we study the performance improvement method based on p-persistent strategy. The p-persistent method reduces the chance of collision and improves the efficiency. However, a probability p and the number of station affect the performance. This paper proposes a dynamic CSMA multiple access based on the network status. If the possibility of collision is low, the station increases the probability p to improve the performance. In the opposite case, the station decreases the probability p. Our simulation results show that the proposed scheme outperforms any methods of CSMA multiple access according to the current persistent strategy.

  • PDF

Performance Analysis and Power Allocation for NOMA-assisted Cloud Radio Access Network

  • Xu, Fangcheng;Yu, Xiangbin;Xu, Weiye;Cai, Jiali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.3
    • /
    • pp.1174-1192
    • /
    • 2021
  • With the assistance of non-orthogonal multiple access (NOMA), the spectrum efficiency and the number of users in cloud radio access network (CRAN) can be greatly improved. In this paper, the system performance of NOMA-assisted CRAN is investigated. Specially, the outage probability (OP) and ergodic sum rate (ESR), are derived for performance evaluation of the system, respectively. Based on this, by minimizing the OP of the system, a suboptimal power allocation (PA) scheme with closed-form PA coefficients is proposed. Numerical simulations validate the accuracy of the theoretical results, where the derived OP has more accuracy than the existing one. Moreover, the developed PA scheme has superior performance over the conventional fixed PA scheme but has smaller performance loss than the optimal PA scheme using the exhaustive search method.

Efficient Access Management Scheme for Machine Type Communications in LTE-A Networks (LTE-A 네트워크 환경에서 MTC를 위한 효율적인 접근관리 기법)

  • Moon, Jihun;Lim, Yujin
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.7 no.1
    • /
    • pp.287-295
    • /
    • 2017
  • Recently, MTC (Machine Type Communication) is known as an important part to support IoT (Internet of Things) applications. MTC provides network connectivities between MTC devices without human intervention. In MTC, a large number of devices try to access over communication resource with a short period of time. Due to the limited communication resource, resource contention becomes severe and it brings about access failures of devices. To solve the problem, it needs to regulate device accesses. In this paper, we present an efficient access management scheme. We measure the number of devices which try to access in a certain time period and predict the change of the number of devices in the next time period. Using the predicted change, we control the number of devices which try to access. To verify our scheme, we conduct experiments in terms of success probability, failure probability, collision probability and access delay.

Backoff-based random access algorithm for offering differentiated QoS services in the random access channels of OFDMA systems (OFDMA 시스템 상향 링크에서, 임의 접근 채널의 차별화된 서비스 품질 제공을 위한 Backoff 기반 임의 접근 알고리즘 및 그 성능 분석)

  • Lee, Young-Du;Koo, In-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.2
    • /
    • pp.360-368
    • /
    • 2008
  • In this paper, in order that the various QoS(Qualify of Service)s that are required by different traffic class are guaranteed in the random access channels in multi-service multi-user OFDMA systems, the backoff-based random access algorithm is proposed and corresponding performance is analyzed in terms of the access success probability, the throughput, the average delay and the blocking probability. Through the numerical analysis, it is shown that the proposed backoff-based random access algorithm can provide the differentiated QoSs to random access attempts according to their service class.