Packet Drop Research Articles

An Energy-Efficient Cluster-based data aggregation for agriculture irrigation management system using wireless sensor networks

Wireless Sensor Network (WSN) are becoming one of the demanding platforms, where sensor nodes are sensing and monitoring the physical or environmental conditions and transmit the data to the base station via multi-hop routing. Agriculture sector also adopted these networks to promote innovations for environmentally friendly farming methods, lower the management cost, and achieve scientific cultivation. This combination can improve crop yield, quality, and efficiency while saving energy and water. It is important to note that irrigation is one of the essential factors for agricultural success. In an agriculture irrigation application, a WSN is deployed in a specific area to control the irrigation in the field. But using WSN will generate massive redundancy in the data processing. So, there is lacking an efficient system for extensive sensor data processing. This research work presents an Energy-Efficient Cluster-Based Data Aggregation (E2CDA) Technique for agriculture irrigation systems in WSN. An improved probabilistic clustering method is used for preserving the optimal number of Cluster Head (CH) in each round of iteration. The proposed work is implemented in MATLAB, according to simulation results; the developed E2CDA method provides better result when compared with the existing approaches such as Low Energy Adaptive Clustering Hierarchical (LEACH) routing and centralized LEACH (LEACH-C) in terms of energy savings, network lifetime, packet delivery ratio, end-to-end delay, and packet drop ratio.

An Effective Mechanism to Mitigate Packet Dropping Attack from MANETs using Chaotic Map based Authentication Technique

Background: MANET is a self-organized wireless network with no infrastructure. Especially data transfer from one system to another system needs to be done in a secure way. In order to provide data integrity, authentication plays an important role in data communication. RSA and ECC are widely used algorithms in the real world, but authentication using these algorithms is time-consuming. Towards this, various algorithms came into existence with different security primitives. However, it is important to design an effective key agreement process with reduced computational cost among these security mechanisms. We have designed an effective mechanism to mitigate packet dropping attacks to secure end-to-end communication in MANET. Objective: The proposed light weight authentication method is based on chaotic maps that uses Chebyshev polynomials as primitive operation. Methods: The methodology includes semi group property of Chebyshev polynomials and also the discrete logarithmic problem based chaotic maps that takes less time than these existing algorithms and evaluates with respect to attack Resilience, packet deliverya fraction, delay, throughput, and overhead. Results: Simulation produces the result of the proposed mechanism and give better performance in terms of packet delivery ratio, overhead and computational cost. Conclusion: Authentication based on developed mechanism consumes less time as shown in statistical analysis and mitigates packet dropping attacks effectively than that of traditional methods like RSA and ECC with respect to key generation mechanism.

VADIA-Verkle Tree-based Approach for Dealing Data Integrity Attacks in Opportunistic Mobile Social Networks

Opportunistic Mobile Social Networks (OMSN) are prone to data integrity attacks that jeopardize the integrity of the routing data inside the network. Among the several techniques that cope with these attacks in OMSN, tree-based approaches have proven to be the most effective due to its ease of data verification and ensurance in data integrity. This paper evaluates two tree-based data structures, Merkle tree and Verkle tree in terms of their effectiveness in detecting and preventing such attacks. The evaluation considers tree-generation time and proof-checking time, and the results demonstrate that the Verkle tree is a bandwidth-efficient solution and have lower proof-checking time, with a reduction of 98.33% than Merkle tree. This makes Verkle tree a good choice for handling data integrity attacks in OMSN. A Verkle tree-based approach, named VADIA, is proposed to handle data integrity attacks such as packet dropping, packet modification and pollution attack in OMSN. The proposed approach is implemented in the Opportunistic Network Environment (ONE) simulator and is shown to be effective in detecting malicious nodes and paths, reducing false negative rates, and improving accuracy in detecting malicious activities. The results demonstrate a 47%, 84% and 69% improvement in malicious node, malicious path and malicious activity detection over a period of time. Furthermore, the approach achieves an 80% reduction in false negative rates.

