TPSF+: a new two-phase scatternet formation algorithm for bluetooth ad hoc networks
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
A Bluetooth scatternet can be formed by interconnecting two or more piconets together. To reduce the traffic load of master and bridge nodes, a two-phase scatternet formation (TPSF) algorithm was proposed (Kawamoto, Y. et al., Proc. IEEE WCNC '03, 2003). A control scatternet is created for the transmission of control packets. For each source and destination pair, an on-demand scatternet is created for the transmission of data packets. The original TPSF does not consider the support of node mobility. We propose TPSF+, which is an extension of the on-demand scatternet formation in the original TPSF. In TPSF+, route information is discovered when a communication session is required between the two nodes. Simulation results show that TPSF+ has a higher successful path connection ratio when compare with the original TPSF. The proposed TPSF+ also has a higher aggregate throughput and smaller end-to-end delay when compared with BTCP (Salonidis, T. et al., Proc. IEEE INFOCOM'01, 2001) and Bluenet (Wang, Z. et al., Proc. 35th Hawaii Int. Conf. on System Sciences - HICSS-35, 2002).
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.002 | 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