{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003853079,0.0001483731,0.0001484115,0.00007961343,0.000182344,0.0002771291,0.0006206241,0.00009667403,0.0001471364],"category_scores_gemma":[0.00002244082,0.0001209526,0.0000845793,0.0002055235,0.00002221566,0.0002217869,0.00008347949,0.0002742805,0.00002539005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001922005,"about_ca_system_score_gemma":0.0001033294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005215352,"about_ca_topic_score_gemma":0.00003089465,"domain_scores_codex":[0.9987922,0.00004673117,0.0002302134,0.0003598501,0.0002619706,0.0003090197],"domain_scores_gemma":[0.9990309,0.00006730574,0.00007158399,0.0006169644,0.0001033511,0.0001098842],"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.00009679249,0.0003568897,0.0005961781,0.00007341676,0.00001931107,0.00001775781,0.0000715164,0.429048,0.01146517,0.5031065,0.0007643193,0.05438408],"study_design_scores_gemma":[0.000550612,0.00007727887,0.00002398559,0.00008091028,0.000001101839,0.000002274157,0.000001589922,0.9946632,0.001167456,0.002810972,0.0004465072,0.0001741214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005503355,6.58203e-7,0.9528176,0.0003154305,0.0001682001,0.03621948,9.295987e-7,0.0002007279,0.004773654],"genre_scores_gemma":[0.7971641,7.225849e-8,0.1499366,0.001303131,0.0002029083,0.05099733,0.000001680544,0.00002052972,0.00037358],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8028809,"threshold_uncertainty_score":0.4932303,"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."}}