Optimized Link State Routing Protocol Protocol Research Articles

Underwater Wireless Sensor Networks Performance Comparison Utilizing Telnet and Superframe

Underwater Wireless Sensor Networks (UWSNs) have recently established themselves as an extremely interesting area of research thanks to the mysterious qualities of the ocean. The UWSN consists of sensor nodes and vehicles working to collect data and complete tasks. The battery capacity of sensor nodes is quite limited, which means that the UWSN network needs to be as efficient as it can possibly be. It is difficult to connect with or update a communication that is taking place underwater due to the high latency in propagation, the dynamic nature of the network, and the likelihood of introducing errors. This makes it difficult to communicate with or update a communication. Cluster-based underwater wireless sensor networks (CB-UWSNs) are proposed in this article. These networks would be deployed via Superframe and Telnet applications. In addition, routing protocols, such as Ad hoc On-demand Distance Vector (AODV), Fisheye State Routing (FSR), Location-Aided Routing 1 (LAR1), Optimized Link State Routing Protocol (OLSR), and Source Tree Adaptive Routing—Least Overhead Routing Approach (STAR-LORA), were evaluated based on the criteria of their energy consumption in a range of various modes of operation with QualNet Simulator using Telnet and Superframe applications. STAR-LORA surpasses the AODV, LAR1, OLSR, and FSR routing protocols in the evaluation report’s simulations, with a Receive Energy of 0.1 mWh in a Telnet deployment and 0.021 mWh in a Superframe deployment. The Telnet and Superframe deployments consume 0.05 mWh transmit power, but the Superframe deployment only needs 0.009 mWh. As a result, the simulation results show that the STAR-LORA routing protocol outperforms the alternatives.

Enhancing OLSR protocol in VANETs with multi-objective particle swarm optimization

The Optimized Link State Routing Protocol (OLSR) is envisioned as one of the key components to the operation of future vehicular ad hoc networks (VANETs). Its performance is however fairly constrained in the vehicular communication environment due to the limited coverage of wireless transmission and high-speed movement of nodes. In this brief, we propose a multi-objective particle swarm optimization (MOPSO) framework to enhance the performance of OLSR in VANETs. Specifically, we formulate a multi-objective optimization problem (MOP) considering not only the quality of service (QoS), including throughput, delay and packet loss rate, but also the cost of service, i.e., routing load. We solve this MOP with MOPSO and obtain the Pareto front corresponding to the optimal equilibrium of performance and cost. In the experiment, our optimization framework is used in a general setting of VANETs to obtain the optimal parameters of OLSR, i.e., Hello and TC intervals, and these parameters are further validated in realistic VANET scenarios. Our optimization framework can be naturally extend to other dynamic routing protocols in networks.

Performance Analysis of OLSR Protocol in Mobile Ad Hoc Networks

Optimized Link State Routing Protocol (OLSR) is an efficient routing protocol used for various Ad hoc networks. OLSR employs the Multipoint Relay (MPR) technique to reduce network overhead traffic. A mobility model's main goal is to realistically simulate the movement behaviors of actual users. However, the high mobility and mobility model is the major design issues for an efficient and effective routing protocol for real Mobile Ad hoc Networks (MANETs). Therefore, this paper aims to analyze the performance of the OLSR protocol concerning various random and group mobility models. Two simulation scenarios were conducted over four mobility models, specifically the Random Waypoint model (RWP), Random Direction model (RD), Nomadic Community model (NC), and the Reference Point Group Model (RPGM) with a low as well as high random range mobility of the nodes. Moreover, BonnMotion Software and Network simulator NS-3 used to implement the simulation scenarios. Further, the performance of the OLSR protocol analyzed and evaluated based on latency, routing overhead, and packet loss ratio metrics. According to the results, the OLSR protocol provides the best performance over the RWP model in a low mobility environment, whereas the Nomadic mobility model is suitable for OLSR protocol in a high mobility environment.

Gray-Hole Attack Minimization in IoMT with 5G Based D2D Networks

