Newborns prediction based on a belief Markov chain model

A multi-objective approach for energy-efficient and reliable dynamic VM consolidation in cloud data centers

IEEE 802.15.7 is introduced to standardize the visible light communication system for connecting devices via visible light spectrum. A slotted CSMA/CA MAC protocol defined in the standard to coordinate channel access for numbers of the optical wireless devices. In this paper, we proposed a simple Discrete Time Markov Chain (DTMC) model for modeling the behavior of the Contention Access Period (CAP) of the IEEE 802.15.7 to acquire valuable insights and inner workings of the protocol. The throughput and packet delivery reliability of the Contention Access Period (CAP) of the IEEE 802.15.7 are analyzed. Ns-2 simulations are used to verify the accuracy of the proposed model. The results between the proposed model and ns-2 simulation are closely matched with about 4 percent accuracy. Thus, verify the accuracy of the proposed model.

Goods Allocation by Queuing and the Occurrence of Violence: A Probabilistic Analysis

The IEEE 802.11 MAC protocol uses Distributed Coordinated Function (DCF) as the main element to determine the efficiency in sharing the limited resources of the wireless channels in wireless local area networks (WLANs). For analyzing 802.11 DCF networks, one of the key assumptions commonly used is that every station always has a packet to transmit (saturated state). However, in practice it may not be valid. In this paper, we assess the accuracy of the non-saturated traffic condition by integrating the traditional M/G/1 queueing model into Discrete Time Markov Chain (DTMC) model. The proposed I-DTMC enables us to analyze the performance of per-station in terms of average MAC system delay observed by each packet for successful transmission over the medium. The comparative results show enhanced performance evaluation of 802.11 DCF against other models.

We propose an analytical model for the performance analysis of the enhanced distributed channel access (EDCA) function of the IEEE 802.11e standard. The proposed discrete-time Markov chain (DTMC) model incorporates the main quality-of-service (QoS) features of 802.11e, namely, contention window (CW), arbitration interframe space (AIFS), and transmit opportunity (TXOP) differentiation. Due to its specific design, the proposed DTMC model jointly considers the state of the medium access control (MAC) layer buffer and the MAC differentiation mechanisms which facilitates a novel performance analysis framework at an arbitrary traffic load. Analytical and simulation results are compared to demonstrate the accuracy of the proposed approach for varying traffic load, EDCA parameters, and MAC layer buffer space.

Markov chain optimization of repair and replacement decisions of medical equipment

Introduction.- Discrete-time Markov chain models.- Poisson models and their application to ozone data.- Some counting processes and ozone air pollution.- Comments.- Acknowledgements.- References.

The rapid development of aviation technology has made the application of unmanned aerial vehicles (UAVs) more popular in recent years. Due to the inadequate capability of a single UAV, flying ad hoc networks (FANETs), which consist of multiple different UAVs, not only break the limits of single UAV by introducing the cooperation between UAVs, but also complete more complex missions by extending the communication range at infrastructure-less areas. One of the most important design issues for FANETs is the communication and cooperation between UAVs, and the number of UAV relays has been proved to be closely related to the improvement of system performance. However, few FANET protocols or algorithms have been proposed from the perspective of scheduling the number of relays. Inspired by the idea, this paper proposes an optimal relay number selection algorithm based on a more realistic network model which includes a novel cooperative ( $n+2$ )-node system model considering the distance metrics between relays and a Nakagami- $m$ short-term static fading channel model more suitable for UAV operation environments. The system outage probability is calculated by introducing the Meijer-G function, and a three-dimensional discrete time Markov chain (DTMC) model is established and analyzed to derive the closed-form binary expressions of throughput, energy efficiency and average transmission delay. In order to balance the three performance to achieve a comprehensive system performance, a trade-off factor named EDT is further proposed and maximized to evaluate the optimal number of relays. Finally, simulation results assess the impact of network parameters on system performance, and verify the superiority of the proposed algorithm over its fixed relay number counterpart.

With the development of the convergence of IT and automotive technology, platoon-based driving systems are getting more attention and how to disseminate messages in the platoon is an important issue. In this paper, to enhance the energy efficiency and traffic throughput (e.g., average velocity) while meeting transmission deadlines, we propose an energy efficient message dissemination scheme (EMDS) in platoon-based driving systems, which also provides proper power control and relay selection. To find out the optimal policy to balance the probability of successful message dissemination and transmission power cost in EMDS, we formulate a Markov decision process (MDP) problem that considers the velocity of the vehicles in the platoon. To evaluate the performance of EMDS, we analyze the outage probability, the average velocity, and the expected power consumption using the discrete-time Markov chain (DTMC) model. Evaluation results demonstrate EMDS with the optimal policy improves the average velocity and the energy efficiency of message dissemination compared with the conventional message dissemination schemes, while reducing the message dissemination failure rate.

