13 search results - page 2 / 3 » The Convergence-Guaranteed Random Walk and Its Applications ... |
ADHOCNOW
2004
Springer
13 years 10 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
EUROPAR
2009
Springer
13 years 2 months ago
2009
Springer
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
GLOBECOM
2010
IEEE
13 years 2 months ago
2010
IEEE
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
MOBICOM
2010
ACM
13 years 5 months ago
2010
ACM
Finding a person in a public place, such as in a library, conference hotel, or shopping mall, can be difficult. The difficulty arises from not knowing where the person may be at t...