Reliable transmission is vital to the success of the next generation of communications technologies and Fifth Generation (5G) networks. Many sensitive applications, such as eHealth and medical services, can benefit from a 5G network. The Internet of Medical Things (IoMT) is a new field that fosters the maintenance of trust among various IoMT Device to Device (D2D) modern technologies. In IoMT the medical devices have to be connected through a wireless network and constantly needs to be self-configured to provide consistent and efficient data transmission. The medical devices need to be connected with sophisticated protocols and architecture to handle the synergy of the monitoring devices. Today, one of the commonly used algorithms in D2D communication is the Optimized Link State Routing protocol (OLSR). The OLSR is considerably good at effectively utilizing the bandwidth and reserving the paths. One of the major attack against the OLSR is the Node isolation attack, also known as the Gray hole denial of service attack. The Gray hole attack exploits the vulnerabilities present with sharing the topological information of the network. The attackers may use this topological information to maliciously disconnect the target nodes from the existing network and stops rendering the communication services to the victim node. Hence, considering the sensitivity and security concerns of the data used in e-Health applications, these types of attacks must be detected and disabled proactively. In this work, a novel Node Authentication (NA) with OLSR is proposed. The simulation experiments illustrated that the proposed protocol has an excellent Packet Delivery Ratio, minimal End-End delay, and minimal Packet loss when compared to the Ad-hoc On-Demand Distance Victor (AODV) protocol and the proposed authentication scheme was able to protect the OLSR protocol from a node isolation attack.

Study of Proactive Routing Protocol in Wildfire Detection Using Mobile Sensor Networks

ABSTRACT Mobile sensor networks include different routing protocols. The performance of these routing protocols differs in terms of transmitting and receiving the packets, where it depends on the architecture of each routing protocol. However, despite there are many protocols that have been proposed, but they have not implemented broadly in disasters, where there is a need to study the routing protocols in disasters such as forest fire detection. Therefore, this paper is present a proactive routing protocol called Optimized Link State Routing Protocol (OLSR). This protocol has implemented in the detection of forest fire based on a different number of mobile sensor nodes in the range of 10-50 nodes with an increment step of 10 nodes. Furthermore, the performance of the OLSR protocol is evaluated in terms of Packet Delivery Ratio (PDR), End-to-End Delay (E2E Delay), energy consumption, and routing overhead. The performance of the OLSR protocol shows encouraging results in the detection of forest fire.

Matching game theoretical model for stable relay selection in a UAV-assisted internet of vehicles

This paper tackles the problem of selecting stable relays for Optimized Link State Routing protocol (OLSR) in urban Internet of Vehicles (IoV) in the presence of Unmanned Aerial Vehicles (UAVs). With the evolution of Internet of Things (IoT), IoV emerged from the conventional vehicular ad-hoc network to enable Vehicle to Everything (V2X) communication through different routing protocols. In OLSR protocol, Multi-Point Relays (MPRs) are selected based on their reachability and uniqueness to route information. However, urban environments are characterized by the rapid changes in topology due to the presence of intersections and traffic lights. Although clusters were proposed as a solution, selecting stable heads and MPRs are of significance, considering environment metrics to provide higher connectivity. As a solution to improve routing in IoV, a distributed Gale-Shapley matching game is proposed for stable clustering and MPR selection, utilizing nodes' quality of service (QoS). Nodes' QoS is calculated using Bayesian Belief function of stable connections utilizing environment metrics. For further enhancement in the network performance, UAVs are integrated in the network of vehicles. Conducted simulations show high percentage of stable heads and MPRs for the proposed model compared to benchmark protocols. In addition, the proposed model shows high performance in terms of packet delivery ratio, throughput and End-to-End delay, which are further improved by the presence of UAVs.

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

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.

An Enhanced OLSR Protocol to Improve Performance Of UAV in Wireless Mesh Network

