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

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.

Mobility, Residual Energy, and Link Quality Aware Multipath Routing in MANETs with Q-learning Algorithm

Abstract: To facilitate connectivity to the internet, the easiest way to establish communication infrastructure in areas affected by natural disaster and in remote locations with intermittent cellular services and/or lack of Wi-Fi coverage is to deploy an end-to-end connection over Mobile Ad-hoc Networks (MANETs). However, the potentials of MANETs are yet to be fully realized as existing MANETs routing protocols still suffer some major technical drawback in the areas of mobility, link quality, and battery constraint of mobile nodes between the overlay connections. To address these problems, a routing scheme named Mobility, Residual energy and Link quality Aware Multipath (MRLAM) is proposed for routing in MANETs. The proposed scheme makes routing decisions by determining the optimal route with energy efficient nodes to maintain the stability, reliability, and lifetime of the network over a sustained period of time. The MRLAM scheme uses a Q-Learning algorithm for the selection of optimal intermediate nodes based on the available status of energy level, mobility, and link quality parameters, and then provides positive and negative reward values accordingly. The proposed routing scheme reduces energy cost by 33% and 23%, end to end delay by 15% and 10%, packet loss ratio by 30.76% and 24.59%, and convergence time by 16.49% and 11.34% approximately, compared with other well-known routing schemes such as Multipath Optimized Link State Routing protocol (MP-OLSR) and MP-OLSRv2, respectively. Overall, the acquired results indicate that the proposed MRLAM routing scheme significantly improves the overall performance of the network.

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.

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.

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.

New NSGA-II-based OLSR self-organized routing protocol for mobile ad hoc networks

Abstract: The problem of routing in ad hoc networks, in particular proactive routing, has attracted the attention of many researchers. Although the protocols proposed in the literature present some relevant characteristics, they also have their limitations, especially in terms of high number of mobile nodes or in terms of high number of load-dependent parameters of the ad hoc network which are often chosen intuitively by a seasoned expert. This paper describes our work to solve this difficult task using a multi-objective genetic algorithm to automate the selection process of the routing protocol parameters. The realized experiments showed the effectiveness of the proposed NGSA-II-OLSR compared to the original OLSR. In case of low node mobility, the proposed NSGA-II-OLSR improves the PLR between 8.59 and 33.17%; the E2ED between 18.17 and 27.56%; and the NRL between 35.18 and 36.60%. While in case of high mobility node, it improves the PLR between 3.47 and 9.94%; the E2ED between 1.47 and 9.40%; and the NRL between 0.14 and 2.34%. In addition, the algorithm can adapt the ad hoc network to each topology change which makes it adaptive to any environment changing.

Network bottlenecks in OLSR based ad-hoc networks

Abstract: All nefarious players must be able to maximize profit on an attack. In the context of communication networks, part of that need translates to finding the best topological location for the attack. While in static networks this is an easily solvable problem, in mobile ad-hoc networks (manet ) having constant topology fluctuations, this becomes a formidable task. Highly important asset nodes are those having numerous paths traversing through them, with bottlenecks being nodes that all data must pass through. Once such nodes are compromised, the damage can be catastrophic. Hence, network defenders must also find these nodes so they can be better protected. In this paper we propose a method that ensures finding such bottleneck nodes (assuming one exists) in olsr based manet , with linear cost. This is accomplished without adding overhead on the network. We experiment and compare, using network simulation tools, multiple types of attackers over a diverse set of topologies.

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 Novel Fog Computing Based Architecture to Improve the Performance in Content Delivery Networks

Abstract: Along with the continuing evolution of the Internet and its applications, Content Delivery Networks (CDNs) have become a hot topic with both opportunities and challenges. CDNs were mainly proposed to solve content availability and download time issues by delivering content through edge cache servers deployed around the world. In our previous work, we presented a novel CDN architecture based on a Fog computing environment as a promising solution for real-time applications. In such architecture, we proposed to use a name-based routing protocol following the Information Centric Networking (ICN) approach, with a popularity-based caching strategy to guarantee overall delivery performance. To validate our design principle, we have implemented the proposed Fog-based CDN architecture with its major protocol components and evaluated its performance, as shown through this article. On the one hand, we have extended the Optimized Link-State Routing (OLSR) protocol to be content aware (CA-OLSR), i.e., so that it uses content names as routing labels. Then, we have integrated CA-OLSR with the popularity-based caching strategy, which caches only the most popular content (MPC). On the other hand, we have considered two similar architectures for conducting performance comparative studies. The first is pure Fog-based CDN implemented by the original OLSR (IP-based routing) protocol along with the default caching strategy. The second is a classical cloud-based CDN implemented by the original OLSR. Through extensive simulation experiments, we have shown that our Fog-based CDN architecture outperforms the other compared architectures. CA-OLSR achieves the highest packet delivery ratio (PDR) and the lowest delay for all simulated numbers of connected users. Furthermore, the MPC caching strategy shows higher cache hit rates with fewer numbers of caching operations compared to the existing default caching strategy, which caches all the pass-by content.

