• Title/Summary/Keyword: Markov channel

Search Result 142, Processing Time 0.028 seconds

The Analysis of Channel Characteristics on Downtown of Daejeon for K-Band Satellite Communication Using 3D Map (3차원 지형정보를 연동한 대전 도심지의 K 대역 위성 채널 특성 분석)

  • Kwon, Kun-Sup;Heo, Jong-Wan;Hwang, Ki-Min;Baek, Seong-Ho;Ryu, Heung-Gyoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.25 no.5
    • /
    • pp.607-617
    • /
    • 2014
  • This paper proposed the M&S(Modeling & Simulation) method of channel characterization of satellite communication in the operating area of satellite OTM(On-The-Move) terminal. In M&S, received signal profile was acquired by HTZ warfare software which uses 3 dimensional map including building, road information and geographical features, and then was analyzed statistically. And a received signal profile and its statistics from M&S data were compared with those from measured data. The research showed that the simulated received signal profile matched the measured one about 74.8 percent and simulated statistics matched well as roadside trees were excluded.

Enhanced Channel Access Estimation based Adaptive Control of Distributed Cognitive Radio Networks

  • Park, Jong-Hong;Chung, Jong-Moon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.1333-1343
    • /
    • 2016
  • Spectrum sharing in centrally controlled cognitive radio (CR) networks has been widely studied, however, research on channel access for distributively controlled individual cognitive users has not been fully characterized. This paper conducts an analysis of random channel access of cognitive users controlled in a distributed manner in a CR network. Based on the proposed estimation method, each cognitive user can estimate the current channel condition by using its own Markov-chain model and can compute its own blocking probability, collision probability, and forced termination probability. Using the proposed scheme, CR with distributed control (CR-DC), CR devices can make self-controlled decisions based on the status estimations to adaptively control its system parameters to communicate better.

Decision Feedback Detector for Space-Time Block Codes over Time-Varying Channels

  • Ahn, Kyung-Seung;Baik, Heung-Ki
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5C
    • /
    • pp.506-513
    • /
    • 2003
  • Most existing space-time coding (STC) schemes have been developed for flat fading channels. To obtain antenna diversity gain, they rely on channel state information (CSI) required at the receiver through channel estimation techniques. This paper proposes a new decision feedback decoding scheme for Alamouti-based space-time block coding (STBC) transmission over time-selective fading channels. In wireless channels, time-selective fading effects arise mainly due to Doppler shift and carrier frequency offset, Modelling the time-selective fading channels as the first-order Gauss-Markov processes, we use recursive algorithms such as Kalman filtering, LMS and RLS algorithms for channel tracking. The proposed scheme consists of the symbol decoding stage and channel tracking algorithms. Computer simulations confirm that the proposed scheme shows the better performance and robustness to time-selectivity.

Iterative Symbol Decoding of Variable-Length Codes with Convolutional Codes

  • Wu, Hung-Tsai;Wu, Chun-Feng;Chang, Wen-Whei
    • Journal of Communications and Networks
    • /
    • v.18 no.1
    • /
    • pp.40-49
    • /
    • 2016
  • In this paper, we present a symbol-level iterative source-channel decoding (ISCD) algorithm for reliable transmission of variable-length codes (VLCs). Firstly, an improved source a posteriori probability (APP) decoding approach is proposed for packetized variable-length encoded Markov sources. Also proposed is a recursive implementation based on a three-dimensional joint trellis for symbol decoding of binary convolutional codes. APP channel decoding on this joint trellis is realized by modification of the Bahl-Cocke-Jelinek-Raviv algorithm and adaptation to the non-stationary VLC trellis. Simulation results indicate that the proposed ISCD scheme allows to exchange between its constituent decoders the symbol-level extrinsic information and achieves high robustness against channel noises.

Medium Access Control Protocol for Ad Hoc Networks Using Dynamic Contention Window (동적 경쟁윈도우를 이용한 Ad Hoc 망에서의 Medium Access Control 프로토콜)

  • Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.4
    • /
    • pp.35-42
    • /
    • 2008
  • Since Bianchi's 2-D Markov Chain Model considers collision problem only in ideal channel condition, it does not reflect real channel impaired by fading, interference, and noise. Distributed Coordination Function(DCF) doubles its contention window(CW) when transmission fails regardless of collision or transmission error. Increase of CW caused by transmission error degrade throughput and increase the delay. In this paper, we present quantitative analysis of the impact of the parameters such as contention window size(CW), transmission probability for a given time slot(${\Im}$), transmission failure probability($p_f$), on the system performance and provide a method how to decrease the initial CW to achieve equivalent performance.

  • PDF

Performance Analysis of CSMA/CD in Radio Environment with Capture Effect (무선환경에서 포획효과를 고려한 CSMA/CD 프로토콜의 성능분석)

  • Sa, Ju-Hee;Hyun, In-Bok;Kwak, Kyung-Sup
    • Journal of IKEEE
    • /
    • v.1 no.1 s.1
    • /
    • pp.73-82
    • /
    • 1997
  • In this paper we analyzed, using Markov modeling, the performance of CSMA/CD over the wireless channel which is characterized by near-far effect, shadowing and Rayleigh fading. The analysis shows that throughput of CSMA/CD is degraded by channel error. However, if capture effect which arises from the randomness of power level of received signal due to the fading phenomena of electromagnetic waves is taken into consideration, the system performance is much improved and the system stability is also made better.

  • PDF

