Sciweavers

497 search results - page 9 / 100
» Curve-Based Greedy Routing Algorithm for Sensor Networks
Sort
View
MONET
2006
102views more  MONET 2006»
13 years 8 months ago
Locating and Bypassing Holes in Sensor Networks
In real sensor network deployments, spatial distributions of sensors are usually far from being uniform. Such networks often contain regions without enough sensor nodes, which we ...
Qing Fang, Jie Gao, Leonidas J. Guibas
INFOCOM
2005
IEEE
14 years 2 months ago
GLIDER: gradient landmark-based distributed routing for sensor networks
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
Qing Fang, Jie Gao, Leonidas J. Guibas, V. de Silv...
MOBIHOC
2006
ACM
14 years 8 months ago
Minimizing recovery state In geographic ad-hoc routing
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
Noa Arad, Yuval Shavitt
MASS
2010
162views Communications» more  MASS 2010»
13 years 6 months ago
A metric for routing in delay-sensitive wireless sensor networks
Abstract--We present a new scheme to reduce the end-toend routing delay in the mission-critical applications of the wireless sensor networks (WSNs) under the duty cycle model. Whil...
Zhen Jiang, Jie Wu, Risa Ito
TAMC
2009
Springer
14 years 3 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens