Golomb Ruler Sequence Generation and Optimization using Modified Firefly Algorithm

International Journal of Electronics and Communication Engineering
© 2014 by SSRG - IJECE Journal
Volume 1 Issue 5
Year of Publication : 2014
Authors : Yogita Wadhwa , Parvinder Kaur and Baljeet Kaur
pdf
How to Cite?

Yogita Wadhwa , Parvinder Kaur and Baljeet Kaur, "Golomb Ruler Sequence Generation and Optimization using Modified Firefly Algorithm," SSRG International Journal of Electronics and Communication Engineering, vol. 1,  no. 5, pp. 1-8, 2014. Crossref, https://doi.org/10.14445/23488549/IJECE-V1I5P101

Abstract:

Nature-inspired algorithms are among the most powerful algorithms for optimization problems. This paper intends to provide a detailed description of a Modified Firefly Algorithm (FA) Approach for Golomb Ruler Sequence Generation and optimization that allows suppression of the four wave mixing (FWM) crosstalk while maintaining channel bandwidth. We will compare the proposed modified firefly algorithm with other hard computing and soft computing algorithms such as Extended Quadratic Congruence (EQC), Search Algorithm (SA), Genetic Algorithm (GA), Biogeography Based Optimization (BBO), Firefly Algorithm (FA). Simulations results indicate that the proposed modified firefly algorithm is superior to existing hard computing and soft computing algorithms in terms of computational complexity

Keywords:

Four wave Mixing (FWM), Optimal Golomb Ruler (OGR), Firefly Algorithm (FA), Modified Firefly Algorithm (MFA)

References:

[1]. Wing C. Kwong, and Guu-Chang Yang, ―An Algebraic Approach to the Unequal-Spaced ChannelAllocation Problem in WDM Light wave Systems, IEEE Transactions on Communications, Vol. 45, No. 3,
352-359, March–1997.
[2]. Andrew R. Chraplyvy, ―Limitations on Light wave Communications Imposed By Optical–Fiber Nonlinearities, Journal of Light wave Technology, Vol. 8, No. 10, pp. 1548–1557, October–1990.
[3]. Gerd Keiser, ―Optical Fiber Communications, Third Edition, McGraw-Hill, New York, 2000.
[4]. Sardesai, H. P. 1999. A Simple Channel Plan to Reduce Effects of Nonlinearities In Dense WDM Systems. Lasers and Electro–Optics, (23–28, May–1999), pp. 183– 184. 
[5]. Forghieri, F., Tkach, R. W., and Chraplyvy, A. R. 1995. WDM systems with unequally spaced channels. J. Lightwave Technol., Vol. 13, pp. 889–897.
[6]. Hwang, B. and Tonguz, O. K. 1998. A generalized suboptimum unequally spaced channel allocation technique—Part I: In IM/DDWDMsystems. IEEE Trans. Commun., Vol. 46, pp. 1027–1037.
[7]. Tonguz, O. K. and Hwang, B. 1998. A generalized suboptimum unequally spaced channel allocation technique—Part II: In coherent WDM systems. IEEE Trans. Commun., Vol. 46, pp. 1186–1193.
[8]. Atkinson, M. D., Santoro, N., and Urrutia, J. 1986. Integer sets with distinct sums and differences and carrier frequency assignments for nonlinear repeaters. IEEE Trans. Commun., Vol. COM-34.
[9]. Randhawa, R., Sohal, J. S. and Kaler, R.S. 2009. Optimum Algorithm for WDM Channel Allocation for Reducing Four-Wave Mixing Effects. Optik 120, pp. 898–904.
[10]. http://www.compunity.org/events/pastevents/ewomp20 04/jaillet_krajecki_pap_ew04.pdf
[11]. W. Babcock,Intermodulation interference in radio systems, Bell Systems Technical Journal, pages: 63–73, 1953.
[12]. Gray S. Bloom and S.W. Golomb,Applications of Numbered Undirected Graphs‖, Proceedings of the IEEE, Vol. 65, No. 4: 562–570, April 1977.
[13]. Vrizlynn L. L. Thing, M. K. Rao and P. Shum, ―Fractional Optimal Golomb Ruler Based WDM Channel Allocation‖, The 8th Opto–Electronics and Communication Conference (OECC– 2003), Vol. 23, pp. 631–632, October 2003.
[14]. James B. Shearer, ―Some New Disjoint Golomb Rulers, IEEE Transactions on Information Theory, vol. 44, No. 7, pp. 3151–3153, Nov. 1998.
[15]. http://theinf1.informatik.uni–jena.de/teaching/ss10/oberseminar–ss10
[16]. Johan P. Robinson, ―Optimum Golomb Rulers, IEEE Transactions on Computers, vol. C–28, No. 12, December 1979.
[17]. James B. Shearer, ―Some New Optimum Golomb Rulers, IEEE Transactions on Information Theory, IT–36:183–184, January 1990.
[18]. Shobhika, ―Generation of Golomb Ruler Sequences and Optimization Using Genetic Algorithm, M. E. Thesis–2005, Department of Electronics andCommunication Engineering, Thapar Institute of Engineering and Technology, Deemed University, Patiala.
[19]. Stephen W. Soliday, A. Homaifar, Gary L. Lebby, ―Genetic Algorithm Approach to the Search for Golomb Rulers, Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA–95),Morgan Kaufmann (1995), 528–535.
[20]. John P. Robinson, ―Genetic Search for Golomb Arrays, IEEE Transactions on Information Theory, Vol. 46, No. 3: 1170–1173, May 2000.
[21]. Bansal, S. 2011. Golomb Ruler Sequences Optimization: Soft Computing Approaches. M. Tech.Thesis, Department of Electronics and Communication Engineering, Maharishi Markandeshwar Engineering College, Deemed University, Mullana.
[22]. Bansal, S. and Kuldeep Singh, P.2014. A Novel SoftComputing Algorithm for channel allocation in WDMSystems Vol. 85, No. 9, pp. 19-25. International Journal of Computer Applications(0975-8887)
[23]. A. Dimitromanolakis, ―Analysis of the Golomb Ruler and the Sidon Set Problems, and Determination ofLarge, Near–Optimal Golomb Rulers‖, Master's thesis, Department of Electronic and Computer Engineering,
Technical University of Crete, June 2002.
[24]. Apostolos Dollas, William T. Rankin, and David McCracken, ―A New Algorithm for Golomb Ruler Derivation and Proof of the 19 Mark Ruler‖, IEEE Transactions on Information Theory, Vol. 44, No. 1,
379–382, January 1998.
[25]. Project OGR‖, http://www.distributed.net/OGR.
[26]. J. Singer, A theorem in finite projective geometry and some applications to number theory, Trans. Am. Math. Soc. 43 (3) (1938) 377–385.
[27]. X.-S. Yang 2010. Firefly Algorithm, Stochastic Test Functions and Design Optimization. Int. J. Bio-Inspired Computation, Vol. 2, No. 2, pp.78–84.
[28]. Pereira, F.B., Tavares, J., Costa, E., ―Golomb Rulers: The Advantage of Evolution, Proceedings of the 11th Portuguese Conference on Artificial Intelligence,
Workshop on Artificial Life and Evolutionary Algorithms (ALEA), EPIA’03. (2003), pp. 27–33, 2003.