• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1010-1019
• /
• 2004

In this paper, we represent Nakagami-m fading channel as finite-State Markov Channel (FSMC) and analyze the performance of wireless communication system with varying the fading channel condition. In FSMC model, the received signal's SNR is divided into finite intervals and these intervals are formed into Markov chain states. Each state is modeled by a BSC and the transition probability is dependent upon the physical characterization of the channel. The steady state probability and average symbol error rate of each state and transition probability are derived by numerical analysis and FSMC model is formed with these values. We found that various fading channels can be represented with FSMC by changing state transition index. In fast fading environment in which state transition index is large, the channel can be viewed as i.i.d. channel and on the contrary, in slow fading channel where state transition index is small, the channel can be represented by simple FSMC model in which transitions occur between just adjacent states. And we applied the proposed FSMC model to analyze the coding gain of random error correcting code on various fading channels via computer simulation.

• Journal of Communications and Networks
• /
• v.16 no.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.

• ETRI Journal
• /
• v.39 no.5
• /
• pp.718-728
• /
• 2017

Empirical modeling of wireless fading channels using common schemes such as autoregression and the finite state Markov chain (FSMC) is investigated. The conceptual background of both channel structures and the establishment of their mutual dependence in a confined manner are presented. The novel contribution lies in the proposal of a new approach for deriving the state transition probabilities borrowed from economic disciplines, which has not been studied so far with respect to the modeling of FSMC wireless fading channels. The proposed approach is based on equal portioning of the received signal-to-noise ratio, realized by using an alternative probability construction that was initially highlighted by Tauchen. The associated statistical procedure shows that a first-order FSMC with a limited number of channel states can satisfactorily approximate fading. The computational overheads of the proposed technique are analyzed and proven to be less demanding compared to the conventional FSMC approach based on the level crossing rate. Simulations confirm the analytical results and promising performance of the new channel model based on the Tauchen approach without extra complexity costs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4324-4342
• /
• 2014

Previous papers analyzed the throughput performance of the CDMA ALOHA system in Rayleigh fading channel, but they assume that the channel coefficient of Rayleigh fading was the same in the whole packet, which is not realistic. We recently proposed the finite-state Markov channel (FSMC) model to the throughput analysis of DS uncoded CDMA/unslotted ALOHA networks for fixed length data traffic in the mobile environment. We now propose the FSMC model to the throughput analysis of coded DS CDMA/unslotted ALOHA networks with variable length data traffic and one or two user classes in the mobile environment. The proposed DS CDMA/unslotted ALOHA wireless networks for two user classes with access control can maintain maximum throughput for the high priority user class under high message arrival per packet duration.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4180-4196
• /
• 2017

In this paper, we analyze average capacity of an amplify-and-forward (AF) cooperative communication system model in multi-relay multiuser networks. In contrast to conventional cooperative networks, relays in the considered network have no embedded energy supply. They need to rely on the energy harvested from the signals broadcasted by the source for their cooperative information transmission. Based on this structure, a two-step selection scheme is proposed considering both channel state information (CSI) and battery status of relays. Assuming each relay has infinite or finite energy storage for accumulating the energy, we use the infinite or finite Markov chain to capture the evolution of relay batteries and certain simplified assumptions to reduce computational complexity of the Markov chain analysis. The approximate closed-form expressions for the average capacity of the proposed scheme are derived. All theoretical results are validated by numerical simulations. The impacts of the system parameters, such as relay or user number, energy harvesting threshold and battery size, on the capacity performance are extensively investigated. Results show that although the performance of our scheme is inferior to the optimal joint selection scheme, it is still a practical scheme because its complexity is much lower than that of the optimal scheme.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.334-345
• /
• 2010

In this paper, we study optimal tradeoffs of achievable throughput versus consumed power in wireless ad-hoc networks formed by a collection of multiple antenna nodes. Relying on adaptive modulation and/or dynamic channel coding rate allocation techniques for multiple antenna systems, we examine the maximization of throughput under power constraints as well as the minimization of transmission power under throughput constraints. In our examination, we also consider the impacts of enforcing quality of service requirements expressed in the form of channel coding block loss constraints. In order to properly model temporally correlated loss observed in fading wireless channels, we propose the use of finite-state Markov chains. Details of fading statistics of signal-to-interference-noise ratio, an important indicator of transmission quality, are presented. Further, we objectively inspect complexity versus accuracy tradeoff of solving our proposed optimization problems at a global as oppose to a local topology level. Our numerical simulations profile and compare the performance of a variety of scenarios for a number of sample network topologies.

• Water for future
• /
• v.29 no.6
• /
• pp.155-166
• /
• 1996

A finite element model for simulating gradually and rapidly varied unsteady flow in open channel is developed based on dynamic wave equation using Petrov-Galerkin method. A matrix stability analysis shows the selective damping of short wave lengths and excellent phase accuracies achived by Petrov-Galerkin method. Whereas the Preissmann scheme displays less selective damping and poor phase accuracies, and Bubnov-Galerkin method shows nondissipative characteristics whicn causes a divergence problem in short wave length. The analysis also shows that the Petrov-Galerkin method displays the desirable combination of selective damping of high frequency progressive waves over a wide range of Courant number and good phase accuracy at low Courant number. Therefore, the Petrov-Galerkin can be effectively applied to gradually and rapidly varied unsteady flow.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.174-180
• /
• 2010

Automatic Repeat reQuest (ARQ) is a very effective technique against transmission error at the medium access control (MAC) layer. An erroneous MAC protocol data unit can be typically retransmitted within a given limit. In order to improve the IP-level performance, which directly affects the user-perceived quality-of-service (QoS), we propose a new truncated ARQ strategy, called MAC service data unit-based ARQ (S-ARQ), where the finite number of opportunities for retransmissions are shared by multiple fragments out of an IP datagram. We describe how SARQ can be implemented in a practical system, and then propose another variant of S-ARQ employing a functionality called early detection of failure. Basically, we evaluate the performance of SARQ in two different manners. First, assuming i.i.d. error process, we analyze both the probability of the delivery failure and the average delay of IP datagram. Then, we assess the performance of S-ARQ via simulation over a 2-state Markov channel.

• Journal of Internet Computing and Services
• /
• v.7 no.1
• /
• pp.151-164
• /
• 2006

The DCF of IEEE 802.11 standard coordinates transmissions onto the shared communication channel based on CSMA/CA protocol. Currently, 802,11 is the most widely deployed wireless LAN standard. In this paper, for 802.11-based wireless LAN we propose a service differentiation scheme adopting different contention window sizes and retransmission schemes for two different types of data packets and we present a Markov model for the state of a given station under a finite load traffic condition. We then derive an algorithm to find the transmission probability and the throughput. The proposed model is validated through simulation under various system settings.