Transmission Optimization and Resource Allocation for Wireless Powered Dense Vehicle Area Network With Energy Recycling
Bibliographic record
Abstract
The wireless-powered communication paradigm brings self-sustainability to the on-vehicle sensors by harvesting the energy from radiated radio frequency (RF) signals. This paper proposes a novel transmission and resource allocation strategy for the scenario where multiple wireless powered vehicle area networks (VAN) co-existed with high density. The considered multi-VAN system consists of a remote master access point (MAP), multiple on-vehicle hybrid access points (HAPs) and sensors. Unlike previous works, we consider that the sensors can recycle the radiated radio frequency energy from all the HAPs when HAPs communicate with MAP, so the dedicated signals for energy harvesting (EH) are unnecessary. The proposed strategy can achieve simultaneous wireless information and power transfer (SWIPT) without complex receiver architecture requirements. The extra EH and interference caused by the dense distribution of VANs, which are rarely explored, are fully considered. To maximize the sum throughput of all the sensors while guaranteeing the transmission from HAPs to the MAP, we jointly optimize the time allocation, system energy consumption, power allocation, and receive beamforming. Due to the non-convexity of the formulated problem, we address the sub-problems separately through the Rayleigh quotient, Frobenius norm minimization and convex optimization. Then an efficient iterative algorithm to obtain sub-optimal solutions. The simulation results and discussions illustrate the proposed scheme's effectiveness and advantages.
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.001 |
| 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.001 | 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".