Three-dimensional greedy routing in large-scale random wireless sensor networks

In this paper, we investigate how to design greedy routing to achieve sustainable and scalable in a large-scale three-dimensional (3D) sensor network. Several 3D position-based routing protocols were proposed to seek either delivery guarantee or energy-efficiency in 3D wireless networks. However, recent results showed that there is no deterministic localized routing algorithm that guarantees either delivery of packets or energy-efficiency of its routes in 3D networks. In this paper, we focus on design of 3D greedy routing protocols which can guarantee delivery of packets and/or energy-efficiency of their paths with high probability in a randomly deployed 3D sensor network. In particular, we first study the asymptotic critical transmission radius for 3D greedy routing to ensure the packet delivery in large-scale random 3D sensor networks, then propose a refined 3D greedy routing protocol to achieve energy-efficiency of its paths with high probability. We also conduct extensive simulations to confirm our theoretical results.