• 제목/요약/키워드: infinite markov chain

검색결과 11건 처리시간 0.055초

Energy Harvesting in Multi-relay Multiuser Networks based on Two-step Selection Scheme

  • Guo, Weidong;Tian, Houyuan;Wang, Qing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권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.

Markov Chain을 이용한 철도계통의 고조파 분석 (Harmonics Analysis of Railroad Systems using Markov Chain)

  • 송학선;이승혁;김진오;김형철
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2005년도 추계학술대회 논문집 전력기술부문
    • /
    • pp.230-233
    • /
    • 2005
  • This paper proposes power qualify assessment using Markov Chain applied to Ergodic theorem. The Ergodic theorem introduces the state of aperiodic, recurrent, and non-null. The proposed method using Markov Chain presents very well generated harmonic characteristics according to the traction's operation of electric railway system. In case of infinite iteration, the characteristic of Markov Chain that converges on limiting probability Is able to expected harmonic currents posterior transient state. TDD(Total Demand Distortion) is also analyzed in expected current of each harmonic. The TDD for power quality assesment is calculated using Markov Chain theory in the Inceon international airport IAT power system.

  • PDF

SOME GENERALIZED SHANNON-MCMILLAN THEOREMS FOR NONHOMOGENEOUS MARKOV CHAINS ON SECOND-ORDER GAMBLING SYSTEMS INDEXED BY AN INFINITE TREE WITH UNIFORMLY BOUNDED DEGREE

  • Wang, Kangkang;Xu, Zurun
    • Journal of applied mathematics & informatics
    • /
    • 제30권1_2호
    • /
    • pp.83-92
    • /
    • 2012
  • In this paper, a generalized Shannon-McMillan theorem for the nonhomogeneous Markov chains indexed by an infinite tree which has a uniformly bounded degree is discussed by constructing a nonnegative martingale and analytical methods. As corollaries, some Shannon-Mcmillan theorems for the nonhomogeneous Markov chains indexed by a homogeneous tree and the nonhomogeneous Markov chain are obtained. Some results which have been obtained are extended.

SOME SMALL DEVIATION THEOREMS FOR ARBITRARY RANDOM FIELDS WITH RESPECT TO BINOMIAL DISTRIBUTIONS INDEXED BY AN INFINITE TREE ON GENERALIZED RANDOM SELECTION SYSTEMS

  • LI, FANG;WANG, KANGKANG
    • Journal of applied mathematics & informatics
    • /
    • 제33권5_6호
    • /
    • pp.517-530
    • /
    • 2015
  • In this paper, we establish a class of strong limit theorems, represented by inequalities, for the arbitrary random field with respect to the product binomial distributions indexed by the infinite tree on the generalized random selection system by constructing the consistent distri-bution and a nonnegative martingale with pure analytical methods. As corollaries, some limit properties for the Markov chain field with respect to the binomial distributions indexed by the infinite tree on the generalized random selection system are studied.

DISCRETE-TIME BUFFER SYSTEMS WITH SESSION-BASED ARRIVALS AND MARKOVIAN OUTPUT INTERRUPTIONS

  • Kim, Jeongsim
    • Journal of applied mathematics & informatics
    • /
    • 제33권1_2호
    • /
    • pp.185-191
    • /
    • 2015
  • This paper considers a discrete-time buffer system with session-based arrivals, an infinite storage capacity and one unreliable output line. There are multiple different types of sessions and the output line is governed by a finite state Markov chain. Based on a generating functions approach, we obtain an exact expression for the mean buffer content.

신호 포획현상을 가지는 알로하 시스템의 안정성 고찰 (A Stability Issue on Controlled ALOHA System with Capture Channel)

  • 곽경섭
    • 한국통신학회논문지
    • /
    • 제18권12호
    • /
    • pp.1855-1869
    • /
    • 1993
  • 기존의 알로하 시스템은 불안정한 시스템으로 알려져있다. 또한 포획현상을 가지는 알로하 시스템도 불안정하다는 것이 증명되었다. 본 논문에서는 신호, 포획현상을 가지는 알로하 시스템에 전송 제어 알고리즘을 적용하고, 새로운 Lyapunov 함수를 도입하여 다차원 바르코프 연쇄 모델의 안정성을 증명하였다. 부가적으로 시스템의 전송효율을 구하고, 또한 시뮬레이션을 통하여 패킷 전송지연을 분석하였다.

  • PDF

