{"id":"W2044947776","doi":"10.1049/iet-com.2009.0461","title":"Improved channel access protocol for cooperative <i>ad hoc</i> networks","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Relay; Throughput; Bandwidth (computing); Node (physics); Multiple Access with Collision Avoidance for Wireless; Markov chain; Diversity gain; Hidden node problem; Channel (broadcasting); Optimized Link State Routing Protocol; Cooperative diversity; Data transmission; Wireless network; Wireless; MIMO; Telecommunications; Fading; Wi-Fi array","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.00109669,0.0004719068,0.0005765477,0.0005559013,0.0005107122,0.0007206117,0.0009058564,0.0006414946,0.001773529],"category_scores_gemma":[0.003438623,0.0001937921,0.0003625018,0.0007298333,0.0007642002,0.0008763862,0.0007558467,0.001070455,0.0003910994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001030149,"about_ca_system_score_gemma":0.001154269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003284052,"about_ca_topic_score_gemma":0.004119611,"domain_scores_codex":[0.9990109,0.0003513705,0.00005421384,0.0001048263,0.0003764306,0.0001021816],"domain_scores_gemma":[0.9986458,0.0006378131,0.0001520106,0.0001567035,0.0003589692,0.00004867948],"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.0004168797,0.0001887672,0.001092455,0.0004557233,0.0001287322,0.0006802951,0.000606017,0.5631115,0.0348952,0.2152174,0.01331917,0.1698878],"study_design_scores_gemma":[0.00005189711,0.0001981915,0.0002777689,0.00003502932,0.00004477285,0.00024399,0.00002505859,0.9615878,0.003051168,0.02090194,0.01354366,0.00003880958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01985168,0.00236213,0.9690884,0.0004449661,0.0002688451,0.0001870127,0.0001099452,0.0008187728,0.006868166],"genre_scores_gemma":[0.8016313,0.002677605,0.1861852,0.0003567371,0.0002200515,0.0006294818,0.0003993262,0.00008189666,0.007818287],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003284052,"threshold_uncertainty_score":0.007474303,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09320148142979909,"score_gpt":0.3867840101752733,"score_spread":0.2935825287454742,"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."}}