Over the past few decades, wireless mesh network is the main area of research in small and large sized network structure. Wireless mesh network is a radio based network scheme that needs minimal structure and organisation. It has the capability to integrate the wired system and can be prolonged at minimum cost without losing the mobile nature. Routing protocols mainly affects the performance of the WMN. Some of the advantages of the WMN are cost effective, easy management, robust and reliable service. It is utilised in numerous application areas such as hospitality and healthcare applications, rescue actions and disaster controlling, broadband connection services at home and institutions. In WMN , some challenges faced are, unsuitable number of alternate routes among the pair of the hops, entire capacity decreased due to interference among the multiple connections, effect on security due to complex networks. In a wireless mesh network, described about the optimized link state routing protocol (OLSR) and works on network parameters. In routing protocol, an immediate routing is required so that the change in topology may lead to flooding of data to desirable hosts in the system. After that, routing, performance is evaluated with encryption method using DES. Data encryption standard (DES) is cryptographic method that is applied to block of information. In this research proposed work, developed a novel improved, optimised link state routing method to enhance the network performance end to delay, delivery rate and recover the loss of data from sender to receiver hop. Experimental analysis is done using various parameters metrices as end delay, packet delivery ratio and throughput. In this research, an improvement in discovery delay of PASER and FER is also increased. The frame error rate computed is based on the level ranges range from 0%, 10% and 20%. Moreover, packet delivery ratio is 70% and throughput is 81%.

Performance Evaluation and Comparison of GRP and OLSR Routing Protocols for Video Streaming Over Mobile Ad Hoc Networks Using OPNET 14.5

Due to the increased use of mobile devices with the high demand for applications such as video application, most companies have tended to pay attention to Mobile Ad hoc Networks. This type of network is characterized by multi-hop wireless networks where data packets are sent in a "store and forward" manner from the source to an arbitrary destination via intermediate nodes. The mobile nodes are connected by multi-routes routing as the nodes in this network not only serve as hosts but also as routers where data is routed to and from other nodes in the network and therefore the mobile node not only sends its data packets but also sends data packets of other mobile nodes. The network architecture changes dynamically, mainly because of Mobility of nodes, so we need routing protocols to establish the connection. Routing protocols are categorized into proactive routing protocols, reactive routing protocols and hybrid routing protocols. So in this research, we has been studied Geographical Routing Protocol (GRP ), Optimized Link State Routing Protocol (OLSR) routing protocols which is one of proactive routing protocols and hybrid routing protocols respectively on the basis of Throughput, Delay and Load..etc and evaluated the performance in a large mobile ad hoc network and in a small mobile ad hoc network as well as for different video resolutions, the OPNET 14.5 network simulator was used to obtain research results. It was found that the GRP protocol performs better for a small number of nodes whether the video resolution is low or high while its performance decreases when the number of nodes increases in the network but the OLSR protocol improves when the number of nodes is increased.

Robust MPR: A Novel Algorithm for Secure and Efficient Data Transmission in VANET

A major issue in VANETs is the high mobility of the nodes. Broadcasting helps in improving the performance of the VANETs in terms of secure routing. However, broadcasting is a major overhead in VANETs. Broadcasting is still a widely used technique in wireless ad hoc networks and is mainly used to transmit network control information and application oriented data. The Optimized Link State Routing Protocol (OLSR) uses a multipoint relay scheme (MPR) to flood the network with control messages involving topology and other technical data. The method generally adopted is flooding which sometimes may lead to congestion in the network. The OLSR technique also has the capability of reducing retransmissions that are redundant and obsolete. We have proposed a MPR selection technique for a robust broadcast in VANETs. Our proposed method tries to cover all the 2-hop MPR nodes ‘m’ times. It also considers the weaker 2-hop MPR nodes set and compensates by providing an alternate solution to counteract the same. In fact, the proposed method determines the strength of the 2-hop MPR set before the start of the transmission and also tries to control the flooding of the transmission control messages. The proposed method is capable of recovering faster when there are broken communication links using the concept of friend MPR nodes. This is made possible with the help of the control packets which carry information regarding the RMPR and the Friend MPR nodes. The RMPR nodes are analyzed using a network simulator (NS2) and mathematical modeling. The values were obtained from the graph readings that were supplied to the simulator. The performance analysis has been tabulated in the results and discussion section. We have studied the performance of the proposed RMPR–OLSR protocol with the existing MMPR–OLSR and the OLSR protocols. The protocols were assessed by studying the network performance when the number of nodes was increased. It was assessed based on the nature of the traffic within the network. The delay for the proposed RMPR–OSLR was lesser than the other two methods (even with an increase in the number of nodes). Similarly, the packet drop for RMPR–OLSR was lesser than MMPR–OLSR and OLSR. The throughput of the RMPR–OLSR was found to increase by than the other existing protocols. The channel utilization was found to be more improved than the other protocols. In fact, the packet delivery ratio (PDR) of the proposed protocol was more than the other two protocols. Thus, the proposed protocol is capable of improving the overall throughput of the network and also helps in maximizing the PDR with respect to the MPR selection technique employed by OLSR.