MVR Delay: A Queueing Based Routing Model for C-V2X Mode 4 in VANET’s

During the last few years, the demand for vehicular ad-hoc networks (VANET) has gained great attraction in the intelligent transport system. The VANET architecture includes several critical features, such as distributed networking and the rapidly changing network topology. Due to the significant characteristics of road safety, it has gained a great deal of interest in industry and academia to enhance the safety of the road transport system. Efficient message exchange between vehicles and roadside units is a tedious task in VANET. Several techniques have been introduced to improve communication, but efficient packet delivery and delay reduction are challenging issues. Currently, the VANET technique has evolved as a “vehicle-to-everything (V2X)” communication standard. In addition, the 3GPP standards have introduced a new communication standard as an alternative to the IEEE 802.11p system. In this new release of 3GPP, two new communication modes are introduced, mode 3 and mode 4. Mode 3 requires a cellular infrastructure, whereas mode 4 can operate without cellular coverage. In this work, we focus on C-V2X mode 4 communications and present a novel routing scheme to deal with hidden terminal problems. The proposed approach generates a virtual queueing model in which efficient channel selection is performed so that packet collision and interference can be reduced by maximizing the distance in the virtual queue model. The experimental results demonstrate that the average performance of the proposed approach is obtained as 0.9383, 0.09 s, and 0.0617 in terms of packet delivery, end-to-end delay, and packet drop rate, respectively.

Detection and prevention of sinkhole attacks in MANETS based routing protocol using hybrid AdaBoost-Random forest algorithm

WSN (Wireless Sensor Network) is considered as one of the promising technologies which are utilized in various fields for various applications. Along with it, MANET (Mobile Ad Hoc Network) has attracted a distinct attention, as they serve communication means across innumerable domain. In recent years, due to the development of both wired and wireless technologies, attacks are becoming more frequent and these attacks can be in various form such as worm hole, black hole, grey-hole, sinkhole and others. These attacks can cause loss of security, increase the number of drop packets, decrease packet delivery ratio which result in poor routing performance. In order to overcome these issues, the proposed study employs PBCS (Particle Bee Colony Swarm) algorithm for finding the shortest path between the nodes, which helps in reducing the routing cost and makes the model more efficient and effective. In addition to this, Hybrid AdaBoost-Random forest algorithm is utilized in proposed model. This model helps in reducing the training time which makes the model more reliable and efficient than existing models. It can be implemented in huge dataset and in Hybrid AdaBoost-Random Forest algorithm, estimator of random forest is used, which result in high accuracy and low loss. AODV (Ad-Hoc on Demand Vector) protocol helps to identify the prevention of attack as this routing protocol perform better for longer and extensive duration of traffic than other protocols. The performance of the proposed model is evaluated using different metrics which includes accuracy, recall, precision, sensitivity and specificity. Besides, energy consumption, throughput, network lifetime, delay of the proposed model is also evaluated. The proposed model is then compared with various existing models in order to determine the efficiency and effectiveness of the proposed framework.

Analyze the Impact of Mobility and Pause Time on ACO based Manet Routing Protocols - Review

Abstract: Recently, many researchers have studied its performance within Mobile Ad-hoc Networks (MANETs). Every ad hoc network protocol focuses on a different set of measurements and traits. The majority of the currently utilized mobility models are employed to provide realistic movement patterns for MANET scenarios. A crucial element in the creation of MANET protocols is simulation. The future topology of a network can be predicted, which enables Quality of service- aware routing to choose a dependable link for data transmission. Ant algorithms, also known as swarm intelligence, are a wider field of study that deals with algorithmic approaches that are motivated by the behaviour of ant colonies and other insects. Ant Colony Optimization (ACO) is a subset of this larger topic. Based on the pheromone value deposited over the link, we identified two categories for the link quality in the proposed approach. We have demonstrated how the network's performance is enhanced by the suggested technique. The nodes are moving in the specified terrain dimensions through the Enhanced Manhattan Mobility Model (EMMM). The five QoS performance metrics are analyzed over three MANET routing protocols. The comparison is made over two important factors-mobility and pause time with the proposed ACO technique of reliable links. In the first experiment of different speeds, DSR is 25.5% better than AODV and 5.3% better than DSDVin metric packet dropping, 1.15% better than AODV and 1.01% better than DSDV in Packet Delivery Ratio, 1.5% better than AODV and 1.04% better than DSDV in packet overhead, and 62.7% better than AODV and 73.1% better than DSDV in average end-to-end delay. In the second experiment of pause times, DSR is 25.05% better than AODV and 4.5% better than DSDV in packet dropping, 1.18% better than AODV and 1.01% better than DSDV in packet delivery ratio, 1.01% better than DSDV in throughput, 0 to 0.002% in packet overhead, and 0.02% to 0.005% shorter delay.

