skip to main content
research-article

Tripartite Transmitting Methodology for Intermittently Connected Mobile Network (ICMN)

Authors Info & Claims
Published:03 February 2023Publication History
Skip Abstract Section

Abstract

Mobile network is a collection of devices with dynamic behavior where devices keep moving, which may lead to the network track to be connected or disconnected. This type of network is called Intermittently Connected Mobile Network (ICMN). The ICMN network is designed by splitting the region into `n' regions, ensuring it is a disconnected network. This network holds the same topological structure with mobile devices in it. This type of network routing is a challenging task. Though research keeps deriving techniques to achieve efficient routing in ICMN such as Epidemic, Flooding, Spray, copy case, Probabilistic, and Wait, these derived techniques for routing in ICMN are wise with higher packet delivery ratio, minimum latency, lesser overhead, and so on. A new routing schedule has been enacted comprising three optimization techniques such as Privacy-Preserving Ant Routing Protocol (PPARP), Privacy-Preserving Routing Protocol (PPRP), and Privacy-Preserving Bee Routing Protocol (PPBRP). In this paper, the enacted technique gives an optimal result following various network characteristics. Algorithms embedded with productive routing provide maximum security. Results are pointed out by analysis taken from spreading false devices into the network and its effectiveness at worst case. This paper also aids with the comparative results of enacted algorithms for secure routing in ICMN.

REFERENCES

  1. [1] Zhang Z.. 2006. Routing in intermittently connected mobile ad hoc networks and deferral tolerant networks: Overview and challenges. IEEE Communications Surveys and Tutorials8, 4 (2006), 2437.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. [2] Boukerche A.. 2008. Algorithms, and Protocols for Wireless Mobile Ad Hoc Networks. Hoboken, NJ: Wiley, 2008.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. [3] Hsu W., Spyropoulos A., Psounis K., and Helmy A.. 2007. Modeling time-variant user mobility in wireless mobile networks. In Proc. IEEE Infocom. Anchorage, AK, 758766.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. [4] Xu Hui, Wu Xianren, Sadjadpour Hamid R. and Garcia-Luna-Aceves J. J.. 2010. A unified analysis of routing protocols in MANETs. IEEE Transactions on Communications 58, 3 (2010), 911922.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. [5] Ramesh S. and Ganesh Kumar P.. 2014. BCR routing for intermittently connected mobile ad hoc networks. International Journal of Engineering and Technology 6, 1 (2014), 6674. ISSN: 0975–4024.Google ScholarGoogle Scholar
  6. [6] Basagni S., Chlamtac I., and Syrotiuk V. R.. 1999. Dynamic source routing for ad hoc networks using the global positioning system. In Proceedings of the IEEE Wireless Communications and Networking Conference 1999 (WCNC'99). 301305.Google ScholarGoogle ScholarCross RefCross Ref
  7. [7] Perkins Charles and Royer Elizabeth. 1999. Ad hoc on-demand distance vector routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications. 90100.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. [8] Perkins Charles E. and Bhagwat Pravin. 1994. Highly active target-sequenced distance-vector routing (DSDV) for mobile computers. In Proceedings of the SIGCOM '94 Conference on Communications Architecture, Protocols, and Applications. 234244.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. [9] Delay Tolerant Networking Research Group 2009. Available from http://www.dtnrg.org.Google ScholarGoogle Scholar
  10. [10] Jain S., Fall K., and Patra R.. 2004. Routing in a delay tolerant network. In Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures and Protocols for Computer Communications. 145158.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. [11] Ramesh S, Indira R., Praveen R., and Kumar P. Ganesh. 2013. A-routing for intermittently connected mobile ad hoc networks. In Proceedings of the Third IEEE International Conference on Recent Trends in Information Technology. 119125.Google ScholarGoogle ScholarCross RefCross Ref
  12. [12] Ramesh S., Praveen R., Indira R., and Kumar P. Ganesh. 2012. A survey on routing methodologies for ICMANET. In Proceedings of the Fourth IEEE International Conference on Advanced Computing. 16.Google ScholarGoogle ScholarCross RefCross Ref
  13. [13] Ramesh S. 2017. An efficient secure routing for intermittently connected mobile networks. Wireless Personal Communications 94, 4 (2017), 27052718. ISSN: 0929–6212.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. [14] Spyropoulos T., Psounis K., and Ragavendra C. S.. 2008. Efficient routing in intermittently connected mobile networks: The single-copy case. IEEE/ACM Trans. Netw. 16, 1 (2008), 6376.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. [15] Spyropoulos T., Psounis K., and Ragavendra C.. 2008. Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Trans. Netw. 16, 1 (2008), 7790.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. [16] Lindgren A., Doria A., and Schelen O. 2004. Probabilistic routing in intermittently connected networks. In Proc. SAPIR 3126, LNCS, 239254.Google ScholarGoogle ScholarCross RefCross Ref
  17. [17] Shi K.. 2010. Semi-probabilistic routing in intermittently connected mobile ad hoc networks. In Journal of Info. Science and Eng. 26 (2010), 16771693.Google ScholarGoogle Scholar
  18. [18] Wen H., Liu J., Lin C., Ren F., Li P., and Fang Y.. 2011. A storage friendly routing scheme in intermittently connected mobile networks. IEEE Trans. Veh. Technol. 60, 3 (2011), 11381149.Google ScholarGoogle ScholarCross RefCross Ref
  19. [19] Arnay R., Acosta L., Sigut M., and Toledo J.. 2008. Ant colony optimization algorithm for detection and tracking of non-saturated roads. Electronics Letters 44, 12 (2008), 725727.Google ScholarGoogle ScholarCross RefCross Ref
  20. [20] Wong Li-Pei, Low M. Y. H., and Chong Chin Soon. 2008. Bee colony optimization with local search for travelling salesman problem. In Proceedings of the Sixth IEEE International Conference on Industrial Informatics. 10191025.Google ScholarGoogle Scholar
  21. [21] Saffari M. H. and Mahjoob M. J.. 2009. Bee colony algorithm for real-time optimal path planning of mobile robots. In Proceedings of the Fifth IEEE International Conference on Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Control. 14.Google ScholarGoogle ScholarCross RefCross Ref
  22. [22] M. Rathee, S. Kumar, A. H. Gandomi, K. Dilip, B. Balusamy, and R. Patan. 2019. Ant colony optimization based quality of service aware energy balancing secure routing algorithm for wireless sensor networks. IEEE Transactions on Engineering Management 68, 1 (2019), 170--182.Google ScholarGoogle Scholar
  23. [23] Rahim M. A., Musirin I., Abidin I. Z., Othman M. M., and Joshi D.. 2010. Congestion management based optimization technique using bee colony. 4th International Power Engineering and Optimization Conference (PEOCO2010). 184186.Google ScholarGoogle ScholarCross RefCross Ref
  24. [24] Dhurandher S. K., Obaidat M. S., Verma K., Gupta P., and Dhurandher P.. 2011. FACES: Friend – based ad hoc routing using challenges to establish security in MANETSs systems. IEEE Sys. Jour. 5, 2 (2011), 176188.Google ScholarGoogle ScholarCross RefCross Ref
  25. [25] Zapata M. G. and Asokan N.. 2002. Securing ad hoc routing protocols. In WiSe '02: Proc. of 1st ACM Workshop on Wireless Security. Atlanta, GA, 110.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. [26] Zhang Y., Liu W., Lou W., and Fang Y.. 2006. Securing mobile ad hoc networks with certificateless public keys. IEEE Trans., Dependable and Secure Computing 3, 4 (2006), 386399.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. [27] Dorigo M., Birattai M., Stuzle T.. 2006. Ant colony optimization: Artificial ants as a computational intelligence technique. IEEE Computational Intelligence Magazine. USA 1, 4 (2006), 2839.Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. [28] Dorigo M. and Socha K.. 2007. An introduction to ant colony optimization. In Handbook of Approximation Algorithms and Metaheuristics. T. F. Gonzalez, (Ed.), Chapman & Hall/CRC, Boca Raton, FL, 114.Google ScholarGoogle Scholar
  29. [29] Gorgen D., Frey H., and Hiedels C.. 2007. JANE – The Java ad hoc network development environment. In Proceedings of the Fortieth Annual Simulation Symposium. 163176.Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. [30] Keranen A.. 2008. Opportunistic network environment simulator. Special Assignment Report, Helsinki University of Technology, Department of Communications and Networking.Google ScholarGoogle Scholar
  31. [31] Al-Turjman F. and Alturjman S.. 2018. Context-sensitive access in industrial internet of things (IIoT) healthcare applications. IEEE Transactions on Industrial Informatics 14, 6 (2018), 27362744.Google ScholarGoogle ScholarCross RefCross Ref
  32. [32] Salih Q., Arafaturrahman M., Al-Turjman F., and Rizal Z.. 2020. Smart routing management framework exploiting dynamic data resources of cross-layer design and machine learning approaches for mobile cognitive radio networks: A survey. IEEE Access 8, 1 (2020), 6783567867.Google ScholarGoogle ScholarCross RefCross Ref
  33. [33] Al-Turjman F. and Altrjman C.. 2020. Enhanced medium access for traffic management in smart-cities' vehicular-cloud. IEEE Intelligent Transportation Systems Magazine, 2020. DOI:Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Tripartite Transmitting Methodology for Intermittently Connected Mobile Network (ICMN)

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Internet Technology
      ACM Transactions on Internet Technology  Volume 22, Issue 4
      November 2022
      642 pages
      ISSN:1533-5399
      EISSN:1557-6051
      DOI:10.1145/3561988
      Issue’s Table of Contents

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 3 February 2023
      • Online AM: 17 November 2022
      • Accepted: 2 November 2020
      • Revised: 20 September 2020
      • Received: 11 July 2020
      Published in toit Volume 22, Issue 4

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Refereed
    • Article Metrics

      • Downloads (Last 12 months)69
      • Downloads (Last 6 weeks)2

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Full Text

    View this article in Full Text.

    View Full Text

    HTML Format

    View this article in HTML Format .

    View HTML Format
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!