{"id":"W2014371526","doi":"10.1109/tvt.2008.923669","title":"Enhanced Markov Chain Model and Throughput Analysis of the Slotted CSMA/CA for IEEE 802.15.4 Under Unsaturated Traffic Conditions","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Carrier sense multiple access with collision avoidance; Markov chain; Superframe; Computer network; IEEE 802.15; Throughput; Computer science; Distributed coordination function; Access control; Markov model; Network allocation vector; Markov process; Limit (mathematics); Multiple Access with Collision Avoidance for Wireless; Protocol (science); IEEE 802.11; Wireless; Wireless sensor network; Mathematics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0001635369,0.0002344015,0.0004276999,0.0006257578,0.0003688453,0.00004378694,0.0006609083,0.0003932008,0.000009398066],"category_scores_gemma":[0.000004366522,0.0001871499,0.0002803749,0.003071179,0.0002217736,0.0001558793,0.0000040475,0.0003725739,0.000001675746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004897927,"about_ca_system_score_gemma":0.00007422339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006031415,"about_ca_topic_score_gemma":0.0001089464,"domain_scores_codex":[0.9984946,0.00007456522,0.0003730434,0.000520192,0.0001892877,0.000348298],"domain_scores_gemma":[0.9986727,0.0001087986,0.0001649553,0.0008430076,0.0001582002,0.00005231759],"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.00002774344,0.0001880311,7.543459e-7,0.000008488839,0.0003581561,0.000001158378,0.00009665523,0.9448634,0.02882852,0.006272431,0.0001090182,0.01924564],"study_design_scores_gemma":[0.0006629149,0.0002238002,0.0001189539,0.00003406714,0.0002477165,0.000006719249,0.00003269107,0.9309012,0.0639691,0.003510471,0.00008400108,0.0002083771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1386188,0.00003808375,0.8540949,0.004604579,0.0001158652,0.002201598,0.00005128184,0.00024893,0.00002601101],"genre_scores_gemma":[0.9922101,0.00004008316,0.006143644,0.0004210621,0.000009611984,0.001082182,0.000005882049,0.00001283142,0.00007462144],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8535913,"threshold_uncertainty_score":0.7631751,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0120759966831361,"score_gpt":0.2587823932782393,"score_spread":0.2467063965951032,"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."}}