AUTHORS: Seyed Mahmood Hashemi, Jingsha He, Alireza Ebrahimi Basabi
Download as PDF
ABSTRACT: Modeling of network security is useful approach to comprehend the status. In this paper, network is modeled in a graph. Security problem is solved in graph as Graph Coloring Problem (GCP). In GCP, two adjacent nodes must have different colors. Thus GCP provides the security in the network. One objective in GCP is chromatic number and another objective is total price. We present a multi-objective problem for GCP in this paper. Defined problem is solved with multi-objective simulated annealing and multi-objective imperialist competitive algorithm.
KEYWORDS: Network Security, Graph Coloring, Multi-Objective Optimization
REFERENCES:
[1] International Standard, Information Processing Systems, ISO 7498-2
[2] Shuzhen Wanga, Zonghua Zhang b, Youki Kadobayashi, “Exploring attack graph for costbenefit security hardening: A probabilistic approach”, ELSEVIER, compute rs & s e c u r i t y 3 2 ( 2 0 1 3 ) 1 5 8 e1 6 9
[3] Marc Demange, Tınaz Ekim, Bernard Ries, Cerasela Tanasescu, “On some applications of the selective graph coloring problem”, ELSEVIER, European Journal of Operational Research 240 (2015) 307–314
[4] Chen Gong, Omar Abu-Ella, Xiaodong Wang, Ali Tajer, “Constrained Group Decoder for Interference Channels”, JOURNAL OF COMMUNICATIONS, VOL. 7, NO. 5, MAY 2012
[5] Shahid Khattak, Wolfgang Rave, Gerhard Fettweis, “Distributed IterativeMultiuser Detection through Base Station Cooperation”, EURASIP Journal onWireless Communications and Networking Volume 2008, Article ID 390489, 2008
[6] M. L. S. N. Swarajya Lakshmi, Niranjan Prasad, “SOURCES OF RADIO LINK INTERFERENCES AND THEIRMITIGATION TECHNIQUES, Golden Research Thoughts, Vol. 2, Issue 7, 2013
[7] Maaly A. Hassan, Andrew Chickadel, ” A REVIEW OF INTERFERENCE REDUCTION Start Produce Matrix of nodes’ connections and their prices Using a multi-objective optimization algorithm to produce N, P Finish IN WIRELESS NETWORKS USING GRAPH COLORING METHODS”, International journal on applications of graph theory in wireless ad hoc networks and sensor networks,” Vol. 3, No. 1, 2011
[8] Guillemo De Ita Luna, Yuridiana Aleman, Nahum Loya, “Polynomial Strategies for the 3- coloring of a graph”, Acta Universitaria, Vol. 22, NE-1, ENC Marzo, 2012
[9] Sándor Szabó, “A Non-Conventional Coloring of the Edges of a Graph”, Scientific Research, 119-124, 2012
[10] V. J. Vernold, M. Venkachalam, “A NOTE ON STAR COLORING OF CENTRAL GRAPH OF BIPARTITE GRAPH AND CORONA GRAPH OF COMPLETE GRAPH WITH PATH AND CYCLE”, Transaction of Combinatorics, Vol. 1, No. 1, 2251-8665, 2012
[11] Carlos A. Coello Coello, David A. Van Veldhuizen, Gary B. Lamont, “Evolutionary Algorithms for Solving Multi-Objective Problems”, Speringer. 2nd Ed. , 2007.
[12] Cristopher Dimopoulos, “A Review of Evolutionary Multi-objective Optimization, Application in the Area of Production Research”, IEEE. Print ISBN 0-7803-8515-2, DOI 10.1109/CEC.2004.1331072. , 2004.
[13] Carlos A. Coello Coello, “An Updated Survey of Evolutionary Multi-Objective Techniques: State of the art and Future Trends”, IEEE. Vol.1, Printed ISBN 0-7803-5536-9, DOI 10.1109/CEC.1999.781901. , 1999.
[14] Zdzislaw Kowalczuk, Tomasz Bialaszewski, “Improving Evolutionary MultiObjective Optimization Using Genders”, Springer. Vol. 4029/2006, DOI 10.1007/1178231-42. , 2006.
[15] Arash Khabbazi, Esmaeil Atashpaz, Caro Lucas, “Imperialist Competitive Algorithm for Minimum Bit Error Rate Beamforming”, Inte.J. Bio-Inspired Computation, Vol. 1, Nos.1/2. , 2009.
[16] Esmaeil Atashpaz, Caro Lucas, “Imperialist Competitive Algorithm: An Algorithm for Optimization Inspired by Imperialistic Competition”, IEEE. Congress on Evolutionary Computation. , 2008 .
[17] Caro Lucas, Zahra Nasiri-Gheidari, Farid Tootoonchian, “Application of an Imperialist Competitive Algorithm to the Design of a Linear Induction Motor”, ELSEVIER. Energy Conversion and Management. 1407–1411, 2010.
[18] Sanghamitra Bandyopadhyay, Sriparna Saha, Ujjwal Maulik, Kalynmoy Deb, “A Simulated Annealing-Based Multi-Objective Optimization Algorithm: AMOSA”, IEEE, Vol. 12, Issue 3, ISSN 1089-778x, 2008
