Dynamic Source Routing Research Articles

Enhancing Smart City Connectivity: A Multi-Metric CNN-LSTM Beamforming Based Approach to Optimize Dynamic Source Routing in 6G Networks for MANETs and VANETs

Enhancing Smart City Connectivity: A Multi-Metric CNN-LSTM Beamforming Based Approach to Optimize Dynamic Source Routing in 6G Networks for MANETs and VANETs

An Analysis of Routing Protocol in Mobile Adhoc Networks and its Applications

Each hub in a mobile ad-hoc network (MANET) sends parcels bound for different hubs in the network by means of remote (radio transmission) transmission on a wilful premise, making it a self-beginning, powerful network made up of mobile hubs. Multi-bounce transferring is the essential inspiration for the advancement of ad hoc networking. Remote Ad hoc networks, otherwise called foundation less networks, can be set up rapidly and effectively using radio waves as the network's transmission channel. There is no principal server or referee in an ad hoc network. Every hub in a MANET is fit for playing out its own networking errands, for example, routing and bundle sending, in a decentralized and independent style. Uses of routing protocols like Ad hoc On-request Distance Routing Protocol (AODV), Dynamic Source Routing (DSR), Transiently Requested Routing Calculation (TORA), and Enhanced Connection State Routing (OLSR) are fascinating in light of the fact that routing is the focal issue in MANETs. These routing protocols are simulated using OPNET, and their effectiveness is investigated using various metrics. With the use of metrics, the most efficient channel for data transfer can be determined. The results demonstrate the viability of AODV and TORA for topology-changing in large-scale networks using a variety of criteria.

Implementation of 802.11ax and cell-free massive MIMO scenario for 6G wireless network analysis extending OMNeT++ simulator

In an era where ubiquitous connectivity and escalating data demands are altering the landscape of wireless communications, our paper proposes a pioneering enhancement for the OMNeT++ simulator to support the advanced features of IEEE 802.11ax high efficiency (HE) alongside cell-free massive multiple-input multiple-output (MIMO) systems. Traditional wireless networks face daunting challenges in sustaining elevated quality of service (QoS), primarily due to fluctuating user densities and signal quality. Cell-free massive MIMO serves as a compelling answer to this predicament by decentralizing the cellular architecture. It eradicates conventional cell boundaries, furnishing uniform QoS regardless of user locations. However, these advancements come at the expense of complex backhaul networks and articulated joint signal processing. The 802.11ax standard, touted for its robustness and efficiency, remains underexplored in this new paradigm. Our research not only dissects the architectural elements and constraints of both 802.11ax and cell-free massive MIMO but also elaborates on the adaptations required to extend OMNeT++ functionalities for these technologies. By doing so, we bridge a crucial gap, enabling the simulator to provide a more precise, detailed, and scalable evaluation of emerging 6G scenarios and directional communications also taking into account the impact of the most known routing protocols such as dynamic source routing (DSR), ad hoc on-demand distance vector routing (AODV), optimized link state routing (OLSR), and dynamic mobile ad hoc network on-demand (DYMO) that were selected for this comparative study. The proposed extensions promise to revolutionize network simulations and lay the foundation for in-depth analyses of wireless systems in complex and dynamic environments. Through extensive simulations, our study demonstrates that cell-free massive MIMO configurations significantly improve network throughput in high-density mobile ad hoc network (MANET) environments, with results indicating an average throughput gain of up to 30% compared with non-cell-free configurations. This improvement highlights the efficacy of cell-free massive MIMO to take advantage of the spatial and frequency multiplexing capabilities inherent in the 802.11ax standard, making it a promising solution for future wireless systems in densely populated areas.

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.

Adaptive Location-based Routing Protocols for Dynamic Wireless Sensor Networks in Urban Cyber-physical Systems

