Showing papers on "Optimized Link State Routing Protocol published in 2020"

A hybrid secure routing and monitoring mechanism in IoT-based wireless sensor networks

Abstract: Internet of Things (IoT) has advanced its pervasiveness across the globe for the development of smart networks. It is aimed to deploy network edge that enables smart services and computation for the IoT devices. In addition, this deployment would not only improve the user experience but also provide service resiliency in case of any catastrophes. In IoT applications, the edge computing exploits distributed architecture and closeness of end-users to provide faster response and better quality of service. However, the security concern is majorly addressed to resist the vulnerability of attacks (VoA). Existing methodologies deal only with static wireless sensor web to deduce the intrusions in which the sensor nodes are deployed in a uniform manner to retain the constancy. Since the sensor nodes are constantly being in question through different transmission regions with several levels of velocities, selection of sensor monitoring nodes or guard nodes has become a challenging job in recent research. In addition, the adversaries are also moving from one location to another to explore its specific chores around the network. Thus, to provide flexible security, we propose a secure routing and monitoring protocol with multi-variant tuples using Two-Fish (TF) symmetric key approach to discover and prevent the adversaries in the global sensor network. The proposed approach is designed on the basis of the Authentication and Encryption Model (ATE). Using Eligibility Weight Function (EWF), the sensor guard nodes are selected and it is hidden with the help of complex symmetric key approach. A secure hybrid routing protocol is chosen to be built by inheriting the properties of both Multipath Optimized Link State Routing (OLSR) and Ad hoc On-Demand Multipath Distance Vector (AOMDV) protocols. The result of the proposed approach is shown that it has a high percentage of monitoring nodes in comparison with the existing routing schemes. Moreover, the proposed routing mechanism is resilient to multiple mobile adversaries; and hence it ensures multipath delivery.

A data authentication scheme for UAV ad hoc network communication

Abstract: In this paper, we propose an efficient and energy-saving distributed network architecture based on clustering stratification to solve the information security problem of unmanned aerial vehicle ad hoc network communication. And a double-authentication watermarking strategy is designed. In order to ensure that the data collected by nodes can be sent securely to the cluster head node, we use the self-characteristic of the collected data to generate the authentication watermark and insert it into the collected data at random. The cluster head node first verifies the integrity of collected data and deletes the suspicious data. Then, the authentication information is generated by combining the chaotic mapping method, and the watermark is hidden by changing the parity of the least significant bits of the data. Experimental results show that the proposed security strategy can resist most attacks, such as selective forwarding, data replay and tampering. Meanwhile, it has low energy consumption and low latency.

An Adaptive Relay Selection Scheme for Enhancing Network Stability in VANETs

Abstract: Vehicular ad hoc networks (VANETs) are a special type of wireless ad hoc network that requires highly scalable routing strategies to establishing reliable end-to-end communication. Because of the high dynamic of VANETs, the mobility of vehicle nodes increases the control traffic overhead. Accordingly, establishing reliable end-to-end communication paths depends entirely on the routing mechanism and the type of nodes mobility information. In this paper, we propose a new improvement to the mechanism of the Optimized Link State Routing Protocol(OLSR) protocol, named Cluster-based Adept Cooperative Algorithm (CACA), where each vehicle estimate a reliable low-overhead path using the cluster-based QoS algorithm. The CACA algorithm is introduced to improve the ability of the MPR scheme for maintaining long-lived routes. Moreover, the network scalability is enhanced by adaptively selecting most sustainable paths based on a signal strength beacon and the mobility degree of a node, which reduces significantly minimizes the size of control messages overhead as well the routing tables recalculation process. Simulation experiments using the network simulator are presented to demonstrate the effectiveness of our solution. The results show that the proposed algorithm can improve network performance effectively relative to other algorithms.

Blockchain-Based Lightweight Trust Management in Mobile Ad-Hoc Networks.

