Coalition Formation for Bearings-Only Localization in Sensor Networks—A Cooperative Game Approach
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, formation of optimal coalitions of nodes is investigated for data acquisition in bearings-only target localization such that the average sleep time allocated to the nodes is maximized. Targets are required to be localized with a prespecified accuracy where the localization accuracy metric is defined to be the determinant of the Bayesian Fisher information matrix (B-FIM). We utilize cooperative game theory as a tool to devise a distributed dynamic coalition formation algorithm in which nodes autonomously decide which coalition to join while maximizing their feasible sleep times. Nodes in the sleep mode do not record any measurements, hence, save energy in both sensing and transmitting the sensed data. It is proved that if each node operates according to this algorithm, the average sleep time for the entire network converges to its maximum feasible value. In numerical examples, we illustrate the tradeoff between localization accuracy and the average sleep time allocated to the nodes and demonstrate the superior performance of the proposed scheme via Monte Carlo simulations.
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.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 it