Spatial Distribution in Routing Table Design for Sensor Networks

—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph distance of any two nodes with constant factor upper and lower bounds, we augment it by storing the routing paths of pairs of nodes, selected in a spatial distribution, and show that the routing table enables 1 + ε stretch routing. In the wireless ad hoc and sensor network scenario, the geographic locations of the nodes serve as such an inaccurate distance oracle. Each node p selects O(log n loglog n) other nodes from a distribution proportional to 1/r2 where r is the distance to p and the routing paths to these nodes are stored on the nodes along these paths in the network. The routing algorithm selects links conforming to a set of sufficient conditions and guarantees with high probability 1+ε stretch routing with routing table size O( √ n log n loglog n) on average for each node. This scheme is favorab...

• Type: Conference
• Year: 2009
• Where: INFOCOM
• Authors: Rik Sarkar, Xianjin Zhu, Jie Gao
• Keywords: Communications, INFOCOM 2009, Routing, Routing Table, Routing Table Design