Packet Delivery Fraction Research Articles

Black-hole and DoS attack detection analysis and isolation mechanism for black-hole in MANET

A mobile ad-hoc network is a network without infrastructure where communication between nodes occurs in an open medium, such as the air. This makes it susceptible to eavesdropping and various attacks, which can be categorized as data traffic attacks (such as black-hole, grey-hole, DoS, etc.) and control traffic attacks (such as worm-hole, hello flood, man-in-the-middle, etc.). This NS2 experimental simulation compares the disruption effects of black-hole and DoS attacks in an identical network using the AODV routing protocol. The simulation aims to observe and analyze parameters such as packet delivery fraction, end-to-end delay, normalized overhead, and residual energy in HKI-Reader. Additionally, it demonstrates how malicious nodes are detected, removed, or isolated from the network to restore it to its original state. HKI-Reader is a software application developed using PHP and JavaScript. It is designed to read simulation results files for attacks and display them in a graphical user interface (GUI) for improved analysis and visual observation.

Extended Comparison and Performance Analysis for Mobile Ad-Hoc Networks Routing Protocols Based on Different Traffic Load Patterns and Performance Metrics

A mobile ad-hoc network (MANET) is a network of mobile nodes that dynamically form a transitory network lacking any existence of infrastructure and any form of centralized management. Nodes in ad hoc networks are powered by batteries with a limited lifespan and communicate in a restricted bandwidth. The unpredictable environment of a MANET may run into a major concern in the routing mechanism, therefore the need for a routing protocol with robust performance is still one of the key challenges in MANET deployment. In this work, a comparative comparison and extensive simulation analysis have been carried out for three major routing protocols: destination sequenced distance vector (DSDV), dynamic source routing (DSR) and ad hoc on-demand distance vector (AODV). Protocol evaluation has been extended by considering several simulation arrangements, different classes of traffic load patterns and diverse performance metrics. Based on packet rate change, node quantity and node speed, simulation scenarios were generated. Protocols were investigated against energy consumption, throughput, lost packets, routing load and packet delivery fraction for three types of traffic load patterns regular, irregular and joint traffic. DSR and AODV protocols proved to be more reliable when joint traffic was implemented when node speed and packets variations are considered. DSDV protocol verifies outstanding response over other protocols in terms of energy consumption when either regular or irregular traffic is applied. The simulation results for DSR protocol have verified the superiority over other protocols in 9 simulation scenarios when diverse metrics are considered. DSDV showed optimal performance in 7 cases, especially at low packet rates and in networks with minimum number of nodes. Similarly, AODV protocol showed outstanding performance in 6 scenarios, when higher packet rates and node mobility are considered.

Integrating Intelligent Systems in MANET- IoT Environment based on Subjective Context

The Internet of Things (IoT) has cultivated a promising environment, pivotal across diverse sectorsvia MANET protocols within the w.w.w. This technology significantly contributes to advanced services for mobiledevices in the MANET-IoT domain. However, MANET encounters security challenges, notably malicious attacksas a prime concern. To counter these threats, preventive measures like subjective-context evaluation and nodeprotection are employed, ensuring data packet integrity before delivery. This study aims to enhance theperformance of a novel reactive protocol, integrated with a fuzzy system within the MANET-IoT environment. Themethodology is implemented in two directions: 1) Establishing a secure network founded on trust parameters andshortest path selection. 2) Incorporating an integrated fuzzy system into an improved reactive routing protocolwithin the MANET environment. Subjective context ensures a secure milieu, evaluating nodes before packetdelivery based on trust and shortest path. The fuzzy system's rules determine the network's probability distribution,contingent upon trust and the number of hop counts. The proposed routing protocol is evaluated both pre- and postattacks during packet transmission. Results demonstrate its superiority in packet transmission over the originalprotocol. Three scenarios evaluate packet delivery fraction (PDF), end-to-end delay (E2E), and normalized routingload (NRL). FS-AODV's percentages were 0.9873% against AODV's 1.9871% without drop) and 0.8419% with adrop for PDF. FS-AODV's percentages stood at 0.0006% against AODV's 0.0007% without a drop and 0.0005%with a drop for E2E. In contrast, FS-AODV's percentage was 0.058%, AODV at 0.0127% without a drop, and0.066% with a drop for NRL.

