{"schema_version":"0.1","map_id":"paper-1-map","publication_id":1,"publication_anchor":"paper-1","slug":"paper-1","canonical_path":"/knowledge/papers/paper-1/","machine_path":"/knowledge/papers/paper-1.json","root_node_id":"paper-1","stage":"mapped_draft","contribution_type_vocabulary_version":"0.1","contribution_types":["algorithm"],"title":"Sub-Carrier Allocation Using Channel Prediction for OFDMA Systems Based on IEEE 802.16 Standard","year":2006,"venue":"International Conference on Computer Engineering and Systems (ICCES)","topic":"algorithms-foundations","labels":["Theory","Applied"],"authors":["Karim Eldefrawy","Mohamed M. Khairy","Amin Nassar"],"keywords":["OFDMA","channel prediction","resource allocation"],"research_question":"In a fixed IEEE 802.16 OFDMA downlink, can a scheduler use predicted per-user channel states over several future frames to satisfy more users' rate requirements and distribute subcarriers more fairly than repeated one-frame allocation?","central_answer":"The paper expands allocation from N subcarriers in one frame to an L-by-N time-frequency horizon, feeds Wiener-filter channel predictions into an existing constrained allocator, and reports that ten-frame scheduling improves the rate-satisfaction/fairness tradeoff in the evaluated SUI-5 simulations.","curation":{"drafted_at":"2026-07-11","drafted_by":[{"actor_type":"ai","name":"OpenAI Codex","role":"source extraction, evidence linking, and initial assessment"}],"method":"Source-grounded audit of the full text indexed from the public author-uploaded copy and the official DOI record. The indexed body was reviewed through the conclusion, but the binary PDF could not be retrieved in this run; page fixity and visual pagination therefore remain unavailable.","source_scope":"full_source_audit","approval":{"status":"pending","note":"AI-drafted, source-linked map awaiting author verification before approval."}},"sources":[{"id":"source-paper-1-full-text","type":"author_hosted_copy","title":"Sub-Carrier Allocation Using Channel Prediction for OFDMA Systems Based on IEEE 802.16 Standard","url":"https://www.researchgate.net/publication/251829226_SubCarrier_Allocation_using_Channel_Prediction_for_OFDMA_systems_based_on_IEEE_80216_Standard","provenance_category":"author","version_note":"Public full text uploaded by Karim Eldefrawy; binary-file fixity was not obtainable in this audit."},{"id":"source-paper-1-official","type":"official_publication_record","title":"IEEE DOI record","url":"https://doi.org/10.1109/ICCES.2006.320475"},{"id":"source-paper-1-citations","type":"citation_search","title":"Dated scholarly-web citation search","url":"https://scholar.google.com/scholar?q=%22Sub-Carrier+Allocation+Using+Channel+Prediction+for+OFDMA+Systems%22","version_note":"Search attempted 2026-07-11; no transparent citation count was retrievable in this environment."}],"source_anchors":[{"id":"anchor-paper-1-problem","source_id":"source-paper-1-full-text","label":"Problem, multi-frame idea, and claimed contribution","locator":"Abstract and Section I","url":"https://www.researchgate.net/publication/251829226_SubCarrier_Allocation_using_Channel_Prediction_for_OFDMA_systems_based_on_IEEE_80216_Standard"},{"id":"anchor-paper-1-system-model","source_id":"source-paper-1-full-text","label":"OFDMA system model and rate constraints","locator":"Sections II-III and Equations 1-9","url":"https://www.researchgate.net/publication/251829226_SubCarrier_Allocation_using_Channel_Prediction_for_OFDMA_systems_based_on_IEEE_80216_Standard"},{"id":"anchor-paper-1-allocation","source_id":"source-paper-1-full-text","label":"L-frame allocation and fairness modification","locator":"Section III","url":"https://www.researchgate.net/publication/251829226_SubCarrier_Allocation_using_Channel_Prediction_for_OFDMA_systems_based_on_IEEE_80216_Standard"},{"id":"anchor-paper-1-prediction","source_id":"source-paper-1-full-text","label":"Pilot-based Wiener channel prediction","locator":"Section IV and Equation 10","url":"https://www.researchgate.net/publication/251829226_SubCarrier_Allocation_using_Channel_Prediction_for_OFDMA_systems_based_on_IEEE_80216_Standard"},{"id":"anchor-paper-1-simulation","source_id":"source-paper-1-full-text","label":"Simulation model, parameters, and four comparison cases","locator":"Section V","url":"https://www.researchgate.net/publication/251829226_SubCarrier_Allocation_using_Channel_Prediction_for_OFDMA_systems_based_on_IEEE_80216_Standard"},{"id":"anchor-paper-1-results","source_id":"source-paper-1-full-text","label":"Rate-satisfaction and allocation-fairness results","locator":"Section V, Figures 2-3","url":"https://www.researchgate.net/publication/251829226_SubCarrier_Allocation_using_Channel_Prediction_for_OFDMA_systems_based_on_IEEE_80216_Standard"},{"id":"anchor-paper-1-conclusion","source_id":"source-paper-1-full-text","label":"Conclusions and stated scope","locator":"Section VI","url":"https://www.researchgate.net/publication/251829226_SubCarrier_Allocation_using_Channel_Prediction_for_OFDMA_systems_based_on_IEEE_80216_Standard"},{"id":"anchor-paper-1-publication","source_id":"source-paper-1-official","label":"Official publication metadata","locator":"DOI 10.1109/ICCES.2006.320475","url":"https://doi.org/10.1109/ICCES.2006.320475"},{"id":"anchor-paper-1-citation-search","source_id":"source-paper-1-citations","label":"Citation search attempted","locator":"Exact-title search, 2026-07-11; no verified count retrieved","url":"https://scholar.google.com/scholar?q=%22Sub-Carrier+Allocation+Using+Channel+Prediction+for+OFDMA+Systems%22"}],"nodes":[{"id":"paper-1","kind":"paper","parent_id":null,"order":1,"epistemic_status":"published","title":"Predictive multi-frame OFDMA allocation","summary":"An OFDMA scheduling algorithm that uses future channel predictions to allocate subcarriers jointly across several frames, evaluated in an IEEE 802.16 fixed-wireless simulation.","source_anchor_ids":["anchor-paper-1-problem","anchor-paper-1-publication"]},{"id":"paper-1-question","kind":"question","parent_id":"paper-1","order":1,"epistemic_status":"research_question","title":"Research question","summary":"Does looking L frames ahead expose time-frequency opportunities that repeated one-frame allocation misses, while still meeting per-user rate constraints?","source_anchor_ids":["anchor-paper-1-problem"]},{"id":"paper-1-answer","kind":"contribution","parent_id":"paper-1","order":2,"epistemic_status":"source_asserted","title":"Central answer","summary":"Treat predicted subcarrier states over L frames as an enlarged L-by-N allocation domain, then schedule against that horizon rather than committing one frame at a time.","source_anchor_ids":["anchor-paper-1-allocation","anchor-paper-1-conclusion"]},{"id":"paper-1-scope","kind":"scope","parent_id":"paper-1","order":3,"epistemic_status":"explicitly_scoped","title":"System model and assumptions","summary":"The evaluated setting is a fixed IEEE 802.16 downlink with K users, N orthogonal subcarriers, minimum average rates, adaptive QAM, pilot observations, and channels slow enough to predict multiple frames ahead.","source_anchor_ids":["anchor-paper-1-system-model","anchor-paper-1-prediction"]},{"id":"paper-1-scope-allocation","kind":"definition","parent_id":"paper-1-scope","order":1,"epistemic_status":"defined","title":"Allocation variables and constraints","summary":"Binary assignment variables allocate each subcarrier in each scheduled frame to at most one user; the objective maximizes assigned bits while aggregate L-frame rates must meet each user's requirement.","source_anchor_ids":["anchor-paper-1-system-model"]},{"id":"paper-1-scope-independence","kind":"assumption","parent_id":"paper-1-scope","order":2,"epistemic_status":"assumed","title":"Time-frequency independence simplification","summary":"The formulation treats user/subcarrier states across frames as independent so the L-frame problem can be viewed as increasing the number of allocable subcarriers from N to L times N; the paper notes that correlation could instead be used to reduce complexity.","source_anchor_ids":["anchor-paper-1-system-model"]},{"id":"paper-1-method","kind":"method","parent_id":"paper-1","order":4,"epistemic_status":"algorithmically_specified","title":"Prediction-and-allocation pipeline","summary":"Pilot-derived channel estimates feed per-subcarrier Wiener predictors; predicted states then drive the constrained multi-frame allocator.","source_anchor_ids":["anchor-paper-1-allocation","anchor-paper-1-prediction"]},{"id":"paper-1-method-prediction","kind":"component","parent_id":"paper-1-method","order":1,"epistemic_status":"specified","title":"Channel predictor","summary":"A frequency-domain one-dimensional Wiener filter predicts future channel responses from p prior noisy pilot estimates; prediction may run at the base station or be distributed to subscriber stations.","source_anchor_ids":["anchor-paper-1-prediction"]},{"id":"paper-1-method-allocation","kind":"component","parent_id":"paper-1-method","order":2,"epistemic_status":"heuristic","title":"Constrained allocation","summary":"The instantiated allocator starts from an unconstrained throughput-maximizing assignment and adjusts allocations until user rate constraints are met; a comparison variant modifies the allocation to account for fairness.","source_anchor_ids":["anchor-paper-1-allocation"]},{"id":"paper-1-claims","kind":"claim_group","parent_id":"paper-1","order":5,"epistemic_status":"experimentally_evaluated","title":"Principal claims","summary":"The paper's main support is simulation evidence, not an optimality theorem or a deployed implementation.","source_anchor_ids":["anchor-paper-1-results"]},{"id":"paper-1-claim-rate","kind":"claim","parent_id":"paper-1-claims","order":1,"epistemic_status":"experimentally_supported","title":"More users meet target rates","summary":"In the reported 32-subcarrier experiments, ten-frame predictive allocation satisfies more users than repeated single-frame allocation, including when users outnumber subcarriers.","source_anchor_ids":["anchor-paper-1-results"]},{"id":"paper-1-claim-fairness","kind":"claim","parent_id":"paper-1-claims","order":2,"epistemic_status":"experimentally_supported","title":"Improved rate distribution","summary":"For the illustrated 8-subcarrier, 32-user case, single-frame allocation over-serves early users while under-serving others; the multi-frame scheme is reported to achieve a better balance between meeting targets and distributing rate.","source_anchor_ids":["anchor-paper-1-results"]},{"id":"paper-1-evidence","kind":"evidence_group","parent_id":"paper-1","order":6,"epistemic_status":"simulation_only","title":"Evidence","summary":"Four simulated variants compare one-frame and ten-frame horizons, each with the base allocator or fairness modification.","source_anchor_ids":["anchor-paper-1-simulation","anchor-paper-1-results"]},{"id":"paper-1-evidence-setup","kind":"evidence","parent_id":"paper-1-evidence","order":1,"epistemic_status":"documented","title":"Simulation configuration","summary":"The reported setup uses the SUI-5 fixed-wireless channel, ten predicted frames, a 50-tap predictor, QPSK/16-QAM/64-QAM, 20 dB average SNR, BER 10^-6, and equal user targets set to 80% of an idealized maximum-rate share.","source_anchor_ids":["anchor-paper-1-simulation"]},{"id":"paper-1-boundaries","kind":"limitation_group","parent_id":"paper-1","order":7,"epistemic_status":"material","title":"Boundaries and limitations","summary":"The results are conditional on predictable fixed-wireless channels and the chosen simulated allocator and traffic assumptions.","source_anchor_ids":["anchor-paper-1-prediction","anchor-paper-1-simulation"]},{"id":"paper-1-boundary-prediction","kind":"limitation","parent_id":"paper-1-boundaries","order":1,"epistemic_status":"explicitly_limited","title":"Prediction horizon","summary":"L is bounded by frame duration, Doppler behavior, and filter accuracy; prediction error or faster mobility can erase the look-ahead advantage.","source_anchor_ids":["anchor-paper-1-prediction"]},{"id":"paper-1-boundary-validation","kind":"limitation","parent_id":"paper-1-boundaries","order":2,"epistemic_status":"not_evaluated","title":"No deployment or robustness study","summary":"The paper reports simulation rather than a hardware or network implementation and does not establish robustness across other channel models, predictors, schedulers, workloads, or prediction-error regimes.","source_anchor_ids":["anchor-paper-1-simulation","anchor-paper-1-conclusion"]},{"id":"paper-1-artifacts","kind":"artifact","parent_id":"paper-1","order":8,"epistemic_status":"paper_available_no_reproduction_package","title":"Artifacts","summary":"A public author-uploaded paper and official DOI record are linked; no code, simulator configuration, raw data, or reproduction package was located in this audit.","source_anchor_ids":["anchor-paper-1-publication","anchor-paper-1-problem"]},{"id":"paper-1-scrutiny","kind":"scrutiny","parent_id":"paper-1","order":9,"epistemic_status":"peer_reviewed","title":"Scrutiny and lineage","summary":"The work appeared at ICCES 2006 and adapts an existing subcarrier allocator by adding a predicted time horizon; no independent reproduction, correction, or adversarial follow-up was located in this audit.","source_anchor_ids":["anchor-paper-1-publication","anchor-paper-1-allocation"]}],"relations":[{"id":"paper-1-relation-prediction-supports-answer","type":"supports","from_id":"paper-1-method-prediction","to_id":"paper-1-answer"},{"id":"paper-1-relation-allocation-realizes-answer","type":"realizes","from_id":"paper-1-method-allocation","to_id":"paper-1-answer"},{"id":"paper-1-relation-simulation-supports-rate","type":"supports","from_id":"paper-1-evidence-setup","to_id":"paper-1-claim-rate"},{"id":"paper-1-relation-simulation-supports-fairness","type":"supports","from_id":"paper-1-evidence-setup","to_id":"paper-1-claim-fairness"},{"id":"paper-1-relation-independence-qualifies-answer","type":"qualifies","from_id":"paper-1-scope-independence","to_id":"paper-1-answer"},{"id":"paper-1-relation-prediction-limits-claims","type":"qualifies","from_id":"paper-1-boundary-prediction","to_id":"paper-1-claims"},{"id":"paper-1-relation-validation-limits-claims","type":"qualifies","from_id":"paper-1-boundary-validation","to_id":"paper-1-claims"}],"assessment":{"id":"paper-1-assessment-2026-07-11","rubric_version":"0.2","assessed_at":"2026-07-11","status":"ai_draft_author_review_pending","note":"These dimensions describe documented support and process, not truth, correctness, or a universal ranking. No composite score is calculated.","axes":[{"id":"epistemic_evidence","level":"medium","rationale":"The paper specifies a model and reports comparative simulations with concrete parameters, but provides neither a proof of optimality nor deployment, robustness, or independent reproduction evidence.","basis_source_anchor_ids":["anchor-paper-1-system-model","anchor-paper-1-simulation","anchor-paper-1-results"]},{"id":"auditability","level":"high","rationale":"A public author-uploaded full-text route exposes the method and evidence, so auditability is high under this site's rubric; the binary file, local fixity, and reproduction materials were not obtained.","basis_source_anchor_ids":["anchor-paper-1-problem","anchor-paper-1-publication"]},{"id":"production_provenance","level":"medium","rationale":"Named authorship and official publication metadata are documented, but contributor roles, revision history, effort history, tool use, and artifact lineage are not.","basis_source_anchor_ids":["anchor-paper-1-publication"]},{"id":"external_scrutiny","level":"medium","rationale":"The work has an official conference publication record; review reports, independent reproduction, and post-publication technical scrutiny were not located.","basis_source_anchor_ids":["anchor-paper-1-publication"]},{"id":"reception","level":"low","rationale":"A dated exact-title scholarly-web search did not yield a transparent verified citation count in this environment. Under the author's rule, zero located citations maps to low; this is not a claim that the paper has no citations.","basis_source_anchor_ids":["anchor-paper-1-citation-search"]},{"id":"contribution_significance","level":"medium","rationale":"The paper contributes a concrete predictive scheduling formulation and comparative evidence, but broader impact and generality are limited by the single simulated fixed-wireless setting.","basis_source_anchor_ids":["anchor-paper-1-problem","anchor-paper-1-results","anchor-paper-1-conclusion"]}]},"reception_snapshot":{"as_of":"2026-07-11","method":"Exact-title scholarly-web search; transparent index count unavailable","source":"Google Scholar query route plus general scholarly-web search","citation_count":0,"signals":[],"limitation":"Zero means no citations were verifiably located during this constrained search, not a total bibliometric count; author should replace it with a confirmed Google Scholar or other index snapshot."}}