{"id":"W2121489931","doi":"10.1109/icc.2006.255664","title":"An Improved Busy-Tone Solution for Collision Avoidance in Wireless Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Transmitter; Wireless ad hoc network; Network packet; Channel (broadcasting); Tone (literature); Throughput; Carrier sense multiple access with collision avoidance; Multiple Access with Collision Avoidance for Wireless; Hidden node problem; Wireless; Terminal (telecommunication); Real-time computing; Vehicular ad hoc network; Wireless network; Telecommunications; Wi-Fi array","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005139899,0.00022847,0.0002255405,0.0002122092,0.0002993045,0.0003284126,0.003991387,0.0001672337,0.00001299605],"category_scores_gemma":[0.00002524274,0.0002530232,0.00008338648,0.0004161435,0.0001420784,0.000782612,0.0002597991,0.0004193227,0.00001958424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002800336,"about_ca_system_score_gemma":0.0001567162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003161221,"about_ca_topic_score_gemma":0.005832646,"domain_scores_codex":[0.9980183,0.000196462,0.0005771219,0.0005220613,0.0003071456,0.0003789181],"domain_scores_gemma":[0.9966528,0.0003514808,0.0002998125,0.002048133,0.0005650144,0.00008280426],"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.0001455814,0.001599532,0.000694503,0.000009648737,0.00003381764,0.000003189164,0.0002077734,0.04418182,0.01108899,0.7856482,0.004712047,0.1516749],"study_design_scores_gemma":[0.0007263677,0.0001407434,0.002236444,0.00009354263,0.000004164969,0.00000352217,0.00002162938,0.9859897,0.0003293176,0.006615214,0.003575772,0.0002635894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01412328,0.0003255509,0.9747418,0.004551413,0.0008463673,0.0007651398,0.00005760123,0.0001865078,0.004402322],"genre_scores_gemma":[0.9525948,0.0007144381,0.04485229,0.0003172787,0.0001672729,0.000566734,0.0003038637,0.00002112188,0.0004622267],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9418079,"threshold_uncertainty_score":0.9999922,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04608635342127172,"score_gpt":0.3341788762120321,"score_spread":0.2880925227907604,"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."}}