This study investigates the development and enhancement of adaptive location-based routing protocols within dynamic wireless sensor networks (WSNs) in urban cyber-physical systems, recommending the implementation of the study’s innovative Urban Adaptive Location-based Routing Protocol (UALRP). This innovative protocol integrates real-time data analytics and adaptive machine learning models into its algorithmic framework to dynamically optimize routing decisions based on continuously changing urban conditions. Through the utilization of data-driven simulation models and machine learning techniques, the research sought to significantly improve the efficiency, reliability, and scalability of urban WSNs. Existing protocols such as Geographic Adaptive Fidelity (GAF), Greedy Perimeter Stateless Routing (GPSR), and Dynamic Source Routing (DSR) were critically assessed under urban settings using extensive datasets detailing New York City's traffic patterns and environmental variables. The analysis demonstrated that while GPSR showed superior performance in terms of latency, throughput, and energy efficiency among the traditional protocols, the introduction of UALRP, with its advanced predictive and adaptive capabilities, can further optimize these metrics. The study affirms the critical role of enhancing location accuracy and the ongoing advancement of machine learning models within urban routing protocols. These insights advocate for the broader implementation of adaptive strategies like UALRP to foster the development of more resilient and efficient urban cyber-physical systems.

Secure Routing and Hybrid SqueezenetFQuantumNN for Intrusion Detection in MANET

An efficient Intrusion Detection System (IDS) is essential to secure Mobile Ad-hoc Networks (MANETs) against malevolent attacks. The present IDS still faces challenges in enhancing detection accuracy and in decreasing the false alarm rate. To overcome the above issues, a secure routing protocol for intrusion detection in MANET has been proposed here. In the proposed model, initially, MANET is simulated, which is followed by routing based on Dynamic Source Routing (DSR) routing protocol. Then, intrusion detection is done at Base Station (BS). At the BS, the log files are acquired from the dataset at first and it is normalized using Quintile normalization to transform the data into a structured form. Then, the desired features are selected in the feature selection phase using Wave–Hedges metrics for removing redundant and irrelevant data. Finally, intrusion detection is performed using the proposed hybrid SqueezenetFQuantum Neural Network (SqueezenetFQuantumNN) which is devised by the fusion of Squeeze Net and Quantum Neural Network (QuantumNN). The effectiveness of the proposed SqueezenetFQuantumNN is measured depending on evaluation metrics and is found to attain accuracy of 95.72%, True Positive Rate (TPR) of 93.42%, and True Negative Rate (TNR) of 91.39%.

A COMPARATIVE ANALYSIS OF PROACTIVE ROUTING PROTOCOLS (DSDV, OLSR) & REACTIVE ROUTING PROTOCOLS (AODV, DSR) IN MANET USING NS-3

The abstract outlines a comprehensive analysis focusing on routing protocols in Mobile Ad Hoc Networks (MANETs). Ad-hoc networks are dynamic wireless networks without a central infrastructure. This analysis compares two types of routing protocols—proactive (table-driven) and reactive (on-demand)—using simulation analysis. The protocols DSDV, OLSR, AODV, and DSR are evaluated using NS-3, considering various performance metrics under different scenarios. The research aims to provide insights into protocol strengths and weaknesses, aiding network protocol selection and potential enhancements. This investigation contributes to understanding routing behaviours in ever-changing MANETs, benefiting network design and optimization efforts. Keywords: MANET (Mobile Ad Hoc Network), DSDV (Destination-Sequenced Distance Vector), OLSR (Optimized Link State Routing), AODV (Ad Hoc On-Demand Distance Vector), DSR (Dynamic Source Routing), Routing Information Protocol (RIP)

Cross-Layer Energy Efficient (CLEE) Routing Algorithm for Mobile Ad-Hoc Networks

Ad-hoc routing algorithms in Wireless Sensor Networks (WSN) rely on nodes’ position awareness by regularly updating routing data of neighbouring nodes. Meanwhile, the transmission energy usage is not optimised as a result of this repeated updates and routing table deployment. Therefore, it is very critical to consider techniques of optimising or conserving energy in the design of wireless sensor networks (WSNs) in order to prolong the lifetime of the individual nodes. One of these techniques is the Cross-layer design which, is considered as an efficient method for addressing this challenge with WSNs. In this paper, we propose a Cross-Layer Energy Efficient (CLEE) routing algorithm to establish an optimal route from the source node to the destination node by selecting candidate nodes from neighbouring nodes based on the distance between these nodes and the rate of energy consumption by a possible candidate node. Then to select a designated node from the candidate nodes, the algorithm further computes the Signal Strength Quality (SQS) and the Link Lifetime (LL) as well as the Throughput (TH) rate of selected nodes. The proposed algorithm was simulated with a network size of 600 X 600 on Network Simulator 3 (NS3) in order to analyse its performance. An evaluation of the performance of the proposed CLEE protocol with existing similar protocols such as Ad-hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) reveals that CLEE outperformes AODV and DSR by conserving about 44% of available energy.

