{"id":"W2126051929","doi":"10.1109/vetecs.2003.1207124","title":"Load-aware on-demand routing (LAOR) protocol for mobile ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Ad hoc On-Demand Distance Vector Routing; Optimized Link State Routing Protocol; Routing protocol; Dynamic Source Routing; Link-state routing protocol; Wireless Routing Protocol; Distance-vector routing protocol; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Distributed computing; Network packet; Telecommunications; Wireless","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.0005468585,0.0003006207,0.0002843446,0.00004896778,0.0002768186,0.0002943457,0.00113415,0.0001775807,0.00005535236],"category_scores_gemma":[0.00002722338,0.0002510044,0.000156113,0.0003945119,0.00004538741,0.0004178882,0.0003325504,0.0002695676,0.00007675296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002333512,"about_ca_system_score_gemma":0.000227209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006266025,"about_ca_topic_score_gemma":0.00004612699,"domain_scores_codex":[0.9975803,0.00004438636,0.0004257184,0.0007904842,0.0003969849,0.0007621064],"domain_scores_gemma":[0.9982621,0.0002089807,0.000163933,0.001000111,0.0001685315,0.0001963529],"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.0001386377,0.0004605482,0.0001189195,0.00008303081,0.00004883038,0.00003474626,0.0006011307,0.6476474,0.0000280335,0.06434572,0.01796027,0.2685327],"study_design_scores_gemma":[0.005930487,0.001899565,0.0001335873,0.0003434252,0.000009637623,0.00002679971,0.00005025712,0.8141995,0.001187177,0.007512642,0.1678351,0.000871873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"protocol","genre_scores_codex":[0.0001091273,0.00004753065,0.8671817,0.0002293264,0.0002296377,0.1289023,0.000001016162,0.0004839429,0.002815406],"genre_scores_gemma":[0.07488444,0.000008400779,0.06430984,0.001877715,0.000692108,0.8564457,0.000004389134,0.00006610763,0.001711344],"genre_candidate":"protocol","genre_consensus":null,"teacher_disagreement_score":0.8028718,"threshold_uncertainty_score":0.9999942,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0185664943137992,"score_gpt":0.2885335713723678,"score_spread":0.2699670770585686,"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."}}