{"id":"W3160406857","doi":"10.5121/ijasuc.2021.12201","title":"Optimum Neighbors for Resource-Constrained Mobile Ad Hoc Networks","year":2021,"lang":"en","type":"article","venue":"International Journal of Ad hoc Sensor & Ubiquitous Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Wireless ad hoc network; Network packet; Optimized Link State Routing Protocol; Node (physics); Routing protocol; Throughput; Distributed computing; Bandwidth (computing); Wireless; Telecommunications; 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.0009169508,0.0004943727,0.0007519471,0.0006798111,0.0007444857,0.0009993174,0.0007831055,0.0008170365,0.002200891],"category_scores_gemma":[0.004168694,0.0003826574,0.0003684568,0.0006331978,0.0007759509,0.002207671,0.0007406697,0.0007484108,0.000422558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004520669,"about_ca_system_score_gemma":0.0004526799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006529279,"about_ca_topic_score_gemma":0.001319355,"domain_scores_codex":[0.9992263,0.0002717067,0.00004108778,0.0001434689,0.0002588977,0.00005851949],"domain_scores_gemma":[0.998838,0.0007446922,0.0001264893,0.00008374815,0.0001648205,0.00004231843],"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.0002267019,0.00006184701,0.001438385,0.0007748307,0.00007705284,0.0004452537,0.0003034119,0.5381132,0.007505933,0.3304479,0.005371766,0.1152337],"study_design_scores_gemma":[0.00007845674,0.0002989539,0.000595596,0.0001524292,0.00007071131,0.0009483499,0.000250172,0.8016052,0.00343939,0.1511029,0.04139253,0.00006530335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02686209,0.00953877,0.9469808,0.000664732,0.0003963199,0.0001244019,0.000102105,0.0002002975,0.01513052],"genre_scores_gemma":[0.570345,0.01049595,0.4096176,0.0002890537,0.0003937685,0.0002795013,0.0001598224,0.0001259089,0.008293303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002200891,"threshold_uncertainty_score":0.007362723,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0125104412385799,"score_gpt":0.2680211108180769,"score_spread":0.255510669579497,"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."}}