Improving Broadcast System of Integrated Satellite-Terrestrial Network-based on Enhanced Ant colony Optimization

With the use of seamless high-speed worldwide network connectivity in future, it is anticipated that the integrated satellite-terrestrial network (ISTN) will be a possible option. Due to the inadequacy of topological data and the close coupling of data and control planes, deploying optimized rules on routers is difficult. The important factors in ISTN networks are routing rules and policies, link failure, and high-bandwidth communication. Software-defined networking (SDN) is an open innovation approach that enables programmability from a central location. The controller handles the complexity of the network, whereas the infrastructure layer devices relay the packets. Thus, we investigated the broadcast by dynamically adjusting routes for fault tolerance and energy efficiency of the ISTN using distance between nodes. In addition, using dynamic source routing, this study examines the competence functions of all managing nodes in a network. The routing design is distributed among all nodes to create numerous collective paths. For LEO satellite networks, the ant colony optimization-based routing algorithm is an improved version that considers the probability of faults and low-energy consumption. The proposed simulation ensures a seamless transition in the event of failures and avoids the requirement for an additional coordination service.

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.

WALS: A Lightweight Stateless Label Switching Framework Based on Prime Theorem for MANETs

This article proposes an innovative unicast/multicast unified, cross-layer, and control/user-plane splitting forwarding method, called Wireless Arithmetic Label Switching (WALS), for mobile ad-hoc networks (MANETs). The WALS is based on a stateless approach: an arithmetic source-routed label is processed by the source and intermediate nodes without table lookup, causing lower protocol overheads and forwarding latency than the conventional stateless unicast/multicast routing protocols such as the Dynamic Source Routing (DSR) and the Differential Destination Multicast (DDM) respectively. Different from conventional unicasting/multicasting designs demanding distinct routing protocol stacks, the WALS requires a unified protocol stack, avoiding the need to distinguish unicast and multicast frames, thus simplifying the design of MANET devices. Mathematical analysis indicates that the WALS is highly scalable for both the network sizes and the number of multicast groups. Simulation results reveal that WALS effectively performs network scalability and the required overhead for the unicast and multicast capabilities. Additionally, WALS achieves superior to the other three state-of-the-art competitive multicast routing methods including DVMRP, ODMRP, and MAODV on the performance of the packet processing latency and packet delivery ratio. As a result, the WALS can significantly enable the employment and management of integrated unicast and multicast services for MANETs.

End to end delay distribution analysis and interference aware high throughput for Wireless Mesh Networks

The wireless mesh network is an innovative and efficient wireless communication approach with immense potential to transform future wireless networks. This cutting-edge wireless technology provides a wide range of wireless services for personal, local, campus, and metropolitan environments. The wireless mesh network consists of a cluster of mobile wireless nodes that can dynamically and instantaneously create random and temporary network topologies, forming a wireless ad-hoc network. Ad hoc wireless networks are particularly advantageous due to their cost-effectiveness and ease of deployment. In order to further optimize the performance of ad-hoc networks, different routing algorithms such as Ad-hoc On-Demand Distance Vector Routing (AODV), Dynamic Source Routing Algorithm (DSR) and Destination Sequenced Distance Vector (DSDV) have been thoroughly researched via simulation.

Efficient Classification of ECG Images Using a Lightweight CNN with Attention Module and IoT.

