{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003850064,0.0009608137,0.0008199364,0.0008703392,0.001004751,0.001995338,0.001788379,0.001302905,0.002280299],"category_scores_gemma":[0.01015414,0.0004866514,0.0005191237,0.0008684886,0.002040059,0.001902662,0.001128382,0.001111243,0.0003042572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002701665,"about_ca_system_score_gemma":0.002875698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004407168,"about_ca_topic_score_gemma":0.004173162,"domain_scores_codex":[0.9976816,0.0009496498,0.00006919152,0.0002705474,0.0006672712,0.0003617599],"domain_scores_gemma":[0.9962651,0.002623741,0.0002329176,0.0002295492,0.0004958399,0.000152896],"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.00009137442,0.00009785521,0.0003700395,0.00009399647,0.00004217282,0.0000801624,0.0001394059,0.8259559,0.00180182,0.1256716,0.001478238,0.04417749],"study_design_scores_gemma":[0.00002491121,0.00003905188,0.00004881621,0.000006797043,0.00001359399,0.00002899163,0.00001957075,0.9541796,0.0005105606,0.04392625,0.001193012,0.000008806535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006569448,0.0004013591,0.9899362,0.0001559064,0.00004537222,0.00007586311,0.00001515775,0.00007040481,0.002730282],"genre_scores_gemma":[0.765861,0.0008044735,0.2288383,0.0001825567,0.0001497279,0.0003626933,0.00004503019,0.00004110068,0.003715099],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004407168,"threshold_uncertainty_score":0.0203613,"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."}}