Guaranteed Delivery in $k$-Anycast Routing in Multi-Sink Wireless Networks
Abstract
In $k$-anycasting, a sensor wants to report event information to any $k$ sinks in the network. In this paper, we describe KanGuRou, the rst position-based energy efficient $k$-anycast routing which guarantees the packet delivery to $k$ sinks as long as the connected component that contains $s$ also contains at least $k$ sinks. A node s running KanGuRou rst computes a tree including $k$ sinks with weight as low as possible. If this tree has $m$ 1 edges originated at node $s$, $s$ duplicates the message m times and runs $m$ times KanGuRou over a subset of de ned sinks. We present two variants of KanGuRou, each of them being more e cient than the other depending of application settings. Simulation results show that KanGuRou allows up to 62% of energy saving compared to plain anycasting.
Origin : Files produced by the author(s)
Loading...