most citedHierarchical Bipartition Routing for delivery guarantee in sparse wireless ad hoc sensor networks with obstacles

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.NI2013★ 2 cited

Hierarchical Bipartition Routing for delivery guarantee in sparse wireless ad hoc sensor networks with obstacles

Daniel Gaußmann, Stefan Hoffmann, Egon Wanke

We introduce and evaluate a very simple landmark-based network partition technique called Hierarchical Bipartition Routing (HBR) to support routing with delivery guarantee in wirel…