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 e cient 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 metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-00782853
Contributor : Nathalie Mitton <>
Submitted on : Monday, December 2, 2013 - 4:18:48 PM
Last modification on : Wednesday, November 29, 2017 - 3:05:54 PM
Long-term archiving on : Monday, March 3, 2014 - 1:52:25 PM

File

k-anycasting.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00782853, version 1

Collections

Citation

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

Share

Metrics

Record views

341

Files downloads

292