Cardiac disorders are a leading cause of global casualties, emphasizing the need for the initial diagnosis and prevention of cardiovascular diseases (CVDs). Electrocardiogram (ECG) procedures are highly recommended as they provide crucial cardiology information. Telemedicine offers an opportunity to provide low-cost tools and widespread availability for CVD management. In this research, we proposed an IoT-based monitoring and detection system for cardiac patients, employing a two-stage approach. In the initial stage, we used a routing protocol that combines routing by energy and link quality (REL) with dynamic source routing (DSR) to efficiently collect data on an IoT healthcare platform. The second stage involves the classification of ECG images using hybrid-based deep features. Our classification system utilizes the "ECG Images dataset of Cardiac Patients", comprising 12-lead ECG images with four distinct categories: abnormal heartbeat, myocardial infarction (MI), previous history of MI, and normal ECG. For feature extraction, we employed a lightweight CNN, which automatically extracts relevant ECG features. These features were further optimized through an attention module, which is the method's main focus. The model achieved a remarkable accuracy of 98.39%. Our findings suggest that this system can effectively aid in the identification of cardiac disorders. The proposed approach combines IoT, deep learning, and efficient routing protocols, showcasing its potential for improving CVD diagnosis and management.

Hybrid Dynamic Source Routing Technique and Security Implementation in Adhoc Network Topology

Routing protocols that are developed with the error-prone environment and resource constraints of mobile nodes in mind perform better in wireless Ad Hoc environments. A good and dependable routing method is required to meet the packet transition aim. When the network is small, most existing routing algorithms operate fine, but when the network is large, there is a problem with link breakage in multipath routing algorithms, especially on demand routing algorithms. As a result, we investigated many forms of routing protocols in order to identify all of the existing algorithms' flaws. In this study, we examine existing protocols in terms of network factors such as delay, throughput, energy consumption, control overhead, and so on.

Enhancing Packet Reliability in Wireless Multimedia Sensor Networks using a Proposed Distributed Dynamic Cooperative Protocol (DDCP) Routing Algorithm

Wireless Multimedia Sensor Networks (WMSNs) are being extensively utilized in critical applications such as environmental monitoring, surveillance, and healthcare, where the reliable transmission of packets is indispensable for seamless network operation. To address this requirement, this work presents a pioneering Distributed Dynamic Cooperation Protocol (DDCP) routing algorithm. The DDCP algorithm aims to enhance packet reliability in WMSNs by prioritizing reliable packet delivery, improving packet delivery rates, minimizing end-to-end delay, and optimizing energy consumption. To evaluate its performance, the proposed algorithm is compared against traditional routing protocols like Ad hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR), as well as proactive routing protocols such as Optimized Link State Routing (OLSR). By dynamically adjusting the transmission range and selecting optimal paths through cooperative interactions with neighboring nodes, the DDCP algorithm offers effective solutions. Extensive simulations and experiments conducted on a wireless multimedia sensor node testbed demonstrate the superior performance of the DDCP routing algorithm compared to AODV, DSR, and OLSR, in terms of packet delivery rate, end-to-end delay, and energy efficiency. The comprehensive evaluation of the DDCP algorithm against multiple routing protocols provides valuable insights into its effectiveness and efficiency in improving packet reliability within WMSNs. Furthermore, the scalability and applicability of the proposed DDCP algorithm for large-scale wireless multimedia sensor networks are confirmed. In summary, the DDCP algorithm exhibits significant potential to enhance the performance of WMSNs, making it a suitable choice for a wide range of applications that demand robust and reliable data transmission.

Evaluation of energy consumption in mobile ad hoc network routing protocols

Rapidly evolving wireless network technology continues to be one of the focal points in academic research. Mobile Ad hoc Networks (MANETs) consist of mobile nodes and the efficient transmission of data among these nodes is crucial for the network's operation. In this study, four of the most common routing protocols, namely AODV(Ad Hoc On-Demand Distance Vector), DSR(Dynamic Source Routing), OLSR(Optimized Link State Routing), and DSDV(Destination-Sequenced Distance Vector) were evaluated using different scenarios in the NS-2 simulation environment. As known, the lifetime of a wireless network is proportional to the battery limits of its nodes. Therefore, the choice of routing protocol for mobile ad hoc networks is critical for the network's lifetime. In this study, the energy consumption of the aforementioned routing protocols was analyzed under different conditions, and it was concluded that table-driven routing protocols, especially DSDV, demonstrated the best energy performance in various scenarios.

