Abstract
Device to device (D2D) data communication in cellular wireless network can be done either directly from source equipment (SE) to destination equipment (DE) or through relay equipment (RE). This type of network mainly known as Wireless ad hoc networks. Mobile ad-hoc networks (MANETs) have constraints such as such as limited power, route failure, bandwidth allocation, and computational complexity. The major impact on the performance of network depends on routing strategy. Routing strategy for matching the multi constraints of network is so far challenge in conventional network. MANETs suffers from dynamic movement of node, power, dynamic routing and storage complexity. Dynamic movement force the computation of re-routing, which act as extra computational burden on the system. In this paper, we propose the Grid Cluster based Multi-Objective Genetic Algorithm for Energy Efficient Trusted Network (gCMOGAEETN) algorithm for finding optimal routes from a given SE to a given DE. Our simulation results show that gCMOGAEETN algorithms are efficient in solving these routing problems and are capable of finding the optimal solutions at lower complexity than the ’brute-force’ exhaustive search, when the number of user equipment (UEs) is higher than or equal to 50. The analytical and simulation result shows that proposed method exhibit significantly higher performance than optimal adaptive forwarding strategy (OAFS), sub-optimal adaptive forwarding strategy (SAFS), memory enhanced genetic algorithm (MEGA), Elitism-based Immigrants Genetic algorithm (EIGA), dynamic load-balanced clustering problem (DLBCP) and Genetic Algorithm Based Optimization of Clustering (GABOC)..
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Recent Technology and Engineering (IJRTE)
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.