ADAPTIVE SECURE AND EFFICIENT ROUTING PROTOCOL FOR ENHANCE THE PERFORMANCE OF MOBILE AD HOC NETWORK

Nowadays Mobile Ad Hoc Network (MANET) is an emerging area of research to provide various communication services to end users. Mobile Ad Hoc Networks (MANETs) are self-organizing wireless networks where nodes communicate with each other without a fixed infrastructure. Due to their unique characteristics, such as mobility, autonomy, and ad hoc connectivity, MANETs have become increasingly popular in various applications, including military, emergency response, and disaster management. However, the lack of infrastructure and dynamic topology of MANETs pose significant challenges to designing a secure and efficient routing protocol. This paper proposes an adaptive, secure, and efficient routing protocol that can enhance the performance of MANET. The proposed protocol incorporates various security mechanisms, including authentication, encryption, key management, and intrusion detection, to ensure secure routing. Additionally, the protocol considers energy consumption, network load, packet delivery fraction, route acquisition latency, packets dropped and Quality of Service (QoS) requirements of the applications to optimize network performance. Overall, the secure routing protocol for MANET should provide a reliable and secure communication environment that can adapt to the dynamic nature of the network. The protocol should ensure that messages are delivered securely and efficiently to the intended destination, while minimizing the risk of attacks and preserving the network resources Simulation results demonstrate that the proposed protocol outperforms existing routing protocols in terms of network performance and security. The proposed protocol can facilitate the deployment of various applications in MANET while maintaining security and efficiency.

S-Octopus: A Novel Scalable Secure Position-Based Routing Protocol for MANETs

Mobile Ad-Hoc Networks (MANET) are self-organized wireless networks that are becoming progressively popular. Determining an efficient route leading from a source to a specific destination in these networks is an essential issue since nodes are continuously moving. Furthermore, finding a secure route is a difficult area to deal with since adversaries might insert themselves into these routes unless a strict secure routing procedure is implemented. In this paper, a novel scalable secure routing protocol called S-Octopus has been proposed. Via dividing the network area into sectors and utilizing restricted directional flooding, our protocol intents to achieve improved scalability. Moreover, S-Octopus seeks to enhance robustness against the single point of failure and compromise by introducing several Sector Certificate Authority servers. Together with S-Octopus a location service and a misbehavior detection system have been proposed. Using GloMoSim simulator, S-Octopus security and performance have been evaluated and compared with the basic Authenticated Routing for Ad-Hoc Networks (ARAN) as well as Zone-based Authenticated Routing for Ad-Hoc Networks (ARANz). Simulation results assure that S-Octopus is able to effectively initiate and maintain secure routes in MANETs. Results also confirm that S-Octopus has significantly mitigated the scalability problem by achieving the maximum packet delivery fraction and the minimum network and routing loads within fairly large networks with high-mobility nodes and large malicious node percentage. Thus, S-Octopus is a good choice for MANET established among students on a campus or peers at a conference, where keys and certificates might be previously deployed.

Pythagorean Fuzzy Sets-based VIKOR and TOPSIS-based multi-criteria decision-making model for mitigating resource deletion attacks in WSNs

In Wireless Sensor Networks (WSNs), resource depletion attacks that focusses on the compromization of routing protocol layer is identified to facilitate a major influence over the network. These resource depletion attacks drain the batter power of the sensor nodes drastically with persistent network disruption. Several protocols were established for handling the impact of Denial of Service (DoS) attack, but majority of them was not able to handle it perfectly. In specific, thwarting resource depletion attack, a specific class of DoS attack was a herculean task. At this juncture, Multicriteria Decision Making Model (MCDM) is identified as the ideal candidate for evaluating the impact introduced by each energy depletion compromised sensor nodes towards the process of cooperation into the network. In this paper, A Pythagorean Fuzzy Sets-based VIKOR and TOPSIS-based multi-criteria decision-making model (PFSVT-MCDM) is proposed for counteracting with the impacts of resource depletion attacks to improve Quality of Service (QoS) in the network. This PFSVT-MCDM used the merits of Pythagorean Fuzzy Sets information for handling uncertainty and vagueness of information exchanged in the network during the process of data routing. It utilized VIKOR and TOPSIS for exploring the trust of each sensor nodes through the exploration of possible dimensions that aids in detecting resource depletion attacks. The experimental results of PFSVT-MCDM confirmed better throughput of 21.29%, enhanced packet delivery fraction of 22.38%, minimized energy consumptions 18.92%, and reduced end-to-end delay of 21.84%, compared to the comparative resource depletion attack thwarting strategies used for evaluation.

