• Title/Summary/Keyword: discrete-time Markov chain (DTMC)

Search Result 13, Processing Time 0.02 seconds

Vehicle Mobility Management Scheme Using AdaBoost Algorithm (AdaBoost 기법을 이용한 차량 이동성 관리 방안)

  • Han, Sang-Hyuck;Lee, Hyukjoon;Choi, Yong-Hoon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.13 no.1
    • /
    • pp.53-60
    • /
    • 2014
  • Redundant handovers cause degraded quality of service to passengers in vehicle. This paper proposes a handover scheme suitable for users traveling in vehicles, which enables continuous learning of the handover process using a discrete-time Markov chain (DTMC). Through AdaBoost machine learning algorithm, the proposed handover scheme avoids unnecessary handover trials when a short dwell time in a target cell is expected or when the target cell is an intermediate cell through which the vehicle quickly passes. Simulation results show that the proposed scheme reduces the number of handover occurrences and maintains adequate throughput.

A Novel Spectrum Access Strategy with ${\alpha}$-Retry Policy in Cognitive Radio Networks: A Queueing-Based Analysis

  • Zhao, Yuan;Jin, Shunfu;Yue, Wuyi
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.193-201
    • /
    • 2014
  • In cognitive radio networks, the packet transmissions of the secondary users (SUs) can be interrupted randomly by the primary users (PUs). That is to say, the PU packets have preemptive priority over the SU packets. In order to enhance the quality of service (QoS) for the SUs, we propose a spectrum access strategy with an ${\alpha}$-Retry policy. A buffer is deployed for the SU packets. An interrupted SU packet will return to the buffer with probability ${\alpha}$ for later retrial, or leave the system with probability (1-${\alpha}$). For mathematical analysis, we build a preemptive priority queue and model the spectrum access strategy with an ${\alpha}$-Retry policy as a two-dimensional discrete-time Markov chain (DTMC).We give the transition probability matrix of the Markov chain and obtain the steady-state distribution. Accordingly, we derive the formulas for the blocked rate, the forced dropping rate, the throughput and the average delay of the SU packets. With numerical results, we show the influence of the retrial probability for the strategy proposed in this paper on different performance measures. Finally, based on the trade-off between different performance measures, we construct a cost function and optimize the retrial probabilities with respect to different system parameters by employing an iterative algorithm.

Performance Evaluation of the VoIP Services of the Cognitive Radio System, Based on DTMC

  • Habiba, Ummy;Islam, Md. Imdadul;Amin, M.R.
    • 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.

Web Page Recommendation using a Stochastic Process Model (Stochastic 프로세스 모델을 이용한 웹 페이지 추천 기법)

  • Noh, Soo-Ho;Park, Byung-Joon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.6
    • /
    • pp.37-46
    • /
    • 2005
  • In the Web environment with a huge amount of information, Web page access patterns for the users visiting certain web site can be diverse and change continually in accordance with the change of its environment. Therefore it is almost impossible to develop and design web sites which fit perfectly for every web user's desire. Adaptive web site was proposed as solution to this problem. In this paper, we will present an effective method that uses a probabilistic model of DTMC(Discrete-Time Markov Chain) for learning user's access patterns and applying these patterns to construct an adaptive web site.

Coexistence Analysis in Korean RFID/USN Frequency Bands Considering Both PHY and MAC Layers (국내 RFID/USN 대역에서 PHY/MAC 계층을 모두 고려한 주파수 공동사용 분석 방법)

  • Yoon, Hyungoo;Jang, Byung-Jun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.24 no.1
    • /
    • pp.73-81
    • /
    • 2013
  • In this paper, we have proposed the interference analysis method which uses both an interference probability model at the PHY layer of RFID system and the DTMC model at the MAC layer of USN system. Using the proposed method, we have performed sharing analysis between passive RFID and USN systems at the Korean RFID/USN frequency bands. If 1% performance degradation of USN system is allowed, RFID and USN systems can share the frequency bands where channel number is greater or equal to 20 on condition that radius of protection area is greater than 300 m.

