{"id":"W2052478271","doi":"10.1016/j.jpdc.2010.05.007","title":"Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University; Acadia University","funders":"","keywords":"Computer science; Spanning tree; Wireless sensor network; Minimum spanning tree; Routing (electronic design automation); Kruskal's algorithm; Energy consumption; Heuristic; Distributed minimum spanning tree; Cluster analysis; Tree (set theory); Hierarchical routing; Distributed computing; Connected dominating set; Degree (music); Routing protocol; Static routing; Algorithm; Computer network; 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.001190559,0.000464967,0.001173087,0.0008603192,0.0007584644,0.0007728279,0.001331273,0.0008500796,0.00165407],"category_scores_gemma":[0.004631613,0.0004797667,0.0003633283,0.001267011,0.0005115321,0.00145784,0.001296199,0.0005012134,0.0002285843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008992476,"about_ca_system_score_gemma":0.001214952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002943305,"about_ca_topic_score_gemma":0.004892697,"domain_scores_codex":[0.9994292,0.0001808041,0.00003675754,0.0001038996,0.0001681238,0.00008117617],"domain_scores_gemma":[0.9988307,0.0006987413,0.00009816641,0.0001236373,0.0001841031,0.0000647131],"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.0004356517,0.0001261447,0.0009557954,0.000122354,0.00005843771,0.00005890374,0.0001641917,0.8903367,0.005689644,0.01587346,0.002443308,0.08373535],"study_design_scores_gemma":[0.00003063026,0.00003495038,0.00009376874,0.000003019963,0.000007495238,0.00001080704,0.00001814805,0.9943135,0.000437164,0.004881402,0.0001664461,0.000002845997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1172351,0.0007291477,0.8780531,0.000460948,0.00006933092,0.0001189169,0.0001512892,0.0004615179,0.002720539],"genre_scores_gemma":[0.8043845,0.000216704,0.1925849,0.0001020688,0.0000434455,0.0001725877,0.0002707893,0.00007359242,0.002151313],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002943305,"threshold_uncertainty_score":0.006524503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01541678113930638,"score_gpt":0.2589145652732349,"score_spread":0.2434977841339285,"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."}}