Abstract: As a trending and interesting research topic, in recent years, researchers have been adopting the blockchain in the wireless ad-hoc environment. Owing to its strong characteristics, such as consensus, immutability, finality, and provenance, the blockchain is utilized not only as a secure data storage for critical data but also as a platform that facilitates the trustless exchange of data between independent parties. However, the main challenge of blockchain application in an ad-hoc network is which kind of nodes should be involved in the validation process and how to adopt the heavy computational complexity of block validation appropriately while maintaining the genuine characteristics of a blockchain. In this paper, we propose the blockchain-based trust management system with a lightweight consensus algorithm in a mobile ad-hoc network (MANET). The proposed scheme provides the distributed trust framework for routing nodes in MANETs that is tamper-proof via blockchain. The optimized link state routing protocol (OLSR) is exploited as a representative protocol to embed the blockchain concept in MANETs. As a securely distributed and trusted platform, blockchain solves most of the security issues in the OLSR, in which every node is performing the security operation individually and in a repetitive manner. Additionally, using predefined principles, the routing nodes in the proposed scheme can collaborate to defend themselves from the attackers in the network. The experimental results show that the proposed consensus algorithm is suitable to be used in the resource-hungry MANET with reduced validation time and less overhead. Meanwhile, the attack detection overhead and time also decrease because the repetitivity of the process is reduced while providing a scalable and distributed trust among the routing nodes.

Performance Analysis of Routing Protocols for UAV Communication Networks

Abstract: The design of routing protocol is an important and key problem in unmanned aerial vehicle (UAV) communication networks. In low altitude environment, UAV information transmission is a complex task. It is an important scientific challenge to design a routing protocol that can provide efficient and reliable node to node packet transmission. This paper develops a more realistic simulation environment based on OPNET 14.5, and performs performance tests and comparisons on four classic routing protocols: Ad Hoc on demand distance vector (AODV), dynamic source routing (DSR), optimized link state routing (OLSR), and geographic routing protocol (GRP). The performance parameters such as network delay, traffic received, data dropped and throughput are compared and analyzed. The experimental results indicate that different routing protocols can be adapted to different UAV communication network scenarios. Therefore, the quantitative results can provide pertinent reference for choosing the best routing protocol in different scenarios.

Multipoint Relaying Versus Chain-Branch-Leaf Clustering Performance in Optimized Link State Routing-Based Vehicular Ad Hoc Networks

Abstract: Routing protocols for vehicular ad hoc networks resort to clustering in order to optimize network performance. Concerning the optimized link state routing protocol and the plethora of its derivatives, the multipoint relaying (MPR) technique has proven its efficiency as an accurate clustering scheme over the last two decades. However, it has been emphasized recently that the MPR technique, which was originally designed for open areas, does not benefit from the particular configuration of road sections, which are intrinsically spatially constrained. A clustering scheme exploiting this particularity, namely chain-branch-leaf (CBL), has been introduced in order to enhance the flooding of broadcast traffic, including that related to routing operations. In this paper, both MPR and CBL are evaluated through MATLAB simulation over several scenarios based on realistic road configurations and traffic generated with SUMO simulator. The results show that CBL actually reduces the number of nodes acting as relays (cluster-heads) in the network, thus decreasing the routing traffic related to creation and retransmission of topology control messages. Also, they show that, with CBL, the nodes chosen as relays remain longer in this role, thus favoring the overall network stability, and that most of the nodes remain attached longer to the same relay than with the MPR technique.

MCTRP: An Energy Efficient Tree Routing Protocol for Vehicular Ad Hoc Network Using Genetic Whale Optimization Algorithm

Abstract: VANETs are wireless sensor networks that suffer from the drawback of highly mobile nodes. The main objective of any type of network is to achieve efficient transmission goals. The vehicles act as the transmitting nodes. Cognitive radio technology helps in sensing the spectrum in order to ensure the efficient usage of the reserved channels by all the nodes. Our proposed system incorporates a routing protocol with the cognitive radio technology for efficient channel assignment. The routing protocol applies a tree based structure for efficient routing within and between networks. The tree routing protocol is further altered by the inclusion of an efficient optimized scheme. The proposed technique involves a Genetic Whale Optimization Algorithm which helps in choosing a root channel for transmission. When the selected root channel becomes active, the other channels are disabled. The proposed tree routing protocol is called the modified cognitive tree routing protocol (MCTRP).Apart from routing this protocol also caters to the need of effective channel utilization by allocating the spectrum fairly. This scheme results in ranking the channels based on their transmission efficiency and also aims to reduce the inherent delay usually associated with VANETs. The protocol also handles link breakages efficiently. The proposed scenario is simulated in NS2 and is evaluated based on the major network metrics. Our protocol shows a sharp decline in the associated delay and guarantees effective channel utilization. The proposed MCTRP method is effective over other protocols, such as, CTRP and OLSR. The analytical results show that MCTRP promises minimum overheads with effective channel utilization than the existing protocols.

