Sciweavers

INFOCOM
2012
IEEE
13 years 9 months ago
Low-stretch greedy embedding heuristics
—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
Andrej Cvetkovski, Mark Crovella
210
Voted
IPSN
2011
Springer
14 years 10 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...