Detection and Isolation of Selfish Nodes in MANET Using Collaborative Contact-Based Watchdog with Chimp-AODV

Mobile Ad-hoc Network (MANET) is one of the most important self-configuring and independent wireless network. Numerous intermediate nodes are used among MANET to interchange the information without the requirement of any centralized infrastructure. But some nodes act selfishly and utilize the resources only for their own purposes and do not share with the neighbors. This selfish nodes might delay or drop the packet and do not perform routing. Though watchdog is a well-known selfish node detection technique, it causes false negatives and false positives that can affect the performance in terms of precision and speed. To eliminate the drawbacks of existing approaches in selfish node detection, this paper integrates both Ad-hoc On-Demand Distance Vector (AODV) protocol incorporated with chimp optimization algorithm and Collaborative Contact based Watchdog to propose a novel technique called Chimp-CoCoWa-AODV in order to improve the performance of MANET. The main role of chimp optimization algorithm in AODV is to undergo optimal route selection process. The performance of the proposed Chimp-CoCoWa-AODV approach is compared with existing approaches in terms of average routing load, Average Packet Delivery Fraction (PDF), Average End-to-end Delay (EED), Average Throughput, Total packet drop in the application layer, and maliciously dropped packet in the routing layer. The simulation results shows that the proposed approach is effective with 82% PDF and 7.4 ms EED at 50 nodes in detection and isolation of selfish nodes in MANET even in the presence of malicious node.

BA-CNN: Bat Algorithm-Based Convolutional Neural Network Algorithm for Ambulance Vehicle Routing in Smart Cities

This article proposes an ambulance vehicle routing approach in smart cities. The approach is based on the bat algorithm and convolutional neural network (BA-CNN). It aims to take transfer the patients confidentially, accurately, and quickly. The type of CNN used in this research is a residual network (ResNet). The node method is responsible for creating the city map. In the beginning, information about the accident place is received by the control station and forwarded to both the hospital and the ambulance. The driver feeds the data that contain the ambulance vehicle’s node position and the accident location to the BA-CNN vehicle routing algorithm. The algorithm then obtains the shortest path to reach the location of the accident by the driver. When the vehicle arrives at the accident location, the driver updates the algorithm with hospital and accident positions. Then, the shortest path (which leads to the fast reach time) to the hospital is calculated. The bat algorithm provides offline data for a possible combination of different source and destination coordinates. The offline data are then trained by utilizing a neural network. The neural network is used for finding the shortest routes between source and destination. The performance evaluation of the BA-CNN algorithm is based on the following metrics: end-to-end delay (EED), throughput, and packet delivery fraction (PDF). This BA-CNN is compared with counterparts, including three different existing methods such as TBM, TVR, and SAODV. The experiments demonstrate that the PDF of our method is 0.90 for 10 malicious nodes, which is higher than in the TBM, TVR, and SAODV.

Cross-Layer Design Based N-ary Huffman Coding for Performance Analysis of DSDV Routing Protocol in MANETs

The implementation of the optimal Huffman coding technique for achieving proficient data compression, lower information redundancy and minimal utilization of the scarce bandwidth is essential to handle the effective processing of massive network data. In this paper, we employ cross-layer design technique among the data link, network and presentation layers of the traditional protocol stack to develop the improved DSDV routing protocol based on n-ary Huffman coding procedure. The entropy-based adaptive prefix codewords with variable length are assigned to the probability of packet successful delivery across the ad-hoc wireless network. Several coding and network efficiency parameters are deployed to assess the performance of the proposed routing scheme under three distinctive IPv4 network scenarios. These investigated network protocols include the default IPv4, multi IPv4 and dynamic IPv4 routing methodologies. Diversified simulation settings are employed with deviating network size to measure the multitude of essential wireless network characteristics incorporating the average delay, packet error rate, packet delivery fraction, data rate, ping loss rate, entropy rate, and reception cache hit. In addition, the set of key data compression/coding indicators are examined through comprehensive numerical analysis such as codeword length, source information rate, mean redundancy, and coding efficiency. Beyond, we significantly compare the performance of our developed cross-layer coded mobile routing model with several previous algorithms to validate its enhanced feasibility and superiority in terms of crucial network operation metrics such as throughput, packet drop rate, mean delay and packet delivery ratio.

