Showing papers on "Link-state routing protocol published in 2019"

Segment Routing with the MPLS Data Plane

Abstract: Segment Routing (SR) leverages the source routing paradigm. A node steers a packet through a controlled set of instructions, called segments, by prepending the packet with an SR header. In the MPLS dataplane, the SR header is instantiated through a label stack. This document specifies the forwarding behavior to allow instantiating SR over the MPLS dataplane.

OSPF Extensions for Segment Routing

Abstract: Segment Routing (SR) allows a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological sub-paths, called "segments". These segments are advertised by the link-state routing protocols (IS-IS and OSPF). This draft describes the OSPFv3 extensions required for Segment Routing with MPLS data plane.

IS-IS Extensions for Segment Routing

Abstract: Segment Routing (SR) allows for a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological sub-paths, called "segments". These segments are advertised by the link-state routing protocols (IS-IS and OSPF). This draft describes the necessary IS-IS extensions that need to be introduced for Segment Routing operating on an MPLS data-plane.

Bat Optimized Link State Routing Protocol for Energy-Aware Mobile Ad-Hoc Networks

Abstract: Mobile ad hoc network (MANET) can be described as a group of wireless mobile nodes that form a temporary dynamic and independent infrastructure network or a central administration facility. High energy consumption is one of the main problems associated with the MANET technology. The wireless mobile nodes used in this process rely on batteries because the network does not have a steady power supply. Thus, the rapid battery drain reduces the lifespan of the network. In this paper, a new Bat Optimized Link State Routing (BOLSR) protocol is proposed to improve the energy usage of the Optimized Link State Routing (OLSR) protocol in the MANET. The symmetry between OLSR of MANET and Bat Algorithm (BA) is that both of them use the same mechanism for finding the path via sending and receiving specific signals. This symmetry resulted in the BOLSR protocol that determines the optimized path from a source node to a destination node according to the energy dynamics of the nodes. The BOLSR protocol is implemented in a MANET simulation by using MATLAB toolbox. Different scenarios are tested to compare the BOLSR protocol with the Cellular Automata African Buffalo Optimization (CAABO), Energy-Based OLSR (EBOLSR), and the standard OLSR. The performance metric consists of routing overhead ratios, energy consumption, and end-to-end delay which is applied to evaluate the performance of the routing protocols. The results of the tests reveal that the BOLSR protocol reduces the energy consumption and increases the lifespan of the network, compared with the CAABO, EBOLSR, and OLSR.

A rule based delay constrained energy efficient routing technique for wireless sensor networks

Abstract: In wireless sensor networks (WSN), the nodes are used to collect and gather the data from different environments. Hence, the network consumes more energy which is the main and challenging issue in WSNs. Since the sensor is operating under battery, recharging is impossible and hence the lifetime of each sensor is an important issue. Therefore, it is necessary to introduce new and efficient techniques to extend the network lifetime. In this paper, a new delay constrained energy efficient routing technique is proposed for performing effective routing in WSNs. This approach introduces a delay constraint based reliable routing approach which reduces the energy consumption by constructing efficient clusters without increasing the end-to-end delay. Moreover, the proposed technique called the rule based clustering for routing model provides better performance in terms of network lifetime than the other existing techniques since they consume more energy during the formation of clusters and finding the shortest path. Moreover, additional overhead on the cluster head selection is tackled also using rules in this proposed model in an efficient manner by building balanced clusters. The main advantage of the proposed approach is that it extends the lifetime of the network and increases the throughput, energy efficiency, link quality and scalability. The experimental verification of this technique has been carried out using MATLAB simulations and proved that this model increases the packet delivery rate, network performance and reduces the delay and energy consumption.

A multipath QoS multicast routing protocol based on link stability and route reliability in mobile ad-hoc networks

