Blockchain-Based Secure and Cooperative Private Charging Pile Sharing Services for Vehicular Networks
Bibliographic record
Abstract
With the proliferation of electric vehicles (EVs), private charging pile (PCP) sharing networks are likely to be an integral part of future smart cities, especially in places with limited public charging infrastructure. However, there are a number of operational challenges associated with the deployment of PCPs in such a shared and untrusted environment. For example, how do we formulate efficient PCP sharing strategies in PCP sharing networks, while also taking into consideration the dynamic charging behaviors of EVs? Therefore, in this paper, we propose an energyblockchain-based secure PCP sharing scheme (BBC) for PCP sharing networks. First, an energy blockchain-based framework is designed for PCP sharing networks to facilitate energy sharing services for EVs and PCPs, using both distributed ledgers and cryptocurrency. Then, we devise a reputation-based secure PCP sharing algorithm to improve consensus efficiency with smaller signature sizes. In addition, a distributed reputation mechanism is constructed to assess the trustworthiness of consensus nodes in blockchain, based on ratings, behaviors, and fading. We also model the interactions among EVs and cooperative PCPs as a joint coalition-matching game, and obtain the optimal strategies of PCPs and EVs by analyzing the Nash-stable coalitional structure and stable many-to-one matching pairs. Extensive simulations and the real-world implementation demonstrate that the proposed approach improves the utility of EV users and renewable energy efficiency in PCP sharing networks.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
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 source (direct Gemma or distilled Codex), 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".