Improved channel access protocol for cooperative <i>ad hoc</i> networks
Bibliographic record
Abstract
Efficient utilisation of bandwidth and high data rates have a great impact on the performance of ad hoc wireless networks. The use of cooperative diversity, where neighbouring stations may act as relay nodes to transfer the source data to the desired destination node through an independent relay channel, has shown to provide diversity gain and consequently improve the achievable bit rate. However, this is usually attained at the expense of loosing some wireless resources such as bandwidth. On the other hand, the use of directional antennas has shown to offer an effective way for efficient bandwidth utilisation. Here, the authors propose a new channel access protocol for transmission over cooperative ad hoc networks. The proposed protocol, which aims at minimising the number of blocked nodes and consequently improving the system throughput, employs directional antennas at both the source and relay stations. The network performance under the proposed settings is modelled using continuous Markov chains. The steady-state transmission blocking probability and the average network throughput are obtained by analysing the derived Markov model. The analytical results, which are validated through simulations, show the improvement in performance compared to the carrier sense multiple access with collision avoidance protocol that employs omnidirectional antennas.
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 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.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.008 | 0.003 |
| Research integrity | 0.000 | 0.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".