{"id":"W3033527907","doi":"10.1016/j.comnet.2020.107350","title":"Power allocation and resource assignment for secure D2D communication underlaying cellular networks: A Tabu search approach","year":2020,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Polytechnique Montréal","keywords":"Computer science; Eavesdropping; Tabu search; Cellular network; Power control; Mathematical optimization; Resource allocation; Distributed computing; Computational complexity theory; Computer network; Algorithm; Power (physics); Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.001224344,0.001246543,0.001329538,0.001851567,0.000782057,0.001645832,0.001414544,0.001638335,0.01001068],"category_scores_gemma":[0.00377426,0.0007712837,0.0007201706,0.002278547,0.001060795,0.001266951,0.0009881172,0.001006704,0.000802105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001544945,"about_ca_system_score_gemma":0.00182899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008937494,"about_ca_topic_score_gemma":0.007774053,"domain_scores_codex":[0.9994631,0.0002752241,0.00001541216,0.00006546191,0.00007373613,0.0001070175],"domain_scores_gemma":[0.9984938,0.001205694,0.0000794838,0.00005190966,0.000125363,0.00004375124],"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.00008518297,0.00004961808,0.0002514765,0.000078784,0.00003603542,0.00003637389,0.0000475673,0.9566983,0.0003905592,0.007564486,0.002468083,0.03229356],"study_design_scores_gemma":[0.00002687464,0.00002483688,0.00005211574,0.00001172264,0.00001067434,0.00001221811,0.00003175813,0.9936279,0.0001286608,0.005722782,0.0003467278,0.000003709314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07507439,0.002726728,0.8965824,0.001232016,0.0001666518,0.0003289074,0.0005185935,0.0008374689,0.02253282],"genre_scores_gemma":[0.7076847,0.001184753,0.2801938,0.0004455868,0.0001210906,0.0004268472,0.0003484894,0.0002261772,0.009368545],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01001068,"threshold_uncertainty_score":0.03348911,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04357913623413174,"score_gpt":0.2530814827378911,"score_spread":0.2095023465037593,"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."}}