{"id":"W2097324407","doi":"10.1109/icc.2007.196","title":"Enhanced Intrusion Detection System for Discovering Malicious Nodes in Mobile Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer network; Computer science; Intrusion detection system; Wireless ad hoc network; Mobile ad hoc network; Node (physics); Network partition; Vehicular ad hoc network; Throughput; Routing protocol; Computer security; Routing (electronic design automation); Wireless; Network packet; Engineering; 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.001070482,0.0005724238,0.0008308091,0.001281062,0.0004276533,0.0006538773,0.00101607,0.0007163419,0.0009226759],"category_scores_gemma":[0.002526095,0.0002623043,0.0002915551,0.0004404391,0.0003639691,0.001703741,0.0008948726,0.0007102212,0.0004043263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003198399,"about_ca_system_score_gemma":0.000443605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00051403,"about_ca_topic_score_gemma":0.0005639709,"domain_scores_codex":[0.9991325,0.0002089343,0.0001015523,0.0001530194,0.0003291063,0.00007489266],"domain_scores_gemma":[0.9982343,0.0005882531,0.0001928666,0.0002599852,0.0006178265,0.0001066952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001769056,0.0009071568,0.01548135,0.0004389729,0.0002872612,0.001505372,0.0006633117,0.02037849,0.2326883,0.005880381,0.009400425,0.7105999],"study_design_scores_gemma":[0.0003059311,0.001976755,0.008059023,0.00006352735,0.0004020008,0.003696879,0.0001061533,0.7563382,0.2017981,0.003051212,0.02407152,0.0001307415],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1659744,0.001326654,0.8017216,0.0003285928,0.0002801231,0.0004852129,0.0001486201,0.02637364,0.003361134],"genre_scores_gemma":[0.6986715,0.0005358383,0.2953753,0.0003901974,0.0001309057,0.0002453869,0.0003965376,0.0001388187,0.004115603],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001281062,"threshold_uncertainty_score":0.005661309,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006723387109422721,"score_gpt":0.2325099173924055,"score_spread":0.2257865302829827,"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."}}