The power saving mechanism with binary exponential traffic indications in the IEEE 802.16e/m

In IEEE 802.16e (air interface standard for MWiMAX) and IEEE 802.16m (evolution of MWiMAX for IMT-Advanced), power saving is one of the important issues for the battery-powered mobile stations (MSs). According to IEEE 802.16e standard, when an MS switches from awake mode to sleep mode, the MS is required to send a sleep request (MOB-SLP-REQ) message and to receive a sleep response (MOB-SLP-RSP) message. In this paper we propose a new sleep mode scheme, called the power saving mechanism with binary exponential traffic indications. This sleep mode scheme omits MOB-SLP-REQ/RSP messages and has a traffic indication (TRF-IND) interval as a main system parameter, applying the truncated binary exponential increasing method for its length. The proposed scheme in this paper is quite well aligned with the design policy of sleep mode in discussion at IEEE 802.16m in the sense that it tries to minimize the overhead for the state transition between awake mode and sleep mode, and hence it can reduce the delay due to the state transition and enhance the power saving efficiency. We present a mathematical analysis for the proposed scheme and investigate its performance. As performance measures, we provide the sleep interval ratio, the average power consumption, and the mean delay. Using the analytical results, the system parameters such as the initial TRF-IND interval and the maximum binary exponent for TRF-IND intervals can be optimized while satisfying the QoS constraint on the mean delay. The numerical results show that the proposed scheme consumes less energy than the power saving class of type I in the IEEE 802.16e standard. This research was supported by the MKE (Ministry of Knowledge Economy), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute for Information Technology Advancement) (IITA-2008-C1090-0801-0013).     

System modeling and performance analysis of the power saving class type II in BWA networks

For reducing the energy consumption of the Mobile Station in mobile Broadband Wireless Access networks, IEEE 802.16 offers three kinds of sleep mode operations called power saving classes type I, type II and type III. In order to investigate mathematically the inherent relationships between the performance measures and the system parameters, we propose in this paper a novel method for modeling the sleep mode with the power saving class type II in IEEE 802.16 and analyzing the performance of this sleep mode. Considering the attractive feature that some data frames can be transmitted during the listening state, we present a queueing model with two kinds of busy mechanisms to capture the working principle of the sleep mode operations with the power saving class type II. With the first and higher derivatives of the probability generating functions, we can give the averages and the standard deviations for the system performance using the diffusion approximation for the operating process of the system. We also propose methods for measuring the system performance in terms of the switching ratio, the energy saving ratio, and the average response time of data frames, as well as giving the expressions for these performance measures. Numerical results are provided with analysis and simulation to show the average performance measures, standard deviations and the cost function with different system loads. Moreover, we construct a cost function with the aim of determining the optimal time length of the sleep window to minimize the cost function.     

Performance analysis of AAL multiplexer with CBR traffic and bursty traffic

This paper models and evaluates the AAL multiplexer to analyze AAL protocol in ATM networks. We consider an AAL multiplexer in which a single periodically deterministic CBR traffic stream and several variable size bursty background traffic streams are multiplexed and one ATM cell stream goes out. We model the AAL multiplexer as aB ^X +D/D/1/K queue and analyze this queueing system. We represent various performance measures such as loss probability and waiting time in the basis of cell and packet.     

Delay analysis of extended rtPS for VoIP service in IEEE 802.16e by matrix analytic method

Extended real time polling service (ErtPS) is added to IEEE 802.16e-2005 standards in order for VoIP service to use uplink resources efficiently by considering on/off characteristic of voice source. Recently average queueing delay of ErtPS algorithm for VoIP service was investigated, and it was shown that ErtPS allows to admit more users than UGS algorithm. But we need the probability distribution of queueing delay rather than average queueing delay in order to provide a necessary information for QoS. In this paper we obtain the probability distribution of queueing delay of ErtPS for VoIP service by using the matrix analytic method for the GI/M/1 type and the M/G/1 type matrices in cases of the service time being exponential and deterministic respectively. By applying the results on deterministic service time we find the maximum allowable number of VoIP users with the required constraint on queueing delay. This research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Assessment).     

A Performance evaluation of neural network models in traffic volume forecasting