DESiRED — Dynamic, Enhanced, and Smart iRED: A P4-AQM with Deep Reinforcement Learning and In-band Network Telemetry

Active Queue Management (AQM) is a mechanism employed to alleviate transient congestion in network device buffers, such as routers and switches. Traditional AQM algorithms use fixed thresholds, like target delay or queue occupancy, to compute random packet drop probabilities. A very small target delay can increase packet losses and reduce link utilization, while a large target delay may increase queueing delays while lowering drop probability. Due to dynamic network traffic characteristics, where traffic fluctuations can lead to significant queue variations, maintaining a fixed threshold AQM may not suit all applications. Consequently, we explore the question: What is the ideal threshold (target delay) for AQMs? In this work, we introduce DESiRED (Dynamic, Enhanced, and Smart iRED), a P4-based AQM that leverages precise network feedback from In-band Network Telemetry (INT) to feed a Deep Reinforcement Learning (DRL) model. This model dynamically adjusts the target delay based on rewards that maximize application Quality of Service (QoS). We evaluate DESiRED in a realistic P4-based test environment running an MPEG-DASH service. Our findings demonstrate up to a 90x reduction in video stall and a 42x increase in high-resolution video playback quality when the target delay is adjusted dynamically by DESiRED.

Improve quality of service for the Internet of Things using Blockchain & machine learning algorithms

The quality of service (QoS) parameters in IoT applications plays a prominent role in determining the performance of an application. Considering the significance and popularity of IoT systems, it can be predicted that the number of users and IoT devices are going to increase exponentially shortly. Therefore, it is extremely important to improve the QoS provided by IoT applications to increase their adaptability. Majority of the IoT systems are characterized by their heterogeneous and diverse nature. It is challenging for these systems to provide high-quality access to all the connecting devices with uninterrupted connectivity. Considering their heterogeneity, it is equally difficult to achieve better QoS parameters. Artificial intelligence-based machine learning (ML) tools are considered a potential tool for improving the QoS parameters in IoT applications. This research proposes a novel approach for enhancing QoS parameters in IoT using ML and Blockchain techniques. The IoT network with Blockchain technology is simulated using an NS2 simulator. Different QoS parameters such as delay, throughput, packet delivery ratio, and packet drop are analyzed. The obtained QoS values are classified using different ML models such as Naive Bayes (NB), Decision Tree (DT), and Ensemble, learning techniques. Results show that the Ensemble classifier achieves the highest classification accuracy of 83.74 % compared to NB and DT classifiers.

Advancing Wireless Sensor Networks through Performance Evaluation of M-PDCH Routing Protocol for Enhanced Quality of Service

