{"id":"W2789617153","doi":"10.1016/j.cose.2018.02.018","title":"An efficient intrusion detection in resource-constrained mobile ad-hoc networks","year":2018,"lang":"en","type":"article","venue":"Computers & Security","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Communication source; Node (physics); Intrusion detection system; Mobile ad hoc network; Wireless ad hoc network; Game theory; Resource (disambiguation); Computer network; Scheme (mathematics); Bayesian game; Bayesian probability; Distributed computing; Computer security; Artificial intelligence; Repeated game; Wireless; Network packet","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.0006598413,0.0005727707,0.001036615,0.001053645,0.0005937387,0.001094358,0.001028987,0.0005290761,0.0008942044],"category_scores_gemma":[0.002433232,0.0003227822,0.000346953,0.0008173987,0.000364569,0.00148945,0.0009253765,0.0005116187,0.0002002808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004980718,"about_ca_system_score_gemma":0.001020756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001678713,"about_ca_topic_score_gemma":0.001798616,"domain_scores_codex":[0.9990897,0.0002122249,0.00007279706,0.000178888,0.0003216435,0.0001246644],"domain_scores_gemma":[0.9990646,0.0004317825,0.00008138394,0.0001080542,0.0002645408,0.00004970742],"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.0009821716,0.0004161682,0.005547782,0.0003055794,0.000200744,0.000348536,0.0001498834,0.3144259,0.04701522,0.01503869,0.006283124,0.6092862],"study_design_scores_gemma":[0.00001183416,0.00007874944,0.0004213865,0.000004752832,0.0000180976,0.0001027,0.00001961397,0.9924832,0.004549711,0.001596142,0.0007077186,0.000006190396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1308538,0.001587263,0.8620457,0.0005105301,0.0002823036,0.0002391823,0.0001521429,0.001427515,0.002901565],"genre_scores_gemma":[0.8339631,0.0006514646,0.1623509,0.00009645434,0.0001109353,0.0001116724,0.0002096654,0.00003301766,0.002472817],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001678713,"threshold_uncertainty_score":0.00361377,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005712860112818473,"score_gpt":0.2268857756541001,"score_spread":0.2211729155412816,"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."}}