DOWNLINK TRAFFIC SCHEDULING IN GREEN VEHICULAR ROADSIDE INFRASTRUCTURE

ABSTRACT

Scheduling for energy-efficient roadside infrastructure is our main problem. Vehicle locations can be predicted with a high degree of accuracy, and this information can be used to reduce downlink infrastructure-to-vehicle energy communication costs. Offline scheduling results are first presented that provide lower bounds on the energy needed to satisfy arriving vehicular communication requirements. We show that the packet-based scheduling case can be formulated as a generalization of the classical single-machine job scheduling problem with a tardiness penalty, which is referred to as aEarlinessTardiness. The remainder of the paper then focuses on timeslot-based scheduling. We formulate this problem as a Mixed-Integer Linear Program (MILP) that is shown to be solvable in polynomial time using a proposed minimum cost flow graph construction. Three energy-efficient online traffic scheduling algorithms are then introduced for common vehicular scenarios where vehicle position is strongly deterministic.

EXISTING SYSTEM
In traditional wireless networks, vehicles are often moving very quickly and may only remain in a roadside unit (RSU) radio coverage area for a relatively short period of time. Multiple vehicles may be present in the RSU coverage area, the question arises as to the order with which vehicles should be served. Even under a simple distance-dependent exponential radio path loss assumption, the problem is NP-complete.

DRAWBACKS OF EXISTING SYSTEM

In many highway locations, deploying roadside infrastructure is difficult due to the unavailability or prohibitive expense of wired electrical power. In a vehicular infrastructure, there is no proper traffic scheduling. Proper Traffic Scheduling can lead to significant improvements in energy efficiency due to the strong dependence of power consumption on RSU-to-vehicle distance.

PROPOSED SYSTEM
The location of vehicles passing through the RSU radio coverage area can be predicted with a high degree of accuracy. Vehicle Location information can then be used to reduce downlink infrastructure-to-vehicle energy communication costs. Presenting offline scheduling bounds that provide lower limits on the energy needed to satisfy vehicular communication requests. Both packet and timeslot-based scheduling are considered.

ALGORITHMS

For Offline Traffic Scheduling

Mixed-Integer Linear Program (MILP) solved in a particular time by modeling it as a minimum cost flow problem. Greedy Minimum Cost Flow (GMCF) local optimization using our minimum cost flow model. Static Scheduler (SS), assigns timeslots based on the vehicles location. Nearest Fastest Set (NFS) scheduler that uses vehicle location and velocity inputs to dynamically assign communication slots. Dynamic Multilevel Priority (DMP) scheduler that uses the GMCF and priority of the data packets to dynamically assign communication slots and assign priority queues for different data.

For Online Traffic Scheduling

VANET

RSU example. Vehicle I is shown at two different times t1 and t2 at distance di,t1 and di,t2 from the RSU, respectively.

VEHICULAR ad hoc networks (VANETs) define two modes of communication: Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I). In the latter case, a fixed infrastructure can be used to broadcast safety messages or can be used as a gateway to the Internet.