{"id":"W4231894427","doi":"10.32920/ryerson.14657526.v1","title":"A history-based energy-efficient routing protocol for opportunistic networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computer network; Routing protocol; Zone Routing Protocol; Network packet; Overhead (engineering); Enhanced Interior Gateway Routing Protocol; Energy consumption; Protocol (science); Energy (signal processing); Routing (electronic design automation); Wireless Routing Protocol; Engineering; Medicine; Mathematics; Electrical engineering","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"],"consensus_categories":[],"category_scores_codex":[0.0009132706,0.0007138462,0.0008594524,0.0001770614,0.0002343009,0.0005526683,0.001888426,0.0006853251,0.0002524819],"category_scores_gemma":[0.0000273563,0.0006832685,0.0005789931,0.0002050902,0.0001120565,0.00008577491,0.001726837,0.0007174476,0.000003269384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006727668,"about_ca_system_score_gemma":0.00378982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009151566,"about_ca_topic_score_gemma":0.00001470862,"domain_scores_codex":[0.9953904,0.0001893807,0.001076426,0.001754537,0.0006232152,0.0009660182],"domain_scores_gemma":[0.9956856,0.0004478536,0.0007582193,0.002068752,0.0005364856,0.0005031114],"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.0001751357,0.001300321,0.00004005119,0.0009833508,0.00021891,0.0007322539,0.0003247515,0.3472299,0.000009178836,0.3139103,0.1265564,0.2085194],"study_design_scores_gemma":[0.0008937703,0.00009156265,0.000002897184,0.0004608762,0.00003952639,0.00001274429,0.00001324676,0.9434685,0.000006869185,0.000516751,0.05371627,0.0007769736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"protocol","genre_scores_codex":[0.000001505294,0.00004128759,0.9258128,0.0002957229,0.002133596,0.05836728,0.00000973914,0.0005927387,0.01274533],"genre_scores_gemma":[0.09430004,0.000003140699,0.2408772,0.004798991,0.001237174,0.6520937,0.0004320689,0.0001374552,0.006120226],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6849356,"threshold_uncertainty_score":0.9995618,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07569004943726862,"score_gpt":0.2882568192028428,"score_spread":0.2125667697655742,"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."}}