Abstract

In this paper, we propose low-complexity algorithms for downlink traffic scheduling in green vehicular roadside infrastructure. In multiple roadside unit (RSU) deployments, the energy provisioning of the RSUs may differ, and it is therefore desirable to balance RSU usage from a normalized min-max energy viewpoint. This paper considers both splittable RSU assignment (SRA) and unsplittable RSU asssignment (URA) scheduling. An offline integer linear programming bound is first derived for normalized min-max RSU energy usage. We then show that in the SRA case, there is a polynomial complexity 2-approximation bound for the normalized min-max energy schedule. This paper then proposes several online scheduling algorithms. The first is a greedy online algorithm that makes simple RSU selections, followed by minimum-energy time slot assignments. A normalized min-max algorithm is then proposed [2-approximation online algorithm (TOAA)], which is an online version of the 2-approximation bound. Two algorithms are then introduced based on a potential function scheduling approach. The 1-objective algorithm uses an objective based on normalized min-max energy, and we show that it has an upper bounded worst-case competitive ratio performance. The 2-objective algorithm uses the same approach but incorporates a total-energy secondary objective as well. Results from a variety of experiments show that the proposed scheduling algorithms perform well. In particular, we find that in the SRA case, the TOAA algorithm performs very close to the lower bound but at the expense of having to reassign time slots whenever a new vehicle arrives. In the URA case, our low-complexity 1-objective algorithm performs better than the others over a wide range of traffic conditions.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call