{"id":"W2930568265","doi":"10.5539/mas.v13n4p89","title":"Hot Spot Phenomenon and Greedy Routing Failure in Mobile Ad-hoc Networks","year":2019,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Hot spot (computer programming); Mobile ad hoc network; Computer science; Computer network; Greedy algorithm; Routing (electronic design automation); Wireless ad hoc network; Path (computing); Phenomenon; Shortest path problem; Distributed computing; Telecommunications; Theoretical computer science; Algorithm; Wireless","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000985902,0.0004818299,0.0006770468,0.0008909696,0.0008751837,0.001085914,0.001037544,0.001108453,0.0007618291],"category_scores_gemma":[0.003564077,0.0003378825,0.0004163824,0.0009407552,0.001767441,0.002430738,0.001036972,0.0007561489,0.0001725985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006504185,"about_ca_system_score_gemma":0.0003692158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009134292,"about_ca_topic_score_gemma":0.0007774587,"domain_scores_codex":[0.9990521,0.0002640128,0.00005125669,0.0001581237,0.0002911692,0.00018333],"domain_scores_gemma":[0.997712,0.00127043,0.0004873376,0.000214049,0.0002149185,0.0001013279],"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.00103624,0.0001552926,0.03566724,0.001668606,0.0004610565,0.01233997,0.005230026,0.3174722,0.04722256,0.3339612,0.01210493,0.2326806],"study_design_scores_gemma":[0.00007463518,0.001177543,0.01853196,0.0002324754,0.0002960995,0.01873368,0.004417372,0.6595282,0.01969396,0.2486956,0.02833972,0.0002787772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4337755,0.01316993,0.5319327,0.002718491,0.0006474199,0.0001507255,0.0001359045,0.00078751,0.01668195],"genre_scores_gemma":[0.9873963,0.001867342,0.009076835,0.0001262771,0.0001707757,0.00003164937,0.00002723329,0.00002131719,0.001282356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001108453,"threshold_uncertainty_score":0.005214036,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007455340751670073,"score_gpt":0.2096545855996411,"score_spread":0.2021992448479711,"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."}}