{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001555671,0.0009095208,0.0009737483,0.0009359104,0.0007024277,0.001046212,0.001353612,0.0008996959,0.003386264],"category_scores_gemma":[0.005317368,0.0005163643,0.0008373117,0.0008705897,0.001205278,0.002165484,0.0006313517,0.001543623,0.0005284554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00248727,"about_ca_system_score_gemma":0.002727395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01597091,"about_ca_topic_score_gemma":0.007361577,"domain_scores_codex":[0.9990157,0.0002643594,0.00003451393,0.0001528989,0.0003171741,0.0002153115],"domain_scores_gemma":[0.9969651,0.00190484,0.0003173788,0.0001844232,0.000556369,0.00007201498],"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.00005635643,0.00003402459,0.0005281758,0.00004646868,0.00002574326,0.0001450656,0.0001178804,0.9050281,0.001907556,0.08732307,0.0006584793,0.004129037],"study_design_scores_gemma":[0.000003958235,0.000007574105,0.00006877894,0.000003437098,0.000007973777,0.00001464828,0.000005609189,0.9932841,0.0002215666,0.006214111,0.0001624991,0.000005648181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03831701,0.0005813186,0.9544861,0.0004036376,0.00008478289,0.00007923017,0.0002253461,0.0003403549,0.005482307],"genre_scores_gemma":[0.9423603,0.001244842,0.05033651,0.0001433264,0.000120884,0.0002778868,0.0002673563,0.00008068039,0.005168171],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01597091,"threshold_uncertainty_score":0.03175592,"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."}}