Since its emergence, Wake-up radio technology has solved idle listening and overhearing problems of the duty-cycled approach in wireless sensor networks (WSN). Using collision avoidance mechanisms has furthered the success of WuR by improving the overall performance of wireless communications. These latter are characterized by transmission errors in real environments. The effect of non-ideal transmission channel on the performance of WuR has not yet been investigated. In this paper, a discrete-time Markov chain (DTMC) model that takes into account transmission errors is provided. This model is used to evaluate and compare the performance of two WuR based protocols, with and without collision avoidance, referred to as WuR-CA and WuR-NCA, respectively. We demonstrate that WuR-CA provides better performance than WuR-NCA in terms of reliability and throughput, at the cost of higher delay and power consumption, in both ideal and no-ideal channel conditions.

As the physical transmission rate develops rapidly in the modern IEEE 802.11 WLANs, the efficiency of traditional stop-and-wait(SAW) automatic repeat request (ARQ) mechanism degrades dramatically. Negative acknowledgement (NAK)-based ARQ mechanism is a proper candidate to improve the link layer performance. In this paper we propose a discrete-time Markov chain (DTMC) model to analyze the performance of the IEEE 802.11 WLAN system with NAK-based ARQ mechanism. Then the analytical performance is compared with that of SAW ARQ. We find that NAK-based ARQ outperforms SAW ARQ in terms of system throughput while performs poorly in terms of transmission delay. Then a hybrid ARQ scheme is proposed, through which the system can leverage between the two mechanisms to achieve better quality of service(QoS) guarantee. The simulation result validates the correctness of the proposed model and scheme.

To improve the efficiency of the identification process in RFID system, anti-collision protocol is crucial. EPC Class-1 Generation-2 standard (Gen2) employs ALOHA-based Q algorithm as anti-collision protocol. However, the same updating rate will cause unnecessary collided and idle slots. In 2010, we proposed a Fast Q algorithm (FQA) that adjusted the value of Q with different steps. Recently, we find that the Fast Q algorithm can be further improved since it did not consider the probabilities of collided/idle slots. Accordingly, this paper proposes an Enhanced Fast Q algorithm (EFQA). In EFQA, Q will be updated after two continuous collided or idle slots with different updating rates, which are calculated by synthesizing the duration time of collided/idle slots and their probabilities. We then quantitatively analyze the performance of EFQA by establishing a Discrete-Time Markov Chain (DTMC) model. Simulation results show that EFQA outperforms other protocols regardless of the number of tags.

We analyze the performance of slotted ALOHA systems with energy harvesting nodes and the retry limit by developing a node-centric two-dimensional discrete-time Markov chain (DTMC) model. We consider not only the number of energy packets consumed when a data packet is transmitted but also a general probability distribution of an energy packet arrival process. We assume that the capacities of data and energy buffer at a node are one packet and $E$ packets, respectively. According to the concept of the equilibrium point analysis, we derive a fixed point equation with respect to the ratio of nodes transmitting a data packet. The accuracy of theoretical results obtained from the fixed point equation is verified by computer simulation. Numerical results under Poisson arriving process of energy packets indicate that throughput, the offered traffic, and the discard probability demonstrate the weak symmetric relationship between the data packet generation probability and the average number of arriving energy packets. However, the average transmission delay rapidly increases when the average number of arriving energy packets becomes small.

This article focuses on data analyses under the scenario of missing at random within discrete-time Markov chain models. The naive method, nonlinear (NL) method, and Expectation-Maximization (EM) algorithm are discussed. We extend the NL method into a Bayesian framework, using an adjusted rejection algorithm to sample the posterior distribution, and estimating the transition probabilities with a Monte Carlo algorithm. We compare the Bayesian nonlinear (BNL) method with the naive method and the EM algorithm with various missing rates, and comprehensively evaluate estimators in terms of biases, variances, mean square errors, and coverage probabilities (CPs). Our simulation results show that the EM algorithm usually offers smallest variances but with poorest CP, while the BNL method has smaller variances and better/similar CP as compared to the naive method. When the missing rate is low (about 9%, MAR), the three methods are comparable. Whereas when the missing rate is high (about 25%, MAR), overall, the BNL method performs slightly but consistently better than the naive method regarding variances and CP. Data from a longitudinal study of stress level among caregivers of individuals with Alzheimer’s disease is used to illustrate these methods.

ABSTRACTIn epidemic modelling, the emergence of a disease is characterized by the low numbers of infectious individuals. Environmental randomness impacts outcomes such as the outbreak or extinction of the disease in this case. This randomness can be accounted for by modelling the system as a continuous time Markov chain, . The probability of extinction given some initial state is the probability of hitting a subset of the state space associated with extinction for the initial state. This hitting probability can be studied by passing to the discrete time Markov chain (DTMC), . An approach is presented to approximate a DTMC on a countably infinite state space by a DTMC on a finite state space for the purpose of solving general hitting problems. This approach is applied to approximate the probability of disease extinction in an epidemic model. It is also applied to evaluate a heterogeneous disease control strategy in a metapopulation.