{"id":"W2893834508","doi":"10.1109/mnet.2018.1700297","title":"Joint Opportunistic Routing and Intra-Flow Network Coding in Multi-Hop Wireless Networks: A Survey","year":2018,"lang":"en","type":"article","venue":"IEEE Network","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computer network; Wireless network; Routing protocol; Linear network coding; Wireless; Wireless Routing Protocol; Dynamic Source Routing; Distributed computing; Lossy compression; Multiple description coding; Routing (electronic design automation); Telecommunications; Network packet; Artificial intelligence","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.001396308,0.0008034751,0.0009719298,0.001510893,0.0005910945,0.001694639,0.001261031,0.001523894,0.001040327],"category_scores_gemma":[0.002014135,0.0005437601,0.0005399359,0.003563103,0.001375786,0.002849074,0.001043825,0.001283902,0.0004106565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008952637,"about_ca_system_score_gemma":0.001081846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001621038,"about_ca_topic_score_gemma":0.001173011,"domain_scores_codex":[0.9991413,0.0002486169,0.00006626758,0.0001245975,0.0003467911,0.0000723479],"domain_scores_gemma":[0.998494,0.001047009,0.00008637486,0.0001077178,0.0002222738,0.00004262747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008720691,0.0002375121,0.00202253,0.003266601,0.0001006541,0.0002785837,0.0003009324,0.06279334,0.00251415,0.1959415,0.007609798,0.7248473],"study_design_scores_gemma":[0.00005442159,0.0006949928,0.002980603,0.001950921,0.0002299812,0.003075943,0.0006774385,0.3499534,0.006972527,0.2512351,0.3819205,0.0002541073],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.009954878,0.5445284,0.4108095,0.00158512,0.0006899801,0.0001655699,0.0000714807,0.0001591499,0.03203578],"genre_scores_gemma":[0.2090528,0.6781228,0.1027915,0.0007254796,0.002367612,0.0003645119,0.0002077727,0.00008128924,0.006286196],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.001694639,"threshold_uncertainty_score":0.007384479,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1024289442613606,"score_gpt":0.2995819962318702,"score_spread":0.1971530519705095,"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."}}