Abstract: Recently, the use of real-time multimedia applications has attracted the attention of mobile ad hoc network users. These applications support service quality. The characteristics of mobile ad hoc networks such as lack of central coordinator, mobility of hosts, dynamic changes in network topology and the limitation of access to resources have caused remarkable challenges in providing high quality services for mobile ad hoc networks. Bandwidth limitation of wireless nodes and the lack of adequate multicast trees are regarded as the main challenges for quality of service-based multicast routing. In this paper, an attempt was made to propose a more stable and more reliable in multi-path quality of service multicast routing protocol (SR-MQMR) for mobile ad-hoc networks. In the proposed method, considering the requested bandwidth, the researchers first used the signal strength of nodes to select the most stable nodes. Then, using the two parameters of route expiration time and the number of hops, we selected a route which had low delay and high stability. The results of simulations conducted in the present study indicated that the SR-MQMR protocol used less time slots than the MQMR protocol in the routing process which resulted in an increase in success ratio. Furthermore, the production of stable routes led to a significant enhancement of reliability. Since the reduction of route request packet exchange decreased overhead in the proposed method, the degree of consumed bandwidth decreased which led to an increase in network lifetime.

An QoS Aware Link Defined OLSR (LD-OLSR) Routing Protocol for MANETS

Abstract: Mobile Adhoc Networks (MANETS) are gaining popularity because of interconnected networks. Routing is a key issue which needs to be addressed for efficient forwarding of packets from source to destination. Optimized Link State Routing (OLSR) is a proactive or table driven routing protocol in MANETS which works on the principal of link sensing. Multi Point Relay (MPR) node is mainly responsible for forwarding of topology control messages in OLSR. In this work MPR node is selected on the basis of node’s willingness to be selected as MPR. Wireless links are generally much inferior and prone to link losses. Frequent link failures result in lesser QoS parameters such as lesser throughput, higher end to end delay, higher latency and less utilization of link bandwidth. Link quality is an important metric to be taken as a research topic while deciding routing protocol. Routing protocols suggested by many authors have proffered minimum hop routing which contains lossy links in wireless medium resulting in reduction of throughput. In this work, Link Defined OLSR (OLSR-LD) is proposed which considers quality of link while making routing decision. Extensive Simulations were performed using NS-2 Simulator by varying pause time of nodes, simulation time of nodes and speed of nodes.

DRADS: depth and reliability aware delay sensitive cooperative routing for underwater wireless sensor networks

Abstract: In this paper, depth and reliability aware delay sensitive (DRADS), interference aware DRADS (iDRADS) and cooperative iDRADS (Co-iDRADS) routing protocols are proposed for maximizing network good-put while minimizing end-to-end delay. We have introduced a new metric called depth threshold to minimize the number of hops between source and destination while ensuring successful packet delivery. Our interference aware and co-operative routing based algorithms select the best relay node at each hop. Extensive simulation results validate that the proposed routing techniques perform better than the selected existing ones in terms of good-put and energy cost of the network.

Enhanced mobility aware routing protocol for Low Power and Lossy Networks

Abstract: Due to the technological advancement in Low Power and Lossy Networks (LLNs), sensor node mobility becomes a basic requirement for many extensive applications. Routing protocol designed for LLNs must ensure real-time data transmission with minimum power consumption. However, the existing mobility support protocols cannot work efficiently in LLNs as they are unable to adapt to the change in the network topology quickly. Therefore, we propose an Enhanced Routing Protocol for LLNs (ERPL), which updates the Preferred Parent (PP) of the Mobile Node (MN) quickly whenever the MN moves away from the already selected PP. Further, a new objective function that takes the mobility of the node into an account while selecting a PP is proposed. Performance of the ERPL has been evaluated with the varying system and traffic parameters under different topologies similar to most of the real-life networks. The simulation results showed that the proposed ERPL reduced the power consumption, packet overhead, latency and increased the packet delivery ratio as compared to other existing works.

Denial of service attack solution in OLSR based manet by varying number of fictitious nodes

