Abstract

Orthogonal frequency-division multiplexing [OFDM] is an information transfer technique in which a single data flow is divided between several closely spaced narrowband subchannel frequency range rather than a single Wideband channel frequency. The information is sent to the relay node there is a delay and some data is lost in the relay node is the major issue in the existing system. To overcome these challenges, The objective of this study is to minimize the overall energy consumption and to maximize the network lifetime. In this paper, a novel Five Input Hybrid Optimization Relay Node Selection and Energy Efficient Routing (FIHORNSEER) technique has been proposed for choosing the best relay based on noises. Ant Lion Optimization (ALO) is initially utilized to select the relay node's elite position. Secondly, the Crow Search Optimization (CSO) Algorithm is used for the phenomenon of position and memory of each relay. Finally, the Memetic Algorithm (MA) was generated by integrating the Ant Lion and Crow search optimization algorithm for the best relay node selection. The proposed framework is compared with previous techniques like FRNSEER, LMMSE, and HABO-OFDM Methods in terms of performance analysis, such as average utility, Energy Consumption, and Network Life Time. The result shows that the proposed FIHORNSEER improves the energy consumption better than 22.01%, 16.4%, and 12.2% FRNSEER, LMMSE, and HABO-OFDM, respectively.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.