{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006084254,0.0002272369,0.0002261645,0.00009618454,0.001337884,0.0006938623,0.008041583,0.0001276221,0.00003178921],"category_scores_gemma":[0.0001788215,0.0002140232,0.0001112203,0.0007396922,0.0002309706,0.0009746465,0.002947166,0.0007305913,0.00001444514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003514584,"about_ca_system_score_gemma":0.0001763467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003678685,"about_ca_topic_score_gemma":0.0007798167,"domain_scores_codex":[0.9985055,0.0002376891,0.000417152,0.0003749956,0.0001035777,0.0003611248],"domain_scores_gemma":[0.9932986,0.0006421916,0.0002113475,0.004961472,0.0007367745,0.0001495453],"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.0001164412,0.001657775,0.0001165163,0.00005333219,0.0001774656,6.854778e-7,0.004232764,0.001116475,0.01846679,0.4961948,0.05508659,0.4227804],"study_design_scores_gemma":[0.0008900358,0.00007845682,0.0001303036,0.00002493656,0.000005089497,0.000003824483,0.00001875861,0.5501966,0.0006159694,0.0008860186,0.4468863,0.0002636306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"protocol","genre_scores_codex":[0.00004832314,0.0002614186,0.894545,0.01540267,0.0003321742,0.08309118,0.00001291247,0.00048481,0.00582151],"genre_scores_gemma":[0.1323002,0.0007439406,0.1350243,0.002811249,0.0001822286,0.7278748,0.00008457393,0.00005446196,0.0009243462],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7595207,"threshold_uncertainty_score":0.9999622,"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."}}