Abstract | ||
---|---|---|
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 this
convergence notion, and by modeling the packet distance evolution to the
destination as a Markov process, we derive bounds on the expected number of
hops that each packet traverses to reach its destination. |
Year | Venue | Keywords |
---|---|---|
2011 | Clinical Orthopaedics and Related Research | markov process,wireless ad hoc network |
Field | DocType | Volume |
Equal-cost multi-path routing,Link-state routing protocol,Dynamic Source Routing,Computer science,Static routing,Destination-Sequenced Distance Vector routing,Computer network,Wireless Routing Protocol,Source routing,Geographic routing,Distributed computing | Journal | abs/1102.5 |
Citations | PageRank | References |
1 | 0.36 | 5 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Armin Banaei | 1 | 5 | 1.78 |
Daren B. H. Cline | 2 | 16 | 5.02 |
Costas N. Georghiades | 3 | 301 | 32.18 |
Shuguang Cui | 4 | 5382 | 368.45 |