{"id":"W2076663834","doi":"10.1109/icwmc.2007.68","title":"POSANT: A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Destination-Sequenced Distance Vector routing; Ant colony optimization algorithms; Optimized Link State Routing Protocol; Link-state routing protocol; Dynamic Source Routing; Distributed computing; Wireless ad hoc network; Wireless Routing Protocol; Algorithm; Routing (electronic design automation); Routing protocol; Telecommunications; Wireless","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":[],"consensus_categories":[],"category_scores_codex":[0.001203299,0.0002197047,0.0002351555,0.00009659885,0.0002744792,0.0001912238,0.0006719968,0.0001736311,0.00003607313],"category_scores_gemma":[0.00001396913,0.0002079461,0.0001420043,0.0005290733,0.00003772053,0.0003613596,0.0001658497,0.0001924349,0.00001693886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001416618,"about_ca_system_score_gemma":0.00007213558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001006081,"about_ca_topic_score_gemma":0.00004894332,"domain_scores_codex":[0.9978591,0.00005037227,0.0004268283,0.000591172,0.000274779,0.000797814],"domain_scores_gemma":[0.9983532,0.0005458341,0.0001551803,0.0005915274,0.0001607596,0.0001935344],"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.00002578539,0.0001213762,0.00004553133,0.000006302027,0.00001592853,0.00003577857,0.0000966459,0.01165172,0.0001570959,0.003959751,0.002385961,0.9814981],"study_design_scores_gemma":[0.0007389094,0.0005037854,0.0003028404,0.00003487938,0.00001001771,0.00002254505,0.00002666646,0.9870842,0.001032512,0.0002282452,0.009738591,0.0002768036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001286521,0.000764335,0.994412,0.000160196,0.000720405,0.001069508,0.000003923594,0.0004657841,0.001117297],"genre_scores_gemma":[0.3913831,0.00002928324,0.6058618,0.001812495,0.0004131327,0.0001962422,0.00002895862,0.00003024245,0.0002447126],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9812213,"threshold_uncertainty_score":0.8479797,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008560779002223932,"score_gpt":0.2492589295957286,"score_spread":0.2406981505935047,"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."}}