{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000223498,0.0003631818,0.0003905592,0.0003645895,0.0003451119,0.0004783306,0.0007793037,0.0004049636,0.0007705376],"category_scores_gemma":[0.0007970359,0.0001077495,0.0002867423,0.0006337424,0.0001723469,0.0005411165,0.0004536162,0.0004646331,0.0002681326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002079761,"about_ca_system_score_gemma":0.0004315937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001047452,"about_ca_topic_score_gemma":0.002912803,"domain_scores_codex":[0.9998148,0.00004824203,0.00001327467,0.00002300925,0.00008652971,0.00001421996],"domain_scores_gemma":[0.9998021,0.00006657398,0.00002892218,0.000024641,0.00006250571,0.00001530009],"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.0002399705,0.0002973059,0.001621661,0.0006745253,0.0002041684,0.0007027176,0.0002135448,0.3212167,0.06576499,0.03690768,0.01882887,0.5533279],"study_design_scores_gemma":[0.00005291966,0.0002680328,0.000669867,0.00002155229,0.00005658914,0.0006076421,0.0000667807,0.9476241,0.007163158,0.006890413,0.03654521,0.00003382207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0454022,0.003227671,0.92404,0.0008145836,0.000811397,0.0004761676,0.000268274,0.001107741,0.02385202],"genre_scores_gemma":[0.6381822,0.003470997,0.3365745,0.0004987952,0.0001318702,0.0005656388,0.00068558,0.0001230357,0.01976736],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001047452,"threshold_uncertainty_score":0.002577722,"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."}}