{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001675793,0.0007253475,0.0006754452,0.0004961636,0.0007568287,0.000725726,0.001032772,0.000542998,0.000387154],"category_scores_gemma":[0.003071659,0.0004358389,0.0004346063,0.0007884143,0.0007098913,0.001250061,0.001139141,0.0004962875,0.00009621593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005107292,"about_ca_system_score_gemma":0.0008757155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001016567,"about_ca_topic_score_gemma":0.001364331,"domain_scores_codex":[0.9991407,0.0003559178,0.00003844418,0.0001106937,0.0002696095,0.00008445409],"domain_scores_gemma":[0.9987499,0.0007395007,0.0001470544,0.0001520801,0.0001751966,0.00003631756],"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.0001432652,0.000070833,0.000819052,0.00008866885,0.00008490255,0.0001337758,0.0002722655,0.8581527,0.01294128,0.03766589,0.0009613044,0.08866614],"study_design_scores_gemma":[0.000009448087,0.00005623986,0.0000798324,0.000003000018,0.00001325162,0.00003637155,0.00001726078,0.9912382,0.001567977,0.006480803,0.0004918291,0.000005885211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02368848,0.0003001177,0.975156,0.0000874024,0.0000207568,0.00002186863,0.000005432983,0.0000711403,0.000648732],"genre_scores_gemma":[0.8152924,0.0003608053,0.1827524,0.0000908127,0.00004464681,0.0001081046,0.00002595159,0.00003315652,0.00129181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001675793,"threshold_uncertainty_score":0.008862555,"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."}}