All Title Author
Keywords Abstract


Ant Routing Protocol with Location Services in Intermittently Connected MANETs

DOI: 10.4236/cs.2016.77092, PP. 1087-1097

Keywords: MANET, ICMANET, Delay Tolerant Network, ACO, A-LODIS, Agent, AES

Full-Text   Cite this paper   Add to My Lib

Abstract:

Wireless and mobile networks seem to deliver tremendous uses. In its way, MANET leads to enormous real world applications. Routing allows us to implement many real world applications. Complete affinity in an infrequent network like ICMANET is highly impossible. Disconnected MANET is also known as ICMANET which is also a DTN (Delay Torrent Network) that supports for higher delays. It is laborious process to execute routing in a diffused network process to execute routing in a diffused network. To deliver the data packets towards the destined node to its best, a new strategy in routing called Ant routing protocol in concoction with storage strategy LoDis has been proposed. Despite of routing, security is still an unsolved problem. To evaluate this situation, this paper presents a methodology called agent technology which yields a secure routing. Hostile node in the network is spotted with the help of agent at each node. A cryptographic algorithm Advanced Encryption Standard (AES) is habituated to improve secure communication in wide range Mobility and total number of nodes in the network act as variables in examining the hostile nodes in the network to judge the standard of security. Improved performance along with the security is the point to be highlighted.

References

[1]  Stamouli, I., Argyroudis, P.G. and Tewari, H. (2005) Real-Time Intrusion Detection for Ad Hoc Networks. IEEE 6th International Symposium on a World of Wireless Mobile and Multimedia Networks, Taormina, 13-16 June 2005, 374- 380.
[2]  Cokuslu, D. and Erciyes, K. (2008) A Flooding Based Routing Algorithm for Mobile Ad Hoc Networks. IEEE 16th. International Conference on Signal Processing, Communication and Applications, Aydin, 20-22 April 2008, 1-5.
[3]  Vahdat, A. and Becker, D. (2000) Epidemic Routing for Partially Connected Ad Hoc Networks. Duke Univ., Duhram, NC, TecH.Rep. CS-2000-06.
[4]  Heissenbüttel, M., Braun, T., Bernoulli, T. and W?lchi, M. (2004) BLR: Beaconless Routing Algorithm for Mobile Ad Hoc Networks. Computer Communications, 27, 1076-1088.
http://dx.doi.org/10.1016/j.comcom.2004.01.012
[5]  Musolesi, M., Hailes, S. and Mascolo, C. (2005) Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks. IEEE 6th International Symposium on a World of Wireless Mobile and Multimedia Networks, Taormina, 13-16 June 2005, 183-189.
[6]  Choudhury, R.R. (2005) Brownian Gossip: Exploiting Node Mobility to Diffuse Information in Ad Hoc Networks. 2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing, San Jose.
http://dx.doi.org/10.1109/colcom.2005.1651262
[7]  Ghosh, J., Westphal, C., Ngo, H. and Qiao, C. (2006) Bridging Intermittently Connected Mobile Ad Hoc Networks (ICMAN) with Sociological Orbits. IEEE 25th International Conference on Computer Communications, Barcelona, 23-29 April 2006, 1-3.
[8]  Li, Z. and Shen, H. (2008) A Direction Based Geographic Routing Scheme for Intermittently Connected Mobile Networks. IEEE/IFIP Int., Conf.,Embedded and Ubiquitous Computing, Shanghai, 17-20 December 2008, 359-365.
[9]  Spyropoulos, T., Psounis, K. and Ragavendra, C.S. (2008) Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case. IEEE/ACM Transactions on Networking, 16, 63-76.
http://dx.doi.org/10.1109/TNET.2007.897962
[10]  Spyropoulos, T., Psounis, K. and Ragavendra, C. (2008) Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case. IEEE/ACM Transactions on Networking, 16, 77-90.
http://dx.doi.org/10.1109/TNET.2007.897964
[11]  Shi, K. (2010) Semi-Probablistic Routing in Intermittently Connected Mobile Ad-Hoc Networks. Journal of Information Science and Engineering, 26, 1677-1693.
[12]  Jebajothi, E.J., Kavitha, V. and Kavitha, T. (2010) Contention Based Routing in Mobile Ad Hoc Networks with Multiple Copies. International Journal of Engineering and Technology, 2, 93-96.
[13]  Kuiper, E. and Nadim-Tehrani, S. (2011) Geographical Routing with Location Services in Intermittently Connected MANETs. IEEE Transactions on Vehicular Technology, 60, 592-694.
http://dx.doi.org/10.1109/TVT.2010.2091658
[14]  Spyropoulos, T., Psounis, K. and Raghavendra, C.S. (2005) Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. ACM Special Interest Group on Data Communications Workshop Delay—To- lerant Networking, Philadelphia, 22-26 August 2005, 252-253.
[15]  Lai, W.K., Chung, W.K., Tsai, J.B. and Shieh, C.S. (2009) Spray and Hop: Efficient Utility-Mobility Routing for Intermittently Connected Mobile Networks. IEEE 4th International Conference on Communications and Networking, Location, Xian, 26-28 August 2009, 1-5.
[16]  Song, X., Li, B. and Yang, H. (2006) Improved Ant Colony Algorithm and Its Applications in TSP. IEEE Proceedings of 6th Inter. Conf. on Intelligent Systems design and Applications (ISDA’06), Jinan, 16-18 October 2006, 1145-1148.
[17]  Ioannis, K., Dimitriou, T. and Freiling, F.C. (1997) Towards Intrusion Detection in Wireless Sensor Networks. 13th European Wireless Conference, Paris, 1-4 April 2007, 1-10.
[18]  Sekaran, R. and Parasuraman, G.K. (2014) A Secure 3-Way Routing Protocol for Intermittently Connected Mobile Adhoc Networks. The Scientific Journal, 2014, Article ID: 865071.
http://dx.doi.org/10.1155/2014/865071
[19]  Mow, W. (2006) Modern Cryptography, Theory and Practice. 4th Edition, Pearson Education, New Delhi, 1-648.
[20]  Keranen, A., Ott, J. and Karkkainen, T. (2009) The One Simulator for DTN Protocol Evaluation. International Conference on Simulation Tools and Techniques, Rome, 2-4 March 2009, 1-10.
[21]  Keranen, A. (2008) Opportunistic Network Environment Simulator. Special Assignment Report, Helsinki University of Technology, Department of Communications and Networking, Finland.

Full-Text

comments powered by Disqus