• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.119-131
• /
• 2014

In recent literature on traffic scheduling, the combination of the two-dimensional discrete-time Markov chain (DTMC) and the Markov modulated Poisson process (MMPP) is used to analyze the capacity of VoIP traffic in the cognitive radio system. The performance of the cognitive radio system solely depends on the accuracy of spectrum sensing techniques, the minimization of false alarms, and the scheduling of traffic channels. In this paper, we only emphasize the scheduling of traffic channels (i.e., traffic handling techniques for the primary user [PU] and the secondary user [SU]). We consider the following three different traffic models: the cross-layer analytical model, M/G/1(m) traffic, and the IEEE 802.16e/m scheduling approach to evaluate the performance of the VoIP services of the cognitive radio system from the context of blocking probability and throughput.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.125-133
• /
• 2008

In this paper, we propose active queue management mechanism (Active-WRED) to guarantee quality of the high priority service class in multi-class traffic service environment. In congestion situation, this mechanism increases drop probability of low priority traffic and reduces the drop probability of the high priority traffic, therefore it can improve the quality of the high priority service. In order to analyze the performance of our mechanism we introduce the stochastic analysis of a discrete-time queueing systems for the performance evaluation of the Active Queue Management (AQM) based congestion control mechanism called Weighted Random Early Detection (WRED) using a two-state Markov-Modulated Bernoulli arrival process (MMBP-2) as the traffic source. A two-dimensional discrete-time Harkov chain is introduced to model the Active-WRED mechanism for two traffic classes (Guaranteed Service and Best Effort Service) where each dimension corresponds to a traffic class with its own parameters.

• Journal of information and communication convergence engineering
• /
• v.20 no.2
• /
• pp.79-89
• /
• 2022

To compute the mean and variance of component-based reliability software, we focused on path-based reliability analysis. System reliability depends on the transition probabilities of components within a system and reliability of the individual components as basic input parameters. The uncertainty in these parameters is estimated from the test data of the corresponding components and arises from the software architecture, failure behaviors, software growth models etc. Typically, researchers perform Monte Carlo simulations to study uncertainty. Thus, we considered a Markov chain Monte Carlo (MCMC) simulation to calculate uncertainty, as it generates random samples through sequential methods. The MCMC approach determines the input parameters from the probability distribution, and then calculates the average approximate expectations for a reliability estimation. The comparison of different techniques for uncertainty analysis helps in selecting the most suitable technique based on data requirements and reliability measures related to the number of components.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.77-86
• /
• 2013

Cognitive radio (CR) has emerged as one of effective methods to enhance the utilization of existing radio spectrum. Main principle of CR is that secondary users (SUs) are allowed to use the spectrum unused by primary users (PUs) without interfering PU's transmissions. In this paper, PUs operate on a slot-by-slot basis and SUs try to exploit the slots unused by PUs. We propose OSA protocols in the single channel and we propose an opportunistic spectrum access (OSA) protocols in the multi-channel cognitive radio networks with one control channel and several licensed channels where a slot is divided into contention phase and transmission phase. A slot is divided into reporting phase, contention phase and transmission phase. The reporting phase plays a role of finding idle channels unused by PUs and the contention phase plays a role of selecting a SU who will send packets in the data transmission phase. One SU is selected by carrier sense multiple access / collision avoidance (CSMA/CA) with request to send / clear to send (RTS/CTS) mechanism on control channel and the SU is allowed to occupy all remaining part of all idle channels during the current slot. For mathematical analysis, first we deal with the single-channel case and we model the proposed OSA media access control (MAC) protocol by three-dimensional discrete time Markov chain (DTMC) whose one-step transition probability matrix has a special structure so as to apply the censored Markov chain method to obtain the steady state distribution.We obtain the throughput and the distribution of access delay. Next we deal with the multi-channel case and obtain the throughput and the distribution of access delay by using results of single-channel case. In numerical results, our mathematical analysis is verified by simulations and we give numerical results on throughput and access delay of the proposed MAC protocol. Finally, we find the maximum allowable number of SUs satisfying the requirements on throughput and access delay.

• Earthquakes and Structures
• /
• v.24 no.4
• /
• pp.303-316
• /
• 2023

Rapid post-earthquake damage estimation of subway stations is particularly necessary to improve short-term crisis management and safety measures of urban subway systems after a destructive earthquake. The conventional Performance-Based Earthquake Engineering (PBEE) framework with constant earthquake occurrence rate is invalid to estimate the aftershock risk because of the time-varying rate of aftershocks and the uncertainty of mainshock-damaged state before the occurrence of aftershocks. This study presents a time-varying probabilistic seismic risk assessment framework for underground structures considering mainshock and aftershock hazards. A discrete non-omogeneous Markov process is adopted to quantify the time-varying nature of aftershock hazard and the uncertainties of structural damage states following mainshock. The time-varying seismic risk of a typical rectangular frame subway station is assessed under mainshock-only (MS) hazard and mainshock-aftershock (MSAS) hazard. The results show that the probabilities of exceeding same limit states over the service life under MSAS hazard are larger than the values under MS hazard. For the same probability of exceedance, the higher response demands are found when aftershocks are considered. As the severity of damage state for the station structure increases, the difference of the probability of exceedance increases when aftershocks are considered. PSDR=1.0% is used as the collapse prevention performance criteria for the subway station is reasonable for both the MS hazard and MSAS hazard. However, if the effect of aftershock hazard is neglected, it can significantly underestimate the response demands and the uncertainties of potential damage states for the subway station over the service life.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.726-747
• /
• 2013

