Guaranteed Delivery in $k$-Anycast Routing in Multi-Sink Wireless Networks - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue EAI Endorsed Transactions on Mobile Communications and Applications Année : 2013

Guaranteed Delivery in $k$-Anycast Routing in Multi-Sink Wireless Networks

Résumé

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.
Fichier principal
Vignette du fichier
k-anycasting.pdf (290.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00782853 , version 1 (02-12-2013)

Identifiants

  • HAL Id : hal-00782853 , version 1

Citer

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⟩

Collections

INRIA INRIA2
136 Consultations
219 Téléchargements

Partager

Gmail Facebook X LinkedIn More