{"id":"W2097307683","doi":"10.1109/wts.2011.5960833","title":"Throughput optimization in wireless multihop networks with Successive Interference Cancellation","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scheduling (production processes); Computer science; Maximum throughput scheduling; Single antenna interference cancellation; Throughput; Computer network; Wireless mesh network; Wireless network; Wireless; Node (physics); Interference (communication); Transmission (telecommunications); Distributed computing; Channel (broadcasting); Mathematical optimization; Dynamic priority scheduling; Engineering; Quality of service; Round-robin scheduling; Telecommunications; Mathematics","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.001699437,0.0007601858,0.0006965897,0.0006617514,0.0004413007,0.0009867812,0.0007036807,0.0005984218,0.0009471578],"category_scores_gemma":[0.003103511,0.0003976833,0.0005996133,0.0008918518,0.0009513919,0.0008600774,0.0007616607,0.0007363278,0.0001521313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001610378,"about_ca_system_score_gemma":0.001110928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003786832,"about_ca_topic_score_gemma":0.002671537,"domain_scores_codex":[0.9992076,0.0003145965,0.0000198257,0.00006764419,0.0002528312,0.0001375978],"domain_scores_gemma":[0.998795,0.0008943739,0.0001021962,0.00005016062,0.0001268167,0.00003150608],"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.00001390266,0.00000660077,0.0001004474,0.00001795576,0.00000916448,0.00002330782,0.00001351992,0.9900435,0.0005814442,0.005743532,0.000114652,0.003332014],"study_design_scores_gemma":[0.000002350396,0.00000970055,0.00004073851,0.000002317942,0.000002040633,0.000004540278,0.000004788146,0.9966635,0.0002420764,0.002939755,0.00008612694,0.000001968279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04644544,0.0008540862,0.946113,0.0001977767,0.00004618833,0.0000384369,0.0000517305,0.0002722616,0.005980995],"genre_scores_gemma":[0.93059,0.0006259848,0.06645113,0.00006529795,0.00004166906,0.00007192988,0.00005113046,0.00005863114,0.002044203],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003786832,"threshold_uncertainty_score":0.01168418,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04536098870204255,"score_gpt":0.2560404458855566,"score_spread":0.2106794571835141,"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."}}