Offline and Online Scheduling Algorithms for Energy Harvesting RSUs in VANETs
Bibliographic record
Abstract
Using renewable energy to power roadside units (RSUs) in vehicular ad hoc networks is a desirable green alternative to the conventional electric grid, since it lowers both the carbon footprint and the cost of deployment. This paper investigates the problem of scheduling the downlink communication from renewable energy-powered RSUs toward vehicles, with the objective of maximizing the number of served vehicles. First, an offline setting is considered where the RSUs are assumed to have advance knowledge of the incoming communication requests from vehicles and of the amount of energy to be harvested. The problem is formulated as an integer linear programming model that is shown to be NP-hard and two near-optimal solutions are proposed. The first one is a greedy heuristic that prioritizes communications based on their energy cost and the second is the particle swarm optimization metaheuristic. Then, the problem is considered in an online setting and two different solution approaches are investigated. The first one assumes distributed scheduling control between RSUs and two algorithms are proposed, one based on a stochastic model and the other on simple threshold-based selection of communication requests. The second approach assumes centralized scheduling and two algorithms are also investigated. The first one uses a greedy approach and the second one uses threshold-based selection again. Simulations compare the proposed schedulers and show their efficiency in terms of the number of vehicles served and the service delay. It is concluded that employing energy harvesting RSUs is a viable green alternative to grid-powered ones.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".