{"id":"W2781398886","doi":"10.1504/ijssc.2017.10010065","title":"A* search based next hop selection for routing in opportunistic networks","year":2017,"lang":"en","type":"article","venue":"International Journal of Space-Based and Situated Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Geographic routing; Routing protocol; Hop (telecommunications); Node (physics); Routing (electronic design automation); Distributed computing; Dynamic Source Routing; Benchmark (surveying); Wireless Routing Protocol; Geography; 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.0006411426,0.0003700363,0.0005228404,0.0009054685,0.0007448959,0.0006281158,0.001017585,0.0006223488,0.001241844],"category_scores_gemma":[0.00210264,0.0001628648,0.0003456532,0.00100985,0.0004352958,0.0008089958,0.0006525211,0.0005343958,0.0002976683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000450225,"about_ca_system_score_gemma":0.001091203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002313996,"about_ca_topic_score_gemma":0.003528273,"domain_scores_codex":[0.9995825,0.000147647,0.00003266344,0.00005740534,0.0001308332,0.00004904369],"domain_scores_gemma":[0.9988563,0.0006870667,0.0001445083,0.0001002727,0.000167004,0.00004479998],"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.0006526043,0.0003366855,0.003482736,0.0006735103,0.0002262481,0.0005587871,0.0003140378,0.3836177,0.0345411,0.08259878,0.01244564,0.4805521],"study_design_scores_gemma":[0.00004500282,0.0002455043,0.0005458941,0.00003745716,0.00003898962,0.000466345,0.00008262284,0.9681199,0.005245109,0.01597676,0.009168011,0.00002844755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03077623,0.002012978,0.9593043,0.0003525155,0.0002116678,0.0001861283,0.0001485519,0.0006927103,0.006314912],"genre_scores_gemma":[0.6544684,0.001655838,0.3369817,0.0002759975,0.0001018578,0.0003416064,0.000345287,0.0000599098,0.005769337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002313996,"threshold_uncertainty_score":0.004601002,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04688670825946679,"score_gpt":0.3033245187005038,"score_spread":0.256437810441037,"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."}}