This paper proposes a hierarchical metaheuristic framework for optimally solving large-scale Euclidean Traveling Salesman Problems (TSP) that strategically embeds the clustered structure of input instances within crossed cubes interconnection networks to accelerate parallel optimization. The algorithm applies clustering-guided partitioning to hierarchically decompose TSP into compressed quadtree representations amenable to multi-level parallel evaluation across interconnected cores. An integrated ant colony-genetic algorithm then efficiently explores the partitioned solution space. Extensive experimentation demonstrates this structured mapping attains significant speedups under parallel execution versus congested sequential modes, with runtime scaling linearly in core count and sublinearly with problem size. Analysis reveals the hierarchical mapping attains optimized resource utilization and fault tolerance within crossed cubes to robustly handle problems an order of magnitude larger than prior work. This research thus presents an efficient approach for high-performance computing systems through aligning algorithmic and architectural hierarchies.
In many Wireless Sensor Network (WSN) applications, location is critical. Another intriguing aspect of the acquired data is the ability to obtain exact information about sensors' locations. In order to localize multi-hop WSNs, based connectivity algorithms use their benefits, such as simplicity and acceptable accuracy, to do so. However, the localization accuracy may be limited due to the two- or three-dimensional environment (2D or 3D). Range-Free 3D-WSNs can benefit from an analytic model for hop-size quantization and an Extreme Learning Machine (ELM) method for localization to reduce localization errors. The additional third dimension greatly affects the accuracy of localization. Since many applications require 3D localization, it is important to develop efficient self-localization algorithms for 3D WSNs. In this paper, for a uniform distribution of sensor nodes, a new probabilistic quantization of hop size in 3D WSNs is proposed. Moreover, the extreme learning machine (ELM) which represents a new approach to WSN localization is exploited combining a conventional method (probabilistic approach) with a non-conventional method (Machine Learning). For a variety of conditions, our algorithms have been tested through simulation in isotropic settings. The performance of the localization model was assessed using the average localization error (LE). When compared to previous 3D-DV-Hop heuristics, the suggested localization algorithm's performance in terms of accuracy is clearly demonstrated by simulation data. With the help of the predicted hop quantization for hop-size estimation and the ELM was used for position estimation, our localization method for 3D-WSNs lowers the average localization error of nodes and has a greater location accuracy compared to its rivals.
1 August 2023 in International Journal of Informatics and Communication Technology (IJ-ICT)
Localization is a critical concern in many wireless sensor network (WSN) applications. Furthermore, correct information regarding the geographic placements of nodes (sensors) is critical for making the collected data valuable and relevant. Because of their benefits, such as simplicity and acceptable accuracy, the based connectivity algorithms attempt to localize multi-hop WSN. However, due to environmental factors, the precision of localisation may be rather low. This publication describes an Extreme Learning Machine (ELM) technique for minimizing localization error in range-free WSN. In this paper, we propose a Cascade Extreme Learning Machine (Cascade-ELM) to increase localization accuracy in Range-Free WSNs. We tested the proposed approaches in a variety of multi-hop WSN scenarios. Our research focused on an isotropic and irregular environment. The simulation results show that the proposed Cascade-ELM algorithm considerably improves localization accuracy when compared to previous algorithms derived from smart computing approaches. When compared to previous work, isotropic environments show improved localization results.
14 February 2023 in Advances and Applications in Statistics