{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001508198,0.0005687407,0.0005430999,0.0005655217,0.0007531227,0.0005732813,0.001970251,0.0005382916,0.001222811],"category_scores_gemma":[0.003908351,0.0002284646,0.0002806738,0.0003018585,0.0008724087,0.001192353,0.0008609811,0.0009173432,0.0001377917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009987558,"about_ca_system_score_gemma":0.001125299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004544083,"about_ca_topic_score_gemma":0.003584033,"domain_scores_codex":[0.9993198,0.0001936978,0.00004187596,0.0001369555,0.0001915743,0.0001160739],"domain_scores_gemma":[0.9978253,0.00106951,0.0003263403,0.0001748299,0.00041776,0.0001862807],"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.0003162427,0.0003457045,0.002763317,0.0001400342,0.0001085011,0.0003599988,0.0003262626,0.7998393,0.01275013,0.05087017,0.003616397,0.1285639],"study_design_scores_gemma":[0.00002673356,0.00005870435,0.0001563091,0.00000436345,0.00001159156,0.00004551427,0.0000130801,0.9904931,0.001141669,0.006892456,0.001143495,0.00001304615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04374949,0.0002674861,0.951198,0.0002969338,0.000132979,0.0001231698,0.00003562681,0.0009127124,0.003283547],"genre_scores_gemma":[0.9667715,0.00007862606,0.03137574,0.0001052818,0.00004204245,0.0001057149,0.00002608231,0.00002960308,0.001465421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004544083,"threshold_uncertainty_score":0.009035289,"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."}}