{"id":"W2290254866","doi":"10.1109/glocom.2015.7417111","title":"An Energy-Efficient Backpressure Routing and Scheduling Algorithm for Wireless Sensor Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Wireless sensor network; Computer network; Network packet; Efficient energy use; Scheduling (production processes); Maximum throughput scheduling; Distributed computing; Energy consumption; Algorithm; Fair-share scheduling; Round-robin scheduling; Mathematical optimization; Engineering; Quality of service; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00111021,0.0004892687,0.0005380091,0.0001071287,0.0007575255,0.000834943,0.004247895,0.0003339846,0.000003059149],"category_scores_gemma":[0.00006794008,0.0005143824,0.0001187148,0.0007998536,0.0003896045,0.0005820165,0.001123016,0.0003998167,0.00001087935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002550442,"about_ca_system_score_gemma":0.0003665429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004751762,"about_ca_topic_score_gemma":0.0003634318,"domain_scores_codex":[0.9963332,0.0005943776,0.0006939367,0.0009436636,0.0005216978,0.0009131104],"domain_scores_gemma":[0.9934857,0.0003569604,0.0004062065,0.00379977,0.001242861,0.0007085056],"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.00001747949,0.0004172124,0.0004240864,0.000008643294,0.00007053477,0.000004725703,0.0003721991,0.6038859,0.00006140747,0.1954344,0.00111219,0.1981913],"study_design_scores_gemma":[0.0008667255,0.0001194813,0.0001084255,0.00009024268,0.00003859738,0.00004175163,0.000403543,0.993592,0.0000739229,0.0006667769,0.003411761,0.0005868031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008804324,0.001628824,0.9850184,0.001121983,0.0008695594,0.0003930869,0.00005968568,0.0005056811,0.001598424],"genre_scores_gemma":[0.6751998,0.0001997542,0.3239769,0.0002559377,0.0001456137,0.00007410594,0.00007497452,0.00002418951,0.00004873872],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6663955,"threshold_uncertainty_score":0.9997308,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04983192209444601,"score_gpt":0.3060800277587588,"score_spread":0.2562481056643128,"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."}}