Efficient Blockchain-Enabled Large Scale Parked Vehicular Computing With Green Energy Supply
Bibliographic record
Abstract
While the vehicular network enables geographically distributed cooperative computation, its mature implementation has long been constrained due to the lack of an effective management platform. In this paper, employing the security and privacy attributes of blockchain, we propose a novel Blockchain-enabled Large-scale Parked Vehicular Computing (BLPVC) architecture to utilize the potential solar energy and vehicular computational resources in the outdoor parking lot. However, the uneven green power supply and random arrival time of electric vehicles compose the highly complex environment. Accordingly, in this paper, to handle the efficient utilization of the distributed resources by blockchain technology, we propose an integrated optimization framework which leverages the green energy utilization and service latency limit among the processes of block generation, task computing, and communication, whereas such a design leads to the mixed-timescale stochastic optimization problem. To this end, corresponding to the dynamic solar energy arrival, we propose a shaped deep deterministic policy gradient (DDPG) algorithm to accelerate the learning rate of computational frequency control in the short-term stage; while in the long-term stage, for the mixed-integer programming (MIP) of task offloading and blockchain parameters adjustment, a series of transformation is employed to preserve convexity. Finally, experiments are carried out on Python demonstrating that the proposed scheme achieves a balanced performance between service latency and distributed resources, while the battery depreciation cost is heavily reduced.
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.001 | 0.000 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| 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".