{"id":"W2486094321","doi":"10.1016/j.comcom.2016.07.009","title":"Organized topology based routing protocol in incompletely predictable ad-hoc networks","year":2016,"lang":"en","type":"article","venue":"Computer Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"Nanjing University of Information Science and Technology; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Topology (electrical circuits); Routing protocol; Network topology; Computer network; Distributed computing; Routing (electronic design automation); Node (physics); Routing table; Wireless ad hoc network; Mathematics; Telecommunications","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.0007308832,0.0002750268,0.0004553778,0.0006434047,0.0007170396,0.0009429456,0.00113069,0.0004562946,0.0004728463],"category_scores_gemma":[0.001873104,0.0002416036,0.0001982346,0.0006563863,0.0005136394,0.00122328,0.001011196,0.000528876,0.0001164699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004326436,"about_ca_system_score_gemma":0.0007367686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006265228,"about_ca_topic_score_gemma":0.001159622,"domain_scores_codex":[0.9995875,0.0001277101,0.00003571815,0.00005851709,0.0001516678,0.00003891022],"domain_scores_gemma":[0.9986313,0.0005335303,0.0002551132,0.0002755393,0.0002183823,0.00008621604],"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.0004913475,0.0001880682,0.002786696,0.0002415619,0.0001232661,0.0006378508,0.0005192297,0.7404124,0.02899271,0.1233037,0.003336628,0.09896658],"study_design_scores_gemma":[0.00002955353,0.0002060163,0.0005573632,0.00001297549,0.00004154374,0.0001852045,0.00009701398,0.9590387,0.005385432,0.03132097,0.00310591,0.00001943452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1417557,0.0006754231,0.8518512,0.0004185259,0.0001753924,0.0001419003,0.0001970342,0.0005847279,0.004200208],"genre_scores_gemma":[0.9311132,0.0003602091,0.0659152,0.0000624072,0.00004953373,0.0001044071,0.00022552,0.00003141022,0.00213804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00113069,"threshold_uncertainty_score":0.003865361,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04124923082441778,"score_gpt":0.286514547669909,"score_spread":0.2452653168454912,"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."}}