Counteracting Selfish Nodes Using Reputation Based System in Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is a group of nodes constituting a network of mobile nodes without predefined and pre-established architecture where mobile nodes can communicate without any dedicated access points or base stations. In MANETs, a node may act as a host as well as a router. Nodes in the network can send and receive packets through intermediate nodes. However, the existence of malicious and selfish nodes in MANETs severely degrades network performance. The identification of such nodes in the network and their isolation from the network is a challenging problem. Therefore, in this paper, a simple reputation-based scheme is proposed which uses the consumption and contribution information for selfish node detection and cooperation enforcement. Nodes failing to cooperate are detached from the network to save resources of other nodes with good reputation. The simulation results show that our proposed scheme outperforms the benchmark scheme in terms of NRL (normalized routing load), PDF (packet delivery fraction), and packet drop in the presence of malicious and selfish attacks. Furthermore, our scheme identifies the selfish nodes quickly and accurately as compared to the benchmark scheme.

Reactive and Proactive Route Evaluation in MANET

Ad hoc networks are established in small local areas and need very low infrastructure. There is no centralized control system for data communication. Due to frequently changing the position of the nodes create so many challenging issues like throughput, data loss and increase the packet delivery fraction. In this paper, An Ad Hoc On-Demand Distance Vector, Ad hoc On demand Multipath Distance Vector, and Multi‐path dynamic address routing protocols have been analyzed based on various data rates. The evaluation parameters are taken as: average throughput, average delay, packet delivery ratio, packet delivery fraction and latency. Implementation research work has been simulated on network simulator 2.35. It is analyzed that Ad hoc On demand Multipath Distance Vector routing protocol performs better in terms of packet delivery ratio and received packets as compared to Ad Hoc On-Demand Distance Vector and Multi‐path dynamic address routing protocols.

Resistance to Malicious Packet Droppers Through Enhanced AODV in a MANET

Packet dropping in a mobile ad hoc network can manifest itself as the data plane attacks as well as control plane attacks. The former deal with malicious nodes performing packet drop on the data packets following the route formation and the latter deal with those malicious nodes which either drop or manipulate the control packets to degrade the network performance. The idea of the proposed approach is that during the route establishment, each of the on-path nodes is provided with pre-computed hash values which have to be used to provide a unique acknowledgement value to the upstream neighbor which acts as a proof of the forwarding activity. The analysis phase results in the detection of nodes which exhibited malicious behavior in the current communication session so as to avoid them in the future communication sessions resulting in an improved packet delivery fraction even in the presence of one or more malicious nodes in the network. The communication overhead incurred is minimum since the acknowledgement reports are sent to the destination for a transmission of N packets rather than an individual acknowledgement for each transmitted packet. In contrast to some of the existing techniques, the proposed mechanism is not dependent on the deployment of additional infrastructure like special Intrusion Detection System (IDS) nodes. The only overhead incurred is in the form of control packets exchanged for the reports request and the reports submission.

An Efficient and Reliable Algorithm for Wireless Sensor Network

In wireless sensor networks (WSN), flooding increases the reliability in terms of successful transmission of a packet with higher overhead. The flooding consumes the resources of the network quickly, especially in sensor networks, mobile ad-hoc networks, and vehicular ad-hoc networks in terms of the lifetime of the node, lifetime of the network, and battery lifetime, etc. This paper aims to develop an efficient and reliable protocol by using multicasting and unicasting to overcome the issue of higher overhead due to flooding. Unicasting is used when the desired destination is at a minimum distance to avoid an extra overhead and increases the efficiency of the network in terms of overhead and energy because unicasting is favorable where the distance is minimum. Similarly, multicasting is used when the desired destination is at maximum distance and increases the network’s reliability in terms of throughput. The results are implemented in the Department of Computer Science, Bacha Khan University Charsadda (BKUC), Pakistan, as well as in the Network Simulator-2 (NS-2). The results are compared with benchmark schemes such as PUMA and ERASCA, and based on the results, the performance of the proposed approach is improved in terms of overhead, throughput, and packet delivery fraction by avoiding flooding.

