{"id":"W2044972695","doi":"10.1109/icet.2010.5638463","title":"Congestion aware nodes (CAN) based scheme for mobile 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":"Dalhousie University","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer network; Retransmission; Computer science; Network congestion; Mobile ad hoc network; Wireless ad hoc network; Packet loss; DSRFLOW; Queuing delay; Throughput; Overhead (engineering); Network packet; Queueing theory; Vehicular ad hoc network; Optimized Link State Routing Protocol; Routing protocol; Wireless; 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.001306846,0.0008226768,0.000636911,0.001138714,0.001724176,0.000748229,0.002167694,0.0008662406,0.001215849],"category_scores_gemma":[0.0028382,0.0002457239,0.0003833422,0.0008277774,0.0007680664,0.001512971,0.001746978,0.000905988,0.0003418936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001042185,"about_ca_system_score_gemma":0.001075675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002399215,"about_ca_topic_score_gemma":0.004557561,"domain_scores_codex":[0.9990329,0.0002693843,0.00007887353,0.0001695478,0.0003176167,0.0001318154],"domain_scores_gemma":[0.9985631,0.0003463209,0.0001880188,0.0002459656,0.000517957,0.000138735],"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.001378777,0.0004457744,0.004481743,0.001807953,0.0005060041,0.001436838,0.001702536,0.0989994,0.1393157,0.1026078,0.02983444,0.6174831],"study_design_scores_gemma":[0.0006955471,0.003343581,0.004980597,0.0002345428,0.001091932,0.00346584,0.0006131741,0.7032629,0.0698451,0.045649,0.1662661,0.000551758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1015709,0.008044469,0.8567983,0.001476947,0.002873606,0.002905493,0.0003670198,0.004612322,0.021351],"genre_scores_gemma":[0.8306023,0.001569764,0.1589221,0.0005155912,0.0003370517,0.0007848007,0.000295278,0.00007408058,0.006898959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002399215,"threshold_uncertainty_score":0.007561624,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01070112371316765,"score_gpt":0.2433070025254114,"score_spread":0.2326058788122437,"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."}}