{"id":"W4315783220","doi":"10.1109/gcwkshps56602.2022.10008500","title":"Reinforcement Learning Based Congestion Control Mechanism for Opportunistic Networks","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Reinforcement learning; Node (physics); Routing protocol; Network congestion; Latency (audio); Overhead (engineering); Distributed computing; Routing (electronic design automation); Network packet; Artificial intelligence","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","sts"],"consensus_categories":[],"category_scores_codex":[0.001961623,0.0005621697,0.0007010159,0.000250166,0.001807157,0.0003721421,0.001618226,0.0002204448,0.00077487],"category_scores_gemma":[0.0000602172,0.0006306829,0.0003854868,0.000839752,0.00008538273,0.0003449039,0.0004275669,0.001135768,0.00002708852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004336274,"about_ca_system_score_gemma":0.0004219211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003031538,"about_ca_topic_score_gemma":0.000009946755,"domain_scores_codex":[0.9951441,0.0004863386,0.000977661,0.001135026,0.001012638,0.001244242],"domain_scores_gemma":[0.9965249,0.001004509,0.0006272499,0.001081188,0.0002652405,0.0004969683],"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.0002670819,0.000161251,0.00007991149,0.00002796311,0.0001167708,0.0001630957,0.000104844,0.8168215,0.00004332785,0.1036644,0.03139144,0.04715838],"study_design_scores_gemma":[0.002685976,0.0005951147,0.00001906335,0.00003865558,0.000112316,0.00005273618,0.0001486576,0.9738105,0.000009087879,0.003399628,0.01841876,0.0007095056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002114249,0.0001470104,0.989041,0.001892743,0.004878197,0.001374249,0.00004324743,0.0005955044,0.001816564],"genre_scores_gemma":[0.9833462,0.00004918158,0.00503803,0.005523985,0.0005416496,0.001141493,0.0003549749,0.00007474623,0.003929794],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.984003,"threshold_uncertainty_score":0.9996145,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02001665065275803,"score_gpt":0.2357903633519205,"score_spread":0.2157737126991625,"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."}}