Third-party handshake protocol for efficient peer discovery in IEEE 802.15.3 WPANs
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
Designed for high data rate wireless personal area networks (WPANs), the IEEE 802.15.3 medium access control (MAC) protocol fits well with emerging technologies such as ultra-wideband (UWB). In an 802.15.3 piconet, all MAC frames are exchanged in a peer-to-peer manner between devices (DEVs) to allow efficient ad hoc operations while the piconet coordinator (PNC) only provides timing synchronization in the piconet; thus peer discovery is an essential function. If two peer DEVs in a piconet are out of transmission range, the standard peer discovery method will fail, and a costly upper layer routing procedure is required to complete the peer connection. In this paper, we propose a third-party handshake protocol (3PHP) at the 802.15.3 MAC layer to provide reliable and prompt peer discovery between out of range DEVs in a piconet via the PNC. It removes the overhead of unsuccessful peer discovery in the standard method, and completely eliminates costly upper layer routing between these DEVs by means of a simple and efficient MAC layer PNC forwarding. The performance of the proposed scheme is evaluated by a novel CSMA/CA delay analysis for the contention access period (CAP). Analytical and simulation results show that for uniformly distributed DEVs over the maximum coverage of a piconet, up to 41.3% of intra-piconet peer discovery procedures may fail if the standard method is used. The cost of unsuccessful MAC peer discovery and consequent routing is very high. The expected peer discovery time for 3PHP is 100 /spl mu/m lower than that of the standard method when the latter is successful in peer discovery, and up to 10 times faster than the standard method with network layer routing when the standard method is unsuccessful in connecting the peer DEVs. 3PHP also significantly reduces the peer discovery failure probability. Therefore, the proposed 3PHP scheme brings huge performance gain with minimum cost, and successfully resolves the potential connectivity issue in an IEEE 802.153 piconet.
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.001 | 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.000 |
| 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