Transmission Optimization of Social and Physical Sensor Nodes via Collaborative Beamforming in Cyber-Physical-Social Systems
Bibliographic record
Abstract
The recently emerging cyber-physical-social system (CPSS) can enable efficient interactions between the social world and cyber-physical system (CPS). The wireless sensor network (WSN) with physical and social sensor nodes plays an important role in CPSS. The integration of the social sensors and physical sensors in CPSS provides an advantage for smart services in different application areas. However, the dynamics of social mobility for social sensors pose new challenges for implementing the coordination of transmission. Furthermore, the integration of social and physical sensors also faces the challenges in term of improving energy efficiency and increasing transmission range. To solve these problems, we integrate the model of social dynamics with collaborative beamforming (CB) technique to formulate the transmission optimization problem as a dynamic game. A novel transmission scheme based on reinforcement learning is proposed to solve the formulated problem. The corresponding implementation of the proposed transmission scheme in CPSS is presented by the design of message exchange processes. The extensive simulation results demonstrate that the proposed transmission scheme presents lower interference to noise ratio (INR) and better signal to noise ratio (SNR) performance in comparison with the existing schemes. The results also indicate that the proposed method has effective adaptation to the dynamic mobility of social sensor nodes in CPSS.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| 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".