Investigating the Impact of Mobility Models on MANET Routing Protocols

Abstract: A mobile ad hoc network (MANET) is a type of multi-hop network under different movement patterns without requiring any fixed infrastructure or centralized control. The mobile nodes in this network moves arbitrarily and topology changes frequently. In MANET routing, protocols play an important role to make reliable communication between nodes. There are several issues affecting the performance of MANET routing protocols. Mobility is one of the most significant factors that has an impact on the routing process. In this paper, FCM, SCM, RWM and HWM mobility models are designed to analyze the performance of AODV, OLSR and GRP protocols, with ten pause time values. These models are based on varying speeds and pause time of MANET participants. Different node parameters such as data drop rate, average end-to-end delay, media access delay, network load, retransmission attempts and throughput are used to make a performance comparison between mobility models. The simulation results showed that in most of the cases OLSR protocol provides better performance than other two routing protocols and it is more suitable for networks that require low delay and retransmission attempts, and high throughput.

Hybrid SDN Control in Mobile Ad Hoc Networks

Abstract: Software defined networking (SDN) can be beneficial in mobile ad hoc networks (MANETs) to increase flexibility, provide programmability and simplify management. The high dynamics in mobile networks, however, raise new reliability challenges to the conventional centralized control plane of SDN. To increase reliability, methods such as placing multiple controllers in the network have been considered that add redundancy in the control plane in a brute force manner. However, these methods cannot by themselves fundamentally solve the reliability problem. To address this issue, this paper complements the controller placement methods with a new architecture that has a hybrid structure splitting the routing decision logic between the controllers and the data plane nodes. Specifically, the controllers can break the routing path into segments, similar to the segment routing technique, and broadcast the list of segment labels to the data plane nodes. The latter are able to make the actual forwarding decisions for each segment in a distributed manner, e.g., by running an existing MANET protocol like OLSR. Experiments on a testbed built from commercial mobile devices with integrated SDN functionality highlight the feasibility and benefits of the proposed architecture.

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.

A 3D Smooth Random Walk Mobility Model for FANETs

Abstract: The number of Unmanned Aerial Vehicles (UAVs) applications has increased over the past few years. Among all scenarios, UAV group consisting multi-UAVs is normally used to provide extensible communications. As a networking solution, Flying Ad Hoc Networks (FANETs) routing with ideal routing performance is the prerequisite of the multi-UAV application. Regarding the high construction cost of devices for FANETs, it is infeasible to build the real experimental environment, hundreds of UAVs are needed. In this case, network simulation is the most common mean to study FANETs in most cases. For FANETs, the mobility of UAV nodes has an important impact on the simulation results. Thus, a mobility model which can fit into specific environments well is necessary. Traditional mobility models of FANETs are mainly designed for planar scenarios without considering the actual application of FANETs which is three-dimensional (3D). Therefore, in this paper, firstly, the characteristics of UAVs is analyzed and then the key points of 3D mobility model for FANETs are presented. In this context, we propose a 3D Smooth Random Walk (3DSRW) mobility model, which intends to mimic the mobility of UAVs to the greatest extent. Then, we conduct simulations to get the network performance of AODV to verify the performance gap between 2D and 3D environment, in order to demonstrate the validity of our proposal. To further present the usage of our proposal, we show the performance of four routing protocols, including AODV, DSDV, OLSR and GPSR under the 3DSRW-constucted 3D environment, and analyzed their applicability in 3D environment.

Evaluation of Parameters Affecting the Performance of Routing Protocols in Mobile Ad Hoc Networks (MANETs) with a Focus on Energy Efficiency

