{"id":"W2791285730","doi":"10.1109/lcomm.2018.2797877","title":"A Power-Efficient and Social-Aware Relay Selection Method for Multi-Hop D2D Communications","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Relay; Computer science; Hop (telecommunications); Exploit; Computer network; Upload; Selection (genetic algorithm); Power consumption; Transmission (telecommunications); Power (physics); Telecommunications; Computer security; Artificial intelligence","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.0005430109,0.0007649809,0.0007531629,0.0006367778,0.00069188,0.0005536943,0.001164614,0.0006583328,0.001164552],"category_scores_gemma":[0.001385005,0.0002538866,0.0006936286,0.0009643725,0.0004436748,0.001028454,0.001024396,0.0005342591,0.0003929231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005420542,"about_ca_system_score_gemma":0.0008001941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001487405,"about_ca_topic_score_gemma":0.002135213,"domain_scores_codex":[0.9994147,0.0002062714,0.0000286212,0.0001128976,0.0001895427,0.00004797366],"domain_scores_gemma":[0.9995271,0.0002203646,0.00005652613,0.00005629996,0.0001081537,0.00003161034],"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.0001927782,0.000149711,0.001150795,0.0003233865,0.000148728,0.0003725716,0.000381032,0.5681453,0.02683083,0.04377348,0.007824915,0.3507065],"study_design_scores_gemma":[0.00001609348,0.00006023898,0.0001589208,0.000006755759,0.00002654804,0.0001648998,0.00004520413,0.9883477,0.002349271,0.006464481,0.002341738,0.0000181879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005895718,0.0003519493,0.9919742,0.0001317535,0.00004545834,0.0000411138,0.00002193872,0.00009181121,0.001445975],"genre_scores_gemma":[0.6154091,0.001181329,0.3769065,0.0001972797,0.0001842718,0.0002873421,0.0001303327,0.00004813137,0.005655626],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001487405,"threshold_uncertainty_score":0.003932953,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1046367194452691,"score_gpt":0.3780376339120289,"score_spread":0.2734009144667598,"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."}}