A traffic-aware Q-network enhanced routing protocol based on GPSR for unmanned aerial vehicle ad-hoc networks

Abstract: In dense traffic unmanned aerial vehicle (UAV) ad-hoc networks, traffic congestion can cause increased delay and packet loss, which limit the performance of the networks; therefore, a traffic balancing strategy is required to control the traffic. In this study, we propose TQNGPSR, a traffic-aware Q-network enhanced geographic routing protocol based on greedy perimeter stateless routing (GPSR), for UAV ad-hoc networks. The protocol enforces a traffic balancing strategy using the congestion information of neighbors, and evaluates the quality of a wireless link by the Q-network algorithm, which is a reinforcement learning algorithm. Based on the evaluation of each wireless link, the protocol makes routing decisions in multiple available choices to reduce delay and decrease packet loss. We simulate the performance of TQNGPSR and compare it with AODV, OLSR, GPSR, and QNGPSR. Simulation results show that TQNGPSR obtains higher packet delivery ratios and lower end-to-end delays than GPSR and QNGPSR. In high node density scenarios, it also outperforms AODV and OLSR in terms of the packet delivery ratio, end-to-end delay, and throughput.

Beamforming-Constrained Swarm UAS Networking Routing

Abstract: With the evolution of 5G cellular communication, beamforming is mature for the implementation on a large scale. The development of cellular networking provides a great opportunity for swarm UAS. Concurrently, the advantages of swarm UAS can provide immense improvement to the advance of industrial and residential implementations.However, the nature of the antenna array constrains beam-forming in a limited space which is rarely mentioned in networking routing researches. In this paper, regarding the constrained steering space, we proposed a novel algorithm,Optimized Ad-hoc On-demand Distance Vector (OAODV),which aims to improve the capacity of beamforming on swarm UAS networking. With the adjustable searching space, OAODV can achieve better latency, overhead, and link generation than the conventional algorithms of Ad-hoc On-demand Distance Vector (AODV) and Optimized Link State Routing (OLSR). Compared with AODV and OLSR, OAODV can reduce 35.07% and 68.93%of average overhead, and decrease 47.73% and 11.55%of average latency respectively. Further, we leverage Ant Colony Optimization(ACO) to enhance OAODV, and the ACO enabled OAODV can achieve better throughput and fewer hops with reduction of overhead. The proposed algorithms show the promising capacity to improve swarm UAS networking.

Performance Evaluation of Ad-Hoc Routing Protocols in (FANETs)

Abstract: The utilization of Unmanned Aerial Vehicles (UAVs) as aerial relays for the Internet of Drones (IoD) network has several advantages such as civilian and military applications A Flying Ad-Hoc Network (FANETs) is a group of Unmanned Aerial Vehicles (UAVs) which can complete their function without human intervention FANET is considered as a subset of MANET, however, due to high mobility and rapid topology changes in FANET applying routing protocols in FANET is a big challenge In this paper, we have extensively evaluated existing Ad-Hoc routing protocols such as OLSR, AODV, DSR, TORA & GRP for FANET environment The performance of those protocols was evaluated using an OPNET 175 network simulator We have compared the protocols using packet dropped ratio, end to end delay, number of hops and throughput in different moving speeds and mobility models such as Random Waypoint Mobility (RWPM), Manhattan Grid Mobility Model (MGM), Semi-Random Circular Movement (SCRM) and Pursue Mobility Model (PRS) For all evaluation scenarios, the results indicate that OLSR and GRP perform better than AODV, DSR, and TORA on average This paper shows that the variation of the network topology caused by the relative speed of nodes is the main reason for the fluctuation of network performance Also, we found that the (MGM) greatly affects the packet dropped ratio for all protocols As we increase mobility speed, we found that End-to-End delay decreases in MGM, PRS, and RWPM, while it is high in SCRM

Performance Optimization of MANET Networks through Routing Protocol Analysis

