{"id":"W2113812479","doi":"10.1109/icc.2012.6364150","title":"An efficient priority packet scheduling algorithm for Wireless Sensor Network","year":2012,"lang":"en","type":"article","venue":"","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Computer network; Priority queue; Network packet; Priority inheritance; Real-time computing; Wireless sensor network; Earliest deadline first scheduling; Round-robin scheduling; Scheduling (production processes); Deadline-monotonic scheduling; Queue; Transmission delay; Dynamic priority scheduling; Distributed computing; Rate-monotonic scheduling; Quality of service; 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.001250289,0.0003506038,0.000366263,0.00009536069,0.0004584148,0.0002587665,0.001080248,0.0002111249,0.00001430315],"category_scores_gemma":[0.00002337724,0.0003180272,0.0001647285,0.0006665323,0.00007777903,0.0005316689,0.0002498136,0.0002519184,0.00004509809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009930717,"about_ca_system_score_gemma":0.00005809156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001962715,"about_ca_topic_score_gemma":0.00000628543,"domain_scores_codex":[0.9966365,0.0001783551,0.0004326739,0.000708449,0.0004856961,0.001558327],"domain_scores_gemma":[0.9975542,0.0003540621,0.0001694268,0.00116733,0.0002111748,0.0005438394],"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.00000850276,0.0004996674,0.001113515,0.00001364886,0.00003189894,0.000004016659,0.000401485,0.7517345,0.0003066565,0.08630928,0.0004217269,0.1591551],"study_design_scores_gemma":[0.0004314193,0.00009040917,0.0006018864,0.00002380943,0.00001303808,0.00001812225,0.00005778272,0.9940356,0.001845443,0.00008164715,0.00233556,0.0004653072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1327264,0.0002161446,0.8631025,0.0001515499,0.002173841,0.0003969322,0.000003847444,0.0006934124,0.0005354011],"genre_scores_gemma":[0.4505193,0.000007089836,0.5477197,0.0002848117,0.001283632,0.00002942251,0.00001005649,0.00002923945,0.0001167529],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3177929,"threshold_uncertainty_score":0.9999272,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01533752460226825,"score_gpt":0.2607972139312551,"score_spread":0.2454596893289868,"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."}}