Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks

  • Authors:

  • Su Xia;Xiaotian Yin;Hongyi Wu;Miao Jin;Xianfeng David Gu

  • Affiliations:

  • University of Louisiana, Lafayette, LA;Harvard University, Cambridge, MA;University of Louisiana, Lafayette, LA;University of Louisiana, Lafayette, LA;Stony Brook University, Stony Brook, NY

  • Venue:
  • MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

With both computational complexity and storage space bounded by a small constant, greedy routing is recognized as an appealing approach to support scalable routing in wireless sensor networks. However, significant challenges have been encountered in extending greedy routing from 2D to 3D space. In this research we develop decentralized solutions to achieve greedy routing in 3D sensor networks. Our proposed approach is based on a unit tetrahedron cell (UTC) mesh structure. We propose a distributed algorithm to realize volumetric harmonic mapping of the UTC mesh under spherical boundary condition. It is a one-to-one map that yields virtual coordinates for each node in the network. Since a boundary has been mapped to a sphere, node-based greedy routing is always successful thereon. At the same time, we exploit the UTC mesh to develop a face-based greedy routing algorithm, and prove its success at internal nodes. To deliver a data packet to its destination, face-based and node-based greedy routing algorithms are employed alternately at internal and boundary UTCs, respectively. As far as we know, this is the first work that realizes truly deterministic greedy routing with constant-bounded storage and computation in 3D wireless sensor networks.