Source Routing Protocol Research Articles

Trust-Based Routing Selection Policy on Mobile Ad-Hoc Network Using Aodv Routing Protocol

This study presents an enhanced Ad-hoc On-demand Distance Vector (AODV) routing protocol, termed Proposed_TAODV, designed to improve security in Mobile Ad-Hoc Networks (MANETs) of 150 nodes by incorporating trust-based mechanisms. Through a comprehensive simulation, the Proposed_TAODV is evaluated against existing AODV and Dynamic Source Routing (DSR) protocols under conditions of increasing malicious node presence. The results reveal that Proposed_TAODV maintains a higher Packet Delivery Ratio, experiences lower Average End-to-End Delay, and achieves greater Throughput compared to the benchmarks, indicating its superior performance and robustness. The integration of Direct Trust Evaluation, Indirect Trust Evaluation, and Trust Aggregation methods into the AODV protocol clearly enhances the MANET's resilience to security threats, establishing the Proposed_TAODV as a promising approach for securing MANETs against various forms of attacks and network disruptions.

Comparative Performance Analysis on the Standard and Revised Routing Models of the Dynamic Source Routing Protocol

Comparative Performance Analysis on the Standard and Revised Routing Models of the Dynamic Source Routing Protocol

Analysis of the Dynamic Source Routing Protocol on the Performance of File Transfer Protocol and Video Conference Services in the Mobile AdHoc Network Simulation

Current technological advancements make it easier for users to do their work effectively and efficiently, including the use of wireless networks to exchange data via File Transfer Protocol (FTP) and video conferencing services (VCS). A Mobile AdHoc Network (MANET) is a wireless network technology that applies a dynamic set of nodes. Data transmission on the MANET does not require the use of devices such as base stations. Because each node on the MANET can act as a router in determining the direction of the data sent, the number of nodes in the MANET will influence the quality of the data sent. Using the OPNET Modeler simulator, this paper shows how to assess the quality of FTP and VCS based on delay, jitter, and packet loss parameters. The simulation scenario employs five, fifteen, and thirty nodes with low, medium, and high traffic loads, using the Dynamic Source Routing (DSR) protocol. According to the measurement results, the FTP service with the bad category is the packet loss parameter in high traffic loads, which has the highest packet loss value of 56.6 percent with 15 nodes. In contrast, good results for VCS are only produced on the delay parameter. The jitter increases with the number of nodes, and it is 5 in this case. In all scenarios, the packet loss parameter yields poor results, with the highest packet loss value approaching 100%.

Performance evaluation of dynamic source routing protocol with variation in transmission power and speed

<span lang="EN-US">Mobile ad-hoc network (MANET) is a set of mobile wireless nodes (devices) which is not rely on a fixed infrastructure. In MANETs, each device is responsible for routing its data according to a specific routing protocol. The three most common MANET routing protocols are: dynamic source routing protocol (DSR), optimized link state routing protocol (OLSR), and ad-hoc on-demand distance vector (AODV). This paper proposes an efficient evaluation of DSR protocol by testing the MANETs routing protocol with variation in transmission power at different speeds. The performance analysis has been given using optimized network engineering tools (OPNET) modeler simulations and evaluated using metrics of average end to end delay and throughput. The results show that the throughput increases as the transmission power increases up to a certain value after which the throughput decreases, also the network work optimally at a certain transmission power which varied at different speed.</span>

Dynamic source routing protocol with transmission control and user datagram protocols

Dynamic source routing protocol (DSR) is a common routing protocol in wireless network without infrastructure, called ad-hoc network, DSR used just above internet protocol (IP) at the network layer. The upper transport layer provides reliability by transmission control protocol (TCP) and user datagram protocol (UDP). The choice between DSR/TCP and DSR/UDP is an actual issue for network designers and engineers. The question arises: which one provides better quality of service (QoS) parameters, less delay and jitter, greater throughput, and data rates. This paper focuses on the study and analysis of DSR and comparison of DSR/TCP and DSR/UDP by simulation in network simulator (NS2) environment. Another comparison of DSR and ad hoc on-demand distance vector (AODV) is provided. Design and simulation of the protocols in ad hoc network accurately describe the behavior in real system and QoS parameters are obtained.

