{"id":"W2159351263","doi":"10.1109/icc.2010.5502486","title":"On Modeling Contention-Based MAC Protocols Using Markov Chains","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Markov chain; Computer science; Markov process; Continuous-time Markov chain; Markov model; Node (physics); Throughput; Markov blanket; Independence (probability theory); Distributed computing; Variable-order Markov model; Markov property; Theoretical computer science; Wireless; Machine learning; Mathematics","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.003239209,0.00120603,0.001094849,0.001082944,0.0007727079,0.001766222,0.001658987,0.001414847,0.001544583],"category_scores_gemma":[0.01079772,0.0007951546,0.001083634,0.001373485,0.001425176,0.003320294,0.001196857,0.001629728,0.0003658621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001182097,"about_ca_system_score_gemma":0.001792645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00848617,"about_ca_topic_score_gemma":0.004266539,"domain_scores_codex":[0.9983156,0.0008394109,0.00008550844,0.0001748793,0.000434478,0.0001501092],"domain_scores_gemma":[0.9905995,0.007640627,0.0004963177,0.0006461983,0.0004951669,0.0001222356],"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.00003397839,0.00002519226,0.0003416768,0.00002495963,0.0000211001,0.00002754408,0.00004389546,0.9696904,0.0004099342,0.02418483,0.0001421206,0.005054255],"study_design_scores_gemma":[0.000007056475,0.00001071205,0.00004148773,0.000005755902,0.000005998367,0.000007941121,0.000003374127,0.987511,0.0001825589,0.01199933,0.0002190285,0.000005750524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01317657,0.0004106338,0.9839521,0.0002016006,0.00004081743,0.00008520251,0.00008016487,0.0002216668,0.00183125],"genre_scores_gemma":[0.5958352,0.003275126,0.395357,0.0002348432,0.0003348015,0.0008387978,0.0004129824,0.0001493694,0.003561852],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00848617,"threshold_uncertainty_score":0.01713079,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04779988945895234,"score_gpt":0.3170004697202409,"score_spread":0.2692005802612886,"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."}}