{"id":"W2099912442","doi":"10.1109/glocom.2009.5425571","title":"On Reducing Blocking Probability in Cooperative Ad-hoc Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Blocking (statistics); Computer network; Wireless ad hoc network; Multiple Access with Collision Avoidance for Wireless; Throughput; Markov chain; Relay; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Transmission (telecommunications); Markov process; Protocol (science); Stochastic geometry models of wireless networks; Channel (broadcasting); Carrier sense multiple access with collision avoidance; Distributed computing; Wireless; Telecommunications","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.002407423,0.0008322531,0.0008108732,0.000630175,0.001044559,0.0007415999,0.001109169,0.0005855681,0.0008835871],"category_scores_gemma":[0.01008377,0.0004424244,0.000309587,0.0009157896,0.001403448,0.001639898,0.001173554,0.0009208127,0.0003693438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009789924,"about_ca_system_score_gemma":0.001649309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003141014,"about_ca_topic_score_gemma":0.002487119,"domain_scores_codex":[0.9980218,0.0006798214,0.0000627846,0.0001454297,0.0007735291,0.0003164929],"domain_scores_gemma":[0.9880837,0.008736487,0.001036812,0.0007381376,0.001104218,0.0003006814],"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.0003866878,0.0002338198,0.002916843,0.0002740524,0.00009001043,0.0002692404,0.0006330751,0.8259578,0.02359007,0.06352215,0.0014136,0.08071262],"study_design_scores_gemma":[0.00003940154,0.0002319006,0.0004068993,0.00002097603,0.00005179947,0.000183988,0.00007294565,0.9670442,0.005792376,0.02402456,0.002109887,0.00002094869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09683239,0.001837328,0.8962458,0.0002912611,0.0000614879,0.00006493091,0.00003003298,0.0004279122,0.004208895],"genre_scores_gemma":[0.9296885,0.001933577,0.06595741,0.0001107799,0.0000789534,0.0001486671,0.00005686942,0.00008582284,0.001939465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003141014,"threshold_uncertainty_score":0.01273179,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03702784373588706,"score_gpt":0.2848486567798063,"score_spread":0.2478208130439193,"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."}}