Developed Clustering Algorithms for Engineering Applications: A Review

Clustering algorithms play a pivotal role in the field of engineering, offering valuable insights into complex datasets. This review paper explores the landscape of developed clustering algorithms with a focus on their applications in engineering. The introduction provides context for the significance of clustering algorithms, setting the stage for an in-depth exploration. The overview section delineates fundamental clustering concepts and elucidates the workings of these algorithms. Categorization of clustering algorithms into partitional, hierarchical, and density-based forms lay the groundwork for a comprehensive discussion. The core of the paper delves into an extensive review of clustering algorithms tailored for engineering applications. Each algorithm is scrutinized in dedicated subsections, unraveling their specific contributions, applications, and advantages. A comparative analysis assesses the performance of these algorithms, delineating their strengths and limitations. Trends and advancements in the realm of clustering algorithms for engineering applications are thoroughly examined. The review concludes with a reflection on the challenges faced by existing clustering algorithms and proposes avenues for future research. This paper aims to provide a valuable resource for researchers, engineers, and practitioners, guiding them in the selection and application of clustering algorithms for diverse engineering scenarios

A novel secure routing scheme using probabilistic modelling for better resistivity against lethal attacks

Study towards Wireless Adhoc Network dates two decades back with various researchers evolving up with new solutions towards addressing its problems. Irrespective of various other problems, the issues related to the secure routing is yet unsolved owing to massively increasing fatal strategies of the adversary. Review of existing literature shows that the existing secure routing scheme can only govern over the stated attacks reducing the applicability in case of dynamic attacks. Therefore, this manuscript introduces a novel probabilistic model which offers the capability to wireless nodes to identify the malicious behavior and react accordingly. Different from existing intrusion prevention system, the proposed system allows the malicious node to participate in the data forwarding process and exhaust its resources with no chance of launching an attack. The simulated outcome of the study shows that the proposed secure routing scheme offers better data forwarding characteristic in contrast to the existing system in the aspect of intrusion detection and secure data transmission

Reliable and efficient data dissemination schemein VANET: a review

Vehicular ad-hoc network (VANET), identified as a mobile ad hoc network MANETs with several added constraints. Basically, in VANETs, the network is established on the fly based on the availability of vehicles on roads and supporting infrastructures along the roads, such as base stations. Vehicles and road-side infrastructures are required to provide communication facilities, particularly when enough vehicles are not available on the roads for effective communication. VANETs are crucial for providing a wide range of safety and non-safety applications to road users. However, the specific fundamental problem in VANET is the challenge of creating effective communication between two fast-moving vehicles. Therefore, message routing is an issue for many safety and non-safety of VANETs applications. The challenge in designing a robust but reliable message dissemination technique is primarily due to the stringent QoS requirements of the VANETs safety applications. This paper investigated various methods and conducted literature on an idea to develop a model for efficient and reliable message dissemination routing techniques in VANET

Identification of Biometric-Based Continuous user Authentication and Intrusion Detection System for Cluster Based Manet

Mobile ad hoc is an infrastructure less dynamic network used in many applications; it has been targets of various attacks and makes security problems. This work aims to provide an enhanced level of security by using the prevention based and detection based approaches such as authentication and intrusion detection. The multi-model biometric technology is used for continuous authentication and intrusion detection in high security cluster based MANET. In this paper, an attempt has been made to combine continuous authentication and intrusion detection. In this proposed scheme, Dempster-Shafer theory is used for data fusion because more than one device needs to be chosen and their observation can be used to increase observation accuracy

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

RESTRICTED ROUTING PROTOCOL FOR CONTRIBUTION OF OPTIMIZATION METHOD

Simple secure connections between a random set of network nodes require that each node maintains the n-1 keys for each pair within the state of symmetric encryption and public keys n-1 in the case of unequal encoding where n represents the number of network nodes. In the operation phase of the network, each node finds the length of the primary road connected by using its overlapped neighbors by making simple path requests. A dynamic set of pre-distribution master plans constructed according to symmetric encryption concepts containing secret keys in pairs. In this document, we refer to the network layer because of the underlying layer as well as the encryption layer because the layer overlays. Our proposed option would essentially be to respond to the derived LP problem by loosening all logical constraints within the original problem. The effectiveness of our formula is within the logical LP solution with the complexity of the period that does not exceed the solution of the problem of LP sedative while ensuring the identification of the optimal solution. We note that the main advantage of our formula is that it has the ability to solve the problem of optimal routing for almost any graphic, whether directed or unguided, in addition to weight or not likely. Evaluate the performance, security and consumption characteristics of the network from the proposed format for pre-symmetric and non-uniform methods running on top of the on-demand routing protocols. In order to evaluate performance in our proposed format, we use it in three main pre-distribution methods: 2-UKP, SST, and PAKP, which operate over the dedicated distance vector routing protocol when necessary

A PROTECTED TRANSFER ROUTING WITH KEY PRE-SHARING: A LINEAR COLDNESS OPTIMIZATION APPROACH

Trivial secure communications inside the random quantity of network nodes requires each node to help keep n - 1 pairwise keys inside the situation of symmetric cryptography and n - 1 public keys inside the situation of uneven cryptography where n represents the quantity of network nodes. Within the network operation phase, each node finds the underlay path length connected getting its overlay neighbors by delivering simple route demands. An important pool for key pre-distribution schemes that's built based on symmetric cryptography concepts contains secret pairwise keys. In this particular paper, we reference the network layer since the underlay layer together with cryptographic layer since the overlay layer. Our recommended option is basically damaged whipped cream an LP problem derived by relaxing all of the Boolean constraints inside the original problem. The effectiveness of our formula reaches solving the Boolean LP challenge with a while complexity not exceeding individuals of solving the relaxed LP problem while guaranteeing to know the very best solution. We noted the main advantage of our formula as acquiring the opportunity to solve the very best routing problem for each graph either directed or undirected in addition to weighted or unweighted. evaluating network performance, security, and consumption characteristics inside the recommended formula for symmetric and uneven key pre-distribution methods operating on top of on-demand routing protocols. So that you can think about the performance within our recommended formula, we employ it three key pre-distribution methods, namely, 2-UKP, SST, and PAKP running on top of ad-hoc when needed distance vector routing protocol