{"id":"W4312500313","doi":"10.1109/access.2022.3230991","title":"Adaptive Routing Protocol in Mobile Ad-Hoc Networks Using Genetic Algorithm","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Wireless Routing Protocol; Optimized Link State Routing Protocol; Computer network; Wireless ad hoc network; Mobile ad hoc network; Ad hoc wireless distribution service; Adaptive quality of service multi-hop routing; Routing protocol; Zone Routing Protocol; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Distributed computing; Algorithm; Routing (electronic design automation); Wireless; Telecommunications; Network packet","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.0005497049,0.0002466816,0.0002876947,0.0001666183,0.0003825646,0.0003566405,0.002647799,0.00007678695,0.00008888753],"category_scores_gemma":[0.000005898922,0.0002732645,0.0000798624,0.001562007,0.00004280136,0.0008300135,0.001759519,0.0006376717,0.000006086787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003697971,"about_ca_system_score_gemma":0.0001667636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007081264,"about_ca_topic_score_gemma":0.00002729119,"domain_scores_codex":[0.9971726,0.000346034,0.0004977087,0.0007718257,0.0004994978,0.0007123506],"domain_scores_gemma":[0.9986391,0.0001277692,0.0002688049,0.0007897665,0.00006206481,0.0001124965],"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.00001144623,0.00007002068,0.0004185613,0.000004102642,0.000007212749,0.0001048716,0.0002097986,0.668448,0.00001193483,0.00003680859,0.0001708271,0.3305064],"study_design_scores_gemma":[0.0006323442,0.0001790422,0.0008014775,0.00003137993,0.000004111463,0.00004469311,0.00004865104,0.9933096,0.00009850027,0.0004297752,0.004097405,0.0003230311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00703257,0.0003978571,0.9557614,0.00001499423,0.0008590388,0.03555574,0.000002843359,0.0001860501,0.0001895469],"genre_scores_gemma":[0.4492655,0.00002467334,0.1786312,0.0008243868,0.0007598966,0.3702688,0.000003462424,0.0001077265,0.0001144028],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7771302,"threshold_uncertainty_score":0.9999719,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03376955831848762,"score_gpt":0.313624816977331,"score_spread":0.2798552586588434,"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."}}