Cross-Layer Greedy position-based routing for multihop wireless sensor networks in a real environment

Abstract

It has been shown that the maximum distance routing strategy which works well on a Unit Disk Graph (UDG), performs poorly when it is executed on a Non Unit Disk Graph (N-UDG) which reflects the radio irregularity phenomenon. This latter arises from multiple factors, such as antenna and medium type, and is accentuated by environmental factors such as obstacles (e.g., buildings, hills, mountains) and weather conditions. In this paper, we propose a Cross-Layer Greedy Routing algorithm (CL-GR) which enables a correct position-based routing on a N-UDG. It provides two novel greedy routing strategies, termed respectively, Progress towards the sink node through Symmetrical links that experience the lowest Path Loss (PSPL) and progress through symmetrical links, combining the Maximum Distance forwarding strategy and the PSPL (MDPSPL). We compare our CL-GR to an Enhanced version of the Greedy algorithm of the Greedy Perimeter Stateless Routing protocol (GPSR), that we call E-GR and which can be executed on a N-UDG, and to COP_GARE algorithm. The simulation results show that both PSPL and MDPSPL enable higher Packet Delivery Ratio (PDR) and energy efficiency. In terms of end-to-end delay, while the PSPL strategy significantly increases this metric, the MDPSPL strategy enables a satisfactory end-to-end delay, comparatively to E-GR and COP_GARE.