Skip to Main content Skip to Navigation
New interface
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Nathalie Mitton Connect in order to contact the contributor
Submitted on : Monday, December 2, 2013 - 4:18:48 PM
Last modification on : Wednesday, March 9, 2022 - 9:16:03 AM
Long-term archiving on: : Monday, March 3, 2014 - 1:52:25 PM


Files produced by the author(s)


  • HAL Id : hal-00782853, version 1



Nathalie Mitton, David Simplot-Ryl, Jun Zheng. Guaranteed Delivery in $k$-Anycast Routing in Multi-Sink Wireless Networks. EAI Endorsed Transactions on Mobile Communications and Applications, 2013. ⟨hal-00782853⟩



Record views


Files downloads