{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009436066,0.0005735453,0.0005798257,0.0002289305,0.0004274596,0.0002401447,0.00117667,0.0002181468,0.00001117889],"category_scores_gemma":[0.0001003939,0.0005242449,0.0003821508,0.0006817619,0.0001298217,0.0001958256,0.0003160265,0.0002973408,0.0000119984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002092288,"about_ca_system_score_gemma":0.0001275101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008551076,"about_ca_topic_score_gemma":0.0000117153,"domain_scores_codex":[0.995652,0.0003358913,0.0007201922,0.000894723,0.0006038718,0.001793353],"domain_scores_gemma":[0.9971842,0.00048785,0.0004247624,0.001145547,0.0002713965,0.0004862883],"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.0001168088,0.0004811495,0.0001083572,0.00002563081,0.00002994527,0.00001114904,0.0001309918,0.9722878,0.00009354073,0.006598806,0.0002594849,0.01985632],"study_design_scores_gemma":[0.004046421,0.00009440667,0.0001073,0.0001140153,0.00001660672,0.00001453242,0.00002031655,0.9800941,0.009928964,0.000006329455,0.004908385,0.0006486306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01212916,0.00002318208,0.9581432,0.0001812734,0.0008837515,0.02733695,0.000004756703,0.0007344403,0.0005632722],"genre_scores_gemma":[0.7098233,9.52568e-7,0.2209002,0.0005052059,0.0006833855,0.06766655,0.00001827277,0.0001085713,0.0002935901],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7372431,"threshold_uncertainty_score":0.9997209,"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."}}