Abstract
In wireless sensor networks, there is usually a sink which gathers data from the battery-powered sensor nodes. As sensor nodes around the sink consume their energy faster than the other nodes, several sinks have to be deployed to increase the network lifetime. In this paper, we motivate the need of anycast communications in wireless networks, where all the sinks are identical and can gather data from any source. To reduce interference and congestion areas on the wireless medium, the path from a source to a sink has to be distant from the path connecting another source to another sink. We show that determining distant paths from sources to sinks is an NP-hard problem, and we propose a linear formulation in order to obtain optimal solutions. Then, we propose a sink selection and routing protocol called S4 and based on realistic assumptions and we evaluate it through simulations. Finally, we conclude that anycast routing protocols in wireless sensor networks should not compute paths independently for each source, but rather consider all the sources simultaneously.
Chapter PDF
Similar content being viewed by others
References
Kim, H., Seok, Y., Choi, N., Kwon, T.: Optimal multi-sink positioning and energy-efficient routing in wireless sensor networks. Information Networking (2005)
Oyman, E.I., Ersoy, C.: Multiple sink network design problem in largescale wireless sensor networks. In: IEEE ICC (2004)
Chang, J., Tassiulas, L.: Maximum lifetime routing in wireless sensor networks. IEEE/ACM Transactions on Networking 12 (2007)
Buratti, C., Orris, J., Verdone, R.: On the design of tree-based topologies for mutli-sink wireless sensor nerworks (September 2006)
Kalantari, M., Shayman, M.: Design optimization of multi-sink sensor networks by analogy to electrostatic theory. In: IEEE WCNC (2006)
Hu, W., Bulusu, N., Jha, S.: A communication paradigm for hybrid sensor/actuator networks. Springer International Jounal of Wireless Information Networks 14(3) (2005)
Thepvilojanapong, N., Tobe, Y., Sezaki, K.: Har: Hierarchy-based anycast routing protocol for wireless sensor networks. In: SAINT (2005)
Kim, J., Lin, X., Shroff, N.B.: Minimizing Delay and Maximizing Lifetime for Wireless Sensor Networks With Anycast. In: IEEE INFOCOM (2008)
Marina, M.K., Das, S.R.: On-demand multipath distance vector routing in ad hoc networks. In: ICNP (2001)
Lee, S.J.: gerla, M.: Split multipath routing with maximally disjoint paths in ad hoc networks. In: IEEE ICC (2001)
Pearlman, M.R., Haas, Z.J., Sholander, P., Tabrizi, S.S.: On the impact of alternate path routing for load balancing in mobile ad hoc networks. In: ACM Mobile Ad Hoc Networking and Computing (2000)
Saha, D., Toy, S., Bondyopadhyay, S., Ueda, T., Tanaka, S.: An adaptive framework for multipath routing via maximally zone-disjoint shortest paths in ad hoc wireless networks with directional antenna. In: Proc. Global Telecommunications (2003)
Wang, Z., Bulut, E., Szymanski, B.K.: Energy Efficient Collision Aware Multipath Routing for Wirelss Sensor Networks. In: IEEE ICC (2009)
El Rachkidy, N., Guitton, A., Misson, M.: Pirat: Pivot Routing for Alarm Transmission in Wireless Sensor Networks. IEEE Local Computer Networks (2009)
Qian-Ping, G., Satoshi, O., Shietung, P.: Efficient algorithms for node disjoint path problems. In: Proceedings of Electronics, Information and Communication Engineers Conference, vol. 2 (1994)
Perkins, C., Belding-Royer, E., Das, S.: Ad hoc on-demand distance vector (AODV) routing. Request For Comments 3561, IETF (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
El Rachkidy, N., Guitton, A., Misson, M. (2010). Routing Protocol for Anycast Communications in a Wireless Sensor Network. In: Crovella, M., Feeney, L.M., Rubenstein, D., Raghavan, S.V. (eds) NETWORKING 2010. NETWORKING 2010. Lecture Notes in Computer Science, vol 6091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12963-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-12963-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12962-9
Online ISBN: 978-3-642-12963-6
eBook Packages: Computer ScienceComputer Science (R0)