{"id":"W1515185950","doi":"10.1109/lcn.2004.16","title":"An adaptive distributed ID assignment scheme for CSMA/IC","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Multiple Access with Collision Avoidance for Wireless; Carrier sense multiple access with collision avoidance; Computer science; Computer network; Hidden node problem; Throughput; Wireless ad hoc network; Countdown; Distributed coordination function; Transmission (telecommunications); Wireless; Scheme (mathematics); Protocol (science); Wireless network; Collision; Distributed computing; Vehicular ad hoc network; IEEE 802.11; Wi-Fi array; Engineering; Computer security; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002209015,0.0001374875,0.0001420981,0.00002879582,0.0001003721,0.0001207261,0.0007964747,0.00006507114,0.00009434927],"category_scores_gemma":[0.000008849659,0.0001195613,0.00005549539,0.0001828518,0.00002468972,0.0005888499,0.0001350874,0.00008637673,0.00008433677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001172982,"about_ca_system_score_gemma":0.00004798164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008274355,"about_ca_topic_score_gemma":0.00002835722,"domain_scores_codex":[0.9987575,0.00003136819,0.0001956333,0.0004271991,0.0002118214,0.0003764795],"domain_scores_gemma":[0.9989851,0.00007607309,0.00006086553,0.0006453108,0.00006658799,0.0001660954],"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.00004844612,0.0005268918,0.0001859965,0.000007115098,0.00005994844,0.000006628574,0.0002146378,0.01274667,0.002331604,0.5931129,0.05926251,0.3314967],"study_design_scores_gemma":[0.0004287745,0.0003560475,0.0003122614,0.000005924771,0.000003970936,0.000003323659,0.00001895329,0.9376879,0.00445322,0.001317714,0.05520707,0.0002048123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00134531,0.00004743458,0.9952208,0.0008409525,0.0001402846,0.0004124725,0.00001358584,0.000274251,0.001704839],"genre_scores_gemma":[0.6568808,0.000002378673,0.3419283,0.0005219019,0.0002305745,0.0001212351,0.00002417666,0.000008555768,0.0002820654],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9249412,"threshold_uncertainty_score":0.4875568,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01918322911004547,"score_gpt":0.2599438281393408,"score_spread":0.2407605990292953,"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."}}