{'fraction_non_alphanumeric': 0.015384615384615385, 'fraction_numerical': 0.0, 'mean_word_length': 5.364130434782608, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Traffic Scheduling for Energy Sustainable Vehicular Infrastructure

Roadside infrastructure can be used provide a wide variety of commercial services in vehicular ad hoc networks. One particular challenge is that of providing roadside radio coverage in highway locations where wired electricity is not available. In this case, roadside access points (APs) powered by renewable energy such as solar power, is a viable alternative. The cost of provisioning this type of roadside infrastructure is dependent on the average power consumption of the AP, and can be reduced by energy efficient scheduling. In this paper, we consider the problem of satisfying vehicle communication requirements while minimizing the energy needed by the roadside access point. The problem is formulated as a Mixed Integer Linear Program (MILP) which provides an upper bound for the performance of any realizable scheduling algorithm. We then propose a Nearest Fastest Set (NFS) scheduler that uses vehicle location and velocity inputs to address the problem. Results from a variety of experiments show that the proposed scheduling algorithm performs well when compared to the performance bound.