• 한국정보통신학회논문지
• /
• 제8권5호
• /
• pp.1010-1019
• /
• 2004

본 논문에서는 Nakagami-m 페이딩 채널을 Finite-State Markov Channel (FSMC)로 모델링하고, 채널 상태 변화에 따른 통신 시스템의 성능을 분석하였다. 고려한 FSMC 모델에서는 수신 신호의 신호 대 잡음 전력비를 유한개의 구간으로 나눠 각각의 구간을 Markov 체인의 상태로 대응한다. 각 상태는 무기억 이진 대칭 통신로로 가정하고, 한 상태에서 다른 상태로의 천이는 Markov 천이를 따른다고 가정한다. 수치 해석을 통해 각 상태에 있어서의 평균 심볼 오율, 정상 상태 확률 그리고 상태 천이 확률을 구하여 FSMC 모델을 구성하였고, 상태 천이 지수를 변경함으로써 여러 페이딩 환경을 FSMC 모델로 나타낼 수 있음을 확인하였다. 상태 천이 지수가 클 경우인 빠른 페이딩 채널에서는 채널이 i.i.d. 특성을 나타내게 되며, 상태 천이 지수가 작을 경우인 느린 페이딩 채널은 인접한 상태로의 천이만 발생하는 간단한 FSMC 모델로 표현될 수 있음을 확인하였다. 마지막으로 제안한 FSMC 모델의 응용 예로써, 여러 채널 환경에서 랜덤 에러 정정 부호의 부호화 이득의 차이를 컴퓨터 시뮬레이션을 통해 비교, 분석하였다.

• Journal of information and communication convergence engineering
• /
• 제6권2호
• /
• pp.134-139
• /
• 2008

In this paper, we propose an analysis model for the performance of channel error probability in Stream Control Transmission Protocol (SCTP) using Markov model. In this model it is assumed that the compressor and decompressor work in Unidirectional Mode. And the average throughput of SCTP protocol is obtained by finding the throughputs of when the initial channel state is good or bad.

• Journal of Communications and Networks
• /
• 제16권2호
• /
• pp.217-226
• /
• 2014

In this research, we study the problem of opportunistic spectrum access (OSA) in a time-varying environment with fading channels, where the channel state is characterized by both channel quality and the occupancy of primary users (PUs). First, a finite-state Markov channel model is introduced to represent a fading channel. Second, by probing channel quality and exploring the activities of PUs jointly, a two-dimensional partially observable Markov decision process framework is proposed for OSA. In addition, a greedy strategy is designed, where a secondary user selects a channel that has the best-expected data transmission rate to maximize the instantaneous reward in the current slot. Compared with the optimal strategy that considers future reward, the greedy strategy brings low complexity and relatively ideal performance. Meanwhile, the spectrum sensing error that causes the collision between a PU and a secondary user (SU) is also discussed. Furthermore, we analyze the multiuser situation in which the proposed single-user strategy is adopted by every SU compared with the previous one. By observing the simulation results, the proposed strategy attains a larger throughput than the previous works under various parameter configurations.

• 한국통신학회논문지
• /
• 제19권5호
• /
• pp.805-814
• /
• 1994

본 논문에서는 실패상태와 성공상태를 포함시키는 보조 Markov 천이행렬을 이용하여 패킷무선망의 성능을 구할 수 있는 새로운 분석방식을 제시하고 패킷오류 발생이 송신 PRU의 수 X와 수신 PRU의 수 R로 이루어지는 망상태(X, R)의 변화에 미치는 영향을 고려한다. 패킷무선망은 연속시간 Markov 체인 모델 그리고 무선채널은 경판정 Viterbi복호기와 비트변환확산부호계열을 이용한 DS/BPSK CDMA에 대하여 검토한다. 슬롯되지 않은 분산된 다중도약 패킷무선망에서 무선채널의 채널심볼오류가 패킷오류 발생에 미치는 진행과정은 Poisson 분포 그리고 오류발생시간을 지수분포로 가정한다. 신호대 잡음비와 심볼당 확산부호계열의 칩수와 같은 무선채널의 매개변수와 PRU의 수와 허용된 트래픽율과 같은 망의 매개변수를 갖는 함수로 망처리량을 구함으로써 Markov 패킷무선망과 부호화된 DS/BPSK 무선채널을 결합하여 종합적으로 분석할 수 있음을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권1호
• /
• pp.61-77
• /
• 2017

