Resilient routing for sensor networks using hyperbolic embedding of universal covering space

Authors:
Wei Zeng;Rik Sarkar;Feng Luo;Xianfeng Gu;Jie Gao
Affiliations:
Department of Computer Science, State University of New York at Stony Brook;Department of Computer Science, State University of New York at Stony Brook;Mathematics Department, Rutgers University;Department of Computer Science, State University of New York at Stony Brook;Department of Computer Science, State University of New York at Stony Brook
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 14
Cited 5

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
Highly-resilient, energy-efficient multipath routing in wireless sensor networks

ACM SIGMOBILE Mobile Computing and Communications Review
Geographic routing without location information

Proceedings of the 9th annual international conference on Mobile computing and networking
Computing surface hyperbolic structure and real projective structure

Proceedings of the 2006 ACM symposium on Solid and physical modeling
Locating and bypassing holes in sensor networks

Mobile Networks and Applications
Boundary recognition in sensor networks by topological methods

Proceedings of the 12th annual international conference on Mobile computing and networking
Network sketching or: "How Much Geometry Hides in Connectivity?--Part II"

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Minimising the effect of WiFi interference in 802.15.4 wireless sensor networks

International Journal of Sensor Networks
Discrete Surface Ricci Flow

IEEE Transactions on Visualization and Computer Graphics
Greedy routing with guaranteed delivery using Ricci flows

IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Ricci Flow for 3D Shape Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence
Geometric spanners for routing in mobile networks

IEEE Journal on Selected Areas in Communications
Jamming sensor networks: attack and defense strategies

IEEE Network: The Magazine of Global Internetworking

Low distortion delaunay embedding of trees in hyperbolic plane

GD'11 Proceedings of the 19th international conference on Graph Drawing
Hyperbolic delaunay complexes and voronoi diagrams made practical

Proceedings of the twenty-ninth annual symposium on Computational geometry
On the energy-delay trade-off in geographic forwarding in always-on wireless sensor networks: A multi-objective optimization problem

Computer Networks: The International Journal of Computer and Telecommunications Networking
A distributed delaunay triangulation algorithm based on centroidal voronoi tessellation for wireless sensor networks

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Differential forms for target tracking and aggregate queries in distributed networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.