Design and analysis of energy aware interior gateway routing algorithm with particle swarm optimization

SummaryIn wireless sensor networks (WSNs), the data must reach a processing node with less energy consumption and delay rate. However, with the specific consideration of the unique properties of sensor networks such as limited power, stringent bandwidth, dynamic topology due to node failures, adding/removing nodes, or even physical mobility, high network density and large‐scale deployments have posed many challenges in the design and management of sensor networks. These challenges have demanded energy awareness and robust protocol design. Efficient utilization of the sensor's energy resources and maximizing the network lifetime were the primary design considerations for the proposed work. As a result, the new interior gateway routing with particle swarm optimization (IGRPSO) is presented with minimal latency and a higher packet delivery ratio in WSN; optimum link weights are calculated in a fraction of the original data to the new protocol. Network entropy maximization is a conceptual framework that guides the development of the protocol and the computational techniques required to determine which traffic distributions are not only best but also realizable through link‐state routing. Therefore, a routing algorithm provides the optimal and economically optimal route. We used the MATLAB simulation environment to compare and contrast the performance of the dynamic source routing (DSR) protocol and enhanced interior gateway routing protocol, DSR protocol with particle swarm optimization with that of the IGRPSO protocol, which has the maximum packet delivery ratio of 75.74% and less packet drop of 25.37%, less energy consumption of 0.3674 J.

Authentication of WSN for Secured Medical Data Transmission Using Diffie Hellman Algorithm

The applications of wireless sensor network (WSN) exhibits a significant rise in recent days since it is enveloped with various advantageous benefits. In the medical field, the emergence of WSN has created marvelous changes in monitoring the health conditions of the patients and so it is attracted by doctors and physicians. WSN assists in providing health care services without any delay and so it plays predominant role in saving the life of human. The data of different persons, time, places and networks have been linked with certain devices, which are collectively known as Internet of Things (IOT); it is regarded as the essential requirement of people in recent days. In the health care monitoring system, IOT plays a magnificent role, which has produced the real time monitoring of patient’s condition. However the medical data transmission is accomplished quickly with high security by the routing and key management. When the data from the digital record system (cloud) is accessed by the patients or doctors, the medical data is transferred quickly through WSN by performing routing. The Probabilistic Neural Network (PNN) is utilized, which authenticates the shortest path to reach the destination and its performance is identified by comparing it with the Dynamic Source Routing (DSR) protocol and Energy aware and Stable Routing (ESR) protocol. While performing routing, the secured transmission is achieved by key management, for which the Diffie Hellman key exchange is utilized, which performs encryption and decryption to secure the medical data. This enables the quick and secured transmission of data from source to destination with improved throughput and delivery ratio.

A Cross-Layer Solution for Contention Control to Enhance TCP Performance in Wireless Ad-Hoc Networks

With the development of wireless technology, users not only have wireless access to the Internet, but this has also sparked the emergence of Wireless Ad-hoc Networks (WANETs); this promising networking paradigm has the potential to adopt the shape of new emergent networks such as the Internet of Things (IoT), Vehicular Ad-hoc Networks (VANET) and Wireless Sensor Networks (WSN). However, channel contention (CC) is one of the key reasons why the TCP performs poorly in WANETs. This paper presents a mechanism called Cross-layer Solution for Contention Control (CSCC) to enhance TCP performance in WANETs. Each node starts marking packets in the proposed mechanism when its CC level reaches a certain threshold. As a result, the source node adjusts the congestion window (cwnd) size to a good state to control the insertion ratio of packets into the network. To provide a fair share to each flow, the flow having a large cwnd is penalized more. Numerous simulations have been conducted across several topologies to clarify the performance of the suggested mechanism. The simulation findings show that, in the presence of the Ad-hoc On-demand Distance Vector (AODV) routing and Dynamic Source Routing (DSR) protocols, the proposed CSCC mechanism outperformed TCP NewReno in terms of throughput and fairness. In comparison to TCP NewReno, the suggested mechanism has fewer retransmitted packets.

