An Unmanned Aerial Vehicle (UAV) network specifies a novel type of Mobile Ad hoc Network (MANET) in which drones serve as nodes and facilitate the retransmission of messages to their final destinations. Aside from its military application, it has recently begun to seep into the civilian sector. Similar to MANET and vehicular ad hoc networks, Flying Ad hoc Networks (FANET) are a subset of ad hoc networks. An FANET is different because it is founded on UAVs. Due to the characteristics of this sort of network, which is defined by a highly changing topology in a 3D environment, we must employ an adjusted configuration method to ensure good routing performance. Therefore, to deal with this problem, a technique that responds to any change in topology by always finding the best route is required. In this work, we propose a new protocol based on the hybrid optimization of the 2-opt heuristic and Honey Badger Algorithm (HBA), called HB-AODV. In order to locate its prey, a badger must move slowly and continuously while using scent markers and mouse-digging skills to catch it. In other words, the most efficient routes in terms of the number of hops are identified. Several simulations were conducted via the 3D version of Network Simulator (NS-2) on different deployment strategies. In comparison to AODV, DSDV, and AntHocNet, the obtained results demonstrated the proposed scheme’s good performance in terms of quality of service metrics.

Association rule methods are among the most used approaches for Knowledge Discovery in Databases (KDD), as they allow discovering and extracting hidden meaningful relationships between attributes or items in large datasets in the form of rules. Algorithms to extract these rules require considerable time and large memory spaces. This paper presents an algorithm that decomposes this complex problem into subproblems and processes items by category according to their support. Very frequent items and fairly frequent items are studied together. To evaluate the performance of the proposed algorithm, it was compared with Eclat and LCMFreq on two actual transactional databases. The experimental results showed that the proposed algorithm was faster in execution time and demonstrated its efficiency in memory consumption.

No abstract