Abstract: The Mobile Ad Hoc Network (MANET) is formed by group of mobile nodes and such group of nodes is flexible in creating links with the other nodes in the network frequently. The routing protocols in the network layer helps in transmitting the data packets between the nodes in the network. The wireless devices use electromagnetic waves or the infrared waves as medium of transmission and each device have antennas for communication. This wireless channel is very unreliable and also unprotected from the interferences from outside. The optimized link state routing (OLSR) protocol is an optimization of pure link state routing protocol. In this paper, the focus is on the active denial of service (DoS) attacks in the network layer routing protocol OLSR. Fictitious node based detection of DoS attacks are proposed by varying the number of fictitious nodes for particular number of network nodes and the parameters throughput,delay,packet delivery ratio and average delay are evaluated using network simulator and the results are compared.The number of fictitious nodes required for the maximum throughput of the given network is finally evaluated.

Fault-Tolerant Adaptive Routing in Dragonfly Networks

Abstract: Dragonfly networks have been widely used in the current high-performance computers or high-end servers. Fault-tolerant routing in dragonfly networks is essential. The rich interconnects provide good fault-tolerance ability for the network. A new deadlock-free adaptive fault-tolerant routing algorithm based on a new two-layer safety information model, is proposed by mapping routers in a group, and groups of the dragonfly network into two separate hypercubes. The new fault-tolerant routing algorithm tolerates static and dynamic faults. Our method can determine whether a packet can reach the destination at the source by using the new safety information model, which avoids dead-ends and aimless misrouting. Sufficient simulation results show that the proposed fault-tolerant routing algorithm even outperforms the previous minimal routing algorithm in fault-free networks in many cases.

QoS in Mobile Ad-Hoc Networks

Abstract: A mobile ad hoc network (MANET) consists of mobile nodes communicating over wireless channels. Routing in MANETs is very challenging due to the random mobility of nodes and unreliability of wireless channels. Therefore most of the existing routing algorithms make only the best effort to find routes for communication but do not provide any performance guarantee. Because of the widespread use of MANETs in real-time applications, it becomes pertinent to provide deterministic network behavior. Quality of Service (QoS) aims to shape the network behavior and provide performance guarantees. In this work, a novel heuristic called Advanced-Optimised Link State Routing (A-OLSR) protocol is designed to provide QoS. It functions by enhancing the connectivity of nodes and establishing more stable routes as compared to standard best-effort Optimised Link State Routing (OLSR) protocol. The simulation results show that A-OLSR provides lower delay, reduces energy consumption and achieves higher throughput without introducing any additional routing overhead as compared to the standard OLSR and it's variants-A$$'$$?-OLSR and A$$''$$??-OLSR. The results also show that A-OLSR provides scalability since it's performance remains consistent with the increasing size of network.

An Enhanced MPR OLSR Protocol for Efficient Node Selection Process in Cognitive Radio Based VANET

Abstract: A VANET is an excellent instance of a wireless sensor network. The mobile vehicles are the nodes and communication happens between the vehicular nodes. This facility of communicating with the vehicular nodes finds varied applications ranging from entertainment to emergency services. When combined with cognitive radio techniques, VANETs are equipped with the facility of sensing the spectrum opportunistically. When the spectrum is sensed efficiently, the channel and the bandwidth can be utilized effectively. To achieve this, we have coordinated the enhanced Optimal Link State Routing Protocol (MMPR-OLSR) with the GSA-PSO (Gravitational Search-Particle Swarm Optimization) scheme in combination with the cognitive radio technique. This technique can be applied to the Vehicular Sensor Networks. MMPR-OLSR with GSA-PSO optimization facilitates the MMPR-OLSR protocol to select the suitable member nodes using an optimal searching technique. The GSA-PSO optimization not only helps in choosing the appropriate MMPR nodes, but also helps in reducing the unnecessary overheads due to the propagation of the control packets. By selecting the appropriate MMPR nodes. It is also possible to minimize the number of relay selector nodes used in transmission. The optimization technique also focuses on assigning the channels among all the network users. This is controlled by our proposed approach. A group of nodes are selected before the start of the actual transmission. These vehicular nodes within the communication range are used as relays in the transmission. These nodes are categorized as Multi Point Relays. Cognitive radio plays an active role by identifying the idle channels, thus enabling the usage of the unused channels. Our proposed approach works efficiently in achieving the objective of effective channel utilization combined with efficient transmission. Our proposed approach is simulated using the NS2 platform and is evaluated based on important network metrics. Our proposed method shows a sharp decrease in delay and a high packet delivery ratio in addition to a high channel utilization. The proposed GSA-PSO approach decreases the delay associated with packet transmission and delivery in VANETs and also ensures a good PDR due to the effective channel utilization.

