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.
- [1] . 2006. Routing in intermittently connected mobile ad hoc networks and deferral tolerant networks: Overview and challenges. IEEE Communications Surveys and Tutorials8, 4 (2006), 24–37.Google Scholar
Digital Library
- [2] . 2008. Algorithms, and Protocols for Wireless Mobile Ad Hoc Networks. Hoboken, NJ: Wiley, 2008.Google Scholar
Digital Library
- [3] . 2007. Modeling time-variant user mobility in wireless mobile networks. In Proc. IEEE Infocom. Anchorage, AK, 758–766.Google Scholar
Digital Library
- [4] . 2010. A unified analysis of routing protocols in MANETs. IEEE Transactions on Communications 58, 3 (2010), 911–922.Google Scholar
Digital Library
- [5] . 2014. BCR routing for intermittently connected mobile ad hoc networks. International Journal of Engineering and Technology 6, 1 (2014), 66–74. ISSN: 0975–4024.Google Scholar
- [6] . 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.Google Scholar
Cross Ref
- [7] . 1999. Ad hoc on-demand distance vector routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications. 90–100.Google Scholar
Digital Library
- [8] . 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.Google Scholar
Digital Library
- [9] Delay Tolerant Networking Research Group 2009. Available from http://www.dtnrg.org.Google Scholar
- [10] . 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.Google Scholar
Digital Library
- [11] . 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.Google Scholar
Cross Ref
- [12] . 2012. A survey on routing methodologies for ICMANET. In Proceedings of the Fourth IEEE International Conference on Advanced Computing. 1–6.Google Scholar
Cross Ref
- [13] . 2017. An efficient secure routing for intermittently connected mobile networks. Wireless Personal Communications 94, 4 (2017), 2705–2718. ISSN: 0929–6212.Google Scholar
Digital Library
- [14] . 2008. Efficient routing in intermittently connected mobile networks: The single-copy case. IEEE/ACM Trans. Netw. 16, 1 (2008), 63–76.Google Scholar
Digital Library
- [15] . 2008. Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Trans. Netw. 16, 1 (2008), 77–90.Google Scholar
Digital Library
- [16] 2004. Probabilistic routing in intermittently connected networks. In Proc. SAPIR 3126, LNCS, 239–254.Google Scholar
Cross Ref
- [17] . 2010. Semi-probabilistic routing in intermittently connected mobile ad hoc networks. In Journal of Info. Science and Eng. 26 (2010), 1677–1693.Google Scholar
- [18] . 2011. A storage friendly routing scheme in intermittently connected mobile networks. IEEE Trans. Veh. Technol. 60, 3 (2011), 1138–1149.Google Scholar
Cross Ref
- [19] . 2008. Ant colony optimization algorithm for detection and tracking of non-saturated roads. Electronics Letters 44, 12 (2008), 725–727.Google Scholar
Cross Ref
- [20] . 2008. Bee colony optimization with local search for travelling salesman problem. In Proceedings of the Sixth IEEE International Conference on Industrial Informatics. 1019–1025.Google Scholar
- [21] . 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.Google Scholar
Cross Ref
- [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 Scholar
- [23] . 2010. Congestion management based optimization technique using bee colony. 4th International Power Engineering and Optimization Conference (PEOCO2010). 184–186.Google Scholar
Cross Ref
- [24] . 2011. FACES: Friend – based ad hoc routing using challenges to establish security in MANETSs systems. IEEE Sys. Jour. 5, 2 (2011), 176–188.Google Scholar
Cross Ref
- [25] . 2002. Securing ad hoc routing protocols. In WiSe '02: Proc. of 1st ACM Workshop on Wireless Security. Atlanta, GA, 1–10.Google Scholar
Digital Library
- [26] . 2006. Securing mobile ad hoc networks with certificateless public keys. IEEE Trans., Dependable and Secure Computing 3, 4 (2006), 386–399.Google Scholar
Digital Library
- [27] . 2006. Ant colony optimization: Artificial ants as a computational intelligence technique. IEEE Computational Intelligence Magazine. USA 1, 4 (2006), 28–39.Google Scholar
Digital Library
- [28] . 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.Google Scholar
- [29] . 2007. JANE – The Java ad hoc network development environment. In Proceedings of the Fortieth Annual Simulation Symposium. 163–176.Google Scholar
Digital Library
- [30] . 2008. Opportunistic network environment simulator. Special Assignment Report, Helsinki University of Technology, Department of Communications and Networking.Google Scholar
- [31] . 2018. Context-sensitive access in industrial internet of things (IIoT) healthcare applications. IEEE Transactions on Industrial Informatics 14, 6 (2018), 2736–2744.Google Scholar
Cross Ref
- [32] . 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.Google Scholar
Cross Ref
- [33] . 2020. Enhanced medium access for traffic management in smart-cities' vehicular-cloud. IEEE Intelligent Transportation Systems Magazine, 2020.
DOI: Google ScholarCross Ref
Index Terms
Tripartite Transmitting Methodology for Intermittently Connected Mobile Network (ICMN)
Recommendations
An Efficient Secure Routing for Intermittently Connected Mobile Networks
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 ...
Planning the mobility of routing ferries for intermittently connected mobile networks
CHINACOM '11: Proceedings of the 2011 6th International ICST Conference on Communications and Networking in ChinaThe intermittent connectivity is very familiar in mobile wireless networks because of the constraint of communication range, interfere and attenuation of the signal etc. Therefore, store-carry-forward becomes an important routing mode in the ...
Geographical Routing in Intermittently Connected Ad Hoc Networks
AINAW '08: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - WorkshopsIn intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destination. In this paper we present LAROD, a geographical routing protocol for ...






Comments