Abstract: This paper provides a comprehensive evaluation and analysis of two classes of routing protocols optimized for MANETs: reactive (DSR, AODV), and proactive (DSDV, OLSR). These protocols are particularly designed for the dynamic nature of MANETs where nodes actively move, connections between nodes are regularly broken, and paths need to be reconstructed. MANETs are used in a wide range of applications including rescue operations, military areas, and oceanography. However, the nodes have limited batteries, and typically, it is not applicable or cost effective to replace the batteries of nodes. Other than the dynamic nature of these networks, which leads to more processing and rerouting requirements, the movements also speed up the batteries’ depletions. Thus, the energy efficiency of routing protocols significantly affects the performance of these networks. In this research, we study the two classes of routing protocols in MANETs, investigate the effect of several parameters on the network performance through excessive simulations, and analyze how the variations of these parameters affect the performance. We evaluate the network performance in terms of energy consumption, routing overhead and Quality of Service metrics including throughput and delay.

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.

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.

A distributed coalition game model for cooperation in MANETs

Abstract: In ad hoc networks, cooperation is necessary to counteract the effect of nodes that may act selfishly to preserve their limited energy resources. Factors like transmit power, environmental obstruction, mobility, and even malicious behavior can determine the topology of an ad hoc network and may hinder cooperation. In this paper, we propose a coalition game model for cooperation in mobile ad hoc networks (MANETs) that aims to mitigate the negative impact of topology changes on node cooperation through coalition formation. Reachability is used as the base for payoff in the proposed model. The proposed approach is implemented and simulated as an integral module of a MANET routing protocol, OLSR, for a realistic assessment in a distributed environment. We simulate MANETs with fully functional network stack under different node densities, speeds, and network sizes. We use end-to-end metrics to evaluate the integrated system, mainly control overhead and packet deliverability. Our results show scalability of the cooperation mechanism with a significant improvement in packet deliverability and control overhead in a wide range of network scenarios. Our study also confirms our findings published in a former preliminary study that the coalition structure is sustainable against the effect of mobility.

Research on OLSR Adaptive Routing Strategy Based on Dynamic Topology of UANET

Abstract: The unmanned aerial vehicles (UAVs) in modern military warfare can form an intelligence communication network to monitor, chase and surround targets. However, the network performance of UAVs is highly susceptible to the fast transformation of network topology in the battlefield environment. This paper designs and implements the new OLSR protocol based on dynamic topology (DT-OLSR) for UAV Ad-hoc network (UANET). It dynamically adjusts the broadcast period of Hello messages according to changes in network topology (such as node leaving or joining). Through the experiment and comparison of the Exata and Matlab simulation platform, the network performance of DT-OLSR is better and more stable than the original OLSR. Meanwhile, the routing strategy can truly reflect the improvement effect of network performance when the routing parameters are reasonably set.

A Strategic Routing Analysis for Agro Sensor Communications in Mobile Ad hoc Networks

Abstract: Recently, agro sensor communications are getting popularity with the advent of wireless sensor networks (WSNs) and mobile ad hoc networks (MANETs). Infrastructure less MANETs are considered as a potential solution for agricultural domains to provide robust and effective operations in wireless networks by enabling routing characteristics at each mobile node. The efficient use of routing protocol is pivotal for network management in MANETs. In this research, we demonstrate a strategic routing analysis to evaluate the performance of different routing protocols, e.g., proactive and reactive in terms of various network quality of service (QoS) parameters for multiple data rate enabled agro sensor mobile nodes. Two different network scenarios (low-node and high-node) are simulated for various network parameters. Simulation results indicate that OLSR protocol provides higher throughput than others for all nodes. This investigation also shows that GRP has the highest network load capacity than other protocols for agro sensor applications. Another finding from this research i s t hat proactive protocols have the lower average end to end delay and MAC delay than reactive protocols.

Multi Objective ALO Based Energy Efficient and Secure Routing OLSR Protocol in MANET

Abstract: The routing protocol design with security and energy efficiency is a challenging task in mobile ad hoc network (MANET). To overcome this challenge, we propose an energy-efficient secured routing protocol. The objective of our work is to provide a secured routing protocol, which is energy efficient. To provide security the proposed technique allows each communicating node to monitor reputation factor, suspicion factor and contingency of threat to compute the degree of its vulnerability. The energy efficiency in optimized link state routing (OLSR) routing protocol is increased by generating new parameters and considering the energy of nodes. Based on the energy efficiency and security parameters the optimal route (multipoint relay) was selected. This approach uses less energy and secured compared to other energy models. The simulation result exhibits that the proposed multi objective Ant Lion Optimizer (MOALO) outperforms other state of art with respect to the performance metrics like energy consumption, Delay, throughput and network lifetime.

Performance Evaluation of OLSR and AODV Routing Protocols over Mobile Ad-hoc Networks