Panconnectivity algorithm for Eisenstein-Jacobi networks

The cycles in an interconnection network are one of the communication types that are considered as a factor to measure the efficiency and reliability of the networks’ topology. The network is said to be panconnected if there are cycles of length l between two nodes u and v, for all l ​= ​d(u, v), d(u, v) ​+ ​1, d(u, v) ​+ ​2, …, n ​− ​1 where d(u, v) is the shortest distance between u and v in a given network, and n is the total number of nodes in the network. In this paper, we propose an algorithm that proves the existence of panconnectivity of Eisenstein-Jacobi networks by constructing all cycles between any two nodes in the network of length l such that 3 ≤ l ​< ​n. The correctness of the proposed algorithm is given with the time complexity O(n4). The proposed algorithm adopts and modifies the idea of Dynamic Source Routing (DSR) to find all possible shortest paths. The results of some test cases using the proposed algorithm are provided.

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

A Novel Method of Enhancing Security Solutions and Energy Efficiency of IoT Protocols

Mobile Ad-hoc Networks (MANET’s) are wireless networks that are capable of operating without any fixed infrastructure. MANET routing protocols must adhere to strict secrecy, integrity, availability and non-repudiation criteria. In MANETs, attacks are roughly categorised into two types: active and passive. An active attack attempts to modify or remove data being transferred across a network. On the other hand, passive attack does not modify or erase the data being sent over the network. The majority of routing protocols for MANETs were built with little regard for security and are therefore susceptible to a variety of assaults. Routing technologies such as AODV and dynamic source routing are quite common. Both however are susceptible to a variety of network layer attacks, including black holes, wormholes, rushing, byzantine, information disclosure. The mobility of the nodes and the open architecture in which the nodes are free to join or leave the network keep changing the topology of the network. The routing in such scenarios becomes a challenging task since it has to take into account the constraints of resources of mobile devices. In this an analysis of these protocols indicates that, though proactive routing protocols maintain a route to every destination and have low latency, they suffer from high routing overheads and inability to keep up with the dynamic topology in a large sized network. The reactive routing protocols in contrast have low routing overheads, better throughput and higher packet delivery ratio. AODVACO-PSO-DHKE Methodology boosts throughput by 10% while reducing routing overhead by 7%, latency by 8% and energy consumption by 5%. To avoid nodes always being on, a duty cycle procedure that's also paired with the hybrid method is used ACO-FDR PSO is applied to a 100-node network and NS-3 is used to measure various metrics such as throughput, latency, overhead, energy consumption and packet delivery ratio.

A Novel Method of Enhancing Security Solutions and Energy Efficiency of IoT Protocols

Mobile Ad-hoc Networks (MANET’s) are wireless networks that are capable of operating without any fixed infrastructure. MANET routing protocols must adhere to strict secrecy, integrity, availability and non-repudiation criteria. In MANETs, attacks are roughly categorised into two types: active and passive. An active attack attempts to modify or remove data being transferred across a network. On the other hand, passive attack does not modify or erase the data being sent over the network. The majority of routing protocols for MANETs were built with little regard for security and are therefore susceptible to a variety of assaults. Routing technologies such as AODV and dynamic source routing are quite common. Both however are susceptible to a variety of network layer attacks, including black holes, wormholes, rushing, byzantine, information disclosure. The mobility of the nodes and the open architecture in which the nodes are free to join or leave the network keep changing the topology of the network. The routing in such scenarios becomes a challenging task since it has to take into account the constraints of resources of mobile devices. In this an analysis of these protocols indicates that, though proactive routing protocols maintain a route to every destination and have low latency, they suffer from high routing overheads and inability to keep up with the dynamic topology in a large sized network. The reactive routing protocols in contrast have low routing overheads, better throughput and higher packet delivery ratio. AODVACO-PSO-DHKE Methodology boosts throughput by 10% while reducing routing overhead by 7%, latency by 8% and energy consumption by 5%. To avoid nodes always being on, a duty cycle procedure that's also paired with the hybrid method is used ACO-FDR PSO is applied to a 100-node network and NS-3 is used to measure various metrics such as throughput, latency, overhead, energy consumption and packet delivery ratio.