{"id":"W4316076805","doi":"10.1109/ictacse50438.2022.10009849","title":"Offering New Routing Method in Ad hoc Networks using Ant Colony Algorithm","year":2022,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Ant colony optimization algorithms; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Latency (audio); Adaptive quality of service multi-hop routing; Optimized Link State Routing Protocol; Mobile ad hoc network; Distributed computing; Algorithm; Routing (electronic design automation); Routing protocol; Link-state routing protocol; Wireless; Telecommunications","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.000388275,0.0004814902,0.0005571247,0.0008316982,0.0005763881,0.001077901,0.0009803664,0.0008967808,0.001381063],"category_scores_gemma":[0.0009459543,0.0002446407,0.000469126,0.0008331505,0.0003467311,0.001546113,0.0004895257,0.0006931697,0.0005432708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003173487,"about_ca_system_score_gemma":0.000569701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001141083,"about_ca_topic_score_gemma":0.001225335,"domain_scores_codex":[0.9994856,0.0001166146,0.00003162486,0.00008489969,0.0002537645,0.00002750806],"domain_scores_gemma":[0.9996988,0.00009194043,0.00003120235,0.00003498292,0.000123463,0.00001970593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001136895,0.0002212947,0.001862727,0.0009840138,0.0002078784,0.0004721674,0.00032166,0.1775901,0.04455001,0.05580893,0.01263736,0.7052301],"study_design_scores_gemma":[0.0000973538,0.0003977359,0.0007971698,0.000104279,0.0001169761,0.001279916,0.0001656709,0.8738741,0.01603176,0.02426894,0.08278574,0.00008038673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01074451,0.003177484,0.9760282,0.000503743,0.0004800029,0.0001812451,0.00004886341,0.0009394694,0.007896477],"genre_scores_gemma":[0.240989,0.005759509,0.7360371,0.0003566362,0.0003643322,0.0003636373,0.0002412426,0.000168919,0.01571973],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001381063,"threshold_uncertainty_score":0.004620135,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02442801431245013,"score_gpt":0.2811146208888128,"score_spread":0.2566866065763627,"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."}}