Sciweavers

67 search results - page 1 / 14
» A Stochastic Analysis of a Greedy Routing Scheme in Sensor N...
Sort
View
SIAMAM
2010
90views more  SIAMAM 2010»
13 years 3 months ago
A Stochastic Analysis of a Greedy Routing Scheme in Sensor Networks
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 ...
H. Paul Keeler, P. G. Taylor
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 4 months ago
A stochastic analysis of greedy routing in a spatially-dependent sensor network
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...
H. Paul Keeler
TOSN
2011
116views more  TOSN 2011»
12 years 11 months ago
A model framework for greedy routing in a sensor network with a stochastic power scheme
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...
Holger Paul Keeler, Peter G. Taylor
MOBIHOC
2004
ACM
14 years 4 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
INFOCOM
2007
IEEE
13 years 11 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—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 ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...