Objective: The decisive aim of this investigation is to improve the capabilities and limitations of PEGASIS with Double Cluster Head (PDCH), for enhancing the overall Quality of Service (QoS) in Wireless Sensor Networks (WSNs). Methods: This research is intended at the application of efficient routing protocol for wireless sensor networks. It works on the principle of the formation of cluster head and clustering. This is accomplished to achieve high QoS for WSN. Improving the efficacy of a WSN protocol is decisive for optimizing communication, resource utilization, and overall effectiveness. An innovative and novel protocol named Mobile-PDCH (M-PDCH) has been devised, developed, and tested. Here several parameters have been carefully investigated for enhancing the performance of a WSN protocol such as energy consumption, delay, and packet loss. A simulation environment has been created to evaluate, compare, and validate the performance and to suggest the desired applications of the proposed protocol. Findings: In the hierarchical category, PDCH performs better compared to all the other protocols. But it suffers from high packet drop, which decrease the performance of the protocol. To improve the performance of sensor networks, there is a need for adaptive routing protocol. The examination of simulation outcomes for the recommended protocol, M-PDCH, has been conducted in comparison with PDCH. The findings indicate that the protocol exhibits superior performance. The proposed algorithm improves the packet drop by 29.75%, reduces delay by 23.28%, and lowers energy consumption by 19.18% when compared to PDCH. Novelty: A novel adaptive routing protocol termed M-PDCH has been proposed for the enhancement of the WSN life span and durability of the sensor nodes. The simulation results show that the proposed algorithm produces better results compared to PDCH protocol. The various QoS parameter results are compared, verified, and validated with existing protocol PDCH. Keywords: WSN, PDCH, Design issues, Metrics, QoS, HRP

Energy-Efficient De-Duplication Mechanism for Healthcare Data Aggregation in IoT

The rapid development of the Internet of Things (IoT) has opened the way for transformative advances in numerous fields, including healthcare. IoT-based healthcare systems provide unprecedented opportunities to gather patients’ real-time data and make appropriate decisions at the right time. Yet, the deployed sensors generate normal readings most of the time, which are transmitted to Cluster Heads (CHs). Handling these voluminous duplicated data is quite challenging. The existing techniques have high energy consumption, storage costs, and communication costs. To overcome these problems, in this paper, an innovative Energy-Efficient Fuzzy Data Aggregation System (EE-FDAS) has been presented. In it, at the first level, it is checked that sensors either generate normal or critical readings. In the first case, readings are converted to Boolean digit 0. This reduced data size takes only 1 digit which considerably reduces energy consumption. In the second scenario, sensors generating irregular readings are transmitted in their original 16 or 32-bit form. Then, data are aggregated and transmitted to respective CHs. Afterwards, these data are further transmitted to Fog servers, from where doctors have access. Lastly, for later usage, data are stored in the cloud server. For checking the proficiency of the proposed EE-FDAS scheme, extensive simulations are performed using NS-2.35. The results showed that EE-FDAS has performed well in terms of aggregation factor, energy consumption, packet drop rate, communication, and storage cost.

Detection and isolation of wormhole nodes in wireless ad hoc networks based on post-wormhole actions

The wormhole attack is one of the most treacherous attacks projected at the routing layer that can bypass cryptographic measures and derail the entire communication network. It is too difficult to prevent a priori; all the possible countermeasures are either too expensive or ineffective. Indeed, literature solutions either require expensive hardware (typically UWB or secure GPS transceivers) or pose specific constraints to the adversarial behavior (doing or not doing a suspicious action). The proposed solution belongs to the second category because the adversary is assumed to have done one or more known suspicious actions. In this solution, we adopt a heuristic approach to detect wormholes in ad hoc networks based on the detection of their illicit behaviors. Wormhole and post wormhole attacks are often confused in literature; that’s why we clearly state that our methodology does not provide a defence against wormholes, but rather against the actions that an adversary does after the wormhole, such as packet dropping, tampering with TTL, replaying and looping, etc. In terms of contributions, the proposed solution addresses the knock-out capability of attackers that is less targeted by the researcher’s community. In addition, it neither requires any additional hardware nor a change in it; instead, it is compatible with the existing network stack. The idea is simulated in ns2.30, and the average detection rate of the proposed solution is found to be 98-99%. The theoretical time to detect a wormhole node lies between 0.07-0.71 seconds. But, from the simulation, the average detection and isolation time is 0.67 seconds. In term of packet loss, the proposed solution has a relatively overhead of ≈\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\approx$$\\end{document} 22%. It works well in static and mobile scenarios, but the frame losses are higher in mobile scenarios as compared to static ones. The computational complexity of the solution is O(n). Simulation results advocate that the solution is effective in terms of memory, processing, bandwidth, and energy cost. The solution is validated using statistical parameters such as Accuracy, Precision, F1-Score and Matthews correlation coefficient (Mcc\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$M_{cc}$$\\end{document}).

