{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001437277,0.0002553244,0.0002610745,0.00005172844,0.0001842913,0.0002905921,0.0004770604,0.0001048024,0.0000138879],"category_scores_gemma":[0.000001797962,0.0001777845,0.0000383832,0.0003266141,0.00008425948,0.0003376574,0.0001773237,0.0002079292,0.00001910045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002455367,"about_ca_system_score_gemma":0.00002930854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001634375,"about_ca_topic_score_gemma":0.0004093401,"domain_scores_codex":[0.998463,0.00005951874,0.00019182,0.0005926489,0.0002430123,0.0004499545],"domain_scores_gemma":[0.9990349,0.0001489699,0.0000888514,0.0005613013,0.00005825543,0.0001076562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002307672,0.0007761139,0.003250896,0.00006240915,0.00006709914,0.0002006943,0.0004108524,0.1181269,0.00008878602,0.3742169,0.02812883,0.4744398],"study_design_scores_gemma":[0.002617815,0.0008730759,0.01248654,0.0001549613,0.000009113639,0.00002947014,0.00001571424,0.9676399,0.0003948534,0.00275186,0.01233148,0.0006951857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06958881,0.0002701154,0.9248084,0.0006080193,0.0001466075,0.00245558,0.000001391327,0.0003408383,0.001780233],"genre_scores_gemma":[0.9450126,0.00004231284,0.05168502,0.0006723705,0.0002271959,0.0007847457,0.00000441667,0.00002598081,0.001545336],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8754238,"threshold_uncertainty_score":0.724984,"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."}}