{"id":"W2177944699","doi":"10.1109/twc.2009.081580","title":"An opportunistic-based protocol for bidirectional cooperative networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Protocol (science); Relay; Upper and lower bounds; Computer network; Outage probability; Channel (broadcasting); Selection (genetic algorithm); Cooperative diversity; Power (physics); Topology (electrical circuits); Mathematics; Fading","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.0009774342,0.0003962827,0.0003465943,0.0004686755,0.0007206203,0.0005794206,0.001087659,0.000504008,0.0009540688],"category_scores_gemma":[0.00227262,0.0001757581,0.0002345612,0.0005106718,0.0007519263,0.001047172,0.001461631,0.0005726276,0.0001559077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004536785,"about_ca_system_score_gemma":0.00074605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007928867,"about_ca_topic_score_gemma":0.001312362,"domain_scores_codex":[0.9993636,0.0002110636,0.00003050195,0.00006276746,0.0002564602,0.00007560039],"domain_scores_gemma":[0.9988483,0.0006064876,0.0001474482,0.0001569053,0.0001868004,0.00005405428],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003014924,0.0001642475,0.001530663,0.0004773798,0.0001080333,0.001367352,0.00113899,0.2354014,0.06179602,0.4686191,0.005719791,0.2233754],"study_design_scores_gemma":[0.00004649607,0.0001609357,0.0002605582,0.00004165461,0.00005270364,0.0008523622,0.0001822474,0.8982446,0.009126043,0.06930495,0.02166879,0.0000587669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01659318,0.0003838174,0.9769632,0.0001678677,0.00006864785,0.0001218719,0.00002693531,0.0001567385,0.005517797],"genre_scores_gemma":[0.8592115,0.000821644,0.1348978,0.0001997416,0.00006068319,0.0005218221,0.00007468589,0.00003706243,0.004175172],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001087659,"threshold_uncertainty_score":0.005169272,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09081092780281547,"score_gpt":0.3593649179714254,"score_spread":0.2685539901686099,"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."}}