Fuzzy and Position Particle Swarm Optimized Routing in VANET

In Intelligent Transport Systems, traffic management and providing stable routing paths between vehicles using vehicular ad hoc networks (VANET's) is critical. Lots of research and several routing techniques providing a long path lifetime have been presented to resolve this issue. However, the routing algorithms suffer excessive overhead or collisions when solving complex optimization problems. In order to improve the routing efficiency and performance in the existing schemes, a Position Particle Swarm Optimization based on Fuzzy Logic (PPSO-FL) method is presented for VANET that provides a high-quality path for communication between nodes. The PPSO-FL has two main steps. The first step is selecting candidate nodes through collectively coordinated metrics using the fuzzy logic technique, improving packet delivery fraction, and minimizing end-to-end delay. The second step is the construction of an optimized routing model. The optimized routing model establishes an optimal route through the candidate nodes using position-based particle swarm optimization. The proposed work is simulated using an NS2 simulator. Simulation results demonstrate that the method outperforms the standard routing algorithms in packet delivery fraction, end-to-end delay and execution time for routing in VANET scenarios.

ASR-FANET: An adaptive SDN-based routing framework for FANET

Flying ad hoc network (FANET) is widely used in many military, commercial and civilian applications. Compared with mobile adhoc network (MANET) and vehicular ad hoc network (VANET), FANET holds unique characteristics such as high mobility, intermittent links and frequent topology changes, which cause a challenging task in the design of routing protocols. A novel adaptive software defined networking (SDN)-based routing framework for FANET called ASR-FANET is proposed in this article to solve the above challenges. The ASR-FANET framework is mainly composed of three important parts, which are the topology discovery mechanism, statistics gathering mechanism and route computation mechanism. In topology discovery mechanism, the periodic information about network topology is collected, including nodes and links. In statistics gathering mechanism, the status of the wireless network connection and flight statistics are collected. In route computation mechanism, the optimal path is calculated based on link costs. The performance of ASR-FANET framework is also has been evaluated by comprehensive simulations. The simulation results show that proposed framework is much better than other traditional protocols in packet delivery fraction, average end to end delay, normalized routing load, packet loss and throughput.

Cluster Formation and Maintenance Techniques for Mobile Adhoc Networks with Improved Quality of Service

— In an Adhoc Network, every node is mobile and self-contained. As these networks lack infrastructure, highly adaptive algorithms are required to deal with frequent mobility changes by member nodes as well as Cluster Head (CH) nodes. The weighted clustering algorithms contribute significantly to cluster-based routing. In these algorithms, the selection of cluster heads is the most important task. In weighted clustering methods, the selected CH did their best to serve the network. However, the CH may become overloaded due to the arrival of nodes greater than their desired threshold value. In this case, the CH can become a bottleneck as it is unable to cope with rapidly increasing loads which ultimately degrade the network performance. In this paper, we address three network issues (i) Member Node movement (ii) Cluster head Node movement, and (iii) Overload at the Cluster head node caused due to mobility of nodes. Our proposed method Cluster Formation and Maintenance Techniques for Mobile Adhoc Networks with Improved Quality of Service (CFMIQS) include various adaptive algorithms to provide solutions to deal with these network issues and improve network Quality of Service (QoS). The Simulated Results are compared with the K-means AODV algorithm, the results showed better Packet Delivery Fraction (PDF) and Throughput values. Keywords— Cluster partition, MANET, Primary Cluster head, QoS, Secondary Cluster head

Performance Evaluation of AODV and DSR Routing Protocols for Flying Ad hoc Network Using Highway Mobility Model

The Flying Ad hoc Network (FANET) is a special type of mobile ad hoc network (MANET) that provides communications among Unmanned Aerial Vehicles (UAVs). These UAVs can reduce human intervention to a great extent by giving numerous applications under different domains such as transportation, military, healthcare, traffic monitoring, surveillance, etc. In FANET, communication is relatively challenging due to its complex infrastructure, unspecified architecture and rapid mobility of nodes. The work embodied in this paper is focused on traffic surveillance of highways using UAVs. UAVs can help to reduce the number of accidents by sharing real-time as well as the accurate status of highways among vehicles and the control station. On the other hand, they can also be used to track specific vehicles on the road. In FANET, both routing protocols and mobility models play a crucial role in the process of information exchange. In this paper, the comparison and performance evaluation of two well-known reactive routing protocols viz. Ad hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR) have been carried out using highway mobility model for traffic surveillance in FANET environment. Implementation of both protocols has been tested on several traffic patterns, mobility and varying network loads. Both AODV and DSR enable significant performance variations; however, they share on-demand behavior. Packet delivery fraction, average end-to-end delay, normalized routing load, packet loss, routing overhead and throughput are used to analyze the performance of both protocols. Based on experimental analysis using NS-2 under constant bit rate (CBR) and TCP traffic sources, it can be stated that AODV outperforms DSR in almost every aspect.

