2010 · 52 citations · 27 references
ComputingComputer ScienceMathematicsComputer NetworksDistributed SystemsTopologyGraph AlgorithmsNetwork TopologyRoutingRouting AlgorithmsSensor NetworksWireless Sensor NetworksDistributed Shortest Path AlgorithmsHomotopy Type TheoryJammingRicci FlowRouting Protocols For Wireless NetworksSensor Network ArchitecturesSensor Network RoutingWireless Sensor Network Routing
We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes are called homotopy equivalent. Two paths that pass around holes in different ways have different homotopy types. With a distributed algorithm we compute an embedding of the network in hyperbolic space by using Ricci flow such that paths of different homotopy types are mapped naturally to paths connecting s with different images of t. Greedy routing to a particular image is guaranteed with success to find a path with a given homotopy type. This leads to simple greedy routing algorithms that are resilient to both local link dynamics and large scale jamming attacks and improve load balancing over previous greedy routing algorithms.
27
Wireless sensor networks: a survey
Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam · Computer Networks · 2002 · 17.4K citations
Three-manifolds with positive Ricci curvature
Richard S. Hamilton · Journal of Differential Geometry · 1982 · 3K citations · Full text
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks
Prosenjit Bose, Pat Morin, Ivan Stojmenović et al. · Wireless Networks · 2001 · 1.2K citations