Energy Based Random Repeat Trust Computation in Delay Tolerant Network

As the use of mobile devices continues to rise, trust administration will significantly improve security in routing the guaranteed quality of service (QoS) supply in Mobile Ad Hoc Networks (MANET) due to the mobility of the nodes. There is no continuance of network communication between nodes in a delay-tolerant network (DTN). DTN is designed to complete recurring connections between nodes. This approach proposes a dynamic source routing protocol (DSR) based on a feed-forward neural network (FFNN) and energy-based random repetition trust calculation in DTN. If another node is looking for a node that swerved off of its path in this situation, routing will fail since it won’t recognize it. However, in the suggested strategy, nodes do not stray from their pathways for routing. It is only likely that the message will reach the destination node if the nodes encounter their destination or an appropriate transitional node on their default mobility route, based on their pattern of mobility. The EBRRTC-DTN algorithm (Energy based random repeat trust computation) is based on the time that has passed since nodes last encountered the destination node. Compared to other existing techniques, simulation results show that this process makes the best decision and expertly determines the best and most appropriate route to send messages to the destination node, which improves routing performance, increases the number of delivered messages, and decreases delivery delay. Therefore, the suggested method is better at providing better QoS (Quality of Service) and increasing network lifetime, tolerating network system latency.

Improved malicious node detection method for detecting a bait in an extensive network for getting the maximum throughput

AbstractMobile Ad‐hoc Network (MANET) is an ad hoc Wireless subset with a unique dynamic geometry of the system and movable nodes. The MANETs are auto‐organized networks that permit mobility without infrastructure. Specific protocols for MANET routing are provided with these attributes. The benefits such as infinite stability and the essential organizational characteristics of MANET are advantageous in circumstances where crisis and military use arise. In the light of malicious nodes, this necessity can lead to real safety threats and interfere in routing. In this specific case, it is a challenge to avoid or identify malicious nodes that initiate grey hole attacks or collective blackhole attacks. This paper addresses and analyzes the risks and security policies of MANET. This method is mainly directed at the Dynamic Source Routing Protocol (DSR). MANET's malicious nodes have been used with schematics such as Control, Two Acknowledgement IDS (TWOACK), Adaptive Acknowledgement IDS(AACK), and Enhanced Adaptive Acknowledgement IDS (EAACK). This research aims to identify trends, difficulties, and possible recommendations for use with MANET using the malicious node detection tool. To fix efficiency, monitoring, and overhead analysis limitations and resolve existing security problems related to MANET. The goal is to offer an Improved Cooperative Malicious Node Detection System (ICMNDS) to detect malicious nodes, which keeps overhead minimum.

Dynamic source routing protocol for robust path reliability and link sustainability aware routing in wireless communication

Routing is the method of determining the most efficient route between transmitter and the receiver which is enhanced by taking into account the node's energy. The Dynamic Source Routing (DSR) Protocol is presented in this work to increase quality-of-service (QoS) by calculating path reliability and link sustainability criteria in which node energy, node centrality, node degree, and link cost are used to choose the relay nodes. Qualified relaying nodes are used for transmission from the source node to the cluster head (CH). One node is utilized to send data packets to its destination and the relay nodes are chosen in the optimum manner. In terms of packet loss ratio, energy consumption and delay, the suggested technique outperforms other existing routing protocols which has the lower packet loss ratio of about 4 % which is 3 % lesser than existing method.

A Quality of Service Aware Source Routing Based Protocol for Underwater Wireless Sensor Networks

