Home            Contact us            FAQs
    
      Journal Home      |      Aim & Scope     |     Author(s) Information      |      Editorial Board      |      MSP Download Statistics

     Research Journal of Applied Sciences, Engineering and Technology


Optimized Minimum Spanning Tree for Secure Routing in MANET

1V. Bhuvaneswari and 2M. Chandrasekaran
1Department of Computer Science and Engineering, Government Polytechnic College, Dharmapuri
2Department of Electronics and Communication Engineering, Government College of Engineering, Bargur, India
Research Journal of Applied Sciences, Engineering and Technology   2016  3:320-327
http://dx.doi.org/10.19026/rjaset.12.2339  |  © The Author(s) 2016
Received: August ‎8, ‎2015  |  Accepted: September ‎3, ‎2015  |  Published: February 05, 2016

Abstract

Secure group communication transfers message from one member to another confidentially. Key management for secure communication in wireless networks is primitive based on cryptographic techniques. Inter-cluster routing was used to improve wireless networks security. In the new scheme, Minimum Spanning Tree (MST) and GBest-BAT algorithm are computed to identify Cluster Heads (CH) with a concept of backup nodes being introduced for effective key management. This study proposes MST formation for inter-cluster routing and it is optimized with GBEST- BAT algorithm.

Keywords:

Cluster Head (CH), GBest-BAT algorithm, inter-cluster routing, Minimum Spanning Tree (MST), secure group communication, security,


