Traffic Queuing Management in the Internet of Things: An Optimized RED Algorithm Based Approach

Congestion control is one of the main obstacles in cyberspace traffic. Overcrowding in internet traffic may cause several problems; such as high packet hold-up, high packet dropping, and low packet output. In the course of data transmission for various applications in the Internet of things, such problems are usually generated relative to the input. To tackle such problems, this paper presents an analytical model using an optimized Random Early Detection (RED) algorithm-based approach for internet traffic management. The validity of the proposed model is checked through extensive simulation-based experiments. An analysis is observed for different functions on internet traffic. Four performance metrics are taken into consideration, namely, the possibility of packet loss, throughput, mean queue length and mean queue delay. Three sets of experiments are observed with varying simulation results. The experiments are thoroughly analyzed and the best packet dropping operation with minimum packet loss is identified using the proposed model.     

Weapons Detection for Security and Video Surveillance Using CNN and YOLO-V5s

In recent years, the number of Gun-related incidents has crossed over 250,000 per year and over 85% of the existing 1 billion firearms are in civilian hands, manual monitoring has not proven effective in detecting firearms. which is why an automated weapon detection system is needed. Various automated convolutional neural networks (CNN) weapon detection systems have been proposed in the past to generate good results. However, These techniques have high computation overhead and are slow to provide real-time detection which is essential for the weapon detection system. These models have a high rate of false negatives because they often fail to detect the guns due to the low quality and visibility issues of surveillance videos. This research work aims to minimize the rate of false negatives and false positives in weapon detection while keeping the speed of detection as a key parameter. The proposed framework is based on You Only Look Once (YOLO) and Area of Interest (AOI). Initially, the models take pre-processed frames where the background is removed by the use of the Gaussian blur algorithm. The proposed architecture will be assessed through various performance parameters such as False Negative, False Positive, precision, recall rate, and F1 score. The results of this research work make it clear that due to YOLO-v5s high recall rate and speed of detection are achieved. Speed reached 0.010 s per frame compared to the 0.17 s of the Faster R-CNN. It is promising to be used in the field of security and weapon detection.     

Microgrid management using hybrid inverter fuzzy-based control

Neural Computing and Applications - Microgrid systems are becoming a very promising solution to meet the power demand growth especially in remote areas where diesel generators (DG) are commonly...     

CDCSS: cluster-based distributed cooperative spectrum sensing model against primary user emulation (PUE) cyber attacks

In cognitive radio network, the secondary users (SUs) use the spectrum of primary users for communication which arises the security issues. The status of SUs as legitimate users is compulsory for the stability of the system. This paper addresses the issue of delay caused by a band-selection decision process that directly affects the security and performance. The model cluster-based distributed cooperative spectrum sensing is proposed. In this model, cluster heads (CHs) exchange control information with other CHs and ordinary nodes. This model significantly reduced the delay, sensing, convergence, routing, in band-selection process. This also reduces the energy consumption while sensing the spectrum which seriously leads to performance upgradation. The simulated results show the improved performance of cognitive radio networks in terms of delay, packet loss ratio and bandwidth usage as compared to cluster-based cooperative spectrum sensing model. The opportunity for primary user emulation attacker is minimized as the overall delay is reduced.     

DLSA: Delay and Link Stability Aware Routing Protocol for Flying Ad-hoc Networks (FANETs)

Flying Ad-hoc Network (FANET) is a new class of Mobile Ad-hoc Network in which the nodes move in three-dimensional (3-D) ways in the air simultaneously. These nodes are known as Unmanned Aerial Vehicles (UAVs) that are operated live remotely or by the pre-defined mechanism which involves no human personnel. Due to the high mobility of nodes and dynamic topology, link stability is a research challenge in FANET. From this viewpoint, recent research has focused on link stability with the highest threshold value by maximizing Packet Delivery Ratio and minimizing End-to-End Delay. In this paper, a hybrid scheme named Delay and Link Stability Aware (DLSA) routing scheme has been proposed with the contrast of Distributed Priority Tree-based Routing and Link Stability Estimation-based Routing FANET’s existing routing schemes. Unlike existing schemes, the proposed scheme possesses the features of collaborative data forwarding and link stability. The simulation results have shown the improved performance of the proposed DLSA routing protocol in contrast to the selected existing ones DPTR and LEPR in terms of E2ED, PDR, Network Lifetime, and Transmission Loss. The Average E2ED in milliseconds of DLSA was measured 0.457 while DPTR was 1.492 and LEPR was 1.006. Similarly, the Average PDR in %age of DLSA measured 3.106 while DPTR was 2.303 and LEPR was 0.682. The average Network Lifetime of DLSA measured 62.141 while DPTR was 23.026 and LEPR was 27.298. At finally, the Average Transmission Loss in dBm of DLSA measured 0.975 while DPTR was 1.053 and LEPR was 1.227.

     