Underwater Wireless Sensor Networks (UWSNs) handle many underwater applications such as environment monitoring, surveillance and navigation. These applications generate varied types of traffic such as continuous bit rate, sporadic and different packet sizes, leading to additional QoS requirements that are traffic and application dependent. This paper presents the development of a Quality of Service Aware Source Routing (QASR) protocol. QASR discovers multiple paths from the sources to the sinks and selects the most QoS compatible route among them. QASR is distinctive because it incorporates multiple QoS parameters such as Signal to Noise Ratio (SNR), latency and residual energy. Depending on which of these parameters are chosen, QASR has three variants, namely, QASR-Latency (QASR-L), QASR-Residual Energy (QASR-RE) and QASR-Signal to Noise Ratio (QASR-SNR). The performance of QASR protocol is compared against traditional source routing protocols, with simulations showing a reduction of about 10% to 20% in latency and about 5% to 10% lesser energy consumption than source routing. QASR protocol exhibits comparable performance to classic source routing protocols while simultaneously adhering to the QoS requirements of the application. It is also worth noting that the performance profile of all the three variants of QASR do not have sudden and drastic variations, with the performance profiles showing consistent trend-lines.

Vehicular connectivity algorithm for cooperative transportation systems

Vehicular Ad-hoc Network (VANET) means connectivity between wireless interface and mobile vehicle equipment which could be of either homogeneous or heterogeneous nature. VANET is an emerging part of research due to its ability to create intelligent transport systems. Roadside fixed equipment (RSU), and on-board unit (OBU) can be either public means of transport service providers or private (belonging to companies or individuals). In this infrastructure, messages flow from vehicle to vehicle and vehicle to roadside via wireless technologies such as IEEE 8.02.11.P and IEEE 1609 WAVE. The main issue in VANET implementation is the design of routing topology that gives accurate vehicle-to-vehicle transmission. In VANET, every participating vehicle node works as a single-vehicle node or wireless router, allowing vehicles that are 100–500 m far from creating a network and connected to each other by a large range using dynamic source routing (DSR) protocol. In this paper, we focus on improving connectivity by integrating simulation of urban mobility (SUMO) with NETSIM and present a new algorithm for packet delivery in different dense environments. In this work, we propose a vehicle connectivity algorithm for less (40), moderate (50), and more (60) number of vehicles and also analyze the threshold value of successfully delivered packets through simulation and the proposed algorithm. In the simulations and proposed method, the overall link and application throughput in VANET is enhanced, and the outcome shows that the connectivity is better than in the other techniques. This study has achieved good throughput in a dense vehicle environment. Performance of the networks has been measured through throughput, delay, packet delivery ratio (PDR), overhead head transmission for less (40), moderate (50), or more (60) number of vehicles on different road paths.

Performance and statistical analysis of ant colony route in mobile ad-hoc networks

<div class="WordSection1"><p>Research on mobile ad-hoc networks (MANETs) is increasing in popularity due to its rapid, budget-friendly, and easily altered implementation, and relevance to emergencies such as forest firefighting and health care provisioning. The main concerns that ad-hoc networks face is dynamic topology, energy usage, packet drop rate, and throughput. Routing protocol selection is a critical point to surmount alterations in topology and maintain quality in MANET networks. The effectiveness of any network can be vastly enhanced with a well-designed routing protocol. In recent decades, standard MANET protocols have not been able to keep pace with growing demands for MANET applications. The current study investigates and contrasts ant colony optimization (ACO) with various routing protocols. This paper compares ad-hoc on-demand multi-path distance vector (AOMDV), dynamic source routing protocol (DSR), ad-hoc on-demand distance vector routing (AODV), and AntHocNet protocols regarding the quality of service (QoS) and statistical analysis. The current research aims to study the behavior of the state-of-the-art MANET protocols with the ACO technique. The ACO technique is a hybrid technique, integrating a reactive route maintaining technique with a proactive method. The reason and motivation for including the ACO algorithm in the current study is to improve by using optimization algorithms proved in other domains. The ACO algorithm appears to have substantial use in large-scale MANET simulation.</p></div>

