{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006808433,0.0006475457,0.0006301392,0.0006348907,0.0008510124,0.0009616924,0.001700964,0.0006498518,0.00128745],"category_scores_gemma":[0.001428839,0.000226581,0.0003396453,0.0008054636,0.0005026893,0.001307559,0.0009167338,0.0008113884,0.001018272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005643151,"about_ca_system_score_gemma":0.0007628251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001028342,"about_ca_topic_score_gemma":0.001869772,"domain_scores_codex":[0.9994165,0.0001621051,0.00004437802,0.00005839514,0.0002731855,0.00004552271],"domain_scores_gemma":[0.9992025,0.0002548255,0.000122458,0.0001809622,0.0002036014,0.00003571522],"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.0003304805,0.0002237972,0.001653819,0.001645668,0.0001601045,0.0006336775,0.0005157149,0.04302097,0.1076865,0.07388048,0.03383149,0.7364174],"study_design_scores_gemma":[0.0001788261,0.0009722271,0.002497816,0.0002069648,0.0002514503,0.002345096,0.0005158397,0.4845443,0.05572514,0.04630952,0.4061989,0.0002537392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02799196,0.007816322,0.936848,0.001547452,0.0009138589,0.0008890785,0.0005424942,0.004060308,0.01939053],"genre_scores_gemma":[0.5373824,0.01526363,0.420104,0.001189575,0.0007945658,0.00182152,0.002548099,0.0005081207,0.02038813],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001700964,"threshold_uncertainty_score":0.004306972,"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."}}