End-to-End Energy Efficient Geographic Path Discovery With Guaranteed Delivery in Ad Hoc and Sensor Networks

Essia Hamouda Elhafsi (1, 2) , Nathalie Mitton (3, 1) , David Simplot-Ryl (3, 1)

1 POPS - System and Networking for Portable Objects Proved to be Safe
2 CSE - Department of Computer Science & Engineering [Riverside]
3 LIFL - Laboratoire d'Informatique Fondamentale de Lille

We propose a novel localized routing protocol for wireless sensor networks (WSN) that is energy-efficient and guarantees delivery. We prove that it is constant factor of the optimum for dense networks. To forward a packet, a node $s$ in graph $G$ computes the cost of the energy weighted shortest path (SP) between $s$ and each of its neighbors which are closer to the destination than itself. It then selects node $x$ which minimizes the ratio of the cost of the SP to the progress towards the destination. It then sends the message to the first node on the SP from $s$ to $x$: say node $x'$. Node $x'$ restarts the same greedy routing process until the destination is reached or the routing fails. To recover from failure, our algorithm invokes Face routing that guarantees delivery. This work is the first to optimize energy consumption of Face routing. First, we build a connected dominating set from graph $G$, second we compute its Gabriel graph to obtain the planar graph $G'$. Face routing is applied on $G'$ only to decide which edges to follow in the recovery process. On each edge, greedy routing is used. This two-phase (greedy-Face) End-to-End routing process (EtE) reiterates until the final destination is reached. Simulation results show that EtE outperforms several existing geographical routing on energy consumption metric.

Domaines: Réseaux et télécommunications [cs.NI]

Essia Hamouda Elhafsi, Nathalie Mitton, David Simplot-Ryl. End-to-End Energy Efficient Geographic Path Discovery With Guaranteed Delivery in Ad Hoc and Sensor Networks. PIMRC 2008, Sep 2008, Cannes, France. pp.000. ⟨hal-00384032⟩