Hybrid and dynamic clustering based data aggregation and routing for wireless sensor networks

In Wireless Sensor Networks (WSNs), effective transmission with acceptable degradation in the power of sensor nodes is a key challenge. In a large network, holdup is bound to occur in communicating superfluous data. The aforementioned issues namely, energy, delay and data redundancy are interdependent on each other and a tradeoff needs to be worked out to improve the overall performance. The extant methods in the literature employ either centralized or distributed approach to select a cluster head (CH). In this paper, sink originated hybrid and dynamic clustering with routing technique is proposed. The proposed routing algorithm works based on node handling capability of each sensor node in the selection of CH and also helps in identifying the forwarder node. In addition, processing load of a sensor node is also considered for selecting the forwarder. Both space and time correlation is used to collect data from the clusters and then aggregated to provide a proficient communication. The introduced method is evaluated with the performance of the previously available techniques like, Data Routing for In-Network Aggregation (DRINA), Efficient Data Collection Aware of Spatio-Temporal Correlation (EAST), Cluster-Based Data Aggregation (CBDA), Energy-Efficient Data Aggregation and Transfer (EEDAT), and Distributed algorithm for Integrated tree Construction and data Aggregation (DICA). Simulation parameters considered for assess ing the performance of the proposed algorithm are aggregation ratio, routing overhead, packet delivery fraction, throughput, packet delay and consumed energy. The experimental analysis of the introduced algorithm generates paramount outcome of finest aggregation quality with diverse key characteristics and circumstances as required by a sensor network.

Determining an optimum zone radius for zone routing protocol (ZRP) based on node mobility

Mobility is one of the important issues in Mobile Ad hoc Networks (MANET). By definition, MANET nodes are free to move around and this may cause difficulty in routing. MANET routing protocols must consider this factor when making routing decision. Zone Routing Protocol (ZRP) is a hybrid routing protocol, which utilizes the proactive and reactive routing protocols advantages. ZRP proactively maintains routing information within a routing zone, while reactively discovering routes to destinations beyond the routing zone. Since ZRP is based on the concept of routing zone, determining an optimum routing zone radius has the major impact on the performance of that protocol. In this research, we studied the effect of zone radius on the performance of ZRP with different levels of node mobility. Node mobility is defined using two different parameters: node speed and pause time. Based on the simulation results, ZRP protocol using zone radius of two provides the best packet delivery fraction, throughput and normalized routing load. However, a larger zone radius will provide a lower delay.

Performance Evaluation of Mobility Models over UDP Traffic Pattern for MANET Using NS-2

The current study presents the simulative study and evaluation of MANET mobility models over UDP traffic pattern to determine the effects of this traffic pattern on mobility models in MANET which is implemented in NS-2.35 according to various performance metri (Throughput, AED (Average End-2-end Delay), drop packets, NRL (Normalize Routing Load) and PDF (Packet Delivery Fraction)) with various parameters such as different velocities, different environment areas, different number of nodes, different traffic rates, different traffic sources, different pause times and different simulation times . A routing protocol.…was exploited AODV(Adhoc On demand Distance Vector) and RWP (Random Waypoint), GMM (Gauss Markov Model), RPGM (Reference Point Group Model) and MGM (Manhattan Grid Model) mobility models above CBR traffic sources. The results of Reference Point Group Model simulation illuminate that routing protocol performance is best with RPG mobility model than other models.