Abstract: A Mobile Ad Hoc Network (MANET) protocol requires proper settings to perform data transmission optimally. To overcome this problem, it is necessary to select the correct routing protocol and use the routing protocol’s default parameter values. This study examined the effect of route request parameters, such as RREQ_RETRIES and MAX_RREQ_TIMOUT, on the Ad Hoc On-demand Distance Vector (AODV) protocol, which was then compared with the default AODV performance Optimized Link State Routing (OLSR) protocols. The performance metrics used for measuring performance were Packet Delivery Ratio (PDR), throughput, delay, packet loss, energy consumption, and routing overhead. The results show that the OLSR protocol has a smaller delay than the AODV protocol, while in other measurements, the AODV protocol is better than OLSR. By reducing the combination value of RREQ_RETRIES, MAX_RREQ_TIMEOUT in AODV routing to (2, 10 s) and (3, 5 s), the protocol’s performance can be improved. The two combinations result in an average increase in throughput performance of 3.09%, a decrease in delay of 17.7%, a decrease in packet loss of 27.15%, and an increase in PDR of 4.8%. For variations in the speed of movement of nodes, 20 m/s has the best performance, while 5 m/s has the worst performance.

SDNMesh: An SDN Based Routing Architecture for Wireless Mesh Networks

Abstract: Software Defined Networking (SDN) has been seen as a revolutionary and exciting network technology that aims to enable control and network management of various network types, whether wired or wireless. Nevertheless, SDN research focuses very little on wireless communication and, more specifically, on Wireless Mesh Networks (WMNs). Moreover, the issue of routing is vitally important in WMNs, but the legacy and traditional routing protocols cannot make the most of multiple paths between the source node and destination node due to the complexity and cost of the network. In this paper, we present SDNMesh, an SDN based routing architecture for WMNs. We combine SDN with WMN to allow mesh networks to meet current user requirements with several resources, coverage, and scalable high bandwidth capability. Apart from the mentioned capability, SDN’s unified approach leads to better network capacity management. Experiments have been carried out using the Mininet-WiFi simulation tool to create a network environment that allows integration of the two networking paradigms, centralized, and decentralized. Simulation results show that our SDNMesh routing solution performs better in terms of network performance metric throughput, packet loss ratio, and delay while comparing with traditional routing approaches such as OLSR, BATMAN, and an SDN based Three-Stage routing protocols. Moreover, experimental results show that SDNMesh gives better results in terms of the mentioned performance metrics.

Enhanced OLSR routing for airborne networks with multi-beam directional antennas

Abstract: This research targets the robust routing protocols in airborne networks (ANs). Particularly, we target the AN which is equipped with the latest antenna technology, called Multi-Beam Directional Antenna (MBDA) [1]. MBDA allows the simultaneously packet delivery in multiple directions without RF interference between directions/beams. We have found that MBDAs can actually bring new opportunities to enhance a popularly used AN routing scheme, i.e., optimized link state routing protocol (OLSR). In particular, MBDAs enable OLSR to better achieve low probability of detection (LPD), a critical requirement in many military applications with adversary nodes nearby which try to eavesdrop the signals. Therefore, we propose a multi-path enhanced OLSR, which is able to exploit the advantages of multi-beam transmissions and select the proper multi-point relays (MPRs) to easily reach all nodes by using only a small number of message broadcasts. An innovative method based on social network concept is used for the selection of MPRs in multi-beam OLSR. Finally, we have conducted the simulations and showed that the enhanced OLSR is suitable for mobile and dense airborne networks with LPD requirements.

Performance Analysis of Routing Protocols AODV, OLSR and DSDV on MANET using NS3

Abstract: Wireless Sensor Networks (WSN) have been widely used to process the monitoring of earth physical phenomena remotely. The result of data sensing in a certain area is transmitting to the server by routing these data via the adjacent nodes between sensor nodes and the server. The changing of physical phenomena will be monitored periodically in a server based on the receiving data from sensor nodes. Mobile Ad Hoc Network (MANET) is a flexible network topology that could be installed in disaster areas with a lack of infrastructure. This topology strongly supports the WSN system in sensor data transmitting. In this paper, we analyze the performance of 3 common MANET routing protocols, i.e. Ad Hoc On-demand Distance Vector (AODV), Dynamic Source Distance Vector (DSDV), and Optimized Link State Routing (OLSR). The three protocols have been examined by simulation using Network Simulator 3 (NS3) with 4 examination parameters, namely Packet Delivery Ratio (PDR), received data throughput, the percentage of packet loss, and transmitting delay. The result of the simulation shows that OLSR has better performance in the aforementioned parameter with the values 97,198%, 19,6399 Kbps, 2,802%, and 0,842 msec respectively based on the number of nodes provides.

