Quantum flower pollination algorithm for optimal multiple relay selection scheme
by Hongyuan Gao; Yanan Du; Shibo Zhang
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 13, No. 4, 2017

Abstract: In order to obtain optimal selection scheme with multiple source-destination pairs and multiple potential relays in cooperative relay networks, an optimal relay selection scheme is designed in cooperative relay networks considering co-channel interference (CCI). It is an integer optimisation problem for selecting suitable relay nodes to obtain optimal system performance. To get the optimal estimation performance with low computing complexity, quantum flower pollination algorithm (QFPA) is proposed to resolve the difficulties of optimal relay selection, and the proposed optimal relay selection scheme is called as quantum flower pollination algorithm based optimal relay selection (QFPA-ORS). The proposed QFPA combines the advantages of quantum evolutionary theory and flower pollination algorithm (FPA). So QFPA has the capability to search the optimal solution. Simulation results show that QFPA based relay selection scheme has the ability to search global optimal solution compared with other relay selection schemes based on classical algorithm and performs better than three other previous intelligent algorithms.

Online publication date: Wed, 17-Jan-2018

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 Wireless and Mobile Computing (IJWMC):
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