A hybrid harmony search algorithm for node localisation in wireless sensor networks

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.