Design of data confidential and reliable bee clustering routing protocol in MANET (Vol 2)

  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract

    Mobile ad hoc network (MANET) requires extraneous energy effectualness and legion intelligence for which a best clustered based approach is pertained called the “Bee-Ad Hoc-C”. In MANET the mechanism of multi-hop routing is imperative but may leads to a challenging issue like lack of data privacy during communication. ECC (Elliptical Curve Cryptography) is integrated with the Bee clustering approach to provide an energy efficient and secure data delivery system. Even though it ensures data confidentiality, data reliability is still disputable such as data dropping attack, Black hole attack (Attacker router drops the data without forwarding to destination). In such cases the technique of overhearing is utilized by the neighbor routers and the packet forwarding statistics are measured based on the ratio between the received and forwarded packets. The presence of attack is detected if the packet forwarding ratio is poor in the network which paves a way to the alternate path identification for a reliable data transmission. The proposed work is an integration of SC-AODV along with ECC in Bee clustering approach with an extra added overhearing technique which n on the whole ensures data confidentiality, data reliability and energy efficiency.

  • Keywords

    Mobile Ad Hoc Networks, Elliptical curve Cryptography, Bee Ad Hoc Clustering, and Overhearing.

  • References

      [1] Bansal Priyanka, Gupta Anuj K, “Impact of Black Hole and Neighbor Attack on AOMDV Routing Protocol”, International Journal of Innovations in Engineering and Technology (IJIET), Vol. 3, No. 4, 2014.

      [2] Gura, N., Patel, A., Wander, A., Eberle, H. and Shantz, S.C., 2004, August. Comparing elliptic curve cryptography and RSA on 8-bit CPUs. In International workshop on cryptographic hardware and embedded systems (pp. 119-132). Springer, Berlin, Heidelberg.

      [3] Ghaffari, A., 2015. Congestion control mechanisms in wireless sensor networks: A survey. Journal of network and computer applications, 52, pp.101-115.

      [4] Shen, H., He, S., Yu, L. and Sarker, A., 2017, March. Prediction-based redundant data elimination with content overhearing in wireless networks. In Pervasive Computing and Communications (PerCom), 2017 IEEE International Conference on (pp. 50-58). IEEE.

      [5] Sett, R. and Banerjee, I., 2015, August. An overhearing based routing scheme for Wireless Sensor Networks. In Advances in Computing, Communications and Informatics (ICACCI), 2015 International Conference on (pp. 2076-2082). IEEE.

      [6] T.C. Camilo, Carreto, J.S. Silva, and F. Boavida, “An Energy-Efficient Ant Based Routing Algorithm for Wireless Sensor Networks”, In Proceedings of 5th International Workshop on Ant Colony Optimization and Swarm Intelligence, Brussels, Belgium, pp. 49 - 59, 2006.

      [7] Narendra Singh Yadav, Bhaskar P Deosarkar, R. P. Yadav, “A Low Control Overhead Cluster Maintenance Scheme for Mobile Ad hoc Networks”, International Journal of Recent Trends in Engineering, Vol .1, No. 1, pp. 1 - 9, 2009.

      [8] K Renuka, G. Murali, “Providing Security for Multipath Routing Protocol in Wireless Sensor Networks”, International Journal of Research in Engineering and Technology, Vol. 4, No. 2, 2015.

      [9] M. Saleem, M. Farooq, “Beesensor: A Bee-Inspired Power Aware Routing Protocol for Wireless Sensor Networks”, In M. Giacobini et al. (Eds.), Lecture Notes in Computer Science, Springer Verlag, pp. 81–90, 2007.

      [10] Raju M Janardhana, Subbaiah P., Ramesh V., “A novel elliptic curve cryptography based AODV for mobile ad-hoc networks for enhanced security”, Journal of Theoretical and Applied Information Technology, December 2013.

      [11] Marina, Mahesh K., and Samir R. Das. "Ad hoc onǦdemand multipath distance vector routing." Wireless communications and mobile computing 6.7 (2006): 969-988.




Article ID: 10552
DOI: 10.14419/ijet.v7i2.8.10552

Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.