Abstract
Aim: The aim of this study is the deployment of components in an efficient manner to make a cost-effective FiWi network.
Background: Fiber Wireless access network is the boost to broadband access technology for providing network services to Internet users at a lower cost. Deployment of components in FiWi access network is very crucial since it affects the deployment cost and network performance.
Objective: We investigate the planning process for efficient placement of components in FiWi access networks. For optimizing the position of components (wireless routers and ONUs) in the network, a novel nature inspired Reptile Search Algorithm (RSA) is proposed in the paper.
Methods: Extensive simulation is carried out to implement proposed work. A simulation model and code is developed in MATLAB to get the optimized position of components for existing and proposed algorithms.
Results: We compare the performance of proposed algorithm with existing algorithm. The obtained results show that the proposed algorithm has superior performance than the existing algorithm.
Conclusion: The present work optimizes the position of components using RSA algorithm. RSA returns the lower number of required wireless routers/ONUs, lesser TCD, increased AONUC, fast convergence rate, lesser execution run time than WSSA algorithm. The outcome of the paper highlights the importance of the proposed work in network planning and component deployment in FiWi access network.
Graphical Abstract
[http://dx.doi.org/10.1016/j.yofte.2011.12.002]
[http://dx.doi.org/10.1016/j.jnca.2014.01.004]
[http://dx.doi.org/10.1109/MCOM.2009.4785396]
[http://dx.doi.org/10.1109/MNET.2011.5687951]
[http://dx.doi.org/10.1016/j.procs.2015.01.055]
[http://dx.doi.org/10.1109/JLT.2012.2188498]
[http://dx.doi.org/10.1038/scientificamerican0792-66]
[http://dx.doi.org/10.1016/j.oceaneng.2021.109892]
[http://dx.doi.org/10.1016/0377-2217(90)90001-R]
[http://dx.doi.org/10.1109/ICNN.1995.488968]
[http://dx.doi.org/10.1109/CEC.1999.782657]
[http://dx.doi.org/10.1016/j.cad.2010.12.015]
[http://dx.doi.org/10.1016/j.ins.2010.07.015]
[http://dx.doi.org/10.1007/s00366-011-0241-y]
[http://dx.doi.org/10.1007/978-3-642-04944-6_14]
[http://dx.doi.org/10.1016/j.advengsoft.2013.12.007]
[http://dx.doi.org/10.1016/j.knosys.2015.07.006]
[http://dx.doi.org/10.1016/j.advengsoft.2016.01.008]
[http://dx.doi.org/10.1016/j.advengsoft.2017.01.004]
[http://dx.doi.org/10.1016/j.advengsoft.2017.07.002]
[http://dx.doi.org/10.1016/j.future.2020.03.055]
[http://dx.doi.org/10.1109/JSACOCN.2008.032207]
[http://dx.doi.org/10.1016/j.yofte.2015.01.010]
[http://dx.doi.org/10.1007/978-981-33-6977-1_8]
[http://dx.doi.org/10.1016/j.heliyon.2019.e01311] [PMID: 30976667]
[http://dx.doi.org/10.2139/ssrn.3364212]
[http://dx.doi.org/10.1016/j.yofte.2019.102002]
[http://dx.doi.org/10.1016/j.yofte.2021.102505]
[http://dx.doi.org/10.1109/4235.585893]