BeeHiveGuard: A Step Towards Secure Nature Inspired Routing Algorithms

  • Horst F. Wedde
  • Constantin Timm
  • Muddassar Farooq
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3907)


Nature inspired routing protocols for fixed and mobile networks are becoming an active area of research. However, analyzing their security threats and countering them have received little attention. In this paper we discuss the security threats of a state-of-the-art routing protocol, BeeHive, and then extend the algorithm with our security model to counter them. We further conclude from our extensive experiments that standard cryptography techniques can not be utilized due to their large processing and communication costs, if Nature inspired routing protocols are to be deployed in real world networks.


Data Packet Communication Cost Propagation Delay Malicious Node Security Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Di Caro, G., Dorigo, M.: AntNet: Distributed stigmergetic control for communication networks. Journal of Artificial Intelligence Research 9, 317–365 (1998)MATHGoogle Scholar
  2. 2.
    Cox, M., Engelschall, R., Henson, S., Laurie, B.: The openssl project.
  3. 3.
    Dasgupta, D. (ed.): Artificial Immune Systems and their Applications. Springer, Heidelberg (1998)Google Scholar
  4. 4.
    Hauser, R., Przygienda, T., Tsudik, G.: Reducing the cost of security in linkstate routing. In: SNDSS 1997: Proceedings of the 1997 Symposium on Network and Distributed System Security, Washington, DC, p. 93. IEEE Computer Society, Los AlamitosGoogle Scholar
  5. 5.
    Hu, Y.-C., Perrig, A., Johnson, D.B.: Efficient security mechanisms for routing protocolsa. In: Proceedings of the Network and Distributed System Security Symposium, NDSS 2003, California, USA, The Internet Society, San Diego (2003)Google Scholar
  6. 6.
    Hu, Y.-C., Perrig, A., Johnson, D.B.: Ariadne: A secure on-demand routing protocol for ad hoc networks. Wireless Networks 11(1-2), 21–38 (2005)CrossRefGoogle Scholar
  7. 7.
    Liang, S., Zincir-Heywood, A.N., Heywood, M.I.: Intelligent packets for dynamic network routing using distributed genetic algorithm. In: Proceedings of Genetic and Evolutionary Computation Conference. GECCO July(2002)Google Scholar
  8. 8.
    Murphy, S.L., Badger, M.R.: Digital signature protection of the ospf routing protocol. In: SNDSS 1996: Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS 1996), DC, USA, p. 93. IEEE Computer Society, Washington (1996)Google Scholar
  9. 9.
    Perlman, R.: Network layer protocols with byzantine robustness. phd thesis. In: Technical report, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technolog (1998)Google Scholar
  10. 10.
    Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Smith, B.R., Murthy, S., Garcia-Luna-Aceves, J.J.: Securing distancevector routing protocols. In: Proceedings of the Network and Distributed System Security Symposium, NDSS 1997, California, USA, San Diego. IEEE Computer Society, Los Alamitos (1997)Google Scholar
  12. 12.
    Varga, A.: OMNeT++: Discrete event simulation system: User manual.
  13. 13.
    Vetter, B., Wang, F., Wu, S.F.: An experimental study of insider attacks for ospf routing protocol. In: ICNP 1997: Proceedings of the 1997 International Conference on Network Protocols (ICNP 1997), Washington, DC, USA, p. 293. IEEE Computer Society, Los Alamitos (1997)Google Scholar
  14. 14.
    Wedde, H.F., Farooq, M.: A performance evaluation framework for nature inspired routing algorithms. In: Rothlauf, F., Branke, J., Cagnoni, S., Corne, D.W., Drechsler, R., Jin, Y., Machado, P., Marchiori, E., Romero, J., Smith, G.D., Squillero, G. (eds.) EvoWorkshops 2005. LNCS, vol. 3449, pp. 136–146. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. 15.
    Wedde, H.F., Farooq, M., Zhang, Y.: BeeHive: An efficient fault-tolerant routing algorithm inspired by honey bee behavior. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 83–94. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  16. 16.
    Zhong, W., Evans, D.: When ants attack: Security issues for stigmergic systems. Technical report, Department of Computer Science, University of Virginina, CS- 2002-3 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Horst F. Wedde
    • 1
  • Constantin Timm
    • 1
  • Muddassar Farooq
    • 1
  1. 1.Informatik IIIUniversity of DortmundDortmundGermany

Personalised recommendations