{"paper":{"title":"Multi-Hop Routing and Scheduling in Wireless Networks in the SINR model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Even, Moti Medina, Yakov Matsri","submitted_at":"2011-04-07T13:44:46Z","abstract_excerpt":"We present an algorithm for multi-hop routing and scheduling of requests in wireless networks in the \\sinr\\ model. The goal of our algorithm is to maximize the throughput or maximize the minimum ratio between the flow and the demand.\n  Our algorithm partitions the links into buckets. Every bucket consists of a set of links that have nearly equivalent reception powers. We denote the number of nonempty buckets by $\\sigdiv$. Our algorithm obtains an approximation ratio of $O(\\sigdiv \\cdot \\log n)$, where $n$ denotes the number of nodes. For the case of linear powers $\\sigdiv =1$, hence the approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1330","kind":"arxiv","version":5},"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"}