Taking Advantage of Spare Battery Capacity in Cellular Networks to Provide Grid Frequency Regulation
Bibliographic record
Abstract
The increasing use of renewable energies places new challenges on the balance of the electricity system between demand and supply, due to the intermittent nature of renewable energy resources. However, through frequency regulation (FR) services, owners of battery storage systems can become an essential part of the future smart grids. We propose a thorough first study on the use of batteries associated with base stations (BSs) of a cellular network, to participate in ancillary services with respect to FR services, via an auction system. Trade-offs must be made among the number of participating BSs, the degradation of their batteries and the revenues generated by FR participation. We propose a large-scale mathematical programming model to identify the best participation periods from the perspective of a cellular network operator. The objective is to maximize profit while considering the aging of the batteries following their usage to stabilize the electrical grid. Experiments are conducted with data sets from different real data sources. They not only demonstrate the effectiveness of the optimization model in terms of the selection of BSs participating in ancillary services and providing extra revenues to cellular network operators, but also show the feasibility of ancillary services being provided to cellular network operators.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 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".