{"id":"W2050660285","doi":"10.1109/wons.2010.5437122","title":"On average and maximum load of greedy routing in wireless ad hoc networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Wireless ad hoc network; Node (physics); Destination-Sequenced Distance Vector routing; Greedy algorithm; Dynamic Source Routing; Static routing; Routing (electronic design automation); Computer network; Routing protocol; Distributed computing; Algorithm; Wireless; Engineering","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.002137325,0.0008447933,0.0009972212,0.001346215,0.0008268885,0.001275336,0.00139638,0.000957444,0.001189303],"category_scores_gemma":[0.01736551,0.0006058603,0.0005269249,0.001407769,0.001883873,0.004730872,0.001277433,0.0008278532,0.0002978886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00159586,"about_ca_system_score_gemma":0.0007131032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002909781,"about_ca_topic_score_gemma":0.001821283,"domain_scores_codex":[0.998648,0.0005024551,0.00004120821,0.0001740743,0.0004747238,0.000159543],"domain_scores_gemma":[0.991206,0.007054415,0.0004247163,0.0005880392,0.0005522874,0.0001745768],"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.000114205,0.00005134063,0.001408998,0.00008970992,0.00003120644,0.0000676038,0.00008709099,0.9332495,0.001680589,0.04753382,0.001138436,0.01454745],"study_design_scores_gemma":[0.000006796626,0.0000352916,0.0004987088,0.00001288499,0.000009147203,0.00005348377,0.00003776791,0.9509978,0.0004891695,0.04738433,0.0004612619,0.00001345736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2954573,0.004023403,0.6779423,0.001468354,0.0002362834,0.00006203019,0.0003703465,0.0006772815,0.0197627],"genre_scores_gemma":[0.9763533,0.001894961,0.01925238,0.000145851,0.0002509936,0.0000876706,0.0001869494,0.0001748708,0.001653055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002909781,"threshold_uncertainty_score":0.0115788,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006818957482990537,"score_gpt":0.2127247088661398,"score_spread":0.2059057513831493,"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."}}