{"paper":{"title":"On the Random 1/2-Disk Routing Scheme in Wireless Ad Hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Armin Banaei, Costas N. Georghiades, Daren B.H. Cline, Shuguang Cui","submitted_at":"2011-02-28T18:54:33Z","abstract_excerpt":"Random 1/2-disk routing in wireless ad-hoc networks is a localized geometric routing scheme in which each node chooses the next relay randomly among the nodes within its transmission range and in the general direction of the destination. We introduce a notion of convergence for geometric routing schemes that not only considers the feasibility of packet delivery through possibly multi-hop relaying, but also requires the packet delivery to occur in a finite number of hops. We derive sufficient conditions that ensure the asymptotic \\emph{convergence} of the random 1/2-disk routing scheme based on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5739","kind":"arxiv","version":2},"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"}