In order to support a large number of mobile stations (MSs) with statistical multiplexing in cellular networks, a random access scheme is widely used for uplink (UL) bandwidth request (BR). In the design of a random access based BR scheme, there are two important requirements: short connection delay and diverse Quality of Services (QoSs) support. Such requirements are crucial for IMT-Advanced systems like IEEE 802.16m to provide various types of fourth generation (4G) data services. IEEE 802.16m provides advanced UL BR schemes for non-real time polling service (nrtPS) and best-effort (BE) service to meet the requirements of short connection time and multiple QoS level support. In order to provide short connection time and multiple QoS support, three-step and differentiated BR procedures are adopted. In this paper, a novel modelling of IEEE 802.16m contention based BR scheme is proposed that uses a 2-dimensional discrete time Markov chain. Both the short access delay three-step BR procedures and normal five-step BR procedure are considered in the model. Our proposed model also incorporates the IEEE 802.16m differentiated BR procedure. With the proposed model, we extensively evaluate the performance of IEEE 802.16m BR for two different service classes by changing QoS parameters, such as backoff window size and BR timer. Computer simulations are performed to corroborate the accuracy of the proposed model for various operation scenarios. With the proposed model, accurate QoS parameter values can be derived for the IEEE 802.16m contention-based BR scheme.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2016.05a
• /
• pp.197-197
• /
• 2016

Forecasting future drought events in a region plays a major role in water management and risk assessment of drought occurrences. The creeping characteristics of drought make it possible to mitigate drought's effects with accurate forecasting models. Drought forecasts are inevitably plagued by uncertainties, making it necessary to derive forecasts in a probabilistic framework. In this study, a new probabilistic scheme is proposed to forecast droughts, in which a discrete-time finite state-space hidden Markov model (HMM) is used aggregated with the Representative Concentration Pathway 8.5 (RCP) precipitation projection (HMM-RCP). The 3-month standardized precipitation index (SPI) is employed to assess the drought severity over the selected five stations in South Kore. A reversible jump Markov chain Monte Carlo algorithm is used for inference on the model parameters which includes several hidden states and the state specific parameters. We perform an RCP precipitation projection transformed SPI (RCP-SPI) weight-corrected post-processing for the HMM-based drought forecasting to derive a probabilistic forecast that considers uncertainties. Results showed that the HMM-RCP forecast mean values, as measured by forecasting skill scores, are much more accurate than those from conventional models and a climatology reference model at various lead times over the study sites. In addition, the probabilistic forecast verification technique, which includes the ranked probability skill score and the relative operating characteristic, is performed on the proposed model to check the performance. It is found that the HMM-RCP provides a probabilistic forecast with satisfactory evaluation for different drought severity categories, even with a long lead time. The overall results indicate that the proposed HMM-RCP shows a powerful skill for probabilistic drought forecasting.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.4
• /
• pp.104-111
• /
• 2012

It is advantageous to avoid the handover to cell whose dwell time is short or can be ignored in terms of service continuity and average throughput. This paper proposes the handover scheme that is suitable for vehicle in order to improve the wireless Internet service quality. In the proposed scheme, the handover process continues to be learned before being modeled to Discrete-Time Markov Chain (DTMC). This modeling reduces the handover frequency by preventing the handover to cell that could provide service sufficiently to passenger even when vehicle passed through the cell but there was no need to perform handover. In order to verify the proposed scheme, we observed the average number of handovers, the average RSSI and the average throughput on various moving paths that vehicle moved in the given urban environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.1
• /
• pp.25-39
• /
• 1986

In this paper, we analyze the performance, particularly the flow control mechanism, of the CCITT X.25 protocol in a packet-switched network. In this analysis, we consider the link and packet layers separately, and investigate the performance in three measures; normalized channel throughput, mean transmission time, and transmission efficiency. Each of these measures is formulated in terms of given protocol parameters such as windos size, $T_1$ and $T_2$ values, message length, and so forth. We model the service procedure of the inpur traffic based on the flow control mechanism of the X.25 protocol, and investigate the mechanism of the sliding window flow control with the piggybacked acknowlodgment scheme using a discrete-time Markov chain model. With this model, we study the effect of variation of the protoccol parameters on the performance of the X.25 protocol. From the numerical results of this analysis one can select the optimal valuse of the protocol parameters for different channel environments. it has been found that to maintain the trasnmission capacity satisfactorily, the window size must be greater than or equal to 7 in a high-speed channel. The time-out value, $T_1$, must carefully be selected in a noisy channel. In a normal condition, it should be in the order of ls. The value of $T_2$ has some effect on the transmission efficiency, but is not critical.

• Convergence Security Journal
• /
• v.8 no.1
• /
• pp.91-100
• /
• 2008

The previous works in sensor networks security have focused on the aspect of confidentiality, authentication and integrity based on cryptographic primitives. There has been no prior work to assess the survivability in systematic way. Accordingly, this paper presents a survivability model of wireless sensor networks using software rejuvenation for dual adaptive cluster head. The survivability model has state transition to reflect status of real wireless sensor networks. In this paper, we only focus on a survivability model which is capable of describing cluster head compromise in the networks and able to switch over the redundant cluster head in order to increase the survivability of that cluster. Second, this paper presents how to enhance the survivability of sensor networks using software rejuvenation methodology for dual cluster head in wireless sensor network. We model and analyze each cluster as a stochastic process based on Semi Markov Process (SMP) and Discrete Time Markov Chain (DTMC). The proof of example scenarios and numerical analysis shows the feasibility of our approach.