Understanding the key performance issues with MAC protocols for multi‐hop wireless 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
Abstract Multi‐hop wireless networks arise in the context of ad hoc networks, sensor networks, and mesh networks, and their performance depends critically on the underlying medium access control (MAC) protocol. Inspite of the large body of work devoted to MAC protocols and associated problems, the relative importance of these problems is still not well understood. This is because most of the previous work focuses on designing a protocol to solve a particular problem, or on identifying scenarios where a protocol will not work well. In addition, most of the work is also based on simplistic assumptions about the physical wireless medium, like fixed ranges for communication and interference, or concepts like capture threshold where the desired signal strength is compared with interference from a single node at a time, rather than cumulatively. Our paper seeks to address these issues. We believe it is extremely critical that (i) we develop an understanding of the relative significance of the problems affecting MAC protocols, and that (ii) we use a realistic model for the physical channel for design and performance evaluation. Towards this end, we evaluate the performance of three currently proposed MAC protocols, IEEE 802.11 [1], RI‐BTMA [2], and DUCHA [3] under a realistic channel model with additive interference. Since these protocols solve or suffer from different sets of problems, our evaluation provides a differential diagnosis of the severity of these problems. Based on our observations, we propose a simple and robust two channel MAC protocol (entitled 2CM) that is based on IEEE 802.11 augmented with a busy‐tone channel. The 2CM protocol (i) mitigates the hidden node problem considerably, (ii) does not waste bandwidth in terms of logical control channels, and (iii) provides a reliable link layer acknowledgment. Through extensive simulations, we show that 2CM offers a consistently high throughput performance while not sacrificing link layer reliability in a variety of scenarios, thereby vindicating our approach. Copyright © 2006 John Wiley & Sons, Ltd.
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.002 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.002 | 0.001 |
| 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