{"id":"W2156238030","doi":"10.1109/allerton.2009.5394771","title":"On channel access delay of CSMA policies in wireless networks with primary interference constraints","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Computer science; Bipartite graph; Exponential backoff; Scheduling (production processes); Wireless network; Channel (broadcasting); Simple (philosophy); Limit (mathematics); Interference (communication); Channel access method; Wireless; Distributed computing; Topology (electrical circuits); Throughput; Mathematics; Telecommunications; Theoretical computer science; Mathematical optimization; Graph","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.00004718314,0.000169785,0.0002372957,0.0001351876,0.00001601211,0.00002029783,0.0001990432,0.00007929193,0.00002154711],"category_scores_gemma":[0.000004202695,0.0001476764,0.0000183051,0.0003831471,0.00007623233,0.0002363635,0.00002133813,0.0001738707,0.000001148915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007012812,"about_ca_system_score_gemma":0.00001287793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000861075,"about_ca_topic_score_gemma":0.00005147881,"domain_scores_codex":[0.9992294,0.00001393875,0.0002425451,0.000150142,0.0001022886,0.0002616492],"domain_scores_gemma":[0.9996345,0.00006402935,0.0000491105,0.0001685127,0.00003842372,0.00004542083],"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.00004617051,0.00003062859,0.0003625091,0.00001595781,0.000008352089,0.00000495588,0.00009251757,0.9751914,0.00007176028,0.002082168,0.00005795772,0.02203569],"study_design_scores_gemma":[0.0005610159,0.0001654989,0.007912611,0.0003503938,0.000004802558,0.000007766375,0.00004723651,0.9889015,0.001435404,0.0003540304,0.000002207378,0.0002575435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2398488,0.00004391439,0.7409902,0.00003125609,0.00006492452,0.0001784145,0.00000206499,0.0001637728,0.01867669],"genre_scores_gemma":[0.998065,0.0001469682,0.00151839,0.0001729626,0.00003057787,0.000008941781,0.00001405162,0.00002194164,0.00002119814],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7582162,"threshold_uncertainty_score":0.6022068,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009352710143012779,"score_gpt":0.2268870730561166,"score_spread":0.2175343629131038,"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."}}