Unmanned Aerial Vehicles Routing Formation Using Fisheye State Routing for Flying Ad-hoc Networks

Abstract: Flying Ad-hoc Networks creates rapid topology changes that causes routing problems between Unmanned Aerial Vehicle and ground base station. Mobile Ad-hoc networks and Vehicular Ad-hoc network protocols are conventionally adopted to overcome routing issues. But Still, they do not fully address the routing problem in Flying Ad-hoc Networks. In this paper, Fisheye state routing protocol is implemented and evaluated to fully overcome routing issues in a Flying Ad-hoc Network and fully utilize the limited resource of Unmanned Aerial Vehicles. Performance evaluation is measured in terms of throughput, average end-to-end delay, packet drop analysis as congestion measure with Ad-Hoc On-Demand Distance Vector (AODV), Distance Sequence Distance Vector (DSDV), Optimized Link State Routing (OLSR), Temporary Ordered Routing Protocol (TORA) and Dynamic Source Routing (DSR). Fisheye state routing protocol showed promising results regarding throughput, packet drop rate, and average end-to-end delay compared with traditional protocols. Moreover, with the suggested improvement of the parameters, network lifetime is increased, and resources harvesting becomes under control.

Trust Routing Protocol Based on Cloud-Based Fuzzy Petri Net and Trust Entropy for Mobile Ad hoc Network

Abstract: The trust-based routing mechanisms are proposed to enhance the security of the mobile ad hoc network (MANET), which use the performance metrics of a node to evaluate the trust value of the node. However, some performance metrics are fuzzy, which are easier to be described qualitatively than to be expressed quantitatively. Therefore, the inability to quantitatively express these performance metrics leads to the inaccuracy in the calculation of the trust values of nodes. Meanwhile, some routing mechanisms add the path with the highest credibility to routing table without considering the hop counts of the route in route selection, which reduces quality of service (QoS) of the routing. Aiming at the above problems, firstly, we use cloud model to deal with the fuzziness of performance metrics. Specifically, a trust reasoning model based on cloud model and fuzzy Petri net (FPN) is presented to evaluate the credibility of nodes. Then we propose a routing algorithm based on trust entropy. Routes with the minimum trust entropy are selected to add to routing table. This routing algorithm can reflect the comprehensive effect of route hops and the trust values of nodes on routing selection, thus improving QoS in MANET. Finally, the TUE-OLSR protocol is established based on the trust entropy routing algorithm and the optimized link state routing (OLSR) protocol. What’s more, the effectiveness of TUE-OLSR protocol is verified by simulation experiments, which illustrate that TUE-OLSR protocol performs better than existing trust-based OLSR protocols in terms of packet delivery ratio and average latency.

On Modeling Optimizations and Enhancing Routing Protocols for Wireless Multihop Networks

Abstract: The contribution of this paper is two fold. It first analyses the flooding strategies for the Wireless Multihop Networks (WMNs) then it enhances the reactive and proactive routing protocols. For analysis purpose, we select four widely used flooding techniques for routing: i. traditional flooding, ii. Time-To-Live based Expanding Ring Search (TTL-based ERS) flooding scheme, iii. TTL-based Scope Routing (SR) flooding and iv. Multi-Point Relays (MPR) flooding. These techniques play a vital role and act as a backbone for routing protocols. Therefore, we compare efficiency of these techniques for six widely used routing protocols: Ad-hoc On-demand Distance Vector (AODV), Destination Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR), DYnamic MANET On-demand (DYMO), Fish-eye Scope Routing (FSR) and Optimized Link State Routing (OLSR). DSDV uses traditional flooding, AODV, DSR and DYMO use TTL-based ERS flooding, FSR uses TTL-based SR flooding and OLSR uses MPR flooding. This paper also presents mathematical models for flooding techniques and studies the affects of these techniques on their respective protocols in terms of energy and time consumption. This is done to measure the cost incurred by the routing protocols in the form of routing overhead and latencies. A novel contribution of this work is the enhancement in search set values and intervals of routing algorithms to improve the efficiency of selected existing protocols. A detailed comparison analysis of selected protocols with their default and enhanced routing algorithms in NS-2 is also a part of this work.

