Research Article
Guaranteed Delivery in k-Anycast Routing in Multi-SinkWireless Networks
@ARTICLE{10.4108/mca.1.3.e1, author={Nathalie Mitton and David Simplot-Ryl and Jun Zheng}, title={Guaranteed Delivery in k-Anycast Routing in Multi-SinkWireless Networks}, journal={EAI Endorsed Transactions on Mobile Communications and Applications}, volume={1}, number={3}, publisher={ICST}, journal_a={MCA}, year={2013}, month={12}, keywords={}, doi={10.4108/mca.1.3.e1} }- Nathalie Mitton
David Simplot-Ryl
Jun Zheng
Year: 2013
Guaranteed Delivery in k-Anycast Routing in Multi-SinkWireless Networks
MCA
ICST
DOI: 10.4108/mca.1.3.e1
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 first 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 first 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 defined sinks. We present two variants of KanGuRou, each of them being more efficient than the other depending of application settings. Simulation results show that KanGuRou allows up to 62% of energy saving compared to plain anycasting.
Copyright © 2013 Nathalie Mitton et al., licensed to ICST. This is an open access article distributed under the terms of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.