Performance of resource allocation schemes in adaptively modulated TDMA network
Bibliographic record
Abstract
In this paper we investigate performance of resource allocation schemes in WLANs of metropolitan area using HiperLAN type 2 standard. Inside the WLANs user moves from one place to another and user rates are dynamically adjusted based on its distance from the access point. To manage the wireless resources of the network we propose resource allocation schemes and evaluate their performance. We develop a generic simulation software for the network and use it for three resource allocation policies namely minimum overhead round robin (MORR), which does not depend on user's buffer condition, weighted minimum overhead round robin (WMORR) which is a function of user buffer as well as the waiting time for transmission opportunity and weighted round robin (WRR) which is a function of user buffer only. For performance comparison we evaluate average and variance of number of packets in the user buffer, user buffer overflow and overhead in the uplink phase. Our results show that the second adaptive resource allocation technique i.e., WMORR outperforms the other two.
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.000 | 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.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 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".