FFBP Neural Network Optimized with Woodpecker Mating Algorithm for Dynamic Cluster-based Secure Routing in WSN

Feed Forward Back Propagation Neural Network (FFBPNN) Optimized with Woodpecker Mating Algorithm is proposed in this manuscript for Dynamic Cluster-Based Secure Routing in Wireless Sensor Networks (FFBPNN-WMA-ECHC-WSN). The proposed method contains three different stages: first stage is dynamically clustered sensor network formation based on FFBPNN, second stage is Key generation for data encryption and decryption using Elliptic Curve-based Hill Cipher (ECHC), third stage is Homomorphic encryption scheme, which is used to deliver the aggregated data in-time. Woodpecker Mating Algorithm (WMA) is proposed to optimize the parameter values of FFBPNN. The proposed FFBPNN-WMA ECHC-WSN method was implemented in NS2 tool and its efficiency is evaluated under some metrics, like alive nodes, packet drop, network lifetime, delay, throughput, and energy consumption, Packet Delivery Ratio (PDR). The performance of FFBPNN-WMA-ECHC-WSN method provides lower delay 99.01%, 98.34%, 95.23% and 97.45%, and higher throughput 97.25%, 90.12%, 89.39% and 95.47% compared with existing models, such as EHCERA-SDT-WSN, DSA-ECC-PSO-SDT-WSN, IPECC-PDF-ABC-SDT-WSN and IBFA-LDCSN-BSHHO-SDT-WSN, respectively.

The Implication of Different Transmission Protocols for Vehicular Networks using NS-2

A vehicular network, categorized as an ad-hoc network, operates without fixed base station infrastructure or centralized management. In this setup, each network entity can serve as a router or a host, facilitating communication via multiple links. Unlike a mobile ad-hoc network, a vehicular network allows nodes to freely join or leave the network. For data transmission, various network layers are involved in delivering packets, with TCP and UDP protocols commonly employed. However, prior research has highlighted the limitations of Vehicular Ad-Hoc Networks (VANETs), particularly due to the surge in vehicular numbers on roads. This situation can trigger issues such as network congestion, leading to increased packet delivery delays and potential packet drops, ultimately compromising network performance. Moreover, when vehicles travel at high speeds on highways, quick message transmission is crucial, often without waiting for acknowledgments from both the transmitter and receiver. To address these challenges, some of the benefits of the User Datagram Protocol (UDP) can be integrated into vehicular network technologies. Consequently, this study aims to assess the data transfer performance between Transmission Control Protocol (TCP) and UDP, focusing on metrics like packet delivery ratio, packet loss, and packet drop, while varying vehicle density. The research location was Persiaran Permai, Seksyen 7, Shah Alam, Malaysia, and simulation was conducted using tools such as JOSM, MOVE, and NS-2. The findings reveal noteworthy differences: TCP exhibits a superior average packet delivery ratio (99.44% vs. 83.56%) and lower packet loss (0.56% vs. 16.45%) compared to UDP. Conversely, UDP demonstrates better performance in terms of average packet drop (0 compared to 6.75) when compared to TCP.

AD-RED: A new variant of random early detection AQM algorithm

Intensive continuing research has been noticed among scholars in the literature with a particular appreciable interest in developing new enhanced variants for the long-standing Random Early Detection (RED) algorithm. Contemporary trends shows that researchers continue to follow a research line thereby exchanging the linear curve needed in RED with nonlinear curves. Several reports have shown that RED’s sole linear function is insufficiently powered for managing rising degrees of traffic congestion in the network. In this paper, Amended Dropping – Random Early Detection (AD-RED), a revised version of RED is presented. AD-RED algorithm consists in combining two nonlinear packet dropping functions: quadratic plus exponential. What’s more, results from ns-3 simulator shows that AD-RED reasonably stabilized and minified the (average) queue size; and obtained a whittled down end-to-end delay when compared with RED itself and another variant of RED. Hence, AD-RED is offered as a fully sufficient replacement for RED’s algorithm implementation in routers.

