Multiconstrained QoS Routing Using a Differentially Guided Krill Herd Algorithm in Mobile Ad Hoc Networks

This paper presents a multiconstrained quality-of-service routing (QoSR) based on a differentially guided krill herd (DGKH) algorithm in mobile ad hoc networks (MANETs). QoSR is a NP-complete and significant problem with immense challenges in determining an optimum path that simultaneously satisfies various constraints in MANETs, where the topology varies constantly. Various heuristic algorithms are widely used to solve this problem with compromise on excessive computational complexities and/or low performance. This paper proposes a krill herd based algorithm called DGKH, where the krill individuals do not update the position in comparison with one-to-one (as usual), but instead it uses the information from various krill individuals and then searches to determine a feasible path. Experiment results on MANETs with different number nodes (routes) are considered with three constraints which are maximum allowed delay, maximum allowed jitter, and minimum requested bandwidth. It is demonstrated that the proposed DGKH algorithm is an effective approximation algorithm exhibiting satisfactory performance than the KHA and existing algorithms in the literature by determining an optimum path that satisfies more than one QoS constraint in MANETs.