Skip to main content
SpringerLink
Log in

An Efficient Secure Routing for Intermittently Connected Mobile Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

A disunited mobile network which lacks of intact affinity as a result of packed network is intermittently connected mobile networks (ICMN). Routing becomes insecure here. High migration of the nodes in the nexus is the reason behind its packed lineament. Detection of the fishy nodes in the network is little tough because of its disunited idiosyncrasy. A secure routing that paves way in detecting and freezing invasion of fishy nodes has been launched in this paper. Ant Colony Optimization (ACO) makes the routing process compatible. Secure communication in the network is made possible by certain authentication series as ICMN is known for its higher delays. A peculiar routing protocol called Privacy Preserving Ant Routing Protocol (PPARP) which is a fusion of ACO with authentication series promises us an expected security. Fishy nodes in the network aids to examine the security grade which proves PPARP as the best.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  1. Zhang, Z. (2006). Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: Overview and challenges. IEEE Communications Surveys and Tutorials, 8(4), 24–37.

    Article  Google Scholar 

  2. Boukerche, A. (2008). Algorithms and Protocols for Wireless Mobile Ad Hoc Networks. Hoboken: Wiley.

    Book  MATH  Google Scholar 

  3. Hsu, W., Spyropoulos, A., Psounis, K., & Helmy, A. (2007). Modeling time variant user mobility in wireless mobile networks. In Proceedings of IEEE Infocom, Anchorage (pp. 758–766).

  4. Xu, H., Wu, X., Sadjadpour, H. R., & Garcia-Luna-Aceves, J. J. (2010). A unified analysis of routing protocols in MANETs. IEEE Transactions on Communications, 58(3), 911.

    Article  Google Scholar 

  5. Ramesh, S., Praveen, R., Indira, R., & Ganesh Kumar, P. (2012). A survey of routing methodologies in intermittently connected MANETs. In the Proceedings of the International Conference ICoAC 2012 (International Conference on Advanced Computing) conducted by Anna University Chennai, MIT Campus, Chennai.

  6. Delay Tolerant Networking Research Group. http://www.dtnrg.org.

  7. Jain, S., Fall, K., & Patra, R. (2004). Routing in a delay tolerant network. In Proceedings of ACM SIGCOMM.

  8. Cokuslu, D., & Erciyes, K. (2008). A flooding based routing algorithm for mobile ad hoc networks. IEEE 16th International Conference SIU, pp. 1–5.

  9. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks, Duke University, Duhram, NC, TecH. Rep. CS-2000-06.

  10. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of ACMSIGCOMM Workshop Delay—Tolerant Networking, pp. 252–253.

  11. Spyropoulos, T., Psounis, K., & Ragavendra, C. S. (2008). Efficient routing in intermittently connected mobile networks: The single-copy case. IEEE/ACM Transactions on Networking, 16(1), 63–76.

    Article  Google Scholar 

  12. Spyropoulos, T., Psounis, K., & Ragavendra, C. (2008). Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Transactions on Networking, 16(1), 77–90.

    Article  Google Scholar 

  13. Lindgren, A., Doria, A., & Schelen, O. (2004). Probabilistic routing in intermittently connected networks. In Proceedings of SAPIR, LNCS, (vol. 3126, pp. 239–254).

  14. Shi, K. (2010). Semi-probabilistic routing in intermittently connected mobile ad hoc networks. Journal of Information Science and Engineering, 26, 1677–1693.

    Google Scholar 

  15. Ramesh, S., Praveen, R., Indira, R., & Ganesh Kumar, P. (2013). Ant routing protocol for intermittently connected mobile networks. In Proceedings of the Fifth IEEE International Conference on Advanced Computing, Anna University, Chennai (pp. 419–425).

  16. Ramesh, S., & Indira, R. (2016). Ant routing protocol with location services in intermittently connected MANETs’. Circuits and Systems, 7(7), 1087–1097. (ISSN: 2153–1285).

    Article  Google Scholar 

  17. Song, X., Li, B., & Yang, H. Improved ant colony algorithm and its applications in TSP. In IEEE Proceedings of Sixth Intertanational Conference on Intelligent Systems design and Applications (ISDA’06).

  18. Arnay, R., Acosta, L., Sigut, M., & Toledo, J. (2008). Ant colony optimisation algorithm for detection and tracking of non-saturated roads. Electronics Letters, 44(12), 1.

    Article  Google Scholar 

  19. Ramesh, S., & Praveen, R. (2015). ‘A Privacy Preserving Routing Protocol for Intermittently Connected Mobile Networks. International Journal of Applied Engineering Research, 10(43), 30454–30461. (ISSN: 0973–4562).

    Google Scholar 

  20. Ramesh, S., & Ganesh Kumar, P. (2014). BCR routing for intermittently connected mobile ad hoc networks. International Journal of Engineering and Technology, 6(1), 66–74. (ISSN: 0975–4024).

    Google Scholar 

  21. Wen, H., Liu, J., Lin, C., Ren, F., Li, P., & Fang, Y. (2011). A storage friendly routing scheme in intermittently connected mobile networks. IEEE Transactions on Vehicular Technology, 60(3), 1138–1149.

    Article  Google Scholar 

  22. Jun, Z. F., & Wei, G. (2008). Meeting ant colony optimization. IEEE.

  23. Blum, C. (2005). Ant colony optimization: Introduction and recent trends. Physics of Life Reviews, Holland, 2(4), 353–373.

    Article  Google Scholar 

  24. Dorigo, M., Birattai, M., & Stuzle, T. (2006). Ant colony optimization: Artificial ants as a computational intelligence technique. IEEE Computational Intelligence Magazine, USA, 1(4), 28–39.

    Article  Google Scholar 

  25. Dorigo, M., & Socha, K. (2007). An introduction to ant colony optimization. In T. F. Gonzalez (Ed.), Handbook of Approximation Algorithms and Metaheuristics (pp. 1–14). Boca Raton: Chapman & Hall/CRC.

    Google Scholar 

  26. Dhurandher, S. K., Obaidat, M. S., Verma, K., Gupta, P., & Dhurandher, P. (2011). FACES: Friend-based ad hoc routing using challenges to establish security in MANETSs systems. IEEE Systems Journal, 5(2), 176–188.

    Article  Google Scholar 

  27. Zapata, M. G., & Asokan, N. (2002). Securing ad hoc routing protocols. In WiSe’02: Proceedings of 1st ACM Workshop on Wireless Security, Atlanta (pp. 1–10).

  28. Zhang, Y., Liu, W., Lou, W., & Fang, Y. (2006). Securing mobile ad hoc networks with certificateless public keys. IEEE Transactions on Dependable and Secure Computing, 3(4), 386.

    Article  Google Scholar 

  29. Ramesh, S., & Ganesh Kumar, P. (2013). A comparative analysis of routing techniques in intermittently connected MANETs. Asian Journal of Scientific Research, 6(4), 736–744. (ISSN: 1992–1454).

    Article  Google Scholar 

  30. Ramesh, S., Indira, R., Praveen, R., & Ganesh Kumar, P. (2013). S-spray routing protocol for intermittently connected mobile networks. ICTACT Journal on Communication Technology, 4(3), 761–765. (ISSN: 2229–6948).

    Article  Google Scholar 

  31. Keranen, A., Ott, J., & Karkkainen, T. The one simulator for DTN protocol evaluation. ICST.

  32. Keranen, A., Karkkainen, T., & Ott, J. (2010). Simulating mobility and DTNs with the ONE. Journal of Communications, 5(2), 92–105.

    Article  Google Scholar 

  33. Grgen, D., Frey, H., & Hiedels, C. (2007). Jane, the java ad hoc network development environment. In Proceedings of the 40th Annual Simulation Symposium (ANSS).

  34. Keranen, A. (2008). Opportunistic network environment simulator, special assignment report. Helsinki University of Technology, Department of Communications and Networking.

  35. TKK/COMNET. (2009). Project page of the ONE simulator. http://www.netlab.tkk.fi/tutkimus/dtn/theone.

Download references

Author information

Authors and Affiliations

  1. Department of CSE, Anna University Regional Campus, Madurai, Tamil Nadu, India

    S. Ramesh

Authors
  1. S. Ramesh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Ramesh.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ramesh, S. An Efficient Secure Routing for Intermittently Connected Mobile Networks. Wireless Pers Commun 94, 2705–2718 (2017). https://doi.org/10.1007/s11277-016-3885-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-016-3885-5

Keywords

Search

Navigation