Privacy Preserving Bee Routing Protocol for Intermittently Connected Mobile Networks
- 1 Department of CSE, Anna University, Regional Campus, Madurai, India
- 2 Department of CSE, Vaigai College of Engineering, Madurai, India
Abstract
The Intermittently Connected Mobile Networks (ICMN) is a disconnected mobile network where a complete connectivity never exists. More number of moving nodes makes them impenetrable genre which in turn makes the network intermittently connected. Detection of malicious node and routing is onerous due to its genre. In this paper, we put forward a secure routing that aids in detecting and preventing intrusion of malicious nodes. The routing process is made more adorable through Bee Colony Optimization (BCO). The amalgamation of BCO with authentication series leads a novel routing protocol named Privacy Preserving Bee Routing Protocol (PPBRP) which is highly secure. The degree of security is tested with malicious nodes in the network to prove that the proposed PPBRP ensures secure routing.
- Ramesh, S., Praveen, R., Indira, R. and Ganesh Kumar, P. (2012) A Survey on Routing Methodologies for ICMANET. Proceedings of the 4th IEEE International Conference on Advanced Computing, Chennai, 13-15 December2012, 1-6. http://dx.doi.org/10.1109/icoac.2012.6416801
- Perkins, C. and Royer, E. (1999) Ad Hoc On-Demand Distance Vector Routing. Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, 25-26 February 1999, 90-100. http://dx.doi.org/10.1109/mcsa.1999.749281
- Ramesh, S. and Indira, R. (2015) Secure Agent Based Routing for ICMANET. International Journal of Applied Engineering Research, 10, 4864-4871.
- Cokuslu, D. and Erciyes, K. (2008) A Flooding Based Routing Algorithm for Mobile Ad Hoc Networks. IEEE 16th. Int. Conf. SIU 2008, Aydin, 20-22 April 2008, 1-5.
- Vahdat, A. and Becker, D. (2000) Epidemic Routing for Partially Connected Ad Hoc Networks. Duke Univ., Duhram, NC, TecH.Rep. CS-2000-06.
- 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
- 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
- Spyropoulos, T., Psounis, K. and Raghavendra, C.S. (2005) Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, Philadelphia, 22-26 August 2005, 252-253. http://dx.doi.org/10.1145/1080139.1080143
- Lindgren, A., Doria, A. and Schelen, O. (2004) Probabilistic Routing in Intermittently Connected Networks. Proc. SAPIR, 3126, 239-254. http://dx.doi.org/10.1007/978-3-540-27767-5_24
- Shi, K. (2010) Semi-Probabilistic Routing in Intermittently Connected Mobile Ad Hoc Networks. Journal of Information Science and Engineering, 26, 1677-1693.
- Ramesh, S., Indira, R., Praveen, R. and Ganesh Kumar, P. (2013) S-Spray Routing Protocol for Intermittently Connected Mobile Networks. ICTACT Journal on Communication Technology, 4, 761-765.
- 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 Transactions on Vehicular Technology, 60, 1138-1149. http://dx.doi.org/10.1109/TVT.2011.2104378