Efficient geographical 3D routing for Wireless Sensor Networks in smart spaces

Abstract

Wireless Sensor Networks (WSNs) is one of the basic components in smart spaces. These kinds of networks are facing many challenges mainly due to limited resources. Indeed, routing protocols are one of the greatest challenges in this domain. Several 3D (Three Dimensions) routing protocols in real environment have been proposed for wireless sensor networks. Some are based on partial or full flooding schemes which consume more energy and incur higher communication overhead, or counted on construction or partition of cubes, convex hulls or Delaunay triangulations where their constructor are relatively complicated and additional cost could be required. In this paper, we present a simple efficient geographical 3D routing algorithm, efficient subminimal Ellipsoid geographical Greedy-Face 3D Routing (EGF3D). The algorithm is based on Greedy and Face routing strategies which are restricted in one subminimal ellipsoid fixed by three points: the forwarding endpoint node, the destination endpoint node and the subminimal angle neighbor in the favorable forwarding direction. We evaluate our approach and compare with the current routing algorithms in this domain. The simulation results show the competitive improvement delivery ratio, end-to-end delay and the communication overhead compared with greedy-random-greedy (GRG) and energy efficiency localized 3D greedy routing algorithm (ERGrd).