{"id":"W1963869843","doi":"10.1109/dcoss.2011.5982193","title":"Sleep scheduling towards geographic routing in duty-cycled sensor networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Geographic routing; Computer science; Wireless sensor network; Scheduling (production processes); Greedy algorithm; Computer network; Routing (electronic design automation); Routing algorithm; Geographic information system; Static routing; Real-time computing; Routing protocol; Distributed computing; Algorithm; Geography; Mathematical optimization; Mathematics; Remote sensing","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.0002841758,0.0003060394,0.0002047366,0.0003493096,0.000380459,0.0002867874,0.0006004348,0.0001777282,0.0003979669],"category_scores_gemma":[0.0009107127,0.0001347046,0.000160073,0.0004752568,0.0003145231,0.0005400787,0.0004732695,0.0002032106,0.00006935881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002403792,"about_ca_system_score_gemma":0.0005269741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001497155,"about_ca_topic_score_gemma":0.002570855,"domain_scores_codex":[0.9998882,0.00004339169,0.00000670011,0.00001536886,0.00003125329,0.00001512252],"domain_scores_gemma":[0.9996896,0.0001349199,0.00004373309,0.00004689169,0.00006172926,0.00002311975],"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.0004425054,0.0001159622,0.003970912,0.0003191137,0.0000866999,0.0002224595,0.0005737931,0.535338,0.05965427,0.04487718,0.002434621,0.3519645],"study_design_scores_gemma":[0.00004703852,0.0002394387,0.0007394988,0.00001541127,0.00003727372,0.0001617098,0.0001507852,0.9680293,0.01181799,0.01422905,0.004516969,0.00001550462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1754574,0.001161001,0.820019,0.0002716082,0.0001043761,0.00006447263,0.00003223033,0.0004740782,0.002415809],"genre_scores_gemma":[0.9074897,0.000462668,0.09123447,0.00008314903,0.000030148,0.00004229518,0.00003562368,0.00003361694,0.0005883219],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001497155,"threshold_uncertainty_score":0.002976894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01996165552834978,"score_gpt":0.2150519989273128,"score_spread":0.195090343398963,"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."}}