{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00159574,0.0008159637,0.0009904966,0.0009355542,0.001720796,0.0007962131,0.001682505,0.0007436798,0.001244438],"category_scores_gemma":[0.002368843,0.000276671,0.0005545027,0.000774169,0.0009284888,0.001364431,0.001269435,0.000658096,0.0002909542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009887627,"about_ca_system_score_gemma":0.001273401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003658987,"about_ca_topic_score_gemma":0.004863419,"domain_scores_codex":[0.9992187,0.0001872645,0.0000389378,0.0001500349,0.0002365602,0.0001684353],"domain_scores_gemma":[0.9988906,0.0004082202,0.0001650711,0.0001291497,0.000294227,0.0001127692],"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.0005449234,0.0004174199,0.0020169,0.0001624064,0.0001092998,0.0004529657,0.0007197004,0.6678421,0.03618594,0.0432743,0.004569296,0.2437049],"study_design_scores_gemma":[0.00002963096,0.0002248109,0.0005382291,0.000008640241,0.00003549356,0.0001523134,0.00009811907,0.9793549,0.003968325,0.0140879,0.001468718,0.00003304428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0499144,0.0003502469,0.945873,0.0002032872,0.000128753,0.00008811409,0.00002764596,0.0003648788,0.003049654],"genre_scores_gemma":[0.9112577,0.0001594929,0.08628955,0.00009122209,0.00008293376,0.0000778509,0.00003447129,0.00002888769,0.001977959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003658987,"threshold_uncertainty_score":0.008439183,"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."}}