{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003557291,0.0006574747,0.0007255055,0.0004420092,0.0004585156,0.0005560409,0.001238813,0.0008328863,0.001544883],"category_scores_gemma":[0.001105462,0.0002742122,0.0003276374,0.0005203352,0.0003754788,0.0008057514,0.0006242385,0.0006660561,0.0007466343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002006432,"about_ca_system_score_gemma":0.0004199873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008186279,"about_ca_topic_score_gemma":0.001509572,"domain_scores_codex":[0.9996942,0.00008152435,0.00001892726,0.00003967304,0.0001489348,0.00001664794],"domain_scores_gemma":[0.9997074,0.0001020837,0.00004720418,0.00003304125,0.00008309263,0.00002724696],"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.0003691889,0.000222855,0.001219255,0.0004776101,0.0001505133,0.0006801927,0.0002137758,0.3843796,0.04911452,0.02411892,0.01414988,0.5249037],"study_design_scores_gemma":[0.0000985704,0.000302515,0.0003647396,0.00001984745,0.00004345674,0.0005574836,0.00002960531,0.9498981,0.009207626,0.008289701,0.0311504,0.00003792009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01111747,0.0006155327,0.9805108,0.0001717362,0.0002001959,0.0001747919,0.0000680169,0.00183632,0.005305169],"genre_scores_gemma":[0.2252206,0.0006675796,0.7606044,0.0002344487,0.00006447191,0.0003999475,0.0003105988,0.0002214622,0.01227644],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001544883,"threshold_uncertainty_score":0.0051682,"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."}}