{"id":"W2584940104","doi":"10.1109/glocom.2016.7842325","title":"Throughput Analysis of Network Coding in Multi-Hop Wireless Mesh Networks Using Queueing Theory","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Retransmission; Computer science; Queueing theory; Linear network coding; Unicast; Computer network; Network packet; Coding (social sciences); Layered queueing network; Queue; Wireless network; Distributed computing; Wireless; 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.00247351,0.0006857034,0.0006039022,0.001147719,0.0004782547,0.001003907,0.0008734177,0.0006757794,0.0008699226],"category_scores_gemma":[0.01119093,0.0002790869,0.0004829455,0.0009688003,0.001214575,0.001900323,0.0007222625,0.0007698719,0.0001167366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002902504,"about_ca_system_score_gemma":0.001090666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004259571,"about_ca_topic_score_gemma":0.001531457,"domain_scores_codex":[0.9989436,0.000476983,0.00003527228,0.00008397311,0.0003120128,0.0001481963],"domain_scores_gemma":[0.9939027,0.004952549,0.0003168391,0.0002150914,0.0005485751,0.00006428559],"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.0000395697,0.00003035718,0.0006887508,0.00004927419,0.00001967304,0.00006285716,0.0000882313,0.9282532,0.0025229,0.06207139,0.0002927625,0.005881024],"study_design_scores_gemma":[0.000001147186,0.000006800071,0.0000950067,0.000003415979,0.000002629747,0.000007331247,0.000009982511,0.9924046,0.0002742919,0.007130496,0.00006151628,0.000002718113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.134513,0.002137756,0.8552149,0.0005970381,0.0000642821,0.00006352217,0.00009306741,0.0002350221,0.007081434],"genre_scores_gemma":[0.9819088,0.0009291139,0.01618868,0.0000476983,0.00004926322,0.00004521483,0.00003600931,0.00003707428,0.0007582028],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004259571,"threshold_uncertainty_score":0.02105927,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0807333449645538,"score_gpt":0.333492920550693,"score_spread":0.2527595755861392,"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."}}