The most challenging issues in the multi-channel MAC of the IEEE 1609.4 standard is how to handle the dynamic vehicular traffic condition with a high mobility, dynamic topology, and a trajectory change. Therefore, dynamic channel coordination schemes between CCH and SCH are required to provide the proper bandwidth for CCH/SCH intervals and to improve the quality of service (QoS). In this paper, we use a Markov model to optimize the interval based on the dynamic vehicular traffic condition with high mobility nodes in the multi-channel MAC of the IEEE 1609.4 standard. We evaluate the performance of the three-dimensional Markov chain based on the Poisson distribution for the node distribution and velocity. We also evaluate the additive white Gaussian noise (AWGN) effect for the multi-channel MAC coordination scheme of the IEEE 1609.4 standard. The result of simulation proves that the performance of the dynamic channel coordination scheme is affected by the high node mobility and the AWGN. In this research, we evaluate the model analytically for the average delay on CCHs and SCHs and also the saturated throughput on SCHs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.4034-4053
• /
• 2015

In order to meet various requirements for transmission quality of both primary users (PUs) and secondary users (SUs) in cognitive radio networks, we introduce a channel bonding mechanism for PUs and a channel reservation mechanism for SUs, then we propose a novel spectrum allocation strategy. Taking into account the mistake detection and false alarm due to imperfect channel sensing, we establish a three-dimensional Markov chain to model the stochastic process of the proposed strategy. Using the method of matrix geometric solution, we derive the performance measures in terms of interference rate of PU packets, average delay and throughput of SU packets. Moreover, we investigate the influence of the number of the reserved (resp. licensed) channels on the system performance with numerical experiments. Finally, to optimize the proposed strategy socially, we provide a charging policy for SU packets.

• 인터넷정보학회논문지
• /
• 제10권3호
• /
• pp.85-94
• /
• 2009

본 논문에서는 무선 센서 네트워크에서의 에너지 효율적인 전송방안을 제안하고 이에 대한 이론적 분석을 제시하고자 한다. 본 논문에서 제안하는 전송기법은 채널 상태가 상대적으로 좋을 때만 전송을 시도하는 opportunistic transmission에 기반한 이진 결정 (binary-decision) 기반 전송이다. 이진 결정 기반 전송에서는 Markov decision process (MDP)를 이용하여 성공적인 전송을 위한 최적의 채널 임계값을 도출하였다. 다양한 시뮬레이션을 통해 제안하는 전송기법의 성능을 에너지 효율성과 전송율 측면에서 분석하였다.

• 제어로봇시스템학회논문지
• /
• 제8권4호
• /
• pp.288-291
• /
• 2002

We characterize multipath fading channel dynamics at the packet level and analyze the corresponding data queueing performance in various environments. We identify the similarity between wire-line queueing analysis and wireless network per-formance analysis. The second order channel statistics, i.e. channel power spectrum, is fecund to play an important role in the modeling of multipath fading channels. However, it is identified that the first order statistics, i.e. channel CDF also has significant impact on queueing performance. We use a special Markov chain, so-called CMPP, throughout this paper.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.628-646
• /
• 2016

This paper proposes a novel channel assignment scheme that is based on finite projective plane (FPP) theory. The proposed scheme involves using a Markov chain model to allocate N channels to N users through intermixed channel group arrangements, particularly when channel resources are idle because of inefficient use. The intermixed FPP-based channel group arrangements successfully related Markov chain modeling to punch through ratio formulations proposed in this study, ensuring fair resource use among users. The simulation results for the proposed FPP scheme clearly revealed that the defined throughput increased, particularly under light traffic load conditions. Nevertheless, if the proposed scheme is combined with successive interference cancellation techniques, considerably higher throughput is predicted, even under heavy traffic load conditions.

• 한국통신학회논문지
• /
• 제41권10호
• /
• pp.1240-1243
• /
• 2016

In this paper, we analyze the queueing performance of cumulative distribution function (CDF)-based opportunistic scheduling over Nakagami-m Markov fading channels. We derive the formula for the average queueing delay and the queue length distribution by constructing a two-dimensional Markov chain. Using our formula, we investigate the queueing performance for various fading parameters.