A hybrid harmony search algorithm for node localisation in wireless sensor networks
by Zhaolu Guo; Shenwen Wang; Baoyong Yin; Songhua Liu; Xiaosheng Liu
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 14, No. 4, 2018

Abstract: Harmony search (HS) has been widely used in the field of wireless sensor networks. However, the search strategy of the basic HS has excellent exploration capability but weak exploitation capability. To enhance the search capability of HS, this paper presents a hybrid harmony search algorithm (HBHS) for node localisation in wireless sensor networks. The proposed HBHS employs the best solution to enhance the exploitation capability. Moreover, HBHS utilises an adaptive search step-size scheme to further enhance the search capability. To verify the search performance, HBHS is compared with two HS algorithms on a suit of classical benchmark problems. The comparisons confirm that HBHS can achieve better performance than the compared HS algorithms on the most of the benchmark problems. Further, HBHS is applied for node localisation in wireless sensor networks.

Online publication date: Tue, 07-Aug-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