{"id":"W2034657792","doi":"10.1109/jsyst.2013.2294881","title":"On the Overheads of Ad Hoc Routing Schemes","year":2014,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Link-state routing protocol; Wireless Routing Protocol; Dynamic Source Routing; Optimized Link State Routing Protocol; Distributed computing; Wireless ad hoc network; Destination-Sequenced Distance Vector routing; Static routing; Routing protocol; Adaptive quality of service multi-hop routing; Mobile ad hoc network; Ad hoc wireless distribution service; Policy-based routing; Routing (electronic design automation); 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":[],"consensus_categories":[],"category_scores_codex":[0.002054323,0.0001181038,0.0002120227,0.00005688928,0.0002033591,0.0002314896,0.001020804,0.00006024573,0.000009257467],"category_scores_gemma":[0.0001067666,0.00007288501,0.0001031812,0.0001966837,0.00003496803,0.0002028598,0.00006308557,0.000388715,0.00003989605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004800817,"about_ca_system_score_gemma":0.00005386999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005127434,"about_ca_topic_score_gemma":0.00000130634,"domain_scores_codex":[0.9982554,0.0003438973,0.0004388109,0.0001673322,0.0005109993,0.0002835189],"domain_scores_gemma":[0.9983317,0.0004502618,0.0004457602,0.0005548071,0.0001242527,0.0000932096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003718161,0.0001652259,0.001651087,0.0001064077,0.0002301758,0.00005082976,0.002080983,0.1378194,0.00725647,0.6858463,0.07496253,0.08979342],"study_design_scores_gemma":[0.0008435344,0.0005374609,0.0006920559,0.001223226,0.00001505547,0.0008954816,0.00007371565,0.9477617,0.002864408,0.004685258,0.04003694,0.0003711736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1810111,0.0009844132,0.807523,0.0005682506,0.004780997,0.000197749,5.905049e-7,0.00005572313,0.004878259],"genre_scores_gemma":[0.9982535,0.00002002571,0.0007259942,0.0001442444,0.0006329399,0.000005469946,4.861895e-8,0.000009810888,0.0002079699],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8172424,"threshold_uncertainty_score":0.2972164,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01598621794365901,"score_gpt":0.2335851013778419,"score_spread":0.2175988834341829,"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."}}