52,017 research outputs found
Reinforcement Learning Scheduler for Vehicle-to-Vehicle Communications Outside Coverage
Radio resources in vehicle-to-vehicle (V2V) communication can be scheduled
either by a centralized scheduler residing in the network (e.g., a base station
in case of cellular systems) or a distributed scheduler, where the resources
are autonomously selected by the vehicles. The former approach yields a
considerably higher resource utilization in case the network coverage is
uninterrupted. However, in case of intermittent or out-of-coverage, due to not
having input from centralized scheduler, vehicles need to revert to distributed
scheduling. Motivated by recent advances in reinforcement learning (RL), we
investigate whether a centralized learning scheduler can be taught to
efficiently pre-assign the resources to vehicles for out-of-coverage V2V
communication. Specifically, we use the actor-critic RL algorithm to train the
centralized scheduler to provide non-interfering resources to vehicles before
they enter the out-of-coverage area. Our initial results show that a RL-based
scheduler can achieve performance as good as or better than the state-of-art
distributed scheduler, often outperforming it. Furthermore, the learning
process completes within a reasonable time (ranging from a few hundred to a few
thousand epochs), thus making the RL-based scheduler a promising solution for
V2V communications with intermittent network coverage.Comment: Article published in IEEE VNC 201
Recommended from our members
GA/SA-based hybrid techniques for the scheduling of generator maintenance in power systems
YesProposes the application of a genetic algorithm (GA) and simulated annealing (SA) based hybrid approach for the scheduling of generator maintenance in power systems using an integer representation. The adapted approach uses the probabilistic acceptance criterion of simulated annealing within the genetic algorithm framework. A case study is formulated in this paper as an integer programming problem using a reliability-based objective function and typical problem constraints. The implementation and performance of the solution technique are discussed. The results in this paper demonstrate that the technique is more effective than approaches based solely on genetic algorithms or solely on simulated annealing. It therefore proves to be a valid approach for the solution of generator maintenance scheduling problem
Approximation Algorithms for Energy Minimization in Cloud Service Allocation under Reliability Constraints
We consider allocation problems that arise in the context of service
allocation in Clouds. More specifically, we assume on the one part that each
computing resource is associated to a capacity constraint, that can be chosen
using Dynamic Voltage and Frequency Scaling (DVFS) method, and to a probability
of failure. On the other hand, we assume that the service runs as a set of
independent instances of identical Virtual Machines. Moreover, there exists a
Service Level Agreement (SLA) between the Cloud provider and the client that
can be expressed as follows: the client comes with a minimal number of service
instances which must be alive at the end of the day, and the Cloud provider
offers a list of pairs (price,compensation), this compensation being paid by
the Cloud provider if it fails to keep alive the required number of services.
On the Cloud provider side, each pair corresponds actually to a guaranteed
success probability of fulfilling the constraint on the minimal number of
instances. In this context, given a minimal number of instances and a
probability of success, the question for the Cloud provider is to find the
number of necessary resources, their clock frequency and an allocation of the
instances (possibly using replication) onto machines. This solution should
satisfy all types of constraints during a given time period while minimizing
the energy consumption of used resources. We consider two energy consumption
models based on DVFS techniques, where the clock frequency of physical
resources can be changed. For each allocation problem and each energy model, we
prove deterministic approximation ratios on the consumed energy for algorithms
that provide guaranteed probability failures, as well as an efficient
heuristic, whose energy ratio is not guaranteed
- …