{"id":"W2023401057","doi":"10.1109/glocom.2012.6503270","title":"Fair channel allocation and access design for cognitive ad hoc networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Cognitive radio; Throughput; Channel (broadcasting); Channel allocation schemes; Node (physics); Vehicular ad hoc network; Channel access method; Protocol (science); Distributed computing; Wireless; 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.0003949482,0.0001311373,0.0001345457,0.0000597883,0.0001875672,0.0002522299,0.0001853672,0.0000604091,0.000004454523],"category_scores_gemma":[0.00003984787,0.000116418,0.00003636797,0.0002132594,0.00003609172,0.001082017,0.0001309168,0.00007432121,0.000003211003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000207304,"about_ca_system_score_gemma":0.00001827331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003593281,"about_ca_topic_score_gemma":0.00001259034,"domain_scores_codex":[0.9990308,0.00005946284,0.0001287536,0.0002707516,0.00009393002,0.000416331],"domain_scores_gemma":[0.9990618,0.0005019433,0.00005861884,0.0001203173,0.0001218193,0.0001355603],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007953768,0.0001065442,0.0004170661,0.00001493933,0.00007138113,0.000002456778,0.00116643,0.001052743,0.00005128527,0.0202515,0.002153552,0.9746326],"study_design_scores_gemma":[0.0005555993,0.0001244009,0.006491249,0.00004313189,0.00002239041,0.00002401581,0.00008684612,0.9886042,0.0007999913,0.002455324,0.000526936,0.0002659262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003583338,0.002365907,0.9918973,0.0005226554,0.0003246209,0.0004758087,7.688804e-7,0.0001131227,0.000716437],"genre_scores_gemma":[0.9790424,0.0003339269,0.01940753,0.0007389926,0.0003179699,0.00003141763,0.000004961002,0.00001117109,0.0001116477],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9875515,"threshold_uncertainty_score":0.4747388,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04848199103386,"score_gpt":0.2864595776188174,"score_spread":0.2379775865849574,"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."}}