DV-hop localisation algorithm with DDICS
by Feixiang Li; Zhihua Cui; Bin Sun
International Journal of Computing Science and Mathematics (IJCSM), Vol. 7, No. 3, 2016

Abstract: Dimension by dimension improvement-based cuckoo search algorithm (DDICS) is a recent proposed variant of cuckoo search algorithm. The experimental results illustrate DDICS is superior to several other evolutionary algorithms when solving un-constraint numerical benchmarks. In this paper, we employ it to improve the performance of distance vector-hop method (DV-hop). The simulation results show it achieves the best performance when compared with two other DV-hop algorithms.

Online publication date: Sun, 17-Jul-2016

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 Computing Science and Mathematics (IJCSM):
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