{"id":"W2055617028","doi":"10.1109/icc.2013.6655119","title":"An ant-swarm inspired energy-efficient ad hoc on-demand routing protocol for mobile ad hoc networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Ant colony optimization algorithms; Wireless Routing Protocol; Computer network; Routing protocol; Optimized Link State Routing Protocol; Mobile ad hoc network; Wireless ad hoc network; Ad hoc wireless distribution service; Distributed computing; Routing (electronic design automation); Energy (signal processing); Protocol (science); Wireless; Telecommunications; Artificial intelligence","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.0006462631,0.0004860708,0.0004483194,0.0001325959,0.0004405516,0.0006962396,0.001803179,0.0002659341,0.0001387327],"category_scores_gemma":[0.00002539774,0.0003985772,0.0001872386,0.0005917261,0.00008622985,0.000651707,0.0004387787,0.0002868522,0.00007489422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001393793,"about_ca_system_score_gemma":0.0001195174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002228884,"about_ca_topic_score_gemma":0.00004258689,"domain_scores_codex":[0.9961599,0.0001747977,0.0007071642,0.001267468,0.0005098125,0.001180914],"domain_scores_gemma":[0.9969397,0.0003228385,0.0003114791,0.001713063,0.00026767,0.0004452439],"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.00007456206,0.0007381287,0.00005407439,0.00003024118,0.00003094601,0.000007884371,0.000417754,0.4099635,0.0001723032,0.009996817,0.009457311,0.5690565],"study_design_scores_gemma":[0.001582061,0.001716833,0.0001856472,0.00009083335,0.00000573411,0.000006883577,0.0000485883,0.9438853,0.0008374362,0.0004268269,0.05068126,0.0005325749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"protocol","genre_scores_codex":[0.005487141,0.0001553559,0.8795009,0.0001391946,0.0004096281,0.1120655,0.0000022426,0.000742293,0.001497713],"genre_scores_gemma":[0.2872427,0.00001953694,0.0403025,0.00161296,0.0005132201,0.6692094,0.00001306348,0.00008216851,0.001004474],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8391984,"threshold_uncertainty_score":0.9998466,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01570959591172321,"score_gpt":0.2714675877843334,"score_spread":0.2557579918726102,"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."}}