Extended OLSR and AODV based on multi-criteria decision making method

Abstract: Recently, multi-metric routing protocols have been proposed to enhance the performance of the typical single metric routing protocols in mobile ad-hoc networks. Generally, most of them employ simple value computation to derive a cost value as a way by combining multiple metrics. However, this simple approach fails to define the relationship or priorities between multiple metrics. To overcome this limitation, in this study, we apply the multi-criteria decision making (MCDM) method to determine the weight factors between the metrics. We define criteria to accommodate multiple metric in logical way and decide a better path. For the case studies, we extend the existing proactive and reactive routing protocols, that is, ad-hoc on-demand distance vector (AODV) and optimized link state routing protocol (OLSR). In AODV, we present a strategy for modifying the route request and route reply mechanism to generate a stable path using the MCDM. On the other hand, in OLSR, we propose a modification strategy of MPR selection algorithm to maintain a stable topology using the MCDM. The simulation results show that proposed routing scheme reduces the routing overhead by 15% and 13%, packet loss rate by 12% and 14%, and end-to-end delay by 21% and 19% approximately, compared with other routing schemes such as fixed weighted AODV, OLSR and MCDM based geographical routing protocol.

Improving aerial image transmission quality using trajectory-aided OLSR in flying ad hoc networks

Abstract: UAVs have been widely used in various applications. Auto coordination of multiple UAVs through AI or mission planning software can provide significant improvements in many applications, including battlefield reconnaissance, topographical mapping, and search and rescue missions. Under such circumstances, the trajectory information is known for a set amount of time, and the system’s performance relies on the network between UAVs and their base. Here, a new protocol is proposed that takes the trajectory of UAVs as a known factor and uses it to improve optimized link state routing (OLSR). In this protocol, Q-learning is adopted to find the best route for the system. Additionally, a packet forwarding arrangement is described that addresses the common problem of deteriorating image quality often faced by UAVs. The simulation results show significant improvements over OLSR and GPSR under a sparsely distributed scenario, with the packet delivery ratio improved by over 30% and over 40 s reduction in the end-to-end delay.

A new position based routing algorithm for vehicular ad hoc networks

Abstract: The main requirement to make safer journey in VANET environment is minimum delay with high packet delivery rate. This ensures that all data packets are received with minimal delay to prevent any accident. This paper presents a new algorithm for VANET class routing protocol that covers sparse and coarse region of vehicles. It takes the advantage of road layout to improve the performance of routing in VANETs. The proposed algorithm uses real-time GPS tracking system to obtain traffic information for creating road based paths from source node to destination node. The optimize forwarding is used to figure out the forwarding node along the road pattern that form the path to deliver the data packets. The results shows that proposed algorithm obtain better results considering the various simulation parameters.

Improving the selection of MPRs in OLSR protocol: a survey of methods and techniques

Abstract: Multi Point Relays (MPRs) are those nodes that are calculated and determined by the Optimized Link State Routing protocol (OLSR) in order to minimize and avoid overload inside the Mobile Ad hoc Network (MANET). In this paper, we will present a synthetic study of many techniques and methods for calculating and selecting the MPR nodes using a set of criteria namely energy, mobility, bandwidth, the quality of links, etc. The result of this study shows that most techniques consider a limited number of metrics for selecting the MPR nodes and therefore they are insufficient to allow the OLSR protocol to be quite complete and efficient because several metrics can occur at the same time in the real execution environment.

Towards Developing Enhanced Cluster-Based QoS-Aware Routing in MANET

Abstract: Creating dynamic communication infrastructures between mobile devices and satisfying the desires for time-sensitive multimedia applications have introduced new challenges in the design of protocols for mobile ad hoc networks. In this paper, to stream time-sensitive applications using mobile ad hoc network (MANET), we have selected the Optimal Link State Routing (OLSR) protocol. However, the protocol has high overhead because each node selects a set of multipoint relay (MPR) nodes. Therefore, we have proposed quality of service (QoS) supporting the MPR selection approach and a new lower maintenance clustering approach for minimizing the overhead of the network. As a result, the proposed approach showed a better result in the average end-to-end delay, packet delivery ratio, routing load, and throughput.

