{"id":"W2990840963","doi":"10.1109/pimrc.2019.8904310","title":"A Throughput Fairness-based Grouping Strategy for Dense IEEE 802.11ah Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Throughput; Maximum throughput scheduling; Computer network; Optimization problem; Integer programming; Reduction (mathematics); Ant colony optimization algorithms; Distributed computing; Wireless; Algorithm; Quality of service; Dynamic priority scheduling; Telecommunications","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004173542,0.0002316382,0.0002911561,0.00005258711,0.0001435345,0.0004035842,0.0008938254,0.0001586672,0.00007285075],"category_scores_gemma":[0.000005688307,0.0001938877,0.0001584596,0.0003431134,0.00002821384,0.000514512,0.00009469013,0.0001708606,0.0000744206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003688833,"about_ca_system_score_gemma":0.0001144936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004283662,"about_ca_topic_score_gemma":0.00003814072,"domain_scores_codex":[0.9982167,0.00006359856,0.0003073378,0.0005909985,0.0002191021,0.0006022368],"domain_scores_gemma":[0.9985668,0.0003277631,0.0001201389,0.0007570325,0.000111813,0.0001164221],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000095936,0.0001257903,0.001392932,0.00013629,0.00004315028,0.00001366099,0.00009934182,0.707104,0.0002301192,0.2014942,0.01103919,0.07822535],"study_design_scores_gemma":[0.001036958,0.0003118033,0.0003324493,0.00007000429,0.000004450446,0.000004165532,0.00001200616,0.9878548,0.0005713378,0.003581795,0.005897258,0.000322965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003205476,0.00005864164,0.9865121,0.0003456092,0.0006272991,0.006245509,0.000001364202,0.0002980768,0.002705944],"genre_scores_gemma":[0.9568599,0.000003453117,0.03775619,0.001520449,0.0004098708,0.002473452,0.000005936765,0.00002810013,0.0009426044],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9536545,"threshold_uncertainty_score":0.7906509,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03222777699116709,"score_gpt":0.2885881894272213,"score_spread":0.2563604124360542,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}