A Dynamical Hybrid CAC Scheme and Its Performance Analysis for Mobile Cellular Network with Multi-Service

  • Li, Jiping;Wu, Shixun;Liu, Shouyin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.6
    • /
    • pp.1522-1545
    • /
    • 2012
  • Call admission control (CAC) plays an important role in mobile cellular network to guarantee the quality of service (QoS). In this paper, a dynamic hybrid CAC scheme with integrated cutoff priority and handoff queue for mobile cellular network is proposed and some performance metrics are derived. The unique characteristic of the proposed CAC scheme is that it can support any number of service types and that the cutoff thresholds for handoff calls are dynamically adjusted according to the number of service types and service priority index. Moreover, timeouts of handoff calls in queues are also considered in our scheme. By modeling the proposed CAC scheme with a one-dimensional Markov chain (1DMC), some performance metrics are derived, which include new call blocking probability ($P_{nb}$), forced termination probability (PF), average queue length, average waiting time in queue, offered traffic utilization, wireless channel utilization and system performance which is defined as the ratio of channel utilization to Grade of Service (GoS) cost function. In order to validate the correctness of the derived analytical performance metrics, simulation is performed. It is shown that simulation results match closely with the derived analytic results in terms of $P_{nb}$ and PF. And then, to show the advantage of 1DMC modeling for the performance analysis of our proposed CAC scheme, the computing complexity of multi-dimensional Markov chain (MDMC) modeling in performance analysis is analyzed in detail. It is indicated that state-space cardinality, which reflects the computing complexity of MDMC, increases exponentially with the number of service types and total channels in a cell. However, the state-space cardinality of our 1DMC model for performance analysis is unrelated to the number of service types and is determined by total number of channels and queue capacity of the highest priority service in a cell. At last, the performance comparison between our CAC scheme and Mahmoud ASH's scheme is carried out. The results show that our CAC scheme performs well to some extend.

An Exposed-Terminal-Eliminated Dual-Channel MAC Protocol for Exploiting Concurrent Transmissions in Multihop Wireless Networks

  • Liu, Kai;Zhang, Yupeng;Liu, Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.778-798
    • /
    • 2014
  • This paper proposes a novel exposed-terminal-eliminated medium access control (ETE-MAC) protocol by combining channel reservation, collision avoidance and concurrent transmissions to improve multi-access performance of the multihop wireless networks. Based on the proposed slot scheduling scheme, each node senses the control channel (CCH) or the data channel (DCH) to accurately determine whether it can send or receive the corresponding packets without collisions. Slot reservation on the CCH can be simultaneously executed with data packet transmissions on the DCH. Therefore, it resolves the hidden-terminal type and the exposed-terminal type problems efficiently, and obtains more spatial reuse of channel resources. Concurrent packet transmissions without extra network overheads are maximized. An analytical model combining Markov model and M/G/1 queuing theory is proposed to analyze its performance. The performance comparison between analysis and simulation shows that the analytical model is highly accurate. Finally, simulation results show that, the proposed protocol obviously outperforms the link-directionality-based dual-channel MAC protocol (DCP) and WiFlex in terms of the network throughput and the average packet delay.

Optimal Packet Scheduling for Energy Harvesting Sources on Time Varying Wireless Channels

  • Kashef, Mohamed;Ephremides, Anthony
    • Journal of Communications and Networks
    • /
    • v.14 no.2
    • /
    • pp.121-129
    • /
    • 2012
  • In this paper, we consider a source node that operates over a time varying channel with energy harvesting capability. The goal of the source is to maximize the average number of successfully delivered packets per time slot. The source is able to choose whether to transmit a packet or defer the transmission in each time slot. The decision which is chosen by the source depends on the channel information available and the length of the energy queue. We formulate the problem of finding the optimal policy as a Markovian decision problem. We show some properties of the value function that represents the discounted number of successfully delivered packets per time slot. We prove that the optimal policy is a threshold type policy depending on the state of the channel and the length of the energy queue. We also derive an upper bound for the average number of packets per time slots successfully received by the destination. We show using numerical results that this bound is a tight bound on the performance of the optimal policy. And we consider the case of time varying channel but without channel state information (CSI). Then, we study the impact of channel time varying nature and the availability of CSI. In this case, we show that the optimal policy is a greedy policy. The performance of this greedy policy is also calculated.

Stochastic Petri Nets Modeling Methods of Channel Allocation in Wireless Networks

  • Ro, Cheul-Woo;Kim, Kyung-Min
    • International Journal of Contents
    • /
    • v.4 no.3
    • /
    • pp.20-28
    • /
    • 2008
  • To obtain realistic performance measures for wireless networks, one should consider changes in performance due to failure related behavior. In performability analysis, simultaneous consideration is given to both pure performance and performance with failure measures. SRN is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. In this paper, a new methodology to model and analyze performability based on stochastic reward nets (SRN) is presented. Composite performance and availability SRN models for wireless handoff schemes are developed and then these models are decomposed hierarchically. The SRN models can yield measures of interest such as blocking and dropping probabilities. These measures are expressed in terms of the expected values of reward rate functions for SRNs. Numerical results show the accuracy of the hierarchical model. The key contribution of this paper constitutes the Petri nets modeling techniques instead of complicate numerical analysis of Markov chains and easy way of performance analysis for channel allocation under SRN reward concepts.