• 제목/요약/키워드: ASYMPTOTIC THROUGHPUT

검색결과 15건 처리시간 0.016초

IEEE 802.11e EDCF 성능 분석과 평가 (Performance Analysis and evaluation of the IEEE 802.11e EDCF)

  • 김종덕
    • 한국통신학회논문지
    • /
    • 제29권12A호
    • /
    • pp.1356-1366
    • /
    • 2004
  • IEEE 802.11 위원회는 트래픽 클래스 별로 상이한 서비스 품질(QoS)을 제공하는 새로운 분산 MAC 방안인 EDCF를 최근 제안했다. 우리는 해석적 방법을 통해 이 새로운 방안의 성능 및 QoS 지원 특성을 분석하고 평가하고자 하였다. 이를 위해 기존 DCF 성능 분석 연구 성과를 수정 및 확장하여 임계 상황에서 EDCF의 성능을 클래스 별로 예측할 수 있는 성능 분석 모형을 개발하였다. 개발한 모형의 타당성 검증을 위해 수행한 심도 깊은 시뮬레이션 결과 모형이 매우 신뢰할 수 있는 수준으로 EDCF의 성능과 지연을 예측함을 확인하였다. 개발한 분석 모형을 활용한 평가 작업을 통해 EDCF의 특성, 특히 각종 EDCF 인자들, 즉 AIFS, CW/Sub min/, CW/Sub max/ 등이 성능과 QoS에 미치는 여러 중요한 특성을 파악할 수 있었다.

Performance Analysis of Amplify-and-Forward Two-Way Relaying with Antenna Correlation

  • Fan, Zhangjun;Xu, Kun;Zhang, Bangning;Pan, Xiaofei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권6호
    • /
    • pp.1606-1626
    • /
    • 2012
  • This paper investigates the performance of an amplify-and-forward (AF) two-way relaying system with antenna correlation. The system consists of two multiple-antenna sources, which exchange information via the aid of a single-antenna relay. In particular, we derive the exact outage probability expression. Furthermore, we provide a simple, tight closed-form lower bound for the outage probability. Based on the lower bound, we obtain the closed-form asymptotic outage probability and the average symbol error rate expressions at high signal-to-noise ratio (SNR), which reveal the system's diversity order and coding gain with antenna correlation. To investigate the system's throughput performance with antenna correlation, we also derive a closed-form lower bound for the average sum-rate, which is quite tight from medium to high SNR regime. The analytical results readily enable us to obtain insight into the effect of antenna correlation on the system's performance. Extensive Monte Carlo simulations are conducted to verify the analytical results.

Capacity Analysis of UWB Networks in Three-Dimensional Space

  • Cai, Lin X.;Cai, Lin;Shen, Xuemin;Mark, Jon W.
    • Journal of Communications and Networks
    • /
    • 제11권3호
    • /
    • pp.287-296
    • /
    • 2009
  • Although asymptotic bounds of wireless network capacity have been heavily pursued, the answers to the following questions are still critical for network planning, protocol and architecture design: Given a three-dimensional (3D) network space with the number of active users randomly located in the space and using the wireless communication technology, what are the expected per-flow throughput, network capacity, and network transport capacity? In addition, how can the protocol parameters be tuned to enhance network performance? In this paper, we focus on the ultra wideband (UWB) based wireless personal area networks (WPANs) and provide answers to these questions, considering the salient features of UWB communications, i.e., low transmission/interference power level, accurate ranging capability, etc. Specifically, we demonstrate how to explore the spatial multiplexing gain of UWB networks by allowing appropriate concurrent transmissions. Given 3D space and the number of active users, we derive the expected number of concurrent transmissions, network capacity and transport capacity of the UWB network. The results reveal the main factors affecting network (transport) capacity, and how to determine the best protocol parameters, e.g., exclusive region size, in order to maximize the capacity. Extensive simulation results are given to validate the analytical results.

Machine Learning Methods for Trust-based Selection of Web Services

  • Hasnain, Muhammad;Ghani, Imran;Pasha, Muhammad F.;Jeong, Seung R.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권1호
    • /
    • pp.38-59
    • /
    • 2022
  • Web services instances can be classified into two categories, namely trusted and untrusted from users. A web service with high throughput (TP) and low response time (RT) instance values is a trusted web service. Web services are not trustworthy due to the mismatch in the guaranteed instance values and the actual values achieved by users. To perform web services selection from users' attained TP and RT values, we need to verify the correct prediction of trusted and untrusted instances from invoked web services. This accurate prediction of web services instances is used to perform the selection of web services. We propose to construct fuzzy rules to label web services instances correctly. This paper presents web services selection using a well-known machine learning algorithm, namely REPTree, for the correct prediction of trusted and untrusted instances. Performance comparison of REPTree with five machine learning models is conducted on web services datasets. We have performed experiments on web services datasets using a ten k-fold cross-validation method. To evaluate the performance of the REPTree classifier, we used accuracy metrics (Sensitivity and Specificity). Experimental results showed that web service (WS1) gained top selection score with the (47.0588%) trusted instances, and web service (WS2) was selected the least with (25.00%) trusted instances. Evaluation results of the proposed web services selection approach were found as (asymptotic sig. = 0.019), demonstrating the relationship between final selection and recommended trust score of web services.

Partly Random Multiple Weighting Matrices Selection for Orthogonal Random Beamforming

  • Tan, Li;Li, Zhongcai;Xu, Chao;Wang, Desheng
    • Journal of Communications and Networks
    • /
    • 제18권6호
    • /
    • pp.892-901
    • /
    • 2016
  • In the multi-user multiple-input multiple-output (MIMO) system, orthogonal random beamforming (ORBF) scheme is proposed to serve multiple users simultaneously in order to achieve the multi-user diversity gain. The opportunistic space-division multiple access system (OSDMA-S) scheme performs multiple weighting matrices during the training phase and chooses the best weighting matrix to be used to broadcast data during the transmitting phase. The OSDMA-S scheme works better than the original ORBF by decreasing the inter-user interference during the transmitting phase. To save more time in the training phase, a partly random multiple weighting matrices selection scheme is proposed in this paper. In our proposed scheme, the Base Station does not need to use several unitary matrices to broadcast pilot symbol. Actually, only one broadcasting operation is needed. Each subscriber generates several virtual equivalent channels with a set of pre-saved unitary matrices and the channel status information gained from the broadcasting operation. The signal-to-interference and noise ratio (SINR) of each beam in each virtual equivalent channel is calculated and fed back to the base station for the weighting matrix selection and multi-user scheduling. According to the theoretical analysis, the proposed scheme relatively expands the transmitting phase and reduces the interactive complexity between the Base Station and subscribers. The asymptotic analysis and the simulation results show that the proposed scheme improves the throughput performance of the multi-user MIMO system.