• Title/Summary/Keyword: communication probability

Search Result 1,337, Processing Time 0.035 seconds

Summary on Internet Communication Network Quality Characteristics Using Beta Probability Distribution (베타 확률분포를 이용한 인터넷통신 네트워크 품질특성 요약)

  • Park Sung-Min
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.1661-1662
    • /
    • 2006
  • Internet communication network quality characteristics are analyzed using Beta probability distribution. Beta probability distribution is chosen for the underlying probability distribution because it is an extremely flexible probability distribution used to model bounded random variables. Based on the fitted Beta probability distribution, a dataset regarding each network quality characteristic is summarized concisely.

  • PDF

Outage Probability of Device-to-Device MIMO Relay Systems with Imperfect Channel Estimation

  • Wei, Liang wu;Shao, Shi Xiang
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.2 no.2
    • /
    • pp.67-76
    • /
    • 2013
  • Under an imperfect channel estimation, a Device-to-Device (D2D) communication framework based on MIMO relay technology is presented. The model consists of a D2D pair equipped with M antennas and a relay equipped with N antennas as well as a cellular user equipped with M antennas. The outage probability under different relaying protocols (i.e. AF and DF protocol) with and without considering a direct link was derived. The actual and theoretical outage probability of the five links under different antenna numbers was emulated. The number of user antennas and channel estimation error was analyzed carefully to determine their impact on the outage probability of a system. The simulation verified the theory analyses and the results showed that MIMO relaying improves the D2D communication system performance.

  • PDF

A Relay Selection Scheme for Network Security (네트워크 보안을 위한 중계기 선택 기법)

  • Lee, Byeong Su;Sung, Kil-Young;Ban, Tae-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.12
    • /
    • pp.2213-2218
    • /
    • 2016
  • In this paper, we propose a new relay selection scheme which can decrease the secrecy outage probability in a relay communication network with multiple relays and an eavesdropper. In the conventional relay selection scheme, a relay transmits jamming signal toward an eavesdropper to decrease the successful decoding probability of the eavesdropper. The coventional scheme has a critical problem that the successful decoding probability of a receiver also decreases. The new relay selection scheme proposed in this paper can significantly enhance the secrecy outage probability by selecting a pair of relays which can increase the successful decoding probability of the receiver while decreasing the successful decoding probability of the eavesdropper. We performed extensive computer simulation based on Monte-Carlo. The simulation results reveal that the proposed relay selection scheme can improve the secrecy outage probability by 10 to 50 times compared to the existing relay selection scheme.

Optimized Relay Selection and Power Allocation by an Exclusive Method in Multi-Relay AF Cooperative Networks

  • Bao, Jianrong;Jiang, Bin;Liu, Chao;Jiang, Xianyang;Sun, Minhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3524-3542
    • /
    • 2017
  • In a single-source and multi-relay amplify-forward (AF) cooperative network, the outage probability and the power allocation are two key factors to influence the performance of an entire system. In this paper, an optimized AF relay selection by an exclusive method and near optimal power allocation (NOPA) is proposed for both good outage probability and power efficiency. Given the same power at the source and the relay nodes, a threshold for selecting the relay nodes is deduced and employed to minimize the average outage probability. It mainly excludes the relay nodes with much higher thresholds over the aforementioned threshold and thus the remainders of the relay nodes participate in cooperative forwarding efficiently. So the proposed scheme can improve the utility of the resources in the cooperative multi-relay system, as well as reduce the computational complexity. In addition, based on the proposed scheme, a NOPA is also suggested to approach sub-optimal power efficiency with low complexity. Simulation results show that the proposed scheme obtains about 2.1dB and 5.8dB performance gain at outage probability of $10^{-4}$, when compared with the all-relay-forward (6 participated relays) and the single-relay-forward schemes. Furthermore, it obtains the minimum outage probability among all selective relay schemes with the same number of the relays. Meanwhile, it approaches closely to the optimal exhaustive scheme, thus reduce much complexity. Moreover, the proposed NOPA scheme achieves better outage probability than those of the equal power allocation schemes. Therefore, the proposed scheme can obtain good outage probability, low computational complexity and high power efficiency, which makes it pragmatic efficiently in the single-source and multi-relay AF based cooperative networks.

Optimized Medium Access Probability for Networked Control Systems (네트워크 제어 시스템을 위한 최적화된 매체 접근 확률)

  • Park, Pangun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.10
    • /
    • pp.2457-2464
    • /
    • 2015
  • Distributed Networked Control Systems (NCSs) through wireless networks have a tremendous potential to improve the efficiency of various control systems. In this paper, we define the State Update Interval (SUI) as the elapsed time between successful state vector reports derived from the NCSs. A simple expression of the SUI is derived to characterize the key interactions between the control and communication layers. This performance measure is used to formulate a novel optimization problem where the objective function is the probability to meet the SUI constraint and the decision parameter is the channel access probability. We prove the existence and uniqueness of the optimal channel access probability of the optimization problem. Furthermore, the optimal channel access probability for NCSs is lower than the channel access probability to maximize the throughput. Numerical results indicate that the improvement of the success probability to meet the SUI constraint using the optimal channel access probability increases as the number of nodes increases with respect to that using the channel access probability to maximize the throughput.