Mitigating Denial of Service Attacks in OLSR Protocol Using Fictitious Nodes

With the main focus of research in routing protocols for Mobile Ad-Hoc Networks (MANET) geared towards routing efficiency, the resulting protocols tend to be vulnerable to various attacks. Over the years, emphasis has also been placed on improving the security of these networks. Different solutions have been proposed for different types of attacks, however, these solutions often compromise routing efficiency or network overload. One major DOS attack against the Optimized Link State Routing protocol (OLSR) known as the node isolation attack occurs when topological knowledge of the network is exploited by an attacker who is able to isolate the victim from the rest of the network and subsequently deny communication services to the victim. In this paper, we suggest a novel solution to defend the OLSR protocol from node isolation attack by employing the same tactics used by the attack itself. Through extensive experimentation, we demonstrate that 1) the proposed protection prevents more than 95 percent of attacks, and 2) the overhead required drastically decreases as the network size increases until it is non-discernable. Last, we suggest that this type of solution can be extended to other similar DOS attacks on OLSR.

A Study on Preventing Node Isolation Attack in OLSR Protocol

A mobile ad hoc network (MANET) is a wireless communication system of continuously self-configuring and infrastructure-less network of mobile devices which can move independently in any direction at any time.Routing protocols is required for message exchange in MANET. The most widely used routing protocol is OLSR (Optimized Link State Routing Protocol). It is efficient in bandwidth utilization and path calculation. But it is vulnerable to many types of attacks. In this paper, we discuss about various methods used to prevent a type of Denial of Service (DoS) attack called the node isolation attack that is capable to compromise OLSR protocol.

Performance analysis of ad hoc routing protocols based on selective forwarding node algorithms

Network resources are essential in resource critical environments as ad hoc wireless networks (AWNs) due to their dynamic topology and broadcasting of packets over the wireless medium without a central controller. In order to perform a routing algorithm with minimum resource consumption, an ideal ad hoc routing protocol should be designed for low consumed resources such as low power consumption. In this paper focus on ad hoc routing protocols, Optimized Link State Routing Protocol (OLSR) and gossip-based routing protocols, based on selective forwarding node algorithms that reduce the control message overheads. Thus, we present performance analytical results to thoroughly evaluate the routing protocols and demonstrate our Adaptive-Gossiping method advantages over Static-Gossiping routing and OLSR protocols in densely deployed networks. This paper is an extended version of ICISA 2013 conference paper [12].

Finding the Minimum MPR Set in OLSR Protocol with Genetic Algorithms

The characteristic that nodes can enlist into the network topology freely and independently makes mobile Ad hoc networks (MANET) widely used in various environments such as disaster rescue, battlefield and so on. In MANET, the routing mechanism should adapt rapidly to the frequently changed network topology and in the mean time economize valuable network resources with its best. The Optimized Link State Routing Protocol (OLSR) is an important MANET routing protocol in which the key technique is MultiPoint Relays (MPR). After introducing the OLSR protocol and its MPR technique, the shortcoming of presently used heuristic algorithm in finding the minimum MPR sets is revealed. Then the new algorithm based on genetic algorithm (GA) is presented, and the convergence of the algorithm is proved. A series of 4 genetic algorithms are further developed by adopting different GA strategies and simulated in many topologies that are created randomly. Analysis on simulating results shows that the genetic algorithms are feasible and applicable and the choice of heuristic strategies is advisable and