{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001288924,0.0001067552,0.0001104472,0.00007337306,0.00008820988,0.00007148935,0.0006061685,0.00004109234,0.00009284837],"category_scores_gemma":[0.000008909828,0.00008532213,0.00001326556,0.0005830042,0.00004069859,0.0006212005,0.000202748,0.0001364285,0.000004966492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005428385,"about_ca_system_score_gemma":0.0000423807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001120184,"about_ca_topic_score_gemma":0.001711455,"domain_scores_codex":[0.999213,0.00009942716,0.0001829931,0.000253854,0.00008440426,0.0001663611],"domain_scores_gemma":[0.9992469,0.0000648763,0.0000856885,0.0004226708,0.0001395958,0.00004029149],"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.00006760224,0.0001866675,0.02261589,0.000008087193,0.00002131069,0.00001255319,0.008814372,0.6667914,0.00007621717,0.1464387,0.0001620911,0.1548051],"study_design_scores_gemma":[0.0002825637,0.0000467481,0.002896417,0.00005572196,0.000001226707,0.000001596713,0.0000500883,0.9961199,0.0003471384,0.00004030695,0.00002497497,0.0001332976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00385603,0.0000849907,0.981719,0.0001554254,0.00008342458,0.0001521975,9.261659e-8,0.00009396209,0.01385489],"genre_scores_gemma":[0.9239817,0.000355959,0.07529166,0.0001809749,0.00001440601,0.00002077511,0.00000316162,0.000005747991,0.0001456395],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9201257,"threshold_uncertainty_score":0.3479335,"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."}}