Electric vehicles (EVs) are being introduced by different manufacturers as an environment-friendly alternative to vehicles with internal combustion engines, with several benefits. The number of EVs is expected to grow rapidly in the coming years. However, uncoordinated charging of these vehicles can put a severe stress on the power grid. The problem of charge scheduling of EVs is an important and challenging problem and has seen significant research activity in the last few years. This review covers the recent works done in the area of scheduling algorithms for charging EVs in smart grid. The works are first classified into two broad classes of unidirectional versus bidirectional charging, and then, each class is further classified based on whether the scheduling is centralized or distributed and whether any mobility aspects are considered or not. It then reviews the key results in this field following the classification proposed. Some interesting research challenges that can be addressed are also identified.Index Terms-Charging, electric vehicle (EV), grid to vehicle (G2V), scheduling, vehicle to grid (V2G).

No abstract

In this work, we consider a vehicular environment in which vehicles moving along roads in a city are interested in different types of information or events generated at different parts of the city. We investigate the use of the publish-subscribe framework for such environments in which vehicles subscribe to a service provider for specific types of events through roadside units; the events are also reported to the service provider. The service provider delivers the events to the subscribed vehicles within the validity periods of both the subscriptions and the events through roadside units placed along the trajectory of a vehicle. We propose a problem called the Minimum Cost Event Placement Problem which addresses the issue of delivering all the events to all the subscribed vehicles within the validity periods while incurring minimum cost of utilization of the roadside units. We first prove that the problem is NP-complete. We then propose three heuristic algorithms to solve the problem. A lower bound on the cost of utilization of the roadside units for a given set of subscriptions and events is presented next. Detailed simulation results in different city traffic scenarios are presented to show that the costs achieved by two of the heuristics proposed are close to the lower bound proved.

No abstract

This paper presents a language independent runtime framework-called Weaves-for object based composition of unmodified code modules that enables selective sharing of state between multiple control flows through a process. Furthermore, the framework allows dynamic instantiation of code modules and control flows through them. In effect, weaves create intra-process modules (similar to objects in OOP) from code written in any language. Applications can be built by instantiating Weaves to form Tapestries of dynamically interacting code. The framework enables objects to be arbitrarily shared-it is a true superset of both processes as well as threads, with code sharing and fast context switching time similar to threads. Weaves does not require any special support from either the language or application code-practically any code can be weaved. Weaves also include support runtime loading and linking of object modules enabling the next generation of highly dynamic applications. This paper presents the elements of the Weaves framework and its implementation on the Linux platform over source-code independent ELF object files. The current implementation has been validated over Sweep3D, a benchmark for 3D discrete ordinates neutron transport (Koch et al. Trans. Am. Nucl. Soc. 65 (198) [1992]), and a user-level port of the Linux 2.4 family kernel TCP/IP protocol stack.