{"id":"W2059929071","doi":"10.1145/1292331.1292409","title":"On high-throughput and fair multi-hop wireless ad hoc networks with MIMO","year":2006,"lang":"en","type":"article","venue":"","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Goodput; Computer network; Computer science; Wireless ad hoc network; Spatial multiplexing; Multiple Access with Collision Avoidance for Wireless; Ad hoc wireless distribution service; Throughput; MIMO; Vehicular ad hoc network; Wireless network; Service set; Network allocation vector; Wireless; Optimized Link State Routing Protocol; IEEE 802.11; Wi-Fi; Telecommunications; Channel (broadcasting)","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.003755512,0.0009931325,0.001119437,0.001055013,0.001827847,0.001603477,0.001223321,0.0007950682,0.001854529],"category_scores_gemma":[0.006421974,0.0005314618,0.0003574435,0.001055425,0.002630365,0.002527033,0.001835539,0.001331808,0.0004824621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001996935,"about_ca_system_score_gemma":0.001012236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002887499,"about_ca_topic_score_gemma":0.004092874,"domain_scores_codex":[0.9979462,0.0008419877,0.00005102213,0.0001415201,0.0007261406,0.000293142],"domain_scores_gemma":[0.9959239,0.002855754,0.0001624823,0.000415745,0.0005147959,0.0001272808],"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.0003944705,0.0001096579,0.0008846708,0.0002361805,0.00007990436,0.0005341249,0.0005638256,0.4026485,0.01011734,0.5178564,0.007693982,0.05888091],"study_design_scores_gemma":[0.00005744557,0.0001655598,0.0003265619,0.00005590354,0.00004210294,0.0002290928,0.00008440515,0.8597852,0.003145542,0.1252203,0.01082972,0.00005831477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02901861,0.008967345,0.9386184,0.001200305,0.0008667394,0.0001519169,0.00006452253,0.0002586879,0.02085344],"genre_scores_gemma":[0.9016569,0.007791242,0.07942254,0.0005975497,0.001952452,0.0002347555,0.00004887648,0.00009496121,0.008200706],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003755512,"threshold_uncertainty_score":0.01986128,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009222681585002388,"score_gpt":0.2225241946288882,"score_spread":0.2133015130438858,"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."}}