41 search results - page 1 / 9 » A model framework for greedy routing in a sensor network wit... |
TOSN
2011
12 years 11 months ago
2011
A stochastic model is formulated and analyzed to study the advancements of messages under greedy routing in a sensor network with a power-saving scheme. The aim of this model is g...
SIAMAM
2010
13 years 3 months ago
2010
We address the stochastic characteristics of a recently-proposed greedy routing scheme. The stochastic behaviour of individual hop advancements is examined to observe the overall ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...
AAAI
2011
12 years 4 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...