Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space

—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.

• Type: Journal
• Year: 2010
• Where: INFOCOM
• Authors: Wei Zeng, Rik Sarkar, Feng Luo 0002, Xianfeng Gu, Jie Gao
• Keywords: Communications, Greedy Routing Algorithms, Homotopy Type, INFOCOM 2010, Two Paths