{"id":"W2005686751","doi":"10.1109/lwc.2014.2357032","title":"Joint Cooperative Routing and Power Allocation for Collision Minimization in Wireless Sensor Networks With Multiple Flows","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Collision; Routing (electronic design automation); Computer network; Mathematical optimization; Dynamic Source Routing; Static routing; Link-state routing protocol; Minification; Time constraint; Constraint (computer-aided design); Equal-cost multi-path routing; Routing protocol; Distributed computing; Engineering; Mathematics","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.0007419158,0.0002527127,0.0003233015,0.0002035993,0.0007360165,0.000282103,0.001195061,0.00009415552,0.000001247929],"category_scores_gemma":[0.0001007705,0.0002412112,0.00004501455,0.0007499864,0.000177325,0.0005698891,0.0003698381,0.0003225532,0.000002739869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001280889,"about_ca_system_score_gemma":0.00004998187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002922574,"about_ca_topic_score_gemma":0.0007664673,"domain_scores_codex":[0.9978386,0.0006838212,0.0005119923,0.0004589474,0.00017797,0.0003286263],"domain_scores_gemma":[0.9963742,0.001069625,0.0002488974,0.001872386,0.0003424878,0.00009241241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002316678,0.0008964322,0.01339953,0.00008003264,0.0001801895,0.000002988101,0.0167781,0.5981066,0.1272525,0.111509,0.001970338,0.1295926],"study_design_scores_gemma":[0.001239807,0.00007535945,0.003259537,0.000190114,0.000008616412,0.000005860212,0.0001406285,0.9925829,0.001239337,0.00001050932,0.0009294788,0.0003178525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2653843,0.00009120058,0.72553,0.008024436,0.00009233001,0.0006882114,0.000002507184,0.0001040157,0.00008292759],"genre_scores_gemma":[0.9238551,0.0005005111,0.07365333,0.001550024,0.00003312649,0.0003034043,0.00005889494,0.00002872975,0.00001691916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6584707,"threshold_uncertainty_score":0.9836309,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0278168840164508,"score_gpt":0.2528523504709597,"score_spread":0.2250354664545089,"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."}}