A Two-Hops State-Aware Routing Strategy Based on Deep Reinforcement Learning for LEO Satellite Networks

Abstract: Low Earth Orbit (LEO) satellite networks can provide complete connectivity and worldwide data transmission capability for the internet of things. However, arbitrary flow arrival and uneven traffic load among areas bring about unbalanced traffic distribution over the LEO constellation. Therefore, the routing strategy in LEO networks should have the ability to adjust routing paths based on changes in network status adaptively. In this paper, we propose a Two-Hops State-Aware Routing Strategy Based on Deep Reinforcement Learning (DRL-THSA) for LEO satellite networks. In this strategy, each node only needs to obtain the link state within the range of two-hop neighbors, and the optimal next-hop node can be output. The link state is divided into three levels, and the traffic forwarding strategy for each level is proposed, which allows DRL-THSA to cope with link outage or congestion. The Double-Deep Q Network (DDQN) is proposed in DRL-THSA to figure out the optional next hop by inputting the two-hops link states. The DDQN is analyzed from three aspects: model setting, training process and running process. The effectiveness of DRL-THSA, in terms of end-to-end delay, throughput, and packet drop rate, is verified via a set of simulations using the Network Simulator 3 (NS3).

Geographic forwarding rules to reduce broadcast redundancy in mobile ad hoc wireless networks

Abstract: The mobile ad hoc networks (MANETs) are self-organizing networks. They use the mechanism of broadcasting to discover the links between nodes, to share the topology information, and to maintain the routing tables. However, the broadcasting suffers from redundant retransmissions causing radio resources waste and packet loss, especially in large networks. In this paper, we propose a new decentralized technique, called geographic forwarding rules (GFRs), to reduce the number of broadcast messages in mobile ad hoc networks. We use the location information of nodes to divide the network into virtual zones. Then we try to avoid duplicate retransmissions between the zones. Our proposition reduces the amount of overhead while it achieves a successful dissemination. We focused our research on the optimized link state routing (OLSR) protocol, the most known proactive routing protocol in the MANETs. We demonstrate, by simulations, that our geographic forwarding rules keep the number of disseminated topology control (TC) messages less than that of the default forwarding rules (DFRs) of OLSR.

EIMO-ESOLSR: energy efficient and security-based model for OLSR routing protocol in mobile ad-hoc network

Abstract: In numerous areas mobile ad hoc network (MANET) has plenteous mobile nodes that are allowed to communicate independently. In optimised link state routing protocols (OLSR), multi-point relays (MPR) are unique nodes that are chosen by different nodes to relay their traffic information which may prompt to MPR nodes high energy consumption. However, misbehaving MPR nodes tend to protect their energy by dropping different nodes packets as opposed to sending them. This prompts to huge energy loss and debasement of execution in many existing energy efficient MPR selection plans. In this work, an energy and security aware routing model is introduced for MANET including an enhanced intellects-masses optimiser (EIMO). At first, by methods of MPR selection the route discovery is advanced. In this approach, parameters, for example, available bandwidth, queue occupancy, and lifetime are considered as willingness nodes and misbehaving probability, power factor and forwarding behavior are considered as Composite Eligibility Index (CEI). Contrasted with other energy models this approach has less energy and secured. The accomplished simulation upshot exhibits that the EIMO-energy-efficient and secure optimised link state routing (ESOLSR) outperforms other state of art with respect to the performance metrics like energy consumption, total remaining time, average network lifetime, and a variance of energy.

