{"id":"W2122906861","doi":"10.3390/s121217295","title":"Towards a Hybrid Energy Efficient Multi-Tree-Based Optimized Routing Protocol for Wireless Networks","year":2012,"lang":"en","type":"article","venue":"Sensors","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Network packet; Tree (set theory); Routing protocol; Computer network; Geographic routing; Routing (electronic design automation); Node (physics); Path vector protocol; Wireless sensor network; Path (computing); Shortest-path tree; Shortest path problem; Dynamic Source Routing; Distributed computing; Algorithm; Minimum spanning tree; Mathematics; Theoretical computer science; Engineering","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.001081277,0.0004445007,0.0005294114,0.0005920169,0.0003892417,0.0008613697,0.001335072,0.0006023303,0.0004980251],"category_scores_gemma":[0.001553837,0.0002723752,0.000362448,0.000821218,0.0004785036,0.001543294,0.001023228,0.0006469575,0.0002239299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004022856,"about_ca_system_score_gemma":0.0006705106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007826444,"about_ca_topic_score_gemma":0.001532171,"domain_scores_codex":[0.9994121,0.0001869114,0.00003152373,0.0000724924,0.0002566899,0.00004019601],"domain_scores_gemma":[0.9995717,0.0001697533,0.00006178411,0.00006571256,0.000111923,0.00001906697],"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.0002133742,0.0001184681,0.0008200036,0.0002622472,0.0001456313,0.0001982007,0.0002915372,0.5713654,0.03642571,0.1143949,0.004291622,0.2714729],"study_design_scores_gemma":[0.00002121339,0.0001257875,0.0001373669,0.00001665916,0.00002744769,0.0001168959,0.00003528154,0.9738221,0.00483952,0.01338608,0.007453678,0.00001794839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007242177,0.0004091288,0.9911566,0.0001207899,0.00002754206,0.00003245127,0.00001505431,0.0002013379,0.0007949937],"genre_scores_gemma":[0.1814657,0.0008372816,0.8148269,0.0001546087,0.000047135,0.0001527771,0.0001229051,0.00009965829,0.002293098],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001335072,"threshold_uncertainty_score":0.00571841,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02515446810014572,"score_gpt":0.2757107570138658,"score_spread":0.2505562889137201,"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."}}