{"id":"W4229840168","doi":"10.32920/ryerson.14643843","title":"Simulation study of power aware routing algorithms in multi-hop networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Dijkstra's algorithm; Computer science; Hop (telecommunications); Shortest path problem; Java; Routing algorithm; Algorithm; Static routing; Computer network; Distributed computing; Routing (electronic design automation); Routing protocol; Theoretical computer science; Graph; Programming language","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.0009527321,0.0005579325,0.0006248221,0.0005185323,0.0004665922,0.0006699842,0.0008230995,0.0007243048,0.00111609],"category_scores_gemma":[0.002867545,0.0002371138,0.0005482754,0.0007420884,0.0003784749,0.0009062609,0.0004409657,0.0006221134,0.0000941414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007909008,"about_ca_system_score_gemma":0.0005651811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005592884,"about_ca_topic_score_gemma":0.003601125,"domain_scores_codex":[0.9993949,0.000294116,0.00002901688,0.00005582855,0.0001402368,0.00008590224],"domain_scores_gemma":[0.9975025,0.001906654,0.0001362382,0.0001285777,0.0002480571,0.00007796552],"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.00004516061,0.00005569889,0.0009256421,0.00003964217,0.00002143435,0.00004165325,0.00003134656,0.9935409,0.0006753847,0.002235125,0.0001679553,0.002220113],"study_design_scores_gemma":[0.000007278416,0.00003475575,0.0001537587,0.000004433331,0.000007028957,0.000007313924,0.00001296387,0.998755,0.0004119595,0.0004228108,0.0001800148,0.000002599787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8362474,0.001311984,0.14362,0.000602183,0.000172591,0.0001598146,0.0003805796,0.0004550925,0.01705054],"genre_scores_gemma":[0.9823883,0.0003870365,0.01575633,0.00003386202,0.000009720654,0.00006592442,0.0001300178,0.00002371365,0.001205233],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005592884,"threshold_uncertainty_score":0.01112068,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04613970487405649,"score_gpt":0.3080563442650913,"score_spread":0.2619166393910348,"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."}}