{"id":"W1542789490","doi":"10.1007/0-387-23150-1_30","title":"Randomized Routing Algorithms in Mobile Ad Hoc Networks","year":2005,"lang":"en","type":"book-chapter","venue":"IFIP International Federation for Information Processing/IFIP","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Wireless Routing Protocol; Wireless ad hoc network; Heuristic; Computer network; Distributed computing; Optimized Link State Routing Protocol; Dynamic Source Routing; Greedy algorithm; Algorithm; Static routing; Routing (electronic design automation); Routing protocol; Artificial intelligence; Telecommunications","routes":{"ca_aff":true,"ca_fund":true,"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.002749335,0.001184304,0.001680498,0.001009927,0.0009171338,0.002070447,0.002895241,0.001953047,0.006697253],"category_scores_gemma":[0.009978485,0.0009356171,0.0006493549,0.002557841,0.001829538,0.003794359,0.001497997,0.002824245,0.002290744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001797317,"about_ca_system_score_gemma":0.001804768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00116275,"about_ca_topic_score_gemma":0.001377992,"domain_scores_codex":[0.9968844,0.001531097,0.0001317575,0.0004091433,0.0008469154,0.0001965384],"domain_scores_gemma":[0.9958496,0.00281957,0.000181473,0.0006950913,0.000369112,0.00008514881],"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.0002413257,0.0001818203,0.000212047,0.0004776741,0.00007552397,0.0000554345,0.00009143212,0.2351732,0.001959725,0.4485953,0.04609484,0.2668417],"study_design_scores_gemma":[0.0001653323,0.0001064734,0.0001499981,0.000100713,0.00003875019,0.0001067043,0.00003734796,0.5710471,0.001138759,0.3895335,0.03753949,0.00003586881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003297422,0.006491725,0.9743009,0.001262154,0.0009878197,0.000134642,0.0001360141,0.001001878,0.01238742],"genre_scores_gemma":[0.1524912,0.009590304,0.8013172,0.00113618,0.002018158,0.0009864643,0.0008423884,0.0005414859,0.03107648],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006697253,"threshold_uncertainty_score":0.02240461,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01439476128446215,"score_gpt":0.2618405975754782,"score_spread":0.247445836291016,"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."}}