Abstract
This paper presents a biologically inspired routing protocol called Self Selective Routing with preferred path selection (SSRP). Its operation resembles the behavior of a biological ant that finds a food source by following the strongest pheromone scent left by scout ants at each fork of a path. Likewise, at each hop of a multi-hop path, a packet using the Self Selective Routing (SSR) protocol moves to the node with the shortest hop distance to the destination. Each intermediate node on a route to the destination uses a transmission back-off delay to select a path to follow for each packet of a flow. Neither an ant nor a packet knows in advance the route that each will follow as it is decided at each step. Therefore, when a route becomes severed by a failure, they can dynamically and locally adjust their routing to traverse the shortest surviving path. Preferred path selection reduces transmission delay by essentially removing back-off delay for the node that carried the previous packet of the same flow. The results reported here for both simulation and execution of a MicaZ mote implementation, show that this is an efficient and fault-tolerant protocol with small transmission delay, high reliability and high delivery rate.
Research was sponsored by US Army Research laboratory and the UK Ministry of Defence and was accomplished under Agreement Number W911NF-06-3-0001. The views and conclusions contained in this document are those of the authors, and should not be interpreted as representing the official policies, either expressed or implied, of the US Army Research Laboratory, the U.S. Government, the UK Ministry of Defense, or the UK Government. The US and UK Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.
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
Woo, A., Tong, T., Culler, D.: Taming the underlying challenges of reliable multihop routing in sensor networks. In: Proc. ACM SenSys 2003, pp. 14–27. ACM Press, New York (2003)
Zhao, J., Govindan, R.: Understanding packet delivery performance in dense wireless sensor networks. In: Proc. ACM SenSys 2003, pp. 1–13. ACM Press, New York (2003)
Anastasi, G., Falchi, A., Passarella, A., Conti, M., Gregori, E.: Performance measurements of motes sensor networks. In: Proc. 7th ACM Intern. Symp. Modeling, Analysis and Simulation of Wireless and Mobile Systems, pp. 174–181. ACM Press, New York (2004)
Crossbow Technology, Inc., http://www.xbow.com
Perkins, C., Belding-Royer, E., Das, S.: RFC 3561-ad hoc on-demand distance vector (AODV) routing, http://www.faqs.org/rfcs/rfc3561.html
Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proc. ACM MobiCom, pp. 56–67. ACM Press, New York (2000)
Branch, J.W., Lisee, M., Szymanski, B.K.: SHR: Self-Healing Routing for wireless ad hoc sensor networks. In: Proc. Intern. Symp. Performance Evaluation of Computer and Telecommunication Systems SPECTS 2007, pp. 5–14. SCS Press, San Diego (2007)
Poor, R.: Gradient routing in ad hoc networks, http://www.media.mit.edu/pia/Research/ESP/texts/poorieeepaper.pdf
Ye, F., Zhong, G., Lu, S., Zhang, L.: Gradient broadcast: a robust data delivery protocol for large scale sensor networks. ACM Wireless Networks 11(2) (2005)
Heissenbüttel, M., Braun, T., Bernoulli, T., Waelchli, M.: BLR: beaconless routing algorithm for mobile ad hoc networks. Computer Communications Journal 27(11) (2004)
Zori, M., Rao, R.R.: Geographic Random Forwarding (GeRaF) for ad hoc and sensor networks: multihop performance. IEEE Trans. Mobile Computing 2(4), 337–348 (2003)
Blum, B.M., He, T., Son, S., Stankovic, J.A.: IGF: a robust state-free communication protocol for sensor networks. Technical Report CS-2003-11, University of Virginia, Charlottesville (2003)
Xu, Y., Lee, W.-C., Xu, J., Mitchell, G.: PSGR: priority-based stateless geo-routing in wireless sensor networks. In: Proc. IEEE Conf. Mobile Ad-hoc and Sensor Systems. IEEE Computer Society Press, Los Alamitos (2005)
Chen, D., Deng, J., Varshney, P.K.: A state-free data delivery protocol for multihop wireless sensor networks. In: Proc. IEEE Wireless Communications and Networking Conf. IEEE Computer Society Press, Los Alamitos (2005)
Cordon, O., Herrera, F., Stutzle, T.: A review on the Ant Colony Optimization Metaheurstics: Basis, Models and New Trends. Mathware & Soft Computing 9 (2002)
Koenig, S., Szymanski, B.K., Liu, Y.: Efficient and Inefficient Ant Coverage Methods. Annals of Mathematics and Artificial Intelligence 31(1-4), 41–76 (2001)
Chen, G., Branch, J., Szymanski, B.K.: Local leader election, signal strength aware flooding, and routeless routing. In: 5th IEEE Intern. Workshop Algorithms for Wireless, Mobile, Ad-Hoc Networks and Sensor Networks WMAN 2005. IEEE Computer Society Press, Los Alamitos (2005)
Chen, G., Branch, J.W., Pflug, M., Zhu, L., Szymanski, B.K.: SENSE: a wireless sensor network simulator. Advances in Pervasive Computing and Networking, pp. 249–267. Springer, Heidelberg (2004)
Wasilewski, K., Branch, J., Lisee, M., Szymanski, B.K.: Self-healing routing: a study in efficiency and resiliency of data delivery in wireless sensor networks. In: Proc. Conference on unattended Ground, Sea, and Air Sensor Technologies and Applications, SPIE Symposium on Defense & Security, April, Orlando, FL (2007)
Rappaport, T.S.: Wireless Communications: Principles and Practice. Prentice Hall, Englewood Cliffs (1996)
Branch, J.W., Chen, G., Szymanski, B.K.: ESCORT: Energy-efficient Sensor network Communal Routing Topology using signal quality metrics. In: Lorenz, P., Dini, P. (eds.) ICN 2005. LNCS, vol. 3420, pp. 438–448. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szymanski, B.K., Morrell, C., Geyik, S.C., Babbitt, T. (2008). Biologically Inspired Self Selective Routing with Preferred Path Selection. In: Liò, P., Yoneki, E., Crowcroft, J., Verma, D.C. (eds) Bio-Inspired Computing and Communication. BIOWIRE 2007. Lecture Notes in Computer Science, vol 5151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92191-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-92191-2_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92190-5
Online ISBN: 978-3-540-92191-2
eBook Packages: Computer ScienceComputer Science (R0)