{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417039,0.0005623148,0.0007528594,0.0006560364,0.0008154149,0.0009240144,0.001356774,0.0006850261,0.001139578],"category_scores_gemma":[0.002874232,0.0003032078,0.0003062446,0.0006235321,0.0005987287,0.001640201,0.001563975,0.001010521,0.0003562694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002803435,"about_ca_system_score_gemma":0.0006437049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005004961,"about_ca_topic_score_gemma":0.0006648758,"domain_scores_codex":[0.9992402,0.0002365477,0.00003953893,0.0000877381,0.0002887881,0.000107263],"domain_scores_gemma":[0.9990714,0.0003411944,0.00008692672,0.0001544767,0.0002566107,0.00008934239],"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.001059567,0.0003425464,0.001599846,0.0007063975,0.0002223007,0.000974034,0.001296273,0.09792479,0.158673,0.07902507,0.004487762,0.6536884],"study_design_scores_gemma":[0.0003150083,0.001513545,0.0008236741,0.00006859544,0.000215275,0.001531786,0.0002754769,0.9100083,0.03418342,0.03336225,0.01755796,0.0001447804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05294042,0.002212238,0.9417926,0.0002019952,0.0002084583,0.000110562,0.00002260073,0.0005100933,0.002001082],"genre_scores_gemma":[0.7176042,0.001328167,0.2767034,0.0003591948,0.0002327992,0.000174601,0.00006533043,0.00005717366,0.003475066],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001356774,"threshold_uncertainty_score":0.004980266,"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."}}