Abstract
Vertical handovers (VH) is said to be a significant effect of user mobility in a diverse wireless network as it causes a major effect on network performances, like call blocking probability, packet delay, or throughput. On the other hand, the analysis of VH meets a lot of complexities when it comes to investigation, including network modeling that was very complex owing to the diversity in topology. This article aims to present a VH method by means of graph theory. At first, the improved k-partite graph is exploited to model the VH issues in HetNets. Second, improved Dijkstra’s algorithm (DA) is deployed for choosing the best path. Further, the analytic hierarchy process is used for estimating the adaptive weights among nodes. Accordingly, optimal selection of weights in DA is performed depending on a hybridized model named as grey wolf upgraded CSO. Ultimately, several metrics such as throughput, packet jitter, and delay and packet losses indicate that the created strategy is efficient.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
