{"id":"W7108227258","doi":"10.1109/tmc.2025.3638816","title":"LearnRouter: A Reinforcement Learning-Based Routing for Opportunistic Mobile Networks Using Multi-Armed Bandit Approach","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Routing protocol; Routing (electronic design automation); Reinforcement learning; Transmission (telecommunications); Protocol (science); Adaptive routing; Dynamic Source Routing; Replication (statistics); Upper and lower bounds; Hierarchical routing","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.0006865103,0.0004962225,0.0007252576,0.0003564621,0.0003436099,0.0004984059,0.001292845,0.0006981076,0.001014979],"category_scores_gemma":[0.001135642,0.0002177457,0.0003262628,0.0002438075,0.000506038,0.0005865196,0.0007684365,0.000702142,0.0002023662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000535755,"about_ca_system_score_gemma":0.001011179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004805099,"about_ca_topic_score_gemma":0.004196561,"domain_scores_codex":[0.9997614,0.0000800327,0.00001084121,0.00004317276,0.00005932395,0.00004516301],"domain_scores_gemma":[0.9995126,0.0002612535,0.00008514831,0.00003484211,0.00006817213,0.00003802146],"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.00007825647,0.0001071524,0.0005895232,0.00004451628,0.00004953823,0.0000842996,0.00005616652,0.9185848,0.001925896,0.006245628,0.001544098,0.0706901],"study_design_scores_gemma":[0.000008913422,0.00002907226,0.00003536439,0.000001948946,0.000003605953,0.00001272682,0.000004342158,0.9984433,0.0002238035,0.0008462512,0.0003878712,0.00000278536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02234537,0.0002993539,0.9735268,0.0001930167,0.00005229193,0.00007917947,0.00002777921,0.001242531,0.002233707],"genre_scores_gemma":[0.810886,0.0002635476,0.1844705,0.000223853,0.00004589521,0.0002398377,0.0000769682,0.00008793037,0.003705483],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004805099,"threshold_uncertainty_score":0.009554267,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04299475508212949,"score_gpt":0.2975966587367513,"score_spread":0.2546019036546218,"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."}}