Load balancing routing with queue overflow prediction for WSNs

Abstract: The ease of deployment of Wireless Sensor Networks (WSNs) makes them very popular and useful for data collection applications. Nodes often use multihop communication to transmit data to a collector node. The next hop selection in order to reach the final destination is done following a routing policy based on a routing metric. The routing metric value is exchanged via control messages. Control messages transmission frequency can reduce the network bandwidth and affect data transmission. Some approaches like trickle algorithm have been proposed to optimize the network control messages transmission. In this paper, we propose a collaborative load balancing algorithm (CoLBA) with a prediction approach to reduce network overhead. CoLBA is a queuing delay based routing protocol that avoids packet queue overflow and uses a prediction approach to optimize control messages transmission. Simulation results on Cooja simulator show that CoLBA outperforms other existing protocols in terms of delivery ratio and queue overflow while maintaining a similar end-to-end delay.

Machine Learning based Link State Aware Service Function Chaining

Abstract: Service Function Chaining (SFC) can be a basic deployment unit that composes a chaining order of required network functions to provide a network service. With the proliferation of Software-Defined Networking (SDN) and cloud computing, such virtualized network functions can be dynamically deployed in different sites, depending on SFC requests. While offering the advantages of flexibility and efficiency, this also leaves management complexity and room for optimization where Machine Learning (ML) can be applicable to solve the problems based on monitoring data. In this paper, we treat SFC as a problem of finding a best source-to-destination routing path from multiple candidates with different link costs and a required traversal order of network functions. There are many mathematical approaches that ensure best optimum but not scalable to the problem size, whereas our approach hides underlying considerations by applying ML technique on measured SFC data to quickly find suboptimal routing paths on a new SFC request, based on their predicted network performance such as the number of successful requests or end-to-end delay. So, we developed a measurement system that records the performance and path costs of SFCs in emulated networks with different per link costs and chain lengths. Then, we evaluate four different ML models for the approach described above.

Particle Swarm Based Resource Optimized Geographic Routing for Improved Network Lifetime in MANET

Abstract: In a Mobile ad hoc network (MANET), scalability, dynamic topology and high mobility are the most significant challenges to perform the routing with improved network lifetime. According to the geographical location, geographic routing termed as position-based routing performs data transmission between source node and destination node in a MANET. But, geographic routing protocols were not able achieve effective routing with enhanced network lifetime by improving the resource optimization and optimal coverage performance. In order to improve the resource optimization and network lifetime, an efficient Particle Swarm based Resource Optimized Geographic Routing (PS-ROGR) technique is introduced in MANET. Initially, each particle (i.e. mobile node) movement in a network is controlled by its local best known position in the search space (i.e. geographic location). The PSO permits all the particles in the network to communicate with the other particles with minimum energy. The particle which has the better global best function is selected for energy efficient routing based on the fitness value. Therefore the entire particles share the similar best position to optimize the network resources. Thereby, the PS-ROGR technique prolong the lifetime of the network with minimum energy utilization. Simulation is carried out on the factors such as packet delivery ratio, average end to end delay, energy consumption and network lifetime. Thus, the proposed PS-ROGR technique improves the network lifetime by 22% and reduces the average end to end delay by 46%. Then, the packet delivery ratio is enhanced up to 11% and energy consumption is minimized to 16% with the help of proposed PS-ROGR technique.

Link-state QoS routing protocol under various mobility models