Interference Analysis of RFID Gen-2 System Considering Both PHY and MAC Layers (PHY/MAC 계층을 모두 고려한 RFID Gen-2 시스템의 간섭 분석)

  • Yoon, Hyun-Goo;Choi, Sun-Woong;Jang, Byung-Jun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.21 no.7
    • /
    • pp.752-760
    • /
    • 2010
  • This paper investigates the performance of EPCglobal Generation-2(Gen-2) radio frequency identification(RFID) protocol under reader-to-reader interfering environments. We establish a modified discrete-time Markov chain(DTMC) model for the Gen-2 and accordingly obtain quantitative results of query success rate(QSR) and tag identification speed (TIS). Extensive simulations validate our theoretical analysis and demonstrate that the number of tags over 100 has little impact on the performance. TIS linearly decreases by 10 tags/sec/reader as the number of interfering readers increases. Our model for Gen-2 protocol is also useful to study the performance of other RFID protocols.

A Smart DTMC-based Handover Scheme Using Vehicle's Mobility Behavior Profile (차량의 이동성 행동 프로파일을 이용한 DTMC 기반의 스마트 핸드오버 기법)

  • Han, Sang-Hyuck;Kim, Hyun-Woo;Choi, Yong-Hoon;Park, Su-Won;Rhee, Seung-Hyuong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6B
    • /
    • pp.697-709
    • /
    • 2011
  • For improvement of wireless Internet service quality at vehicle's moving speed, it is advised to reduce the service disruption time by reducing the handover frequency on vehicle's moving path. Particularly, 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 experiment results confirmed that the proposed scheme was able to provide the improved wireless Internet service to vehicle that moved to some degree of consistency.

Estimation of Degradation Period Ratio for Adaptive Framework in Mobile Cellular Networks (적응형 구조를 갖는 이동통신망에서 호 저하 시간 비율 추정)

  • Jung, Sung-Hwan;Lee, Sae-Jin;Hong, Jung-Wan;Lee, Chang-Hoon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.29 no.4
    • /
    • pp.312-320
    • /
    • 2003
  • Recently there is a growing interest in mobile cellular network providing multimedia service. However, the link bandwidth of mobile cellular network is not sufficient enough to provide satisfactory services to users. To overcome this problem, an adaptive framework has been proposed. In this study, we propose a new method of estimating DPR(Degradation Period Ratio) in an adaptive multimedia network where the bandwidth of ongoing call can be dynamically adjusted during its lifetime. DPR is a QoS(Quality of Service) parameter which represents the ratio of allocated bandwidth below a pre-defined target to the whole service time of a call. We improve estimation method of DPR using DTMC(Discrete Time Markov Chain) model by calculate mean degradation period, degradation probability more precisely than in existing studies. Under Threshold CAC(Call Admission Control) algorithm, we present analytically how to guarantee QoS to users and illustrate the method by numerical examples. The proposed method is expected to be used as one of CAC schemes in guaranteeing predefined QoS level of DPR.

WBAN MAC Protocols- Non-Saturation Modeling and Performance Analysis

  • Khan, Pervez;Ullah, Niamat;Kim, Hoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1462-1476
    • /
    • 2017
  • The current literature on discrete-time Markov chain (DTMC) based analysis of IEEE 802.15.6 MAC protocols for wireless body area networks (WBANs), do not consider the ACK timeout state, wherein the colliding nodes check the ill fate of their transmissions, while other contending nodes perform backoff check that slot as usual. In this paper, our DTMC model accurately captures the carrier sense multiple access with collision avoidance (CSMA/CA) mechanism of IEEE 802.15.6 medium access control (MAC) and allows the contending nodes performing backoff to utilize the ACK timeout slot during collisions. The compared rigorous results are obtained by considering a non-ideal channel in non-saturation conditions, and CSMA/CA parameters pertaining to UWB PHY of IEEE 802.15.6 MAC protocols.

Mobility Management Scheme for Vehicles Moving Repeated Path (반복 경로를 운행하는 차량의 이동성 관리 기법)

  • Choi, Gyu-Yeon;Han, Sang-Hyuck;Lee, Jung-Girl;Choi, Yong-Hoon
    • 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.