{"id":"W2126183826","doi":"10.1049/ip-com:20045260","title":"Modelling CSMA∕CA protocol for wireless channels that use collaborative codes modulation","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Carrier sense multiple access with collision avoidance; Computer science; Computer network; Network packet; Throughput; Markov chain; Distributed coordination function; Protocol (science); Multiple Access with Collision Avoidance for Wireless; Channel access method; Channel (broadcasting); Simple (philosophy); Wireless; IEEE 802.11; Routing protocol; Telecommunications; Optimized Link State Routing Protocol","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004729614,0.0002720577,0.0002894356,0.0001528438,0.0009759174,0.001208523,0.002109087,0.0001561969,0.000003452239],"category_scores_gemma":[0.00002341811,0.0002679438,0.00009495416,0.0008454206,0.0001356084,0.002210847,0.0004694148,0.0002406018,0.000008724829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000974045,"about_ca_system_score_gemma":0.0001153499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001487627,"about_ca_topic_score_gemma":0.00003171191,"domain_scores_codex":[0.9982902,0.00004743567,0.000469933,0.0004684523,0.0003014306,0.0004225678],"domain_scores_gemma":[0.9971284,0.0003269523,0.0004350235,0.0009529202,0.001067489,0.00008917187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009648542,0.0005837313,0.001728443,0.0002122828,0.00005069826,3.974295e-7,0.00215363,0.1316465,0.001056885,0.8436871,0.01313217,0.005651651],"study_design_scores_gemma":[0.0007238167,0.00008082436,0.0001220538,0.0001767341,0.000007422937,0.000002561122,0.00005242362,0.9218044,0.001355588,0.02996046,0.04540523,0.000308424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"protocol","genre_scores_codex":[0.001250855,0.00001439252,0.766424,0.001561974,0.00005423883,0.22861,0.00002547289,0.0003490897,0.001710022],"genre_scores_gemma":[0.3187141,0.00000543412,0.1366434,0.00006747791,0.0001122142,0.5441905,0.00002468495,0.00002537856,0.0002167493],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8137267,"threshold_uncertainty_score":0.9999773,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1006283555115134,"score_gpt":0.329993772123047,"score_spread":0.2293654166115336,"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."}}