A compact Black Hole Algorithm for localization of mobile sensor network
preprint
OA: closed
CC-BY-4.0
Abstract
Abstract In mobile wireless sensor networks, localization accuracy and cost are the key issues to be considered. This paper is committed to solving the localization problem of mobile sensor networks. We propose an improved Black Hole (BH) algorithm based on compact strategy and elitist learning strategy. An improved Monte Carlo localization (IMCL) algorithm based on multi-hop combines the novel algorithm to deal with the localization problem of mobile sensor networks. The performance of the novel algorithm is verified on 28 test functions of CEC 2013 and compared with other standard optimization algorithms. The results reveal that the novel algorithm has first-class performance. In the simulation experiment, the novel algorithm and several optimization algorithms are applied to IMCL. The comparison results show that the new heuristic algorithm combined with IMCL can provide more competitive results in mobile node localization.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-28T02:00:01.590549+00:00
License: CC-BY-4.0