{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007039245,0.000561993,0.0004758394,0.0004716385,0.0005360035,0.0005521544,0.0009146337,0.0005039921,0.0004590199],"category_scores_gemma":[0.002101169,0.0002358836,0.0002880506,0.0005754185,0.0003691956,0.0009059656,0.000604669,0.00073213,0.0001156464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000499378,"about_ca_system_score_gemma":0.001061605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001669107,"about_ca_topic_score_gemma":0.001636737,"domain_scores_codex":[0.9996202,0.00007892208,0.00003026998,0.00004879515,0.0001912722,0.00003050321],"domain_scores_gemma":[0.999605,0.0001788686,0.00005302025,0.00003625442,0.00009921872,0.00002759996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002769686,0.0001651343,0.0007605578,0.0001594487,0.00005456113,0.0001277738,0.0002078789,0.4572868,0.03792537,0.02734922,0.003948536,0.4717377],"study_design_scores_gemma":[0.00001278866,0.00005912076,0.00008550762,0.000004298972,0.000007155022,0.00003534446,0.000007373991,0.992503,0.002633256,0.003509403,0.001136958,0.000005713698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01586824,0.0005124704,0.9818625,0.0001758685,0.0001302134,0.00006091517,0.00002173176,0.0004339432,0.0009340341],"genre_scores_gemma":[0.4798175,0.001043537,0.5162317,0.0001763959,0.0001911191,0.0002119009,0.0001210051,0.00007410179,0.002132822],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001669107,"threshold_uncertainty_score":0.003722787,"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."}}