A Safe Proactive Routing Protocol SDSDV for Ad Hoc Network

  • Yongfei Ye
  • Suqin Feng
  • Minghe Liu
  • Xinghua SunEmail author
  • Ting Xu
  • Xuming Tong


In mobile Ad Hoc network, nodes move freely, this can lead to frequent changes of network topology. Routing protocol algorithm is the strategy to establish communication links for network nodes, and its performance influences the availability of Ad Hoc network directly. By using wireless channel to transmit data in Ad Hoc network, the invaded malicious nodes will cause various attacks, aim to steal the transmission data or destroy the network. Based on the traditional proactive routing protocol for Ad Hoc network, an improved safe routing strategy SDSDV is put forward to resist attacks against routing protocols. The safe proactive routing protocol includes route request and route response two stages. When the network initialization is complete, after successful identity authentication by each other, secure communication paths are established between nodes and the encrypted data will be transmission through the path. The protocol integrates distributed authentication, encryption algorithm, hash check, and other security policy together. SDSDV protocol reduces the risk of malicious manipulation of routing information and ensures the safe and reliable routing between the source and destination nodes.


Ad Hoc network Safe proactive routing protocol Distributed certificate authority Hash check 


  1. 1.
    Z. J. Hass et al., Wireless ad hoc networks, IEEE Journal on Selected Areas in Communications, 1999.Google Scholar
  2. 2.
    Jason N. Turner and Clive S. Boyer, Ad hoc networks: new reseach, Nova Science PublishersNew York, 2009.Google Scholar
  3. 3.
    W. Jinglong, Ad Hoc mobile wireless network. Beijing, 2004. 5:1–10.Google Scholar
  4. 4.
    Z. Xihai, F. Junlong, M. Fanfeng, An efficient node localization approach with RSSI for randomly deployed wireless sensor networks, Journal of Electrical and Computer Engineering, pp. 1–11, 2016.Google Scholar
  5. 5.
    F. Shu, Z. Honglin, Cross-layer control with worst case delay guarantees in multihop wireless networks, Journal of Electrical and Computer Engineering, 2016.Google Scholar
  6. 6.
    Md. J. H. Biddut, N. Islam, Md. M. Karim, and M. B. A. Miah, An analysis of QoS in ZigBee network based on deviated node priority, pp. 1–8, 2016.Google Scholar
  7. 7.
    N. Shizhao, W. Zheng, P. Wangmo, N. Yuan and L. Peng, Big data prediction of durations for online collective actions based on peak’s timing, Physica A: Statistical Mechanics and its Applications, Vol. 55, pp. 130–139, 2018.Google Scholar
  8. 8.
    Z. Hass and M. Pearlman, The zone routing protocol(ZRP) for Ad Hoc networks, IETF Internet Draft, draft-ietf-manet-zone-zrp-04.txt, 2002.Google Scholar
  9. 9.
    D. Johnson, The dynamic source routing protocol for mobile ad hoc networks(DSR), IETF Internet Draft, draft-ietf-manet-dsr-09.txt, 2003.Google Scholar
  10. 10.
    C. Perkins, P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, ACM SIGCOMM’94 Conference on Communications Architectures, Protocols and Applications, pp. 234–244, 1994.Google Scholar
  11. 11.
    C. Perkins, E. Belding-Royer, and S. Das, Ad Hoc on-demand distance vector (AODV) routing, Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), New Orleans, LA, Vol. 6, No. 7, pp. 90–100, 2000.Google Scholar
  12. 12.
    M. A. Monis, J. Noman, and A. Muzammil, Integrated mechanism of routing and key exchange in AODV, WSEAS Transactions on Communications, Vol. 6, No. 4, pp. 565–572, 2007.Google Scholar
  13. 13.
    Y. Hu, A. Perrig, and D. Johnson Ariadne, A secure on-demand routing protocol for ad hoc networks, ACM MOBICOM, No. 1, pp. 21–38, 2005.Google Scholar
  14. 14.
    V. Lakshmi and P. Arrival Dharma, Strategies for enhancing routing security in protocols for mobile ad hoc networks, Journal of Parallel and Distributed Computing, Vol. 63, No. 2, pp. 214–227, 2003.CrossRefzbMATHGoogle Scholar
  15. 15.
    M. Z. Zapata, N. Asokan, Securing ad-hoc routing protocols, Proc. of the 2002 ACM Workshop on Wireless Security (WiSe2002). Singapore: IEEE Computer Society Press, pp. 1–10, 2002.Google Scholar
  16. 16.
    Y. Chun and S. Meilin, QoS based routing protocol in Ad Hoc Networks, Chinese Journal of Computers, Vol. 24, No. 10, pp. 1026–1033, 2001.Google Scholar
  17. 17.
    K. Snazgiri, B. Dahill, et al, A secure routing protocol for ad hoc networks, Proceedings of the 10 th IEEE International Conference on Network Protocols (ICNP’02), pp. 1–10, 2002.Google Scholar
  18. 18.
    Y. Yongfei and Y. Meisheng, Secure key management scheme based on cluster architecture in mobile Ad Hoc networks, Computer Applications, Vol. 27, No. 3, pp. 611–613, 2007.Google Scholar
  19. 19.
    A. Shamir, How to Share a Secret, Communications of the ACM, Vol. 24, No. 11, pp. 612–613, 1979.MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    W. Diffie and M. Hellman, New directions in cryptography, IEEE Transaction on Information Theory, Vol. 22, No. 6, pp. 644–654, 1976.MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    L. Xiaoqing, Research of secure routing protocol for mobile ad hoc netorks, Xi’an: Xidian University, pp. 17–26, 2011.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  • Yongfei Ye
    • 1
  • Suqin Feng
    • 1
  • Minghe Liu
    • 2
  • Xinghua Sun
    • 1
    Email author
  • Ting Xu
    • 1
  • Xuming Tong
    • 1
  1. 1.School of Information Science and EngineeringHebei North UniversityZhangjiakouChina
  2. 2.School of Economics and ManagementHebei North UniversityZhangjiakouChina

Personalised recommendations