Packet Dropper and Collecting Missing Packet due to Packet Dropping Attackers in Mobile Adhoc Network using Divide and Conquer Algorithm

In a mobile ad hoc network, packet transmission is essential to prevent packet drops along the transmission path. Attackers who drop forwarded packets are present in the MANET and are attempting to lower the MANET's performance. There are several ways to identify packet dropper attackers and warn the MANET about them. The divide and conquer tactic is used in this research study to identify the attacker who dropped the packets and to obtain the missing packet from the intermediary source. This task will be accomplished by adding an extra buffer to hold the forwarded packet during its whole round trip from source to destination. The findings of the suggested work's implementation using the network simulator and comparisons with those of the current methodology ultimately demonstrate that the divide and conquer approach has demonstrated the MANET's performance.

Finding Packet Dropper and Collecting Missing Packet due to Packet Dropping Attackers in Mobile Adhoc Network Using Divide and Conquer Algorithm

Objective: Finding the Packet dropping attacker and collecting the missing packet in the MANET is one of the challenging task since the characteristics of the MANET node mobility. Packet Transmission from the source node to the Destination node is done after sending the Route Request and Route Reply, reliable path chosen based on the protocol selection in Mobile Adhoc Network which is self-organized running without any basic infrastructure. Data which is going to send by the sender is divided in to the packet and put sequence numbering on the packet finally transmitted on the medium. Each and every packet get travelled on the assigned path to reach to the destination. If any packet missed on the transmission the source node has to retransmit to the destination. while forwarding the packet from one hop to another the packet dropper attacks are play dropping the packets. Methods: There are several methods were proposed for elaborating the packet dropping attacks and solution for finding the attackers in the MANET, but none of the methods proposed for collecting the missed packet instead of getting retransmission. Divide and conquer method between the route to destination path applied to finding the packet dropper attacker and collecting the missing packet from the previous node. Findings: The proposed method could be implement using network simulator and performance result could be better than existing packet dropper attacker work. Novelty: This proposed article shows packet dropper attackers in the MANET and collecting the missing packet by using the divide and conquer algorithm in the source to destination path route.

Smart Actuation for End-Edge Industrial Control Systems

Along with the fourth industrial revolution, industrial automation systems are evolving into a multi-tier end-edge computing architecture. Edge controllers, which are equipped with a larger computing capacity compared to local controllers, can communicate with local plants over mainstream wireless networks such as WirelessHART, Wi-Fi, and cellular networks. Well-known challenges induced by networks, such as uncertain time delays and packet drops, have been intensively investigated from various perspectives: control synthesis, network design, or control and network co-design. The status quo is that the industry remains hesitant to close the loop between the edge controller and the actuation side due to safety concerns. This work offers an alternative perspective to address the safety concern, by exploiting the design freedom of an end-edge computing architecture. Specifically, we present a smart actuation framework, which deploys (1) an edge controller, which communicates with physical plant via wireless network, accounting for optimality, adaptation, and constraints by conducting computationally expensive operations; (2) a smart actuator, which is co-located with the physical plant on the end tier and executes a local control policy, accounting for system safety in the view of network imperfections, (3) the end-edge control co-design strategies and cooperation logic for both performance and stability. For certain classes of plants, semi-globally asymptotic stability of the resulting end-edge control systems is established when the edge controller is the model predictive control (MPC), or policy iteration-based learning control. We also provide an adaptation strategy for the end-edge control systems facing model parameter mismatches when the edge controller employs reinforcement learning. Extensive simulations demonstrate the advantages of the proposed end-edge co-design and cooperation procedures. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Note to Practitioners</i> —Edge computing is gaining momentum in areas that require low latency and high efficiency, i.e., mobile computing, video analytics, and autonomous driving. Industrial automation systems are also evolving into a multi-tier end-edge computing architecture. It pays obvious dividends to leverage the cooperation between end and edge, benefiting from fast and reliable communication on the end side, and powerful computation capacity on the edge side. The current end-edge cooperation focuses on how to partition tasks and offload computation resources in order to minimize delay and energy consumption, as well as how to balance the tradeoff between them. However, the impacts of end-edge cooperation on the safety, optimality, and cost of industrial automation have not been systematically studied. This paper aims to tailor end-edge cooperation in a smart actuation framework, for industrial automation to reconcile the above aspects by leveraging co-design of end and edge controllers and their switching logic. Extensive pure and semi-physical simulations demonstrate the advantages in performance and system stability of the proposed end-edge co-design and cooperation procedures.