Total energy consumption analysis in wireless Mobile ad hoc network with varying mobile nodes

Abstract: The energy protocols that have a mechanisms of shortest path routing considered predominant in the networking scenarios. The interesting matter in the routing protocols designing deal with mobile ad hoc network (MANET) must have an energy efficient network for better network performances. The Performances of such routing protocols that can be assessed will be focused on many metrics like delay, throughput, and packet delivery. MANET is a distribution network, having no infrastructure and network decentralization. There routing protocols are utilized for detecting paths among mobile nodes to simplify network communication. The performance comparison of three protocols are Optimized Link State Routing (OLSR), the second is Ad hoc On-Demand Distance Vector (AODV), while the third is Dynamic Source Routing (DSR) routing protocols concerning to average energy consumption and mobile node numbers are described thoroughly by NS-3 simulator. The nodes number is changing between 10 and 25 nodes, with various mobility models. The performance analysis shows that the suggested protocols are superior in relations to the energy consumption for networking data transmission and the performance of the wireless network can be improved greatly.

Evaluation DSDV, AODV and OLSR routing protocols in real live by using SUMO with NS3 simulation in VANET

Abstract: The area of interest in intelligent transport is vehicle communication for researchers and the automotive industry. In this article, the performance of various routing protocols in a vehicle scenario has been observed using the NS3 network simulator. Performance measurement metrics include Average Good put and the BSM PDR. AODV appears to be a good routing protocol for low-density vehicles but OLSR beats other protocols in the high-density scenario

Performance Evaluation and Analysis of Proactive and Reactive MANET Protocols at Varied Speeds

Abstract: A Mobile Ad Hoc Network (MANET) is a decentralized wireless network that does not rely on pre-existing infrastructure. Instead, it is each node's responsibility to forward data according to its specified routing protocol. Although these protocols perform the same task, their performance in a variety of scenarios differ. This paper simulates four different routing protocols in NS-3 at a variety of movement speeds and area sizes, comparing their Packet Delivery Ratio (PDR) and Average End-To-End Delay (AETED). The performance results reflect what would be expected if a system would be implemented in a similar environment. Therefore, it is crucial selecting a protocol to best suit a system.

Efficient Deployment with Throughput Maximization for UAVs Communication Networks.

Abstract: The article presents a throughput maximization approach for UAV assisted ground networks. Throughput maximization involves minimizing delay and packet loss through UAV trajectory optimization, reinforcing the congested nodes and transmission channels. The aggressive reinforcement policy is achieved by characterizing nodes, links, and overall topology through delay, loss, throughput, and distance. A position-aware graph neural network (GNN) is used for characterization, prediction, and dynamic UAV trajectory enhancement. To establish correctness, the proposed approach is validated against optimized link state routing (OLSR) driven UAV assisted ground networks. The proposed approach considerably outperforms the classical approach by demonstrating significant gains in throughput and packet delivery ratio with notable decrements in delay and packet loss. The performance analysis of the proposed approach against software-defined UAVs (U-S) and UAVs as base stations (U-B) verifies the consistency and gains in average throughput while minimizing delay and packet loss. The scalability test of the proposed approach is performed by varying data rates and the number of UAVs.

An LBMRE-OLSR Routing Algorithm under the Emergency Scenarios in the Space-Air-Ground Integrated Networks

Abstract: The Space-Air-Ground integrated network (SAGIN) is the development trend of the future communication networks, and it can cope with various complex environments and tasks in the future communication environment When sudden public events and natural disasters occurs, ground communication facilities may be damaged and cannot meet the communication needs in emergency scenarios The Space-Air-Ground integrated three-dimensional and heterogeneous network enables flexible deployment and rapid networking In this paper, we study the routing algorithm in a software defined SAGIN to optimize the load balancing in the communication network First, considering the characteristics of dynamic topology changes in real time, we propose a new Software Defined Network (SDN) model for the SAGIN, which promotes a high network flexibility Basing on such model, we present a new load balancing dynamic routing algorithm, namely Load Balancing Algorithm Based on Multi-dimensional Resources and Energy (LBMRE-OLSR) The multi-dimensional resources and energy consumption are considered in the new routing algorithm The simulation experiments show that the proposed algorithm efficiently reduce end-to-end delays and packet loss rate

