Dominating set based bluetooth scatternet formation with localized maintenance
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
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each node is assumed to know its position and position of all its neighbours. The proposed formation algorithms have three phases. In the first phase the unit graph is constructed (each node establishes connection with all its neighbors that are located within its transmission radius, which is equal for all nodes), and, if planar structure is desirable, localized sparse subgraph (such as relative neighbourhood or Gabriel graph) is extracted. In the second phase, the degree of each node is limited to 7 by applying Yao subgraph construct simultaneously on all nodes with excessive degree, followed by either elimination of directed edges or the application of reverse Yao construct. In the last phase, master-slave relations are created by applying higher degree priority (with dominating set membership as the primary key). The creation and maintenance requires minimal overhead in addition to maintaining accurate location information for one-hop neighbours. The proposed schemes have localized maintenance property (scatternet maintenance due to movement or activity change of a single node is limited to the locality of that node), which is not the case with the existing clustering based Bluetooth scatternet formation schemes.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 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