Detecting and Predicting Models for QoS Optimization in SDN

Recently, deep learning algorithms and software‐defined networking technologies enabled traffic management to be more controllable in IP networking and mobile Internet to yield quality services to subscribers. Quality of service (QoS) needs more effort to optimize QoS performance. More specifically, elephant flow management is a critical task that needs further research since its heavy hit behavior leads to high CPU utilization, packet drops, high latency, packet overflow, and network congestion problems. For this purpose, we focused on elephant flow management since elephant flows are big flows that hinder good service delivery (QoS) on demand. Hence, elephant flow detection and early prediction techniques optimize QoS. In this regard, we employed DNN and CNN deep learning models to detect elephant flows, and the random forest model predicts elephant flows in the SDN. As a result of our experiments, the findings reveal that deep learning algorithms within the Ryu controller significantly outperform in detecting and predicting performance in order to yield good network throughput. This solution proves to be significant for QoS optimization in data centers.

Energy Efficient Clustering Mechanism for Malicious Sensor Nodes in IOT Based MWSN

A mobile wireless sensor network (MWSN) is a collection of wireless nodes that may be set up anywhere and at any time without the need for a pre-existing network structure. Network performance is challenging factor due to nature of mobility and misbehaving nodes. Data loss and misbehaving in sensor nodes degrades performance of network. Some circumstances some malevolent sensor nodes predisposed to eradicate capability of network. The goal of this study is to use an irregular set approach to distinguish hostile nodes. Broadcasting information in route entry table identifies malicious node. Each sensor node in network preserves entry table and broadcast record regarding nearby nodes. To estimate broadcasting record metrics are premeditated as data deliverance proportion, throughput, delay, packet drop, fault rate. Mobile nodes with diverse velocity are simulated in NS2 environment which contains variable node clusters. Based broadcasting records of mobile nodes with diverse velocity are considered to create information table. Fine and malicious nodes are recognized based on rules derived in table of irregular set tactic. Shortest path without malicious node is elected to broadcast packets in the environment. Proposed tactic consequences reveal irregular set tactic amplifies network capability data deliverance percentage, throughput and dwindled end-to-end delay in mobile sensors.

Fuzzy Logic for the Improving of Handover Decision and the Adaptive Adjustment of Control Parameters in 5G Wireless Networks

Handover process is one of the most important aspects of mobility management in 5G wireless networks. It becomes a hot topic for researchers because it constitutes a guarantee of communication continuity during the user's movement, in addition to being the basic step on which the mobility load balancing process depends to distribute the load between the cells. The focus on this process is whether by providing solutions to improve the handover decision-making, or by modifying the values of the handover control parameters in a way that it guarantees the reduction of handover problems, because the inaccurate or unnecessary modification of these parameters values will cause a degradation in the quality of service. This paper presents a study targeting two mechanisms to improve handover decision-making and selection of handover control parameters adaptively based on different schemes. The first one, based on a learning model called LIM2 and the second one is based on fuzzy logic and is called RHOT-FLC. The results show that the RHOT-FLC mechanism, which relies on fuzzy logic and takes into account the user's velocity provides better performance in term of average throughput, packet drop rate, average HOPP probability, average HO latency, HO failure.