Efficient Channel State Feedback Scheme for Opportunistic Scheduling in OFDMA Systems by Scheduling Probability Prediction

  • Ko, Soomin;Lee, Jungsu;Lee, Byeong Gi;Park, Daeyoung
    • Journal of Communications and Networks
    • /
    • v.15 no.6
    • /
    • pp.589-600
    • /
    • 2013
  • In this paper, we propose a new feedback scheme called mode selection-based feedback by scheduling probability prediction (SPP-MF) for channel state feedback in OFDMA downlink system. We design the scheme such that it determines the more desirable feedback mode among selective feedback by scheduling probability prediction (SPP-SF) mode and bitmap feedback by scheduling probability prediction (SPP-BF) mode, by calculating and comparing the throughputs of the two modes. In both feedback modes, each user first calculates the scheduling probability of each subchannel (i.e., the probability that a user wins the scheduling competition for a subchannel) and then forms a feedback message based on the scheduling probability. Specifically, in the SPP-SF mode, each user reports the modulation and coding scheme (MCS) levels and indices of its best S subchannels in terms of the scheduling probability. In the SPP-BF mode, each user determines its scheduling probability threshold. Then, it forms a bitmap for the subchannels according to the scheduling probability threshold and sends the bitmap along with the threshold. Numerical results reveal that the proposed SPP-MF scheme achieves significant performance gain over the existing feedback schemes.

Performance Analysis of an AF Dual-hop FSO Communication System with RF Backup Link

  • Alhamawi, Khaled A.;Altubaishi, Essam S.
    • Current Optics and Photonics
    • /
    • v.3 no.4
    • /
    • pp.311-319
    • /
    • 2019
  • A hybrid free-space-optical/radio-frequency (FSO/RF) communication system is considered, with the help of amplify-and-forward (AF) relaying. We consider various weather conditions to investigate their effects on the system's performance. We begin by obtaining the cumulative distribution function and probability density function of the end-to-end signal-to-noise ratio for the AF dual-hop FSO communication system with RF backup link. Then, these results are used to derive closed-form expressions for the outage probability, average bit-error rate, and average ergodic capacity. The results show that the considered system efficiently employs the complementary nature of FSO and RF links, resulting in impressive performance improvements compared to non-hybrid systems.

Performance of call handling schemes for radio mobile exchange communication system applied by timeout Queue (무선 이동통신 교환시스템에서 타임아웃(timeout)큐를 적용한 호 처리 방식의 성능해석에 관한 연구)

  • 우상철;윤종호
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.2 no.1
    • /
    • pp.59-70
    • /
    • 1998
  • In the wireless mobile exchange communication system, the proper handling of originating call(OC) and handover call(HC) is important. Specially, when it's viewed from the user side, mobile users feel more weighting soul disappointment with the handover blocking probability moving from current cell to adacent cell than with originating call blocking probability happening new call in current cell. Accordingly,this paper is proposed and analyzed the timeout buffer system and guard channel for decreasing handover blocking probability. In analytic result, The more guard channel increase,t he more originating call blocking probability increase and handover blocking probability decrease. Also, the more timeout duration increase, the more handover blocking probability decrease.

  • PDF

Architectures and Connection Probabilities forWireless Ad Hoc and Hybrid Communication Networks

  • Chen, Jeng-Hong;Lindsey, William C.
    • Journal of Communications and Networks
    • /
    • v.4 no.3
    • /
    • pp.161-169
    • /
    • 2002
  • Ad hoc wireless networks involving large populations of scattered communication nodes will play a key role in the development of low power, high capacity, interactive, multimedia communication networks. Such networks must support arbitrary network connections and provide coverage anywhere and anytime. This paper partitions such arbitrarily connected network architectures into three distinct groups, identifies the associated dual network architectures and counts the number of network architectures assuming there exist N network nodes. Connectivity between network nodes is characterized as a random event. Defining the link availability P as the probability that two arbitrary network nodes in an ad hoc network are directly connected, the network connection probability $ \integral_n$(p) that any two network nodes will be directly or indirectly connected is derived. The network connection probability $ \integral_n$(p) is evaluated and graphically demonstrated as a function of p and N. It is shown that ad hoc wireless networks containing a large number of network nodes possesses the same network connectivity performance as does a fixed network, i.e., for p>0, $lim_{N\to\infty} Integral_n(p)$ = 1. Furthermore, by cooperating with fixed networks, the ad hoc network connection probability is used to derive the global network connection probability for hybrid networks. These probabilities serve to characterize network connectivity performance for users of wireless ad hoc and hybrid networks, e.g., IEEE 802.11, IEEE 802.15, IEEE 1394-95, ETSI BRAN HIPERLAN, Bluetooth, wireless ATM and the world wide web (WWW).

Robust Speech Decoding Using Channel-Adaptive Parameter Estimation.

  • Lee, Yun-Keun;Lee, Hwang-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.18 no.1E
    • /
    • pp.3-6
    • /
    • 1999
  • In digital mobile communication system, the transmission errors affect the quality of output speech seriously. There are many error concealment techniques using a posteriori probability which provides information about any transmitted parameter. They need knowledge about channel transition probability as well as the 1st order Markov transition probability of codec parameters for estimation of transmitted parameters. However, in applications of mobile communication systems, the channel transition probability varies depending on nonstationary channel characteristics. The mismatch of designed channel transition probability of the estimator to actual channel transition probability degrades the performance of the estimator. In this paper, we proposed a new parameter estimator which adapts to the channel characteristics using short time average of maximum a posteriori probabilities(MAPs). The proposed scheme, when applied to the LSP parameter estimation, performed better than the conventional estimator which do not adapt to the channel characteristics.

  • PDF