{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044861,0.0007784294,0.0009733189,0.0005187792,0.000676749,0.0007512752,0.0008034154,0.0008103993,0.0006734295],"category_scores_gemma":[0.002822618,0.0004627738,0.0005367139,0.001120799,0.001085089,0.001386798,0.001113058,0.000713814,0.0001413826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007203241,"about_ca_system_score_gemma":0.00140297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001954104,"about_ca_topic_score_gemma":0.001963986,"domain_scores_codex":[0.9991528,0.0003920903,0.00002650664,0.0001343046,0.0002236593,0.00007059005],"domain_scores_gemma":[0.9991933,0.0005737413,0.00008767226,0.00004174235,0.000082089,0.00002147389],"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.0000283439,0.00002934442,0.0001322184,0.00004660155,0.000018016,0.00002809148,0.00007313114,0.9552603,0.001787636,0.02260416,0.0004968978,0.01949522],"study_design_scores_gemma":[0.00000395417,0.00001731251,0.00002870936,0.000002591873,0.000003393369,0.00001061292,0.00001043847,0.9910707,0.0002857416,0.008328469,0.0002349317,0.000003098222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01230866,0.0004331309,0.9858032,0.0001223307,0.00001777624,0.00002082093,0.00001109029,0.00004882536,0.001234224],"genre_scores_gemma":[0.7703273,0.001178642,0.2258504,0.0001163968,0.00005506508,0.0002247899,0.00005863783,0.00005563262,0.002133174],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001954104,"threshold_uncertainty_score":0.005525768,"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."}}