An analytical hierarchy process-based approach to solve the multi-objective multiple traveling salesman problem

We consider the problem of assigning a team of autonomous robots to target locations in the context of a disaster management scenario while optimizing several objectives. This problem can be cast as a multiple traveling salesman problem, where several robots must visit designated locations. This paper provides an analytical hierarchy process (AHP)-based approach to this problem, while minimizing three objectives: the total traveled distance, the maximum tour, and the deviation rate. The AHP-based approach involves three phases. In the first phase, we use the AHP process to define a specific weight for each objective. The second phase consists in allocating the available targets, wherein we define and use three approaches: market-based, robot and task mean allocation-based, and balanced-based. Finally, the third phase involves the improvement in the solutions generated in the second phase. To validate the efficiency of the AHP-based approach, we used MATLAB to conduct an extensive comparative simulation study with other algorithms reported in the literature. The performance comparison of the three approaches shows a gap between the market-based approach and the other two approaches of up to 30%. Further, the results show that the AHP-based approach provides a better balance between the objectives, as compared to other state-of-the-art approaches. In particular, we observed an improvement in the total traveled distance when using the AHP-based approach in comparison with the distance traveled when using a clustering-based approach.     

Optimal path planning in cluttered environment using RRT*-AB

Rapidly exploring Random Tree Star (RRT*) has gained popularity due to its support for complex and high-dimensional problems. Its numerous applications in path planning have made it an active area of research. Although it ensures probabilistic completeness and asymptotic optimality, its slow convergence rate and large dense sampling space are proven problems. In this paper, an off-line planning algorithm based on RRT* named RRT*-adjustable bounds (RRT*-AB) is proposed to resolve these issues. The proposed approach rapidly targets the goal region with improved computational efficiency. Desired objectives are achieved through three novel strategies, i.e., connectivity region, goal-biased bounded sampling, and path optimization. Goal-biased bounded sampling is performed within boundary of connectivity region to find the initial path. Connectivity region is flexible enough to grow for complex environment. Once path is found, it is optimized gradually using node rejection and concentrated bounded sampling. Final path is further improved using global pruning to erode extra nodes. Robustness and efficiency of proposed algorithm is tested through experiments in different structured and unstructured environments cluttered with obstacles including narrow and complex maze cases. The proposed approach converges to shorter path with reduced time and memory requirements than conventional RRT* methods.     

Optimizing web server RAM performance using birth–death process queuing system: scalable memory issue

Planning a powerful server imposes an enormous cost for providing ideal performance. Given that a server responding for web requests is more likely to consume RAM memory than other resources, it is desirable to provide an appropriate RAM capacity for optimal performance of server in congested situations. This can be done through RAM usage modeling and its performance evaluation. In the literature, modeling of RAM usage is not provided with mathematical modeling. We propose an approach to model RAM usage of such a server, based on birth–death process in this article. The model can be used to figure out an operation research problem of finding minimum RAM capacity covering intended constraints elicited from birth–death queuing system. We show how optimal RAM capacity can be obtained using our approach with an illustrative example.     

Progressive Compression of 3D Mesh Geometry Using Sparse Approximations from Redundant Frame Dictionaries

In this paper, we present a new approach for the progressive compression of three‐dimensional (3D) mesh geometry using redundant frame dictionaries and sparse approximation techniques. We construct the proposed frames from redundant linear combinations of the eigenvectors of a combinatorial mesh Laplacian matrix. We achieve a sparse synthesis of the mesh geometry by selecting atoms from a frame using matching pursuit. Experimental results show that the resulting rate‐distortion performance compares favorably with other progressive mesh compression algorithms in the same category, even when a very simple, sub‐optimal encoding strategy is used for the transmitted data. The proposed frames also have the desirable property of being able to be applied directly to a manifold mesh having arbitrary topology and connectivity types; thus, no initial remeshing is required and the original mesh connectivity is preserved.