Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Analysis of Average Travel Time for Stateless Opportunistic Routing
  Techniques   Wireless network applications, such as, searching, routing, self
stabilization and query processing can be modeled as random walks on graphs.
Stateless Opportunistic routing technique is a robust distributed routing
technique based on random walk approach, where nodes transfer the packets to
one of their direct neighbors uniformly, until the packets reach their
destinations. Simplicity in execution, fault tolerance, low overhead and
robustness to topology changes made it more suitable to wireless sensor
networks scenarios. But the main disadvantage of stateless opportunistic
routing is estimating and studying the effect of network parameters on the
packet latency. In this work, we derived the analytical expressions for mean
latency or average packet travel time for r-nearest neighbor cycle, r-nearest
neighbor torus networks. Further, we derived the generalized expression for
mean latency for m-dimensional r- nearest neighbor torus networks and studied
the effect of number of nodes, nearest neighbors and network dimension on
average packet travel time.

16
The categories of this paper are: stat
20
The categories of this paper are: acc-phys
10
The categories of this paper are: q-bio
35
The categories of this paper are: mtrl-th
34
The categories of this paper are: chem-ph
17
The categories of this paper are: q-fin
26
The categories of this paper are: bayes-an
29
The categories of this paper are: funct-an
6
The categories of this paper are: astro-ph
23
The categories of this paper are: solv-int
28
The categories of this paper are: alg-geom
14
The categories of this paper are: math-ph
7
The categories of this paper are: hep-th
33
The categories of this paper are: plasm-ph
32
The categories of this paper are: atom-ph
5
The categories of this paper are: gr-qc