{"id":"W2519275224","doi":"10.1109/nana.2016.88","title":"A Distributed Prioritized Multiple Access Scheme for Ad Hoc Networks Using Time-Frequency Hopping Communications","year":2016,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Random access; Collision; Throughput; Channel (broadcasting); Transmission (telecommunications); Linear network coding; Network packet; Distributed computing; Wireless; Telecommunications","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.0006970646,0.0006900981,0.0004853815,0.0006415515,0.0007956969,0.0007158779,0.001087991,0.0004085265,0.0007929852],"category_scores_gemma":[0.001295043,0.0001965777,0.0003099107,0.0005770936,0.0004298056,0.0009235435,0.0005775503,0.0005370616,0.0002195494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006499116,"about_ca_system_score_gemma":0.001002787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001289817,"about_ca_topic_score_gemma":0.002242346,"domain_scores_codex":[0.9994653,0.0001445803,0.00002924463,0.00009595423,0.0002105553,0.00005450538],"domain_scores_gemma":[0.9994859,0.0001676181,0.0000696659,0.00007159008,0.0001617917,0.00004339881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005024655,0.0003385638,0.001598591,0.0006632511,0.0001755106,0.0007763932,0.0005074676,0.1481152,0.1377435,0.1515558,0.005946158,0.5520772],"study_design_scores_gemma":[0.0001203403,0.0006872124,0.0006738533,0.00002279181,0.00008621231,0.0008506594,0.00005012765,0.9582176,0.01039306,0.01668363,0.01215699,0.00005751331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0206569,0.001163435,0.9749489,0.0001318645,0.0001716801,0.0001269669,0.00004020597,0.0006004506,0.002159553],"genre_scores_gemma":[0.7326831,0.001026299,0.2624185,0.0002112415,0.0002323014,0.0003219042,0.0001092132,0.00002560247,0.002971861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001289817,"threshold_uncertainty_score":0.004715502,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05234887144053181,"score_gpt":0.3097661296725792,"score_spread":0.2574172582320474,"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."}}