Abstract: Mobile Ad hoc Network (MANET) is a form of wireless network that does not need a centralized system to communicate with nodes. MANET's nodes are self-organized and designed where each mobile node can be a sender, forwarder or receiver. However, the dynamic topology and mobility of nodes make the routing of data between nodes a challenge. Through the last two decades, the researchers developed many routing protocols that have various characteristics. Because of their popularity among MANET protocols, this paper evaluates OLSR and AODV routing protocols in wide range of scenarios over NS2, this under various number of nodes, various node speed, and various data rate. After the results obtained from the simulation are analyzed, OLSR gives better performance in term of average end to end delay which make it suitable for delay sensitive applications. On the other hand, AODV outperforms in terms of throughput and packet delivery ratio which is suitable for throughput-based applications.

Analyzing the Performances of WSNs Routing Protocols in Grid-Based Clustering

Abstract: Nowadays wireless sensor networks (WSNs) became a modern research theme owing to the various applications range in assorted fields. Clustering considered from the more efficient techniques for solving the WSN drawbacks of energy consumption. The grid-based cluster has definitely done its effectiveness, especially for networks with high dynamic, all nodes in the clusters represented and the values of data are collected from sensor nodes by the cluster head (CH). For balancing the energy consumption with network traffic, the (CH) must be exchanged between all sensor nodes and the cluster size ought to be closely determined at different network parts. The most important issues for WSN is developing an energy-efficient algorithm by Grid-based clustering for improving the network lifetime, reduced cost, and increasing the network reliability. The equipment of the sensor nodes attached with limited power sources, the Grid-Based Clustering algorithm (GBC), therefore efficiently employing the energy of the sensor nodes can preserve a prolongation of the network lifetime. The network Performances of the sensor node are largely based on the application of the routing protocols, three routing protocols OLSR, AODV, and DSR in grid-based cluster WSN are evaluated by using Qualnet simulator. The results show DSR outperforms in the range of throughput, and end to end delay, while the AODV can be considered as the best in the package delivery ratio PDR with compared to others.

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.

Firmly Fixed Route Selection With Cluster Approach To Diminish Overhead In VANET

Abstract: Vehicular ad hoc networks (VANETs) are a promising innovation to empower the correspondences among vehicles and among vehicles and street/road side units (RSU). Another calculation to develop Stable clusters is acquainted with perform cluster based directing (CBR) and to improve the presentation of VANETs. The steady bunching calculation cluster the hubs dependent on the position and course data to frame stable groups and chooses cluster head dependent on a multi-metric calculation. This strategy decreases the overhead of re-clustering and lead to a productive progressive system topology. The proposed framework is assessed utilizing simulation software NS2 (Network simulation 2). The presentation parameters incorporate throughput, end to end delay and normal cluster change per vehicle. Simulation results uncover that there is increment in throughput, and decrease in propagation delay and normal cluster change per vehicle. VANET is considers as a self sorted out type of MANET. It is not quite the same as MANET by fast topology change, visit interface disappointment and so forth. The primary disadvantage is VANET is organizing flimsiness. In these primarily two unique conventions is being utilized to diminish the system in solidness. To improve the exhibition of the bunch CBLTR, OLSR are utilized as a routing convention.

Data Dissemination of Vehicular Ad-Hoc Network in Highway Scenario

Abstract: Vehicular Ad Hoc Networks (VANETs) have emerged as an exciting research and application area. Increasingly vehicles are being equipped with embedded sensors, processing and wireless communication capabilities. This has opened major possibilities for powerful and potential life-changing applications on safety, efficiency, comfort, public collaboration and participation, while they are on the road. The high mobility of vehicles during the road time is a very important issue to be studied and used in VANETs design in order to have high reliability and data exchange during moving. In this paper, several types of routing protocols are used in order to study the effect of routing protocol for data dissemination in VANET which is the process of distributing a certain amount of information to the users such as vehicle drivers or mobile users especially in wireless networks by simulating the Packet Delivery Ratio (PDR) and Routing load for different number of network densities. The simulation results for the PDR performance say that the Optimized Link State Routing Protocol (OLSR) routing protocol is totally unsuitable for gives high PDR ratio especially in the case of higher percent of communication pairs in networks, where no more than 35% of data packets delivered successfully. Also the results show that the Ad Hoc On-Demand Distance Vector (AODV) in general has higher routing request, especially for larger network size and higher percentage of communication pairs and the OLSR and Dynamic Source Routing (DSR) have a comparatively stable routing load overhead.