{"id":"W2049531648","doi":"10.1109/wiopt.2008.4586087","title":"A distributed power and rate control scheme for mobile ad hoc networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Multiple Access with Collision Avoidance for Wireless; Computer science; Computer network; Distributed coordination function; Throughput; Wireless ad hoc network; Capture effect; Network packet; Hidden node problem; Power control; Carrier sense multiple access with collision avoidance; IEEE 802.11; Transmission (telecommunications); Energy consumption; Protocol (science); Wireless; Wireless network; Power (physics); Engineering; Optimized Link State Routing Protocol; Telecommunications; Electrical engineering; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002035906,0.0001269473,0.0001892889,0.00001931803,0.000187945,0.00009789121,0.0002951236,0.00007738938,0.00002191922],"category_scores_gemma":[0.00001058198,0.0001000161,0.00005843563,0.0001592692,0.00005066522,0.0002259177,0.00008762116,0.00008482151,0.000005227428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001216574,"about_ca_system_score_gemma":0.00003072003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000137674,"about_ca_topic_score_gemma":0.000002291634,"domain_scores_codex":[0.9991091,0.0000370691,0.0001499108,0.0003018596,0.00007809734,0.0003239563],"domain_scores_gemma":[0.9992604,0.0001900246,0.00005608229,0.0002994302,0.00007749124,0.0001166114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001284282,0.001030213,0.01180461,0.0001254228,0.0004434117,0.0002175996,0.001122809,0.03610168,0.0009132472,0.1249311,0.4562111,0.3658145],"study_design_scores_gemma":[0.00222365,0.0003663168,0.002745279,0.00001603011,0.000003135344,0.00002298352,0.000005923036,0.7830327,0.00007461776,0.0004238453,0.210846,0.0002395423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006961055,0.0009825767,0.9862135,0.0003597752,0.00009854172,0.005065618,0.00001083956,0.0001412173,0.0001668704],"genre_scores_gemma":[0.961731,0.0001863913,0.02686111,0.001097323,0.0001125466,0.009321982,0.0000118993,0.00001518605,0.0006625878],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9593524,"threshold_uncertainty_score":0.4078538,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01165451925966159,"score_gpt":0.2402775084649099,"score_spread":0.2286229892052483,"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."}}