{"id":"W2043762646","doi":"10.1016/j.adhoc.2008.07.003","title":"Game theoretic approach in routing protocol for wireless ad hoc networks","year":2008,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer network; Computer science; Ad hoc On-Demand Distance Vector Routing; Optimized Link State Routing Protocol; Routing protocol; Wireless ad hoc network; Flooding (psychology); Wireless Routing Protocol; Ad hoc wireless distribution service; Network packet; Dynamic Source Routing; Distributed computing; Wireless; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001548053,0.0007646476,0.0009136129,0.0001911061,0.0004654124,0.0002937514,0.002638718,0.000653902,0.0000228652],"category_scores_gemma":[0.00004006748,0.000731802,0.0003444665,0.001668006,0.0003668595,0.000760861,0.0008159619,0.001295181,0.00001923451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002489104,"about_ca_system_score_gemma":0.0001968261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004854902,"about_ca_topic_score_gemma":0.00003634662,"domain_scores_codex":[0.99397,0.0004351537,0.001185514,0.001689299,0.0005941286,0.00212591],"domain_scores_gemma":[0.9962106,0.0007686698,0.0005387489,0.001906786,0.0001920381,0.0003830964],"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.0003923269,0.0005367053,0.001955525,0.0001243066,0.00007300485,0.0001389119,0.001524651,0.6344496,0.000004011347,0.03501969,0.005705395,0.3200758],"study_design_scores_gemma":[0.00294132,0.0003533044,0.00108844,0.0002948756,0.00001382227,0.0001228787,0.00003896303,0.9796487,0.000008822421,0.001885334,0.01275139,0.000852139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001744654,0.001439545,0.9101521,0.0001200993,0.0005296455,0.0835527,0.000001806311,0.0005466772,0.00191278],"genre_scores_gemma":[0.639031,0.0005458611,0.03847521,0.0009508452,0.001234665,0.3190702,0.00004301834,0.0001881587,0.0004610353],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8716769,"threshold_uncertainty_score":0.9995133,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02231307666936859,"score_gpt":0.2606155269612441,"score_spread":0.2383024502918755,"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."}}