An adaptive multi-group slime mould algorithm for node localisation in wireless sensor networks Online publication date: Mon, 19-Dec-2022
by Xiankang He; Lijun Yan; Shi-Jian Liu; Jixiang Lv; Jeng-Shyang Pan
International Journal of Sensor Networks (IJSNET), Vol. 40, No. 4, 2022
Abstract: Node localisation is a common and significant practical application question in wireless sensor network (WSN). The goal of this problem is to use anchor nodes in the network to estimate the geographical location of the unknown node. A novel algorithm, named adaptive multi-group slime mould algorithm (AMSMA), is proposed in this study. The improved slime mould algorithm uses the multi-group strategy and adaptive communication mechanism to alleviate the lack of population diversity, development and exploration imbalance of the slime mould algorithm. The proposed AMSMA was tested under CEC2013 test suite. Compared with SMA and corresponding optimisation algorithms, the AMSMA is more effective and efficient. In addition, a novel localisation algorithm based on AMSMA is proposed. The AMSMA-Distance Vector-Hop (AMSMA-DV-Hop) is applied to the localisation of WSN. Compared with some other existing localisation algorithms, the proposed AMSMA-DV-Hop is an effective algorithm for the localisation of WSN.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Sensor Networks (IJSNET):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook