Source Routing Research Articles

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.

Nationwide Demand Modeling for an Urban Air Mobility Commuting Mission

In this paper, we present a comprehensive and reproducible urban air mobility (UAM) demand model centered around publicly available data and open source tools capable of demand estimation at the national level. A discrete mode-choice demand model is developed using longitudinal origin–destination employment statistics flow data, American community survey economic data, and the Open Source Routing Machine (OSRM) to identify the utility of a UAM commuter service relative to other modes of transportation. Using the implemented model, we identify New York City, San Francisco, and Los Angeles as cities with the highest potential commuter demand, and Seattle as the city most resilient to increases in delay time. A sensitivity study of demand is performed and shows that strong demand exists for short trips with low total delay times and for longer trips with a low ticket price per kilometer, with the former showing resilience to increases in operational costs and the latter showing resilience to increases in delays. The demand model is supported by a speed-flow model, which fuses highway performance monitoring system data with OpenStreetMap data to provide traffic-adjusted road segment speeds to OSRM. The speed-flow model has the capability of providing congestion data for road segments across the United States without the use of commercial data sets or routing services and is shown to improve routing duration accuracy in congested regions.

A COMPARATIVE STUDY OF METHODS FOR DRIVE TIME ESTIMATION ON GEOSPATIAL BIG DATA: A CASE STUDY IN USA

Abstract. Travel time estimation is crucial for several geospatial research studies, particularly healthcare accessibility studies. This paper presents a comparative study of six methods for drive time estimation on geospatial big data in the USA. The comparison is done with respect to the cost, accuracy, and scalability of these methods. The six methods examined are Google Maps API, Bing Maps API, Esri Routing Web Service, ArcGIS Pro Desktop, OpenStreetMap NetworkX (OSMnx), and Open Source Routing Machine (OSRM). Our case study involves calculating driving times of 10,000 origin-destination (OD) pairs between ZIP code population centroids and pediatric hospitals in the USA. We found that OSRM provides a low-cost, accurate, and efficient solution for calculating travel time on geospatial big data. Our study provides valuable insight into selecting the most appropriate drive time estimation method and is a benchmark for comparing the six different methods. Our open-source scripts are published on GitHub (https://github.com/wybert/Comparative-Study-of-Methods-for-Drive-Time-Estimation) to facilitate further usage and research by the wider academic community.

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.

An investigation on applicability of Ad-hoc routing protocols in Fog-assisted smart health care system

Cloud computing is widely adopted as it provides real-time services to users on a respectable scale in alignment with pay-per-use models. The heterogeneity and lively characteristics of the cloud network's components make failure inevitable. The failure also has an impact on the cloud service's dependability and accessibility. A computer paradigm called fog brings cloud computing services closer to edge hardware. Fog computing is being used more and more in applications that require faster real-time services, and the healthcare industry has embraced it heavily due to the urgent need to save lives. This work is aimed to investigate the suitable ad-hoc routing protocol for fog-assisted smart health monitoring system. By simulating with the network simulator NS-2 and using throughput, latency, and packet delivery ratio (PDR) as assessment criteria, the effectiveness of routing protocols is assessed. The protocols Ad-hoc on-demand Distance Vector (AODV), Destination Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR), and Optimized Link State Routing (OLSR) are being tested. The AODV exhibits encouraging results with other comparative protocols.

A Century Ammonium Record Retrieved From the Central Tibetan Plateau

AbstractThe limited observations pose challenges to understanding long‐term variations of atmospheric ammonium () deposition. Glaciers on the margins of the Tibetan Plateau (TP) adjacent to heavily populated regions can capture and preserve unique records of natural and anthropogenic ammonium aerosol. However, relatively little has been known about spatiotemporal variations and anthropogenic influences on ammonium deposition on the central TP. Here, we present a high‐resolution ammonium record spanning the period 1900–2011, reconstructed from the Qiangtang (QT) ice core on the central TP. Empirical orthogonal function and interspecies correlation analysis reveal that has a source and/or transport route that differs from the dust species, especially after the 1950s. The QT ammonium record is also likely influenced by temperature‐dependent biogenic emissions from northwestern South Asia. Comparison with other ice core records shows that intensified anthropogenic emissions have caused a widespread increase in ammonium records in the inner TP after the 1950s. Furthermore, the significant positive relationship with the December–April Arctic Oscillation (AO) suggests that enhanced westerlies during the positive AO phase transport aerosol more efficiently to the QT. As a result, the decrease in ammonium concentrations after 1990, when anthropogenic emissions were still increasing, could be attributed to the weakening of westerlies associated with the transitioning of the AO phase from positive to negative. Our results may enhance the understanding of the influence of the westerlies on the transport of atmospheric pollutants to the central TP.

Impact of Jellyfish attack on routing protocols in TCP-based MANETs

Mobile ad-hoc networks (MANETs) are self-organized infrastructure-less network of mobile wireless devices that could be deployed for communication. Due to the insecure wireless communication medium, multi-hop routing communication process, and dynamic behavior of the nodes in MANETs, routing protocols are vulnerable to various security attacks, such as Jellyfish attacks. A Jellyfish node targets TCP-based MANET and exploits its working mechanism to degrade the communication performance. This attack is hard to detect since it is a TCP protocol compliant methodology.In this paper, we evaluate the performance of the Ad hoc on-demand vector (AODV), Dynamic source routing (DSR), Temporally ordered routing algorithm (TORA), Geographic routing protocol (GRP), and optimized link state routing (OLSR) routing protocols under the Jellyfish delay variance attacks for TCP-based MANETs. Further, the TAHOE, RENO, and SACK variants of TCP protocol are considered for comparison. These routing protocols are simulated using the OPNET simulator to compare their performance, using specific performance metrics on the network. The experimental results show that the AODV protocol performs better than the DSR, TORA, OLSR, and GRP protocols under the jellyfish delay variance attack. Further, the SACK TCP variant performs better than the other TCP variants under the Jellyfish delay variance attack.

Detection and Counter Measure of Packet Misrouting by GPS-Free Positioning of Ad-Hoc Nodes

The ad-hoc networks are a developing area of research with a large and wide variety of applications and related requirements. The nodes participating in an ad-hoc network use different routing protocols to send their packets from one node to another. But most of the time, the ad-hoc network is not suitable for urgent needs. For this, an ad-hoc network GPS-free positioning system can be used in emergency situations to save people in danger. Nodes participating in an ad-hoc network choose the best route from various nodes near them to send information through the complex system. For this, we have used trust dynamic source routing (TDSR) in our research work to determine and design the best route to transmit information, and we designed this system with the aim of being able to be used in emergencies. We have compared our proposed routing protocols with dynamic source routing (DSR) and found out that TDSR is working excellent.

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%.

Highly Efficient Electroenzymatic Cascade Reduction Reaction For The Conversion of Nitrite to Ammonia

AbstractThe electrochemical nitrite reduction reaction provides an alternative approach to offer sustainable ammonia source routes for repairing imbalances in the global nitrogen cycle. In this work, electrocatalysis is combined with enzymatic catalysis to provide an efficient and clean process for recoverable ammonia production. NO2− is reduced to NH3 by electroenzymatic cascade reduction reaction on a bioconjugate, in which 1‐butyl‐3‐methylimidazolium bromide (ILBMB) modified chloroperoxidase (CPO) is fixed on polyethyleneimine (PEI) modified multi‐walled carbon nanotubes (MWCNT) to from bioconjugate (CPO‐ILBMB/MWCNT‐PEI). 15N and 14N isotope labeling reveal that the NH3 species is derived from NO2− reduction. Density functional theory calculations identify that the FeII species in heme center of CPO serve as the key active site for NO2− reduction. The amino groups derived from MWCNT‐PEI not only serve as a bridge to covalently immobilize CPO but also enrich the NO2− ion at electrode/solution interface through electrostatic interactions. The low energy barrier of NO2− reduction and low adsorption free energy of the intermediate result in high Faradaic efficiency (96.4%), NH3 yield (112.7 mg h−1 mgCPO−1), and high selectivity in pH 5.0 solution. The highly efficient electroenzymatic reaction ensurespromising applications in the conversion of NO2− to NH3.

An improved non-local awareness of congestion and load balanced algorithm for the communication of on chip 2D mesh-based network

Due to advancements in multi-core design technology, IC (Integrated Circuits) designers have expanded the single chip multi-core design. A privileged way of communication effectively between these multi-cores is a Network on-chip (NoC). Design of an effective routing algorithm capable of routing data to non-congested paths is the most notable research challenge in NoC, by retrieving congestion information of non-local nodes. This research proposed an improved congestion-aware load balancing routing algorithm. Non-local or distant links congestion awareness is done by propagating congestion information via data packets. By counting number of hops from the source node, in the quadrant of the destination node, an intermediate node has been defined, and after the calculation of the least congested route to the intermediate node, this route is also stored in the data packet for source routing. Furthermore, for load balancing network is partitioned into two areas called high congested area (HCA) and low congested area (LCA). For load balancing, from HCA a node in LCA is selected as output for data packets. Comparison of the proposed algorithm is done in the form of average latency, average throughput, power consumption, and scalability analysis under synthetic traffic patterns. Under simulation experiments, it is shown improvement in an average latency and throughput of the proposed algorithm is 31.28% and 5.28% respectively, than existing.

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

&lt;span lang="EN-US"&gt;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.&lt;/span&gt;

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.

AI-assisted Emergency Healthcare using Vehicular Network and Support Vector Machine.

The COVID-19 pandemic has created an emergency across the globe. The number of corona positive and death cases is still rising worldwide. All countries' governments are taking various steps to control the infection of COVID-19. One step to control the coronavirus's spreading is to quarantine. But the number of active cases at the quarantine center is increasing daily. Also, the doctors, nurses, and paramedical staff providing service to the people at the quarantine center are getting infected. This demands the automatic and regular monitoring of people at the quarantine center. This paper proposed a novel and automated method for monitoring people at the quarantine center in two phases. These are the health data transmission phase and health data analysis phase. The health data transmission phase proposed a geographic-based routing that involves components like Network-in-box, Roadside-unit, and vehicles. An effective route is determined using route value to transmit data from the quarantine center to the observation center. The route value depends on the factors such as density, shortest path, delay, vehicular data carrying delay, and attenuation. The performance metrics considered for this phase are E2E delay, number of network gaps, and packet delivery ratio, and the proposed work performs better than the existing routing like geographic source routing, anchor-based street traffic aware routing, Peripheral node based GEographic DIstance Routing . The analysis of health data is done at the observation center. In the health data analysis phase, the health data is classified into multi-class using a support vector machine. There are four categories of health data: normal, low-risk, medium-risk, and high-risk. The parameters used to measure the performance of this phase are precision, recall, accuracy, and F-1 score. The overall testing accuracy is found to be 96.8%, demonstrating strong potential for our technique to be adopted in practice.

Performance Analysis by Improving Energy Efficiency in IoT Based Wireless Sensor Network for Routing Algorithm

Objectives: To improve the energy efficiency in IoT-based wireless sensor networks. To increase the sensor node lifetime in any wireless sensor network (WSN) based on the Energy-efficient cluster and routing in WSN. The advancement in the electronic industry has to develop the low powerconsuming and low-cost devices for multiple purposes. Methods: A new algorithm is proposed to improve the energy efficiency in IoT-based WSN for routing algorithms. The low power consuming devices are wisely chosen for the respected application and their power management. This study is intended to provide efficient routing algorithms with less energy consumption in wireless sensor networks. Findings: A wireless sensor network deployed with a number of non-static nodes in a communication network are beneficial for numerous fields such as the military, medical sector, structural health monitoring, transportation industries, etc. In this paper, the performance parameters like average throughput, average end-to-end delay, packet delivery ratio, average node energy, and normalized routing load are analyzed. Novelty: We designed and simulated the Distributed IoT-based wireless network system to analyze the information of nodes roaming in the vicinity of the zone area. In proposed technique energy efficiency is increased compared to the conventional algorithm. In node centric routing protocol, energy efficiency is increased from 55% to 68%. In data centric routing protocol, energy efficiency is increased from 65% to 75%. In source-initiated routing protocol, energy efficiency is increased from 68% to 80%. In destination-initiated routing protocol, energy efficiency is increased from 72% to 85%. Keywords: Ad Hoc OnDemand stance Vector (AODV); DestinationSequenced DistanceVector Routing (DSDV); Dynamic source routing (DSR); MQ Telemetry Transport (MQTT); Quality of Services (QoS); Wireless Sensor Network (WSN)

Maternal executive functioning is associated with infant sustained attention, but not executive functioning, in a sex-specific manner

Parental executive functioning (EF) is considered one key contributing source, via direct and indirect routes, of inter-individual variation in offspring EF. The current study investigated the unexplored associations between maternal EF and infant EF as well as its precursor, sustained attention. Ninety-seven mother-infant-dyads from the FinnBrain Birth Cohort Study participated. Maternal EF was assessed using selected measures from the Cogstate test battery. At 8 months, infants completed Lab-TAB Blocks and modified A-not-B tasks. A modest but robust link between maternal EF and infant attention was revealed in girls. There was no association between mother and infant EF in either sex at 8 months. Notable directions for future research, and potential underlying mechanisms of sex differences are discussed.

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.