{"id":"W2286329776","doi":"10.1109/jsen.2015.2495329","title":"Optimal and Near-Optimal Cooperative Routing and Power Allocation for Collision Minimization in Wireless Sensor Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Sensors Journal","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Multipath routing; Mathematical optimization; Integer programming; Computer network; Static routing; Wireless sensor network; Equal-cost multi-path routing; Geographic routing; Dynamic Source Routing; Network packet; Distributed computing; Routing protocol; Algorithm; 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.0009076197,0.0001555379,0.0002061162,0.0001030624,0.0004253351,0.0005921394,0.0002157768,0.00008871307,0.000002094723],"category_scores_gemma":[0.000143733,0.0001446779,0.00002718922,0.0003215607,0.00008139678,0.0006061476,0.0001029539,0.0002886686,0.000001093046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008727554,"about_ca_system_score_gemma":0.0001139867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002804213,"about_ca_topic_score_gemma":0.00001258095,"domain_scores_codex":[0.9986358,0.0003072432,0.0003624963,0.0002623813,0.0001732806,0.000258806],"domain_scores_gemma":[0.9986979,0.0002378802,0.0001738719,0.0001825043,0.000518174,0.0001896795],"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.0001320816,0.00005981602,0.001233505,0.000003954791,0.00002769475,0.00001427358,0.00850585,0.9763178,0.0007763407,0.001621015,0.001223024,0.01008461],"study_design_scores_gemma":[0.001269112,0.0001786954,0.0009476654,0.00006884993,0.000005784615,0.0001776654,0.0004473515,0.9957774,0.0004190065,0.00001356056,0.0005179606,0.0001770089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5665821,0.0002557884,0.4319383,0.000750146,0.0002212915,0.0001822345,7.11802e-7,0.00001965208,0.00004978328],"genre_scores_gemma":[0.9395082,0.0005115424,0.05961484,0.0001621385,0.0001065417,0.00000670064,0.000002861078,0.00001268292,0.00007448146],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3729261,"threshold_uncertainty_score":0.5899795,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03585037458130336,"score_gpt":0.2846773050909854,"score_spread":0.248826930509682,"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."}}