{"id":"W2513021552","doi":"10.1002/dac.3180","title":"An efficient network‐coding based back‐pressure scheduling algorithm for wireless multi‐hop networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Computer science; Linear network coding; Computer network; Hop (telecommunications); Wireless network; Coding (social sciences); Wireless; Scheduling (production processes); Maximum throughput scheduling; Distributed computing; Algorithm; Round-robin scheduling; Fair-share scheduling; Telecommunications; Quality of service; Mathematical optimization; Network packet","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.0007002832,0.0005167749,0.0005149792,0.000608949,0.0004920273,0.00055072,0.0009914624,0.0005860114,0.001153797],"category_scores_gemma":[0.002024635,0.0002354328,0.0002991077,0.0006510371,0.0005146469,0.0007560502,0.0009305705,0.0008404243,0.0001944615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000874306,"about_ca_system_score_gemma":0.001669847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004507088,"about_ca_topic_score_gemma":0.003197698,"domain_scores_codex":[0.9995844,0.0001096738,0.00001743463,0.00005233719,0.0001635329,0.00007278305],"domain_scores_gemma":[0.9993448,0.0003176431,0.00006506693,0.00004810398,0.0001758349,0.00004854751],"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.000111049,0.00007964095,0.0004442846,0.00005318919,0.00001980256,0.0000568399,0.00007896671,0.8672608,0.006530704,0.01792734,0.002350016,0.1050873],"study_design_scores_gemma":[0.000006091509,0.00001096582,0.0000307528,0.000001621302,0.000001512912,0.000007313806,0.000003564274,0.9975938,0.0005126062,0.001665685,0.0001639027,0.000002228727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01852824,0.000108716,0.9792418,0.0001358342,0.00005081401,0.00005804216,0.00002513903,0.000169804,0.001681712],"genre_scores_gemma":[0.6507406,0.0002169551,0.3461976,0.0001210599,0.00007074345,0.0002231088,0.0001187471,0.00006108479,0.002250084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004507088,"threshold_uncertainty_score":0.008961737,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01701329410286068,"score_gpt":0.2750245534377791,"score_spread":0.2580112593349184,"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."}}