[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Tripartite Transmitting Methodology for Intermittently Connected Mobile Network (ICMN)

Published: 03 February 2023 Publication History

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]
Z. Zhang. 2006. Routing in intermittently connected mobile ad hoc networks and deferral tolerant networks: Overview and challenges. IEEE Communications Surveys and Tutorials 8, 4 (2006), 24–37.
[2]
A. Boukerche. 2008. Algorithms, and Protocols for Wireless Mobile Ad Hoc Networks. Hoboken, NJ: Wiley, 2008.
[3]
W. Hsu, A. Spyropoulos, K. Psounis, and A. Helmy. 2007. Modeling time-variant user mobility in wireless mobile networks. In Proc. IEEE Infocom. Anchorage, AK, 758–766.
[4]
Hui Xu, Xianren Wu, Hamid R. Sadjadpour and J. J. Garcia-Luna-Aceves. 2010. A unified analysis of routing protocols in MANETs. IEEE Transactions on Communications 58, 3 (2010), 911–922.
[5]
S. Ramesh and P. Ganesh Kumar. 2014. BCR routing for intermittently connected mobile ad hoc networks. International Journal of Engineering and Technology 6, 1 (2014), 66–74. ISSN: 0975–4024.
[6]
S. Basagni, I. Chlamtac, and V. R. Syrotiuk. 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). 301–305.
[7]
Charles Perkins and Elizabeth Royer. 1999. Ad hoc on-demand distance vector routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications. 90–100.
[8]
Charles E. Perkins and Pravin Bhagwat. 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. 234–244.
[9]
Delay Tolerant Networking Research Group 2009. Available from http://www.dtnrg.org.
[10]
S. Jain, K. Fall, and R. Patra. 2004. Routing in a delay tolerant network. In Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures and Protocols for Computer Communications. 145–158.
[11]
S. Ramesh, R. Indira, R. Praveen, and P. Ganesh Kumar. 2013. A-routing for intermittently connected mobile ad hoc networks. In Proceedings of the Third IEEE International Conference on Recent Trends in Information Technology. 119–125.
[12]
S. Ramesh, R. Praveen, R. Indira, and P. Ganesh Kumar. 2012. A survey on routing methodologies for ICMANET. In Proceedings of the Fourth IEEE International Conference on Advanced Computing. 1–6.
[13]
S. Ramesh. 2017. An efficient secure routing for intermittently connected mobile networks. Wireless Personal Communications 94, 4 (2017), 2705–2718. ISSN: 0929–6212.
[14]
T. Spyropoulos, K. Psounis, and C. S. Ragavendra. 2008. Efficient routing in intermittently connected mobile networks: The single-copy case. IEEE/ACM Trans. Netw. 16, 1 (2008), 63–76.
[15]
T. Spyropoulos, K. Psounis, and C. Ragavendra. 2008. Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Trans. Netw. 16, 1 (2008), 77–90.
[16]
A. Lindgren, A. Doria, and O. Schelen 2004. Probabilistic routing in intermittently connected networks. In Proc. SAPIR 3126, LNCS, 239–254.
[17]
K. Shi. 2010. Semi-probabilistic routing in intermittently connected mobile ad hoc networks. In Journal of Info. Science and Eng. 26 (2010), 1677–1693.
[18]
H. Wen, J. Liu, C. Lin, F. Ren, P. Li, and Y. Fang. 2011. A storage friendly routing scheme in intermittently connected mobile networks. IEEE Trans. Veh. Technol. 60, 3 (2011), 1138–1149.
[19]
R. Arnay, L. Acosta, M. Sigut, and J. Toledo. 2008. Ant colony optimization algorithm for detection and tracking of non-saturated roads. Electronics Letters 44, 12 (2008), 725–727.
[20]
Li-Pei Wong, M. Y. H. Low, and Chin Soon Chong. 2008. Bee colony optimization with local search for travelling salesman problem. In Proceedings of the Sixth IEEE International Conference on Industrial Informatics. 1019–1025.
[21]
M. H. Saffari and M. J. Mahjoob. 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. 1–4.
[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.
[23]
M. A. Rahim, I. Musirin, I. Z. Abidin, M. M. Othman, and D. Joshi. 2010. Congestion management based optimization technique using bee colony. 4th International Power Engineering and Optimization Conference (PEOCO2010). 184–186.
[24]
S. K. Dhurandher, M. S. Obaidat, K. Verma, P. Gupta, and P. Dhurandher. 2011. FACES: Friend – based ad hoc routing using challenges to establish security in MANETSs systems. IEEE Sys. Jour. 5, 2 (2011), 176–188.
[25]
M. G. Zapata and N. Asokan. 2002. Securing ad hoc routing protocols. In WiSe '02: Proc. of 1st ACM Workshop on Wireless Security. Atlanta, GA, 1–10.
[26]
Y. Zhang, W. Liu, W. Lou, and Y. Fang. 2006. Securing mobile ad hoc networks with certificateless public keys. IEEE Trans., Dependable and Secure Computing 3, 4 (2006), 386–399.
[27]
M. Dorigo, M. Birattai, T. Stuzle. 2006. Ant colony optimization: Artificial ants as a computational intelligence technique. IEEE Computational Intelligence Magazine. USA 1, 4 (2006), 28–39.
[28]
M. Dorigo and K. Socha. 2007. An introduction to ant colony optimization. In Handbook of Approximation Algorithms and Metaheuristics. T. F. Gonzalez, (Ed.), Chapman & Hall/CRC, Boca Raton, FL, 1–14.
[29]
D. Gorgen, H. Frey, and C. Hiedels. 2007. JANE – The Java ad hoc network development environment. In Proceedings of the Fortieth Annual Simulation Symposium. 163–176.
[30]
A. Keranen. 2008. Opportunistic network environment simulator. Special Assignment Report, Helsinki University of Technology, Department of Communications and Networking.
[31]
F. Al-Turjman and S. Alturjman. 2018. Context-sensitive access in industrial internet of things (IIoT) healthcare applications. IEEE Transactions on Industrial Informatics 14, 6 (2018), 2736–2744.
[32]
Q. Salih, M. Arafaturrahman, F. Al-Turjman, and Z. Rizal. 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), 67835–67867.
[33]
F. Al-Turjman and C. Altrjman. 2020. Enhanced medium access for traffic management in smart-cities' vehicular-cloud. IEEE Intelligent Transportation Systems Magazine, 2020. DOI:

Index Terms

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

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    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

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 03 February 2023
    Online AM: 17 November 2022
    Accepted: 02 November 2020
    Revised: 20 September 2020
    Received: 11 July 2020
    Published in TOIT Volume 22, Issue 4

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. ICMN
    2. PPRP
    3. PPARP
    4. PPBRP
    5. authentication sequence

    Qualifiers

    • Research-article
    • Refereed

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 115
      Total Downloads
    • Downloads (Last 12 months)31
    • Downloads (Last 6 weeks)5
    Reflects downloads up to 24 Dec 2024

    Other Metrics

    Citations

    View Options

    Login options

    Full Access

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Full Text

    View this article in Full Text.

    Full Text

    HTML Format

    View this article in HTML Format.

    HTML Format

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media