QUANTUM PHASE SHIFT FOR ENERGY CONSERVED SECURED DATA COMMUNICATION IN MANET

A Mobile Ad-Hoc Network(MANET) is a structure-less network where the mobile nodes randomly moved in any direction within the transmission range of the network. Due to this mobility, wide range of intrusion occurs in MANET. Therefore, Intrusion Detection Systems (IDS) are significant in MANETs to identify the malicious behavior. In order to improve the secured data communication an efficient Quantum Phase Shift Energy Conserved Data Security (QPSEC-DS) technique is introduced. The Quantum Phase Shift (QPS) technique is used for ensuring the security during the data transmission from sender to receiver in MANET. Initially, the quantum based approach is used to encrypt the information using QPS at the sender through secret key distribution. The receiver side also performs the same QPS, and then the encrypted bit is received successfully. This in turns attains the secured packet transmission without any malicious node in the MANET. Based on the phase shifting, the energy conservation between the sender and receiver is measured for transmitting the data packet using QPSEC-DS technique. Also, the enhanced Dynamic Source Routing (DSR) protocol is applied in QPSEC-DS technique is implemented to improve the energy management and secured data communication between the source and destination in an efficient manner. The QPSEC-DS technique conducts the simulations work on parameters including packet delivery ratio, energy consumption, communication overhead and end to end delay.

An Identity-Based Encryption Method for SDN-Enabled Source Routing Systems

In this study, we consider endpoints communicating over a software-defined networking (SDN)-based architecture using source routing, i.e., packets are routed through a path selected by the packet sender, and we provide a security solution that enforces the selected path. In particular, our solution allows a sender to select the path that a packet should go through using a constant-size cryptographic construction which is referred to as the authenticator. A recipient can examine an authenticator and verify that the received packet has followed the path selected by the sender. Additionally, any intermediate “programmable” switch can verify whether or not it is included in the path of a packet. Our solution can be used even for paths that include multiple recipients (e.g., multicast paths), as well as multiple parallel paths (e.g., multipath transmissions). We implement our solution by leveraging identity-based encryption (IBE), so it can be used by any sender that knows the identifiers of the links that compose the desired path, i.e., information that the sender usually already knows as part of the source routing protocol. Our solution is realistic since it can be implemented over a variety of platforms with tolerable overhead.

A Comparative Study of Routing Protocols for Minimum Path Cost Matric in MANETS

The Routing is the process of transmitting data packets from one node to another another node from source to destination The Mobile Adhoc Networks (MANETs ) doesn't have any fixed network structure or any centralized process to administer. The selection of the route is important for performance of packet transfer from source to destination. These routing protocol are classified as inter domain routing and Intra domain routing protocol. The routing protocols have been classified into Non Reactive , Reactive and Hybrid protocols. In the present paper we proposes to compare reactive routing protocols videlicet Ad hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR) protocols, Temporarily Ordered Routing Algorithm (TORA) and Associativity Grounded Routing (ABR) protocol.The Routing in MANETs is a one of the robustly and demanding task and has entered a great quantum of mindfulness from experimenters around the globe. To overcome this problem, a colorful number of routing classes have been introduced and the number is still rising day by day fastly. It's relatively hard to decide which protocols or routing classes may do well under an quantum of different network scripts similar as network volume and network topology etc. The study and performance of the above mentioned protocol has also been tabulated in the present two tables . The protocols are based on minimum power and temporary configuration of topology. The table 1 gives comparison of the main characteristics of routing protocols and Table2. provide comparison of various reactive routing protocol.

A mean field game-theoretic cross-layer optimization for multi-hop swarm UAV communications