Abstract: Mobile Ad Hoc Network (MANET) consists of a group of mobile or wireless nodes that are placed randomly and dynamically that causes the continual change between nodes. A mobility model attempts to mimic the movement of real mobile nodes that change the speed and direction with time. The mobility model that accurately represents the characteristics of the mobile nodes in an ad hoc network is the key to examine whether a given protocol. The aim of this paper is to compare the performance of four different mobility models (i.e. Random Waypoint, Random Direction, Random walk, and Steady-State Random Waypoint) in MANET. These models were configured with Optimized Link State Routing (OLSR) protocol under three QoS (Quality of Service) metrics such as the Packet Delivery Ratio (PDR), Throughput, End-to-End delay. The simulation results show the effectiveness of Steady-State Random Waypoint Mobility Models and encourage further investigations to extend it in order to guarantee other QoS requirements.

Bio-Inspired Routing over FANET in Emergency Situations to support Multimedia Traffic

Abstract: A QoS routing to select the best paths among Drones supporting incoming calls and multimedia traffic in emergency or critical situations is proposed. In situations where drones' teams are requested to cover areas where mobile users can need to communicate under the absence of network infrastructure, a self-organized on-the fly network becomes an essential goal. Cooperating with a critical network infrastructure, deploying a QoS aware path selection strategy supporting QoS requests and multimedia traffic such as VoIP and Video traffic can become a key issue to face. In this paper, a bio-inspired strategy to maintain the drones' network topology in a ligthway manner is proposed. Two metrics considered in a joint unified metric are proposed in order to balance traffic load and, at the same time, select the shortest routes. A comparison with an enhanced Link-State (LS) routing has been performed where the minimum hop count metric has been considered together to a LS routing with maximum available bandwidth metric. Performance evaluation has been evaluated in terms of control overhead, number or admitted calls, average bandwidth utilization.

Formal modeling and analysis of ad hoc Zone Routing Protocol in Event-B

Abstract: Ad hoc routing protocols are responsible for searching a route from the source to the destination under the dynamic network topology. Hybrid routing protocols combine the features of proactive and reactive approaches. So, the formal specification of a hybrid routing protocol in the dynamic network environment is a challenge. In this paper, we formally analyze the Zone Routing Protocol (ZRP), a hybrid routing framework, using Event-B. We develop the formal specification by the refinement mechanism. It allows us to gradually model the network environment, the construction of routing zones, route discovery based on bordercasting service and routing update. We prove the stabilization property in the inactive environment. In addition, we demonstrate that discovered routes hold the loop freedom and validity in each reachable system state. To present that the formalization is consistent with the informally expressed requirements, we adopt an animator, ProB, to validate our model. Our work provides reference to analyze extensions of the ZRP and other hybrid routing protocols.

A Meshed Tree Protocol for Loop Avoidance in Switched Networks

Abstract: Switched networks use meshed topologies. Loop avoidance is essential in these networks to avoid broadcast storms. Logical Spanning Trees are constructed on the physical meshed topologies to address the broadcast storm problem. However, during topology changes, networks take time to re-converge and identify new spanning tree paths for frame forwarding. Link State routing was introduced to speed up convergence and reduce convergence delays on root failures experienced with spanning tree protocols (STP). Meshed Tree algorithms (MTA) offer a new approach. They support multiple tree branches from a single root to cut down convergence delays on link failures. Multi Meshed Tree algorithm an enhancement to MTA supports multiple roots each with its own meshed trees. A Meshed Tree Protocol (MTP) based on MTA is currently under development as an IEEE standard. In this article, MTP is evaluated for convergence delay in comparison with Rapid STP.

Infrastructure-aided hybrid routing in CR-VANETs using a Bayesian Model

