DFQIoV: Design of a Dynamic Fan-Shaped-Clustering Model for QoS-aware Routing in IoV Networks

Internet of Vehicles (IoV) is a steadily growing field of research that deals with highly ad-hoc wireless networks. These networks require design of high-speed & high-efficiency routing models, that can be applied to dynamically changing network scenarios. Existing models that perform this task are highly complex and require larger delays for estimation of dynamic routes. While, models that have faster performance, do not consider comprehensive parameters, which limits their applicability when used for large-scale network scenarios. To overcome these limitations, this text proposes design of a novel dynamic fan-shaped clustering model for QoS-aware routing in IoV networks. The model initially collects network information sets including node positions, & energy levels, and combines them with their temporal packet delivery & throughput performance levels. These aggregated information sets are processed via a hybrid bioinspired fan shaped clustering model, that aims at optimization of routing performance via deployment of dynamic clustering process. The model performs destination-aware routing process which assists in reducing communication redundances. This is done via a combination of Elephant Herding Optimization (EHO) with Particle Swarm Optimization (PSO), which integrates continuous learning for router level operations. The integrated model is able to reduce communication delays by 5.9%, while improving energy efficiency by 8.3%, throughput by 4.5%, and packet delivery performance by 1.4% under different network scenarios. Due to which the proposed model is capable of deployment for a wide variety of dynamic network scenarios

Document clustering based on firefly algorithm

Document clustering is widely used in Information Retrieval however, existing clustering techniques suffer from local optima problem in determining the k number of clusters.Various efforts have been put to address such drawback and this includes the utilization of swarm-based algorithms such as particle swarm optimization and Ant Colony Optimization.This study explores the adaptation of another swarm algorithm which is the Firefly Algorithm (FA) in text clustering.We present two variants of FA; Weight- based Firefly Algorithm (WFA) and Weight-based Firefly Algorithm II (WFAII).The difference between the two algorithms is that the WFAII, includes a more restricted condition in determining members of a cluster.The proposed FA methods are later evaluated using the 20Newsgroups dataset.Experimental results on the quality of clustering between the two FA variants are presented and are later compared against the one produced by particle swarm optimization, K-means and the hybrid of FA and -K-means. The obtained results demonstrated that the WFAII outperformed the WFA, PSO, K-means and FA-Kmeans. This result indicates that a better clustering can be obtained once the exploitation of a search solution is improved

Is swarm intelligence able to create mazes?

In this paper, the idea of applying Computational Intelligence in the process of creation board games, in particular mazes, is presented. For two different algorithms the proposed idea has been examined. The results of the experiments are shown and discussed to present advantages and disadvantages

Adaptive firefly algorithm for hierarchical text clustering

Text clustering is essentially used by search engines to increase the recall and precision in information retrieval. As search engine operates on Internet content that is constantly being updated, there is a need for a clustering algorithm that offers automatic grouping of items without prior knowledge on the collection. Existing clustering methods have problems in determining optimal number of clusters and producing compact clusters. In this research, an adaptive hierarchical text clustering algorithm is proposed based on Firefly Algorithm. The proposed Adaptive Firefly Algorithm (AFA) consists of three components: document clustering, cluster refining, and cluster merging. The first component introduces Weight-based Firefly Algorithm (WFA) that automatically identifies initial centers and their clusters for any given text collection. In order to refine the obtained clusters, a second algorithm, termed as Weight-based Firefly Algorithm with Relocate (WFAR), is proposed. Such an approach allows the relocation of a pre-assigned document into a newly created cluster. The third component, Weight-based Firefly Algorithm with Relocate and Merging (WFARM), aims to reduce the number of produced clusters by merging nonpure clusters into the pure ones. Experiments were conducted to compare the proposed algorithms against seven existing methods. The percentage of success in obtaining optimal number of clusters by AFA is 100% with purity and f-measure of 83% higher than the benchmarked methods. As for entropy measure, the AFA produced the lowest value (0.78) when compared to existing methods. The result indicates that Adaptive Firefly Algorithm can produce compact clusters. This research contributes to the text mining domain as hierarchical text clustering facilitates the indexing of documents and information retrieval processes