References

  1. Abreu, R.C. and J.E.C. Arroyo, 2011. A particle swarm optimization algorithm for topology control in wireless sensor networks. Proceeding of the 30th IEEE International Conference of the Chilean Computer Science Society, pp: 8-13.
    CrossRef    
  2. Anupama, M. and B. Sathyanarayana, 2011. Survey of cluster based routing protocols in mobile ad hoc networks. Int. J. Comput. Theor. Eng., 3(6): 806-815.
    CrossRef    
  3. Bakht, H., 2011. Survey of routing protocols for mobile ad-hoc network. Int. J. Inform. Commun. Technol. Res., 1(6): 258-270.
  4. Baziar, A., A. Kavoosi-Fard and J. Zare, 2013. A novel self- adaptive modification approach based on bat algorithm for optimal management of renewable MG. J. Intell. Learn. Syst. Appl., 5(01): 11.
    CrossRef    
  5. Bui, T.N., X. Deng and C.M. Zrncic, 2012. An improved ant-based algorithm for the degree-constrained minimum spanning tree problem. IEEE T. Evolut. Comput., 16(2): 266-278.
    CrossRef    
  6. Dalal, R., M. Khari and Y. Singh, 2012a. Different ways to achieve trust in MANET. Int. J. AdHoc Netw. Syst., 2(2): 53-64.
  7. Dalal, R., Y. Singh and M. Khari, 2012b. A review on key management schemes in MANET. Int. J. Distrib. Parall. Syst., 3(4): 165-172.
    CrossRef    
  8. Djenouri, D., L. Khelladi and N. Badache, 2005. A survey of security issues in mobile ad hoc networks. IEEE Commun. Surv., 7(4): 2-28.
    CrossRef    
  9. Gomathi, K. and B. Parvathavarthini, 2010. An efficient cluster based key management scheme for MANET with authentication. Proceedings of the Trendz in Information Sciences and Computing (TISC, 2010). Chennai, pp: 202-205.
    CrossRef    
  10. Gronskiy, A. and J.M. Buhmann, 2014. How informative are minimum spanning tree algorithms? Proceeding of the IEEE International Symposium on Information Theory (ISIT, 2014). Honolulu, HI, pp: 2277-2281.
    CrossRef    
  11. Guo, W.Z., H.L. Gao, G.L. Chen and L. Yu, 2009. Particle swarm optimization for the degree-constrained MST problem in WSN topology control. Proceeding of the IEEE International Conference on Machine Learning and Cybernetics, 3: 1793-1798.
    CrossRef    
  12. Jain, J., M. Fatima, R. Gupta and K. Bandhopadhyay, 2005. Overview and challenges of routing protocol and mac layer in mobile ad-hoc network. J. Theor. Appl. Inform. Technol., 8(1): 6-12.
  13. Karypis, G. and V. Kumar, 1995. Metis-unstructured graph partitioning and sparse matrix ordering system. Version 2.0, Technical report, Department of Computer Science, University of Minnesota, Minneapolis, MN.
  14. Karypis, G. and V. Kumar, 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(1): 359-392.
    CrossRef    
  15. Karypis, G., E.H. Han and V. Kumar, 1999. Chameleon: Hierarchical clustering using dynamic modeling. Computer, 32(8): 68-75.
    CrossRef    
  16. Komarasamy, G. and A. Wahi, 2012. An optimized K-means clustering technique using bat algorithm. Eur. J. Sci. Res., 84(2): 263-273.
  17. Li, Y. and X. Chang, 2011. A MST-based and new GA supported distribution network planning. Proceeding of the International Conference on Mechatronic Science, Electric Engineering and Computer (MEC, 2011), pp: 2534-2538.
  18. Malik, M., 2012. Bees algorithm for degree-constrained minimum spanning tree problem. Proceeding of the National Conference on Computing and Communication Systems (NCCCS, 2012). Durgapur, pp: 1-8.
    CrossRef    
  19. Nakamura, R.Y.M., L.A.M. Pereira, K.A. Costa, D. Rodrigues, J.P. Papa and X.S. Yang, 2012. BBA: A binary bat algorithm for feature selection. Proceeding of the 25th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI), August 22-25, pp: 291-297.
    CrossRef    PMid:21383680    
  20. Narayanan, A.E., R. Devi and A.V. Jayakumar, 2013. An energy efficient cluster head selection for fault-tolerant routing in MANET. Int. J. Eng. Technol., 5(2): 0975-4024.
  21. Papagianni, C., C. Pappas, N. Lefkaditis and I.S. Venieris, 2009. Particle swarm optimization for the multi level capacitated minimum spanning tree. Proceeding of the IEEE International Multiconference on Computer Science and Information Technology (IMCSIT), pp: 765-770.
    CrossRef    
  22. Rafsanjani, M.K. and B. Shojaiemehr, 2012. Improvement of self-organized public key management for MANET. J. Am. Sci., 8(1): 197-202.
  23. Roy, P., 2011. A new technique to solve Minimum Spanning Tree (MST) problem using Modified Shuffled Frog-Leaping Algorithm (MSFLA) with GA cross-over. Proceeding of the 3rd International Conference on Advances in Recent Technologies in Communication and Computing (ARTCom). Bangalore, pp: 32-35.
    CrossRef    
  24. Singh, U.P. and R.S. Rathore, 2013. Distributed hierarchical group key management using elliptic curve and hash function. Int. J. Comput. Appl., 61(19).
  25. Upadhyayula, S. and S.K.S. Gupta, 2006. Spanning tree based algorithms for latency and energy efficient data aggregation enhanced convergecast (DAC) wireless sensor networks. Ad Hoc Netw., 5(5): 626-648.
    CrossRef    
  26. Xiong, W.A. and Y.H. Gong, 2011. Secure and highly efficient three level key management scheme for MANET. WSEAS T. Comput., 10(1): 6-15.
  27. Yang, X.S., 2010. A New Metaheuristic Bat-Inspired Algorithm. In: Gonzalez, J.R., D.A. Pelta, C. Cruz, G. Terrazas and N. Krasnogor (Eds.), Nature Inspired Cooperative Strategies for Optimization (NICSO, 2010). Springer-Verlag, Berlin, Heidelberg.
    CrossRef    
  28. Yilmaz, S. and E.U. Kucuksille, 2013. Improved Bat Algorithm (IBA) on continuous optimization problems. Lect. Notes Software Eng., 1(3): 279-283.
    CrossRef    
  29. Zhang, Y., Y. Shen and S. Lee, 2010. A cluster-based group key management scheme for wireless sensor networks. Proceeding of the 12th IEEE International Asia-Pacific Web Conference (APWEB), pp: 386-388.
    CrossRef    
  30. Zheng, C., H. Hu, Y. Hu and H. Xia, 2011. The selection of scattered settlements based on ant colony optimization algorithm. Proceeding of the 19th International Conference on Geoinformatics, pp: 1-6.
    CrossRef    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.

ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Information
   Sales & Services
Home   |  Contact us   |  About us   |  Privacy Policy
Copyright © 2024. MAXWELL Scientific Publication Corp., All rights reserved