{"id":"W2993252065","doi":"10.1109/tcomm.2019.2957767","title":"Throughput-Oriented Non-Orthogonal Random Access Scheme for Massive MTC Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Science Basic Research Program of Shaanxi Province; Key Research and Development Projects of Shaanxi Province; National Science and Technology Major Project; National Mobile Communications Research Laboratory, Southeast University; Southeast University; National Natural Science Foundation of China","keywords":"Computer science; Throughput; Telecommunications link; Random access; Multiplexing; Optimization problem; Computer network; Particle swarm optimization; Noma; Distributed computing; Algorithm; Wireless; 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.001040983,0.0008014354,0.0006675174,0.0005893587,0.0006185622,0.0007442243,0.001486729,0.0006600451,0.0009843704],"category_scores_gemma":[0.002337904,0.0002074671,0.0005211537,0.0008029279,0.0006755328,0.0009592194,0.0009280129,0.0009144577,0.0003204696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007855993,"about_ca_system_score_gemma":0.0008087916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001107113,"about_ca_topic_score_gemma":0.001593236,"domain_scores_codex":[0.9990382,0.0003911481,0.00005198411,0.0001450501,0.0002577436,0.0001159364],"domain_scores_gemma":[0.9989154,0.0004252505,0.0002372429,0.0001454853,0.0002234629,0.0000530782],"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.0005458529,0.0002526435,0.001149203,0.0003810826,0.0001311319,0.0007755471,0.0003146113,0.6336848,0.06265631,0.1127455,0.006469636,0.1808937],"study_design_scores_gemma":[0.0000252934,0.000113112,0.0001134143,0.000007066064,0.00001813305,0.0001540268,0.00001005594,0.9916917,0.002049347,0.004613265,0.001185571,0.00001896409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01741081,0.0006094085,0.9785825,0.0001845103,0.00008878065,0.00005406317,0.00003063508,0.0003733113,0.002665986],"genre_scores_gemma":[0.9017701,0.0006612604,0.09506564,0.000171355,0.0001078733,0.0001754184,0.00007607624,0.0000364722,0.001936008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001486729,"threshold_uncertainty_score":0.005699992,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02660428065825239,"score_gpt":0.3002897360120764,"score_spread":0.273685455353824,"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."}}