BMAP(r)/M(r)/N(r) 대기행렬시스템 분석 (Analysis of BMAP(r)/M(r)/N(r) Type Queueing System Operating in Random Environment)

  • 김제숭
    • 대한산업공학회지
    • /
    • 제42권1호
    • /
    • pp.30-37
    • /
    • 2016
  • A multi-server queueing system with an infinite buffer and impatient customers is analyzed. The system operates in the finite state Markovian random environment. The number of available servers, the parameters of the batch Markovian arrival process, the rate of customers' service, and the impatience intensity depend on the current state of the random environment and immediately change their values at the moments of jumps of the random environment. Dynamics of the system is described by the multi-dimensional asymptotically quasi-Toeplitz Markov chain. The ergodicity condition is derived. The main performance measures of the system are calculated. Numerical results are presented.

Comments on "Optimal Utilization of a Cognitive Shared Channel with a Rechargeable Primary Source Node"

  • El Shafie, Ahmed;Salem, Ahmed Sultan
    • Journal of Communications and Networks
    • /
    • 제17권3호
    • /
    • pp.265-266
    • /
    • 2015
  • In a recent paper [1], the authors investigated the maximum stable throughput region of a network composed of a rechargeable primary user and a secondary user plugged to a reliable power supply. The authors studied the cases of an infinite and a finite energy queue at the primary transmitter. However, the results of the finite case are incorrect. We show that under the proposed energy queue model (a decoupled M/D/1 queueing system with Bernoulli arrivals and the consumption of one energy packet per time slot), the energy queue capacity does not affect the stability region of the network.

Unified Model for Performance Analysis of IEEE 802.11 Ad Hoc Networks in Unsaturated Conditions

  • Xu, Changchun;Gao, Jingdong;Xu, Yanyi;He, Jianhua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권2호
    • /
    • pp.683-701
    • /
    • 2012
  • IEEE 802.11 standard has achieved huge success in the past decade and is still under development to provide higher physical data rate and better quality of service (QoS). An important problem for the development and optimization of IEEE 802.11 networks is the modeling of the MAC layer channel access protocol. Although there are already many theoretic analysis for the 802.11 MAC protocol in the literature, most of the models focus on the saturated traffic and assume infinite buffer at the MAC layer. In this paper we develop a unified analytical model for IEEE 802.11 MAC protocol in ad hoc networks. The impacts of channel access parameters, traffic rate and buffer size at the MAC layer are modeled with the assistance of a generalized Markov chain and an M/G/1/K queue model. The performance of throughput, packet delivery delay and dropping probability can be achieved. Extensive simulations show the analytical model is highly accurate. From the analytical model it is shown that for practical buffer configuration (e.g. buffer size larger than one), we can maximize the total throughput and reduce the packet blocking probability (due to limited buffer size) and the average queuing delay to zero by effectively controlling the offered load. The average MAC layer service delay as well as its standard deviation, is also much lower than that in saturated conditions and has an upper bound. It is also observed that the optimal load is very close to the maximum achievable throughput regardless of the number of stations or buffer size. Moreover, the model is scalable for performance analysis of 802.11e in unsaturated conditions and 802.11 ad hoc networks with heterogenous traffic flows.

집단 과거 의존 파론도 게임의 역설 (Paradox in collective history-dependent Parrondo games)

  • 이지연
    • Journal of the Korean Data and Information Science Society
    • /
    • 제22권4호
    • /
    • pp.631-641
    • /
    • 2011
  • 과거 시행의 승패 결과에 의해 현재 시행의 승패 확률이 결정되는 과거 의존 파론도 게임을 고려한다. 여러 명의 게임자들이 과거 의존 파론도 게임을 구성하는 공정한 두 게임 중에서 한 게임을 임의로 선택하는 전략과 매 시행 때마다 현재의 상태를 이용하여 그 기대상금이 최대인 게임을 선택하는 전략을 비교한다. 현재의 상태를 고려하지 않고 임의적으로 게임을 선택하는 전략은 점차 기대상금이 양수가 되어 결국 이기는 게임이 되는 반면에 현재의 상태를 이용하여 최적의 게임을 선택하는 전략은 게임이 진행될수록 오히려 기대상금이 0으로 일정하게 되는 역설적인 현상이 나타남을 확인하고, 이러한 역설적인 현상이 발생하는 확률 모수의 범위를 찾는다.