Unmanned aerial vehicle (UAV) multi-hop communication networks are foreseen to be widely employed in both military and civilian scenarios. However, in ultra-dense scenarios with swarm UAVs, nodes are highly dynamic mobile, ultra-dense deployment and non-centralized distribution. These characteristics make the centralized resource management policy not apply. Meanwhile, existing routing protocols can't meet the performance challenges of high dynamic, topology and link frequency changes of ultra-dense scenarios with swarm UAVs. To solve the above challenges of resource management and routing protocol, a cross-layer optimization method is presented with a novel mean field game (MFG) in this paper. It is based on the cross-layer design method of the MFG theory and jointly considers the power resources in the physical layer, frequency resources in the medium access control (MAC) layer, and routing resources in the network layer. By dividing into subproblems, the original problem is solved. Meanwhile, the optimal data transmission path can be selected through the management and allocation of frequency resources and power resources. A cross-layer resource management dynamic source routing (CLRM-DSR) protocol is designed based on that which adds link quality measurement. The simulation results show that the presented CLRM-DSR with the proposed resource management scheme can improve the data packet transmission rate, reduce end-to-end delay, and lower routing overhead for the multi-hop swarm UAV communication network.

Enhanced dynamic source routing for verifying trust in mobile ad hoc network for secure routing

Secure data transfer in mobile ad hoc network (MANET) against malicious attacks is of immense importance. In this paper, we propose a new enhanced trust model for securing the MANET using trust-based scheme that uses both blind trust and referential trust. In order to do this, the trust relationship function has to be integrated with the dynamic source routing (DSR) protocol for making the protocol more secure. We thoroughly analyze the DSR protocol and generate the performance matrices for the data pertaining to packets sent, packets received, packets loss, and throughput. We also analyze the outcome attained from the improvised trust establishment scheme by using the three algorithm implementations in NS2 simulator for detecting and preventing various types of attacks.

Design and Analysis of Improved Dynamic Source Routing Protocol in Vehicular Ad-Hoc Network

Background and Objective: The present issues faced by the transport systems include enormous traffic jams and congestion, unexpected road accidents, unwanted time delays, pedestrians' crossings on main roads, wastage of fuel, and many more. ITS and some other technologies work together to overcome such factors contributing to a much more desirable transport system. This paper aims to identify the security measures that could increase the security of the routing protocol and improve the performance of the DSR routing protocol. If the number of establishing links is frequently broken, then the performance of the DSR routing protocol is not very good. A new modified DSR algorithm has been designed that would help in reducing the network overhead and increase the network quality. A comparison between the performances of both algorithms has also been studied, and the results show that improved DSR routing protocol has better efficiency in parameters like end-to-end network load delays and packet delivery ratio. Methods & Materials: The paper mainly focuses on securing the Dynamic Source routing algorithm by designing its modified version and simulating it. We have Proposed Modified DSR and discussed so far that the basic functionality of the DSR algorithm, its advantages and disadvantages. The main drawbacks include the end-to-end Delay, network overhead and packet delivery ratio. Following is a modified version of the dynamic source routing algorithm, which tries to overcome all the limitations of the basic algorithm at a certain level. In the Dynamic Source Routing algorithm, the Route Maintenance phase is used for the successful propagation of the packet within the network. The nodes that are involved in the transmission acknowledge the receiving of the packet to the preceding node. Results and Discussion: The present study aims at modifying the existing algorithm and designing a new modified algorithm that has less routing overhead, less Delay in packet transmission and high network quality. Modified DSR routing algorithm is examined on the parameters like E-2-E delay, Normalize Routing Overhead, PDR. When we compare the performance of the proposed method with the Existing protocol AODV, and DSR at a number of nodes equal to 50 then we get the Proposed DSR, which has the least end-to-end Delay among all the three protocols. Conclusion: In this paper, acomparison of Exiting DSR and Modified DSR in terms of end-to-end Delay, routing load and packet delivery ratio is made. After studying the readings, the conclusion drawn was that there is less network overhead and a high delivery ratio in modified DSR as compared to the existing DSR algorithm. The corrupted and destroyed packets are detected by the receiver, and in DSR, the mobility of mobile nodes is moderate. Under certain conditions, bidirectional and unidirectional links can be accepted. DSR routing protocols are highly dependent on the parameters such as area size, packet size, packet type, and others.