{"paper":{"title":"Complexity Analysis of CSMA Scheduling via Dependencies Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mahdi Azarafrooz, R. Chandramouli","submitted_at":"2015-09-19T21:52:29Z","abstract_excerpt":"The complexity of a CSMA algorithm has been translated to the norm properties of a dependencies matrix.\n  The maximum throughput optimization is reformulated by including the dependencies matrix in the formulations. It has been shown that for the interference graphs $\\mathcal{G}$ that have minimum vertex cover size $\\mathcal{C}(\\mathcal{G})=\\log n$ where $n$ is the number of the links, the optimal strategy of the links is to transmit with the probability 1, i.e a service-rate agnostic approach.\n  Several numerical analyses have been conducted in order to illustrate the effect of the interferen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05939","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}