Trace-routing in 3D wireless sensor networks: a deterministic approach with constant overhead

We propose a distributed and deterministic routing algorithm with constant storage, communication and computation overhead, dubbed trace-routing, for strong-connected 3D wireless sensor networks. Its basic idea is to construct a virtual cutting plane that intersects boundary surface to yield a trace, along which a routing path with guaranteed delivery can be established. We prove the correctness of trace-routing under both continuous and discrete settings. We implement the trace-routing algorithm on Crossbow sensors and carry out extensive simulations to evaluate its routing efficiency.