Forecasting traffic volume is an important task in controlling urban highways, guiding drivers' routes, and providing real-time transportation information. Previous research on traffic volume forecasting has concentrated on a single forecasting model and has reported positive results, which has been frequently better than those of other models. In addition, many previous researchers have claimed that neural network models are better than linear statistical models in terms of prediction accuracy. However, the forecasting power of a single model is limited to the typical cases to which the model fits best. In other words, even though many research efforts have claimed the general superiority of a single model over others in predicting future events, we believe it depends on the data characteristics used, the composition of the training data, the model architecture, and the algorithm itself.In this paper, we have studied the relationship in forecasting traffic volume between data characteristics and the forecasting accuracy of different models, particularly neural network models. To compare and test the forecasting accuracy of the models, three different data sets of traffic volume were collected from interstate highways, intercity highways, and urban intersections. The data sets show very different characteristics in terms of volatility, period, and fluctuations as measured by the Hurst exponent, the correlation dimension. The data sets were tested using a back-propagation network model, a FIR model, and a time-delayed recurrent model.The test results show that the time-delayed recurrent model outperforms other models in forecasting very randomly moving data described by a low Hurst exponent. In contrast, the FIR model shows better forecasting accuracy than the time-delayed recurrent network for relatively regular periodic data described by a high Hurst exponent. The interpretation of these results shows that the feedback mechanism of the previous error, through the temporal learning technique in the time-delayed recurrent network, naturally absorbs the dynamic change of any underlying nonlinear movement. The FIR and back-propagation model, which have claimed a nonlinear learning mechanism, may not be very good in handling randomly fluctuating events.     

Weak type bounds for a class of rough operators with power weights

In this note we show that and the fractional integral and maximal operators with rough kernel respectively, are bounded operators from to where and

     

On a class of self-similar processes with stationary increments in higher order Wiener chaoses

We study a class of self-similar processes with stationary increments belonging to higher order Wiener chaoses which are similar to Hermite processes. We obtain an almost sure wavelet-like expansion of these processes. This allows us to compute the pointwise and local Hölder regularity of sample paths and to analyse their behaviour at infinity. We also provide some results on the Hausdorff dimension of the range and graphs of multidimensional anisotropic self-similar processes with stationary increments defined by multiple Wiener–Itô integrals.     

Optimal scheduling and power allocation in wireless networks with heavy traffic

This paper addresses the problem of joint transmit power allocation and time slot scheduling in a wireless communication system with time varying traffic. The system is handled by a single base station transmitting over time varying channels. This may be the case in practice of a hybrid TDMA-CDMA (Time Division Multiple Access-Code Division Multiple Access) system. The operating time horizon is divided into time slots; a fixed amount of power is available at each time slot. The users share each time slot and the power available at this time slot with the objective of minimizing the expected total queue length. The problem is reformulated, via a heavy traffic approximation, as the optimal control of a reflected diffusion in the positive orthant. We establish a closed form solution for the obtained control problem. The main feature that makes it possible is an astute choice of some auxiliary weighting matrices in the cost rate. The proposed solution relies also on the knowledge of the covariance matrix of the non-standard multi-dimensional Wiener process which is the driving process in the reflected diffusion. We then compute this covariance matrix given the stationary distribution of the multi-dimensional channel process. Further stochastic analysis is provided: the cost variance, and the Fokker–Planck equation for the distribution density of the queue length.     

Queueing analysis of the DRX power saving mechanism in fault-tolerant 3GPP LTE wireless networks

Energy efficiency and high reliability are major aspects of modern mobile wireless networks. Therefore, it is a critical step to use power management methods along with fault-tolerant techniques. In this paper, we mathematically investigate the Discontinuous Reception, a power saving mechanism in 3GPP LTE wireless networks, with checkpointing and rollback recovery using a variant of an M/G/1 queue with a modified service time and multiple vacations. Due to the lack of enough storage, the mobile device periodically stores its checkpoint data in a stable fixed server, and rolling back to the latest checkpoint when a transient fault or a wireless link error occurs. Various energy and performance metrics are obtained, while constrained optimization problems are formulated and solved. Extensive numerical results are provided, and give an insight into the operation of the model.     

Heavy traffic analysis of M/G/1 type queueing systems with Markov-modulated arrivals

M/G/1 type queueing systems whose arrival rate is a function of an independent continuous time Markov chain are considered. We suggest a simple analytical approach which allows rigorous mathematical analysis of the stationary characteristics under heavy traffic. Their asymptotic behaviour is described in terms of characteristics of the modulating process (defined as a solution of a set of linear algebraic equations). The analysis is based on certain “semi-explicit” formulas for the performance characteristics. This research was supported by INTAS under grant No. 96-0828.     

An a priori error analysis of a type III thermoelastic problem with two porosities

