3,372 research outputs found
Optimal Energy Management Policies for Energy Harvesting Sensor Nodes
We study a sensor node with an energy harvesting source. The generated energy
can be stored in a buffer. The sensor node periodically senses a random field
and generates a packet. These packets are stored in a queue and transmitted
using the energy available at that time. We obtain energy management policies
that are throughput optimal, i.e., the data queue stays stable for the largest
possible data rate. Next we obtain energy management policies which minimize
the mean delay in the queue.We also compare performance of several easily
implementable sub-optimal energy management policies. A greedy policy is
identified which, in low SNR regime, is throughput optimal and also minimizes
mean delay.Comment: Submitted to the IEEE Transactions on Wireless Communications; 22
pages with 10 figure
A time dependent performance model for multihop wireless networks with CBR traffic
In this paper, we develop a performance modeling technique for analyzing the time varying network layer queueing behavior of multihop wireless networks with constant bit rate traffic. Our approach is a hybrid of fluid flow queueing modeling and a time varying connectivity matrix. Network queues are modeled using fluid-flow based differential equation models which are solved using numerical methods, while node mobility is modeled using deterministic or stochastic modeling of adjacency matrix elements. Numerical and simulation experiments show that the new approach can provide reasonably accurate results with significant improvements in the computation time compared to standard simulation tools. © 2010 IEEE
Analysis of an Electric Vehicle Charging System Along a Highway
To reduce carbon emission, the transportation sector evolves toward replacing internal combustion vehicles by electric vehicles (EV). However, the limited driving ranges of EVs, their long recharge duration and the need of appropriate charging infrastructures require smart strategies to optimize the charging stops during a long trip. These challenges have generated a new area of studies that were mainly directed to extend the classical Vehicle Routing Problem (VRP) to a fleet of commercial EVs. In this paper, we propose a different point of view, by considering the interaction of private EVs with the related infrastructure, focusing on a highway trip. We consider a highway where charging stations are scattered along the road, and are equipped withmultiple chargers. Using Fluid Stochastic Petri Nets (FSPN), the paper compares different decision policies when to stop and recharge the battery to maximize the probability of a car to reach its destination and minimize the trip completion time
Analysis of Fluid Queues Using Level Crossing Methods ID: 11563
This dissertation is concerned with the application of the level crossing method on fluid queues driven by a background process. The basic assumption of the fluid queue in this thesis is that during the busy period of the driving process, the fluid content fills at net rate r_1, and during the idle period of the driving process, the fluid content, if positive-valued, empties at a rate r_2. Moreover, nonempty fluid content, leaks continuously at a rate r_2. The fluid models considered are: the fluid queue driven by an M/G/1 queue in Chapter 2, the fluid queue driven by an M/G/1 queue with net input and leaking rate depending on fluid level, and type of arrivals in the driving M/G/1 queue, in chapter 3, and the fluid queue driven by an M/G/1 queue with upward fluid jumps in Chapter 4. In addition, a triangle diagram has been introduced in this thesis as a technique to visualize the proportion of time that the content of the fluid queue is increasing or decreasing during nonempty cycles. Finally, we provide several examples on how the probability density function of the fluid level is related to the probability density function of the waiting time of M/G/1 queues with different disciplines
Performance modelling with adaptive hidden Markov models and discriminatory processor sharing queues
In modern computer systems, workload varies at different times and locations. It is important to model the performance of such systems via workload models that are both representative and efficient. For example, model-generated workloads represent realistic system behaviour, especially during peak times, when it is crucial to predict and address performance bottlenecks. In this thesis, we model performance, namely throughput and delay, using adaptive models and discrete queues. Hidden Markov models (HMMs) parsimoniously capture the correlation and burstiness of workloads with spatiotemporal characteristics. By adapting the batch training of standard HMMs to incremental learning, online HMMs act as benchmarks on workloads obtained from live systems (i.e. storage systems and financial markets) and reduce time complexity of the Baum-Welch algorithm. Similarly, by extending HMM capabilities to train on multiple traces simultaneously it follows that workloads of different types are modelled in parallel by a multi-input HMM. Typically, the HMM-generated traces verify the throughput and burstiness of the real data. Applications of adaptive HMMs include predicting user behaviour in social networks and performance-energy measurements in smartphone applications. Equally important is measuring system delay through response times. For example, workloads such as Internet traffic arriving at routers are affected by queueing delays. To meet quality of service needs, queueing delays must be minimised and, hence, it is important to model and predict such queueing delays in an efficient and cost-effective manner. Therefore, we propose a class of discrete, processor-sharing queues for approximating queueing delay as response time distributions, which represent service level agreements at specific spatiotemporal levels. We adapt discrete queues to model job arrivals with distributions given by a Markov-modulated Poisson process (MMPP) and served under discriminatory processor-sharing scheduling. Further, we propose a dynamic strategy of service allocation to minimise delays in UDP traffic flows whilst maximising a utility function.Open Acces
- …