Routing Protocol Selection for Intelligent Transport System (ITS) of VANET in High Mobility Areas of Bangladesh

Abstract: The ultimate objectives of VANETs are to provide safer and Intelligent Transportation System (ITS) where drivers can communicate with each other in higher mobility for secure travel. In the case of the vehicular communication in Bangladesh, no ITS of VANET is practically developed so far. To implement VANET for Bangladesh, the selection of the protocols and path routing is the most common strategies that are to be focused while designing VANETs. This paper illustrates the evaluation of four routing protocols: AODV, AOMDV, OLSR, and DSDV which are applied on open street map in New Paltan area in Dhaka city, Bangladesh. Our simulations are enacted using SUMO (for vehicular movement) simulators and NS2 (for network traffic) with two ray ground propagation model and scenarios configured to mirror the conditions of real world. The simulations are made on the basis of various parameters such as Packet Delivery Ratio (PDR), end-to-end average delay, jitter, and throughput. The simulation outcomes show that OLSR gains higher PDR assimilating to AODV, AOMDV, and DSDV under low network load. PDR is also quite consistent with high network load. In terms of delay, DSDV provides lower end-to-end delay as compared to other routing protocols in lower and higher network load. The OLSR protocol gains maximum average throughput in low network load but AODV outperforms OLSR and DSDV in higher congestion area. If routing overhead is the major choice then OLSR is the best-fitted protocol because it provides lower overhead in both low and high mobility situations.

Performance Evaluation on VANET Routing Protocols in The Way Road of Central Jakarta using NS-3 and SUMO

Abstract: The Vehicular Ad-hoc Networks (VANET) technology is still an open research area on wireless networks. In overcoming the dynamic changes in topology and obtaining reliable network quality, the selection of the routing protocol type and the type of propagation loss model is critical within the VANET Design. This research aims to analyze the performance of OLSR, AODV, DSDV, and DSR routing protocol in relation to the variation of speed and the type of propagation loss model scenarios. Those Scenarios are organized according to the number of nodes, packet size, duration of simulation time, simulation speed, and the propagation loss model environment. As a result of this research, this paper analyzes the simulation result of receive packet rate, packet receive, throughput, and goodput using NS3 and SUMO simulators. The simulation result showed that the variance of speed used (30 m/s, 50 m/s, 100 m/s) has no significant influence in choosing the best ad hoc routing protocol. Nevertheless, the considerable impact comes from the variance of the propagation loss model used. Our experiment shows that each propagation loss model has a unique routing protocol to get the best performance. The simulation results indicate that the Friis Propagation Loss Model has excellent performance and only is shown by OLSR protocol while other protocols have quite low values. Meanwhile, replacement of the propagation loss model parameter to both The Two Way and The Nakagami-m Fast Fading Propagation Loss Model makes some protocols notably AODV, DSDV and DSR show better performance than before when they are adopting The Friis Propagation Loss Model.

Dual-Channel-Based Mobile Ad Hoc Network Routing Technique for Indoor Disaster Environment

Abstract: The existing network infrastructure may not work well in a disaster environment caused by a fire or an earthquake. Instead of relying on the existing infrastructure, communicating through a mobile ad hoc network (MANET) is recommended because MANET can configure a network without an infrastructured communication system. In addition, firefighters conducting emergency activities in harsh environments surrounded by flames and smoke need a communication system to assist their rapid firefighting operations. Existing work is not suitable for indoor firefighter communications because they did not consider the indoor disaster environment well. In this proposed scheme, dual channels (i.e., 2.4 GHz and sub-GHz bands) are used for an efficient routing table configuration. Data frame and HELLO message are exchanged through the 2.4 GHz band, while the neighbor list of each node is exchanged through the sub-GHz band. Each node can configure the routing table based on the exchanged neighbor list. A performance evaluation is conducted to compare the proposed technique with enhanced versions of optimized link state routing (OLSR) and destination-sequenced distance vector routing (DSDV). The results show that the proposed scheme outperforms the other two MANET routing algorithms (i.e., OLSR-mod and DSDV-mod) in terms of the packet delivery ratio (PDR), end-to-end delay, and initial routing table configuration time approximately 27.8%, 4.7%, and 166.7%, respectively.