Abstract
In k-anycasting, a sensor wants to report event information to any k sinks in the network. This is important to gain in reliability and efficiency in wireless sensor and actor networks. 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 sufficient number of sinks. A node s running KanGuRou first computes a tree including k sinks among the M available ones, 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. Simulation results show that KanGuRou allows up to 62% of energy saving compared to plain anycasting.
This work was partially supported by CPER Nord-Pas-de-Calais/FEDER Campus Intelligence Ambiante and the ANR BinThatThinks project.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks 7(8), 609–616 (2001)
Wu, B., Wu, J.: k-anycast routing schemes for mobile ad hoc networks. In: IPDPS (2006)
Elhafsi, E.H., Mitton, N., Simplot-Ryl, D.: Energy Efficient Geographic Path Discovery With Guaranteed Delivery in Ad hoc and Sensor Networks. In: IEEE PIMRC (2008)
Frey, H., Ingelrest, F., Simplot-Ryl, D.: Localized mst based multicast routing with energy-efficient guaranteed delivery in sensor networks. In: WOWMOM (2008)
Mitton, N., Simplot-Ryl, D., Stojmenovic, I.: Guaranteed delivery for geographical anycasting in wireless multi-sink sensor and sensor-actor networks. In: IEEE INFOCOM (2009) (short paper)
Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389–1401 (1957)
Rodoplu, V., Meng, T.: Minimizing energy mobile wireless networks. IEEE JSAC 17, 1333–1347 (1999)
Wang, W., Li, X.Y., Frieder, O.: k-anycast game in selfish networks. In: ICCCN (2004)
Wang, X.: Analysis and design of a k-anycast communication model in ipv6. Comput. Commun. 31, 2071–2077 (2008)
Wu, B., Wu, J.: k-anycast routing schemes for mobile ad hoc networks. In: IPDPS (2006)
Xu, X., Gu, Y.-L., Du, J., Qian, H.-Y.: A distributed k-anycast routing proto col based on mobile agents. In: WiCOM (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mitton, N., Simplot-Ryl, D., Voge, ME., Zhang, L. (2012). Energy Efficient k-Anycast Routing in Multi-sink Wireless Networks with Guaranteed Delivery. In: Li, XY., Papavassiliou, S., Ruehrup, S. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2012. Lecture Notes in Computer Science, vol 7363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31638-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-31638-8_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31637-1
Online ISBN: 978-3-642-31638-8
eBook Packages: Computer ScienceComputer Science (R0)