Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Call For Paper : Vol 11, Issue 08, August 2024

Call for Paper

Vol 11, Issue 08, August 2024

Indexing

SUPERMAN: Security Using Pre-Existing Routing for Mobile Ad hoc Networks

Author : R.Sangeetha 1 R.Selvapriya 2 M.Supraja 3 D.Bhavanidevi 4

PDF

Date of Publication :21st March 2018

Abstract: The adaptability and versatility of Mobile Ad hoc Networks (MANETs) have made them expanding famous in an extensive variety of utilization case. To protect these networks, security protocols have been developed to protect routing and application data. However, these protocols only protect routes or communication, not both. Both secure directing and correspondence security conventions must be executed to give full assurance. The use of communication security protocols originally developed for wire line and Wi-Fi networks can also place a heavy burden on the limited network resources of a MANET. To address these issues, a novel secure structure is proposed. The framework is designed to allow existing network and routing protocols to perform their functions, whilst providing node authentication, access control, and communication security mechanisms. This paper shows a novel security system for MANETs, SUPERMAN. Simulation results comparing SUPERMAN with IPSec, SAODV and SOLSR are provided to demonstrate the proposed frameworks suitability for wireless communication security.

Reference :

    1. C.-Y. Chong and S. Kumar, “Sensor networks: Evolution, opportunities, and challenges,” Proc. IEEE, vol. 91, no. 8, pp. 1247–1256, Aug. 2003.
    2. J. Wang, R. Ghosh, and S. Das, “A survey on sensor localization,” J. Control Theory Appl., vol. 8, no. 1, pp. 2–11, 2010
    3. C.-F. Huang and Y.-C. Tseng, “The coverage problem in a wireless sensor network,” in Proc. 2nd ACM Int. Conf. Wireless Sensor Netw. Appl., 2003, pp. 115–121.
    4. Y. Gu, H. Liu, and B. Zhao, “Target coverage with QoS requirements in wireless sensor networks,” in Proc. Intell. Pervas. Comput., 2007, pp. 35–38.
    5. M. Chaudhary and A. K. Pujari, “Q-coverage problem in wireless sensor networks,” in Proc. Int. Conf. Distrib. Comput. Netw., 2009, pp. 325–330.
    6. D. Karaboga and B. Akay, “A survey: Algorithms simulating bee swarm intelligence,” Artif. Intell. Rev., vol. 31, nos. 1–4, pp. 61–85, 2009.
    7. D. Karaboga and B. Basturk, “On the performance of artificial bee colony (SUPERMAN) algorithm,” Appl. Soft Comput., vol. 8, pp. 687–697, Jan. 2008.
    8. D. Karaboga, B. Gorkemli, C. Ozturk, and N. Karaboga, “A comprehensive survey: Artificial bee colony (SUPERMAN) algorithm and applications,” Artif. Intell. Rev., 2012, pp. 1–37.
    9. D. Karaboga, C. Ozturk, N. Karaboga, and B. Gorkemli, “Artificial bee colony programming for symbolic regression,” Inf. Sci., vol. 209, pp. 1–15, Nov. 2012.
    10. D. Karaboga, S. Okdem, and C. Ozturk, “Cluster based wireless sensor network routing using artificial bee colony algorithm,” Wireless Netw., vol. 18, no. 7, pp. 847–860, 2012.

Recent Article