Pizza Forwarding: A Beaconless Routing Protocol Designed for Realistic Radio Assumptions

Since the last ten years, Wireless Sensor Networks (WSNs) attract considerable research interests. The limited energy of sensors, the embedded constraints and the communication restrictions make WSN a very challenging system. Many efforts have been done to propose energy-efficient protocols in WSN through activity scheduling, duty cycling MAC protocols, energy-aware routing protocol, temporal and spatial data aggregation schemes. However both control packets and beacons remain, which induces a huge waste energy. Beaconless geo-routing protocols are a piece of work to improve considerably the sensor lifetime but classical approaches do not work under realistic radio assumptions due to the planarization strategies. In this paper, we present a new beaconless routing protocol called Pizza-Forwarding (PF) without any assumption on the radio environment: neither the radio range nor symmetric radio links nor radio properties (shadowing, etc.) are assumed or restricted. A classical greedy mode is proposed. To overcome the hole problem, packets are forwarded to an optimal node in the two hop neighbor following a reactive and optimized neighborhood discovery. Simulation results are proposed to highlight PF´s efficiency in terms of delivery ratio, residual energy and latency, but we also show that the duplicated packets is very high.