In this work, we study, from the numerical point of view, a type III thermoelastic model with double porosity. The thermomechanical problem is written as a linear system composed of hyperbolic partial differential equations for the displacements and the two porosities, and a parabolic partial differential equation for the thermal displacement. An existence and uniqueness result is recalled. Then, we perform its a priori error numerical analysis approximating the resulting variational problem by using the finite element method and the implicit Euler scheme. The linear convergence of the algorithm is derived under suitable additional regularity conditions. Finally, some numerical simulations are shown to demonstrate the accuracy of the approximations and the dependence of the solution on a coupling coefficient.     

Some new aspects of the transient analysis of discrete-parameter Markov models with an application to the evaluation of repair events in power transmission

In Markov reliability modelling, a partitioned state space isused to describe the behaviour of a system each state of whichis associated with the system either being functional or underrepair. Such a system alternates between working and repairperiods indefinitely. Recent research results on the distributionof the sequences of the lengths of working and repair periodsafford the reliability analyst a set of system characteristicswhich can be used in addition to the traditional ones (reliability,point availability, etc.) to describe the system‘s transientbehaviour. In this paper, we present a concise derivation ofclosed-form expressions for the probability mass function andthe factorial moments of the total cumulative ’time‘spent in a subset of the state space by an irreducible or absorbingdiscrete-parameter Markov chain during the first n time instances.This result is then applied to analyse the sequence of repairevents categorized as ’minor‘ and ’major‘of a Markov model of a power transmission system. The numericalimplementation using the Macintosh version of MatLab is alsodiscussed.     

The normalizer group of an ergodic automorphism of type III and the commutant of an ergodic flow

It was proved by W. Krieger that for an ergodic automorphism T of type III there is an ergodic flow (F_t)_tR, whose isomorphism class uniquely determines the weak equivalence class of T. It will be shown that if N[T] is the normalizer group of the full group [T] and [ ] is the closure of [T], then the quotient group is topologically isomorphic to the commutant, c((F_t)_tR), of the flow (F_t)_tR. For various examples of flows (F_t)_tR the commutant c((F_t)_tR) is studied.     

Bifurcation analysis of a generalized Gause model with prey harvesting and a generalized Holling response function of type III

In this paper we study a generalized Gause model with prey harvesting and a generalized Holling response function of type III: . The goal of our study is to give the bifurcation diagram of the model. For this we need to study saddle-node bifurcations, Hopf bifurcation of codimension 1 and 2, heteroclinic bifurcation, and nilpotent saddle bifurcation of codimension 2 and 3. The nilpotent saddle of codimension 3 is the organizing center for the bifurcation diagram. The Hopf bifurcation is studied by means of a generalized Liénard system, and for b=0 we discuss the potential integrability of the system. The nilpotent point of multiplicity 3 occurs with an invariant line and can have a codimension up to 4. But because it occurs with an invariant line, the effective highest codimension is 3. We develop normal forms (in which the invariant line is preserved) for studying of the nilpotent saddle bifurcation. For b=0, the reversibility of the nilpotent saddle is discussed. We study the type of the heteroclinic loop and its cyclicity. The phase portraits of the bifurcations diagram (partially conjectured via the results obtained) allow us to give a biological interpretation of the behavior of the two species.     

Performance analysis of an ISDN switch with distributed architecture: circuit switched calls

We have developed an approximate analytic model and a detailed simulation model to study the performance of an ISDN switch with distributed architecture. The analytic model treats the switch as a network of single server and infinite server queues with nonpreemptive priority service, general service times and batch arrivals. The simulation program is written in a distributed and modular way so as to simplify model development and debugging. Also extensive statistical techniques are employed for simulation output validation. It is observed that the analytic and the simulation models are in close agreement for the mean end-to-end delay and in moderately close agreement for the 95th percentile points of the end-to-end delay distribution. The comparisons between the analytic and the simulation models lead us to conjecture that the analytic model would be even more accurate for bigger systems with several hundred processors (where simulation models are too expensive to run). Even though the model assumes Poisson external call arrival process, it is shown that it may be applied with reasonable accuracy even when external call arrivals are non-Poisson. This is due to the fact that the composite message arrival process at a processor or transmission element tends to be close to Poisson even when the external call arrivals are non-Poisson.     

Eigenvalue-Eigenvector analysis for a class of patterned correlation matrices with an application: A comment

A correlation matrix analyzed by Kotz, Pearn and Wichern (1984) is reanalyzed with known results on balanced ANOVA models.