Unmanned Aerial Vehicles (UAVs) are widely available in the current market to be used either for recreation as a hobby or to serve specific industrial requirements, such as agriculture and construction. However, illegitimate and criminal usage of UAVs is also on the rise which introduces their effective identification and detection as a research challenge. This paper proposes a novel machine learning-based for efficient identification and detection of UAVs. Specifically, an improved UAV identification and detection approach is presented using an ensemble learning based on the hierarchical concept, along with pre-processing and feature extraction stages for the Radio Frequency (RF) data. Filtering is applied on the RF signals in the detection approach to improve the output. This approach consists of four classifiers and they are working in a hierarchical way. The sample will pass the first classifier to check the availability of the UAV, and then it will specify the type of the detected UAV using the second classifier. The last two classifiers will handle the sample that is related to Bebop and AR to specify their mode. Evaluation of the proposed approach with publicly available dataset demonstrates better efficiency compared to existing detection systems in the literature. It has the ability to investigate whether a UAV is flying within the area or not, and it can directly identify the type of UAV and then the flight mode of the detected UAV with accuracy around 99%.

Unmanned Aerial Vehicles (UAVs) are considered an important element in wireless communication networks due to their agility, mobility, and ability to be deployed as mobile base stations (BSs) in the network to improve the communication quality and coverage area. UAVs can be used to provide communication services for ground users in different scenarios, such as transportation systems, disaster situations, emergency cases, and surveillance. However, covering a specific area under a dynamic environment for a long time using UAV technology is quite challenging due to its limited energy resources, short communication range, and flying regulations and rules. Hence, a distributed solution is needed to overcome these limitations and to handle the interactions among UAVs, which leads to a large state space. In this paper, we introduced a novel distributed control solution to place a group of UAVs in the candidate area in order to improve the coverage score with minimum energy consumption and a high fairness value. The new algorithm is called the state-based game with actor–critic (SBG-AC). To simplify the complex interactions in the problem, we model SBG-AC using a state-based potential game. Then, we merge SBG-AC with an actor–critic algorithm to assure the convergence of the model, to control each UAV in a distributed way, and to have learning capabilities in case of dynamic environments. Simulation results show that the SBG-AC outperforms the distributed DRL and the DRL-EC3 in terms of fairness, coverage score, and energy consumption.

Parking in heavily populated areas has been considered one of the main challenges in the transportation systems for the past two decades given the limited parking resources, especially in city centres. Drivers often waste long periods of time hunting for an empty parking spot, which causes congestion and consumes energy during the process. Thus, finding an optimal parking spot depends on several factors such as street traffic congestion, trip distance/time, the availability of a parking spot, the waiting time on the lot gate, and the parking fees. Designing a parking spot allocation algorithm that takes those factors into account is crucial for an efficient and high-availability parking service. We propose a smart routing and parking algorithm to allocate an optimal parking space given the aforementioned limiting factors. This algorithm supports choosing the appropriate travel route and parking lot while considering the real-time street traffic and candidate parking lots. A multi-objective function is introduced, with varying weights of the five factors to produce the optimal parking spot with the least congested route while achieving a balanced utilization for candidate parking lots and a balanced traffic distribution. A queueing model is also developed to investigate the availability rate in candidate parking lots while considering the arrival rate, departure rate, and the lot capacity. To evaluate the performance of the proposed algorithm, simulation scenarios have been performed for different cases of high and low traffic intensity rates. We have tested the algorithm on in-city parking facility in the city of Al Madinah as a case study. The results show that the proposed algorithm is effective in achieving a balanced utilization of the parking lots, reducing traffic congestion rates on all routes to candidate parking lots, and minimizing the driving time to the assigned parking spot. Additionally, the proposed algorithm outperforms the MADM algorithm in terms of the selected three metrics for the five periods.