A Pareto optimal multi-objective optimisation for parallel dynamic programming algorithm applied in cognitive radio ad hoc networks
by Badr Benmammar; Youcef Benmouna; Francine Krief
International Journal of Computer Applications in Technology (IJCAT), Vol. 59, No. 2, 2019

Abstract: In this paper, we present a Pareto optimal multi-objective optimisation for parallel dynamic programming algorithm applied in cognitive radio ad hoc networks. To measure the performance of our contribution, we have used a multi-core architecture. The parallel version of the dynamic programming is implemented with the concept of Pareto. To select the most compromising solution from the Pareto front, Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) is used in this paper. We have also implemented a meta-heuristic (cuckoo search) with the Pareto principle in order to validate our proposal. Our simulations approve the desired results, showing significant gain in terms of execution time. The main objective is to allow a cognitive engine to use an exact method and to have better results compared to the use of meta-heuristics while satisfying QoS parameters.

Online publication date: Fri, 22-Feb-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com