Abstract: With long delays due to sporadic routing links in cognitive vehicular communications systems, relay node selection is one of the key design factors, as it significantly improves end-to-end delay, thereby improving overall network performance. To this end, we propose infrastructure-aided hybrid routing that uses a roadside unit (RSU) to help vehicular nodes to select idle channels and relay nodes. Channel selection is done with a belief propagation algorithm, which aggregates individual beliefs with the help of vehicles and RSUs to make a final belief, providing high accuracy in hypotheses about spectrum availability. The selection of a relay node is determined by calculating the message delivery time—the source/relay node selects the one that has the minimum message delivery time from among all the neighboring nodes. This is a hybrid (vehicle-to-vehicle and vehicle-to-RSU) communications scheme where two nodes can communicate only when they have consensus about a common idle channel. The idea is to combine cognitive capabilities with a routing technique in order to simultaneously overcome spectrum scarcity and network connectivity issues. Therefore, both dense and sparse network conditions are considered in this routing protocol for both highway and city scenarios. To enhance the stability of cognitive routing links, different functions for vehicles and RSUs are considered. We prove better performance in delay, delivery ratio, and overhead by comparing the proposed technique with two existing techniques (one dealing with, and another without, RSUs).

Driving Path Stability in VANETs

Abstract: Vehicular Ad Hoc Network has attracted both research and industrial community due to its benefits in facilitating human life and enhancing the security and comfort. However, various issues have been faced in such networks such as information security, routing reliability, dynamic high mobility of vehicles, that influence the stability of communication. To overcome this issue, it is necessary to increase the routing protocols performances, by keeping only the stable path during the communication. The effective solutions that have been investigated in the literature are based on the link prediction to avoid broken links. In this paper, we propose a new solution based on machine learning concept for link prediction, using LR and Support Vector Regression (SVR) which is a variant of the Support Vector Machine (SVM) algorithm. SVR allows predicting the movements of the vehicles in the network which gives us a decision for the link state at a future time. We study the performance of SVR by comparing the generated prediction values against real movement traces of different vehicles in various mobility scenarios, and to show the effectiveness of the proposed method, we calculate the error rate. Finally, we compare this new SVR method with Lagrange interpolation solution.

MPR selection to the OLSR quality of service in MANET using minmax algorithm

Abstract: Optimized link state routing (OLSR) is a routing protocol that has a small delay, low traffic control, support the application of denser networks, and adopts the concept of multipoint relays (MPR). The problem of OLSR is routing table updating which continually causes excessive packet delivery, and energy consumption becomes increased. This article proposes the improvement of OLSR performance using the min-max algorithm based on the quality of service (QoS) with considering the density of the node. The Min-max algorithm works in selecting MPR nodes based on the largest signal range. The QoS parameters analyzed with a different number of nodes are packet delivery ratio (PDR), throughput, delay, energy consumption, and topology control (TC). Simulation result of network simulator version 2 (NS-2) shows that OLSR performance using the min-max algorithm can increase PDR of 91.17%, packet loss of 60.77% and reduce topology control packet of 8.07%, energy consumption of 16.82% compared with standard OLSR.

Secure opportunistic routing protocols: methods, models, and classification

Abstract: Addressing communication reliability and security has always been of significant importance in wireless networks. Opportunistic routing (OR) protocols comprise a promising area of research that aims to improve the reliability of communications, particularly in lossy networks. The main concept behind OR protocols is to utilize the broadcast nature of the wireless medium and determine a group of neighboring node candidates, known as candidate set, to collaboratively forward packets towards the destination using a candidate coordination approach. However, similar to traditional routing protocols, OR protocols operate poorly in the presence of malicious nodes and attackers. Therefore, researchers have designed and developed a number of security enhancements, considering the specific characteristics of such protocols. In this paper, following a brief overview on OR protocols, we examine, classify, and compare the different categories of security approaches proposed for OR protocols. More precisely, we divide security-related OR protocols into three categories, including trust-based approaches, game-theory-oriented solutions, and other related protocols. Furthermore, the most significant algorithms of each category are investigated as case studies. Finally, a comparison of different protocols is presented considering the main features, advantages, and shortcomings of each protocol.