{"id":"W2039469367","doi":"10.1016/j.comcom.2007.10.024","title":"A game-theoretic intrusion detection model for mobile ad hoc networks","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Intrusion detection system; Mobile ad hoc network; Overhead (engineering); Node (physics); Network packet; Computer network; Wireless ad hoc network; Resource allocation; Distributed computing; Resource (disambiguation); Service (business); Computer security; Wireless; Operating system","routes":{"ca_aff":true,"ca_fund":true,"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.003189923,0.00153351,0.002103357,0.001191469,0.0009354713,0.003563604,0.004604999,0.003049765,0.002932112],"category_scores_gemma":[0.008090634,0.0009182679,0.001219011,0.001497976,0.002644869,0.004386266,0.00228315,0.002571671,0.0006305228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002745442,"about_ca_system_score_gemma":0.002024527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005340953,"about_ca_topic_score_gemma":0.003740698,"domain_scores_codex":[0.9966245,0.00166744,0.0001291922,0.0005104164,0.0006816285,0.0003869782],"domain_scores_gemma":[0.995324,0.003247786,0.0003660448,0.0002291476,0.0005117938,0.0003213484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001637639,0.000153767,0.0006824797,0.0001308615,0.000103305,0.0002533297,0.0002171761,0.5961924,0.001527851,0.3835328,0.002502147,0.01454009],"study_design_scores_gemma":[0.00003688905,0.00005467584,0.00006017974,0.000008330159,0.00002126901,0.00005824105,0.00001968781,0.9232566,0.0001137118,0.07539206,0.0009625528,0.00001581482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02337421,0.000429572,0.9648201,0.001343816,0.0001264336,0.0002343841,0.0002285124,0.0001956554,0.009247236],"genre_scores_gemma":[0.880258,0.0008376221,0.1050292,0.0004337335,0.0001847146,0.0004525805,0.000208815,0.00004963416,0.01254572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005340953,"threshold_uncertainty_score":0.01991963,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02188444540775204,"score_gpt":0.2752206278828226,"score_spread":0.2533361824750706,"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."}}