{"id":"W2890009228","doi":"10.1109/tvt.2018.2871036","title":"A Markov Model for Batch-Based Opportunistic Routing in Multi-Hop Wireless Mesh Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Research and Development Corporation of Newfoundland and Labrador","keywords":"Computer network; Computer science; Wireless mesh network; Markov chain; Markov model; Hop (telecommunications); Wireless; Markov process; Wireless network; Distributed computing; Telecommunications; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004472955,0.00032477,0.0004019628,0.0005806874,0.0003199104,0.00006339596,0.00117191,0.0006305973,0.00001056589],"category_scores_gemma":[0.00001510307,0.0003494375,0.0001642922,0.001243661,0.000307963,0.0001840085,0.00001254056,0.0006775768,0.00001516781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001942729,"about_ca_system_score_gemma":0.0001921611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002280344,"about_ca_topic_score_gemma":0.0004464331,"domain_scores_codex":[0.9975598,0.0000734697,0.0005024589,0.0008669652,0.0002043466,0.0007930023],"domain_scores_gemma":[0.9982014,0.0001679913,0.000146855,0.001179591,0.0001893608,0.0001148296],"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.0001053803,0.0008028387,0.00005897373,0.00003659724,0.00008446042,0.00009045292,0.0001817881,0.591296,0.00236015,0.0251886,0.0001732409,0.3796215],"study_design_scores_gemma":[0.001323758,0.0002492344,0.000009040816,0.00008738261,0.00002477772,0.00001861174,0.00002036848,0.9935561,0.003744402,0.0005601968,0.00005743808,0.0003486749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008050188,0.00001353425,0.9886779,0.001050249,0.0005450609,0.000830045,0.00001046715,0.0007966626,0.0000259022],"genre_scores_gemma":[0.8926473,0.00001468508,0.106089,0.0004299378,0.00003716025,0.0006195767,0.00000353651,0.0000439016,0.0001149182],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8845971,"threshold_uncertainty_score":0.9998958,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02527802448377576,"score_gpt":0.2617061739582279,"score_spread":0.2364281494744521,"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."}}