IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Performance Evalution of MANET Routing Protocols using Reference Point Group ...ijasuc
An ad hoc network is often defined as an “infrastructureless” network, meaning a network without the
usual routing infrastructure like fixed routers and routing backbones. Typically, the ad hoc nodes are
mobile and the underlying communication medium is wireless. Each ad hoc node may be capable of acting
as a router.it’s charactrizied by multihop wireless connection and frequently changing networks.we
compare the performance of on-demand routing protocols for mobile ad-hoc networks are distributed
cache updating for the dynamic source routing protocol(DSR) and ad hoc on-demand distance vector
routing (AODV).the simulation model of the medium access control(MAC) layer is evaluting the
performance of MANET protocols.DSR and AODV protocols share similar behavours.we evalute the
both on demand protocols DSR and AODV based on packet delivery ratio , packet delivery latency,mobility
variation with total number of errors, packet and normalized routing overhead,end-to-end delay by varying
in node density.the performance and characterictics are explained by the graph models.
A New Theoretical Approach to Location Based Power Aware RoutingIOSR Journals
This document proposes a new theoretical approach to location based power aware routing in mobile ad hoc networks (MANETs). It aims to extend the network lifetime by improving power utilization during routing. The approach uses nodes' location information, remaining battery power, and bandwidth status to assign link stability and select routes with lower "uptime values" and minimum bandwidth over time. This is hypothesized to better utilize nodes' power sources and bandwidth. The document outlines calculating a root up time factor for each node based on its power backup and required power, and only using nodes with maximum backup. It concludes future work will design and validate a new protocol based on this approach.
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRMIOSR Journals
This document proposes a modification to the Dynamic Source Routing (DSR) protocol called Modified DSR (MDSR) to reduce routing overhead caused by frequent link breakages in mobile ad hoc networks. MDSR adds a link breakage prediction algorithm that uses signal strength measurements to predict when a link may break. Intermediate nodes monitor signal strength and warn the source node if a link may soon break. This allows the source to proactively rebuild the route or switch to a backup route to avoid disconnection. Simulation results showed MDSR can reduce the number of dropped packets by at least 25% compared to standard DSR. The document also discusses how DSR works and the proposed proactive route maintenance concept in M
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
This document summarizes a simulation-based performance analysis of three routing protocols (CBRP, DSR, AODV) for mobile ad hoc networks (MANETs) under different node densities. The analysis varies the number of data sources and evaluates the protocols based on packet delivery ratio, average end-to-end delay, and normalized routing load. The simulation is conducted using the NS-2 network simulator for dense and sparse network topologies with 50 nodes each, varying node speeds and transmission ranges. Results show that CBRP performs better than DSR and AODV in terms of normalized routing load for more than 15 sources in both dense and sparse topologies, while AODV has lower delay than CBR
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity
Performance Evalution of MANET Routing Protocols using Reference Point Group ...ijasuc
An ad hoc network is often defined as an “infrastructureless” network, meaning a network without the
usual routing infrastructure like fixed routers and routing backbones. Typically, the ad hoc nodes are
mobile and the underlying communication medium is wireless. Each ad hoc node may be capable of acting
as a router.it’s charactrizied by multihop wireless connection and frequently changing networks.we
compare the performance of on-demand routing protocols for mobile ad-hoc networks are distributed
cache updating for the dynamic source routing protocol(DSR) and ad hoc on-demand distance vector
routing (AODV).the simulation model of the medium access control(MAC) layer is evaluting the
performance of MANET protocols.DSR and AODV protocols share similar behavours.we evalute the
both on demand protocols DSR and AODV based on packet delivery ratio , packet delivery latency,mobility
variation with total number of errors, packet and normalized routing overhead,end-to-end delay by varying
in node density.the performance and characterictics are explained by the graph models.
A New Theoretical Approach to Location Based Power Aware RoutingIOSR Journals
This document proposes a new theoretical approach to location based power aware routing in mobile ad hoc networks (MANETs). It aims to extend the network lifetime by improving power utilization during routing. The approach uses nodes' location information, remaining battery power, and bandwidth status to assign link stability and select routes with lower "uptime values" and minimum bandwidth over time. This is hypothesized to better utilize nodes' power sources and bandwidth. The document outlines calculating a root up time factor for each node based on its power backup and required power, and only using nodes with maximum backup. It concludes future work will design and validate a new protocol based on this approach.
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRMIOSR Journals
This document proposes a modification to the Dynamic Source Routing (DSR) protocol called Modified DSR (MDSR) to reduce routing overhead caused by frequent link breakages in mobile ad hoc networks. MDSR adds a link breakage prediction algorithm that uses signal strength measurements to predict when a link may break. Intermediate nodes monitor signal strength and warn the source node if a link may soon break. This allows the source to proactively rebuild the route or switch to a backup route to avoid disconnection. Simulation results showed MDSR can reduce the number of dropped packets by at least 25% compared to standard DSR. The document also discusses how DSR works and the proposed proactive route maintenance concept in M
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
This document summarizes a simulation-based performance analysis of three routing protocols (CBRP, DSR, AODV) for mobile ad hoc networks (MANETs) under different node densities. The analysis varies the number of data sources and evaluates the protocols based on packet delivery ratio, average end-to-end delay, and normalized routing load. The simulation is conducted using the NS-2 network simulator for dense and sparse network topologies with 50 nodes each, varying node speeds and transmission ranges. Results show that CBRP performs better than DSR and AODV in terms of normalized routing load for more than 15 sources in both dense and sparse topologies, while AODV has lower delay than CBR
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self-administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction normalized routing load, average end to end delay by varying speed of nodes, traffic sources and mobility.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This document summarizes a research paper on load balancing protocols in mobile ad hoc networks (MANETs). It begins with an abstract of the paper and introduces MANETs and the importance of load balancing in them given nodes' limited resources. It then discusses various load metrics and load balancing routing protocols. Specific protocols covered include Ad Hoc On-Demand Distance Vector (AODV), Ad hoc On-Demand Multipath Distance Vector (AOMDV), and Scalable Multipath On-Demand Routing (SMORT). AOMDV and SMORT aim to compute multiple loop-free paths during route discovery to help balance traffic load across multiple paths. The document concludes that load balanced routing protocols use different metrics to select routes
This document summarizes and compares two routing protocols for wireless ad hoc networks: Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV). It provides an overview of how each protocol functions, specifically noting that DSR uses source routing while AODV uses a table-driven approach with destination sequence numbers. It then discusses the motivation and goals for evaluating the performance and differences between the two protocols using network simulations.
E-Lins Technology provides an insight on routing. E-Lins Technology are the manufacturers and providers of the one of the best 3G/4G routers across the globe.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETspijans
This document summarizes and surveys several enhanced routing protocols that have been developed for mobile ad hoc networks (MANETs). It begins by providing background on routing challenges in MANETs and classifications of routing protocols. It then describes several traditional and widely used routing protocols, including DSDV, OLSR, TORA, DSR, and AODV. The document focuses on summarizing several new routing protocols that have been proposed to improve upon existing protocols. It discusses protocols such as BAWB-DSR, CCSR, RAMP, AODV-SBA, CBRP-R, and CBTRP - noting techniques, advantages, and disadvantages of each. The overall purpose is to review
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
This document compares the performance of four routing protocols (AODV, DSR, OLSR, GRP) under the security attack of node misbehavior in mobile ad hoc networks (MANETs). The document presents background information on MANETs and the four routing protocols. It then discusses two types of misbehaving nodes (partially selfish and fully selfish) that are modeled in simulations. The simulations vary the percentage of misbehaving nodes and measure performance metrics like packet delivery ratio, end-to-end delay, data dropped, and load. The results show that packet delivery ratio decreases and data dropped increases as the percentage of misbehaving nodes increases for all protocols. OLSR generally has the lowest delay while
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
Secured Preemptive DSR(S-PDSR): An integration of SRP and SMT with Preemptive...ijasuc
This document proposes enhancements to Preemptive DSR (PDSR) called Secured Preemptive DSR (S-PDSR) to provide secured route discovery in mobile ad hoc networks. S-PDSR integrates the Secured Routing Protocol (SRP) and Secured Message Transmission (SMT) with PDSR. PDSR is an on-demand routing protocol that discovers multiple routes to allow for secured data transmission. The proposed S-PDSR protocol exploits this feature of PDSR to incorporate SRP for secured route discovery and allow SMT to use the multiple routes to ensure secure data transmission.
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
This document summarizes a research paper that proposes a new hybrid multipath routing protocol for mobile ad hoc networks called Hybrid Multipath Progressive Routing Protocol (HMPRP). It improves upon existing routing protocols like AODV and OLSR by utilizing multiple paths based on received signal strength to increase packet delivery and reduce overhead. Simulation results showed the proposed protocol achieved better performance than AODV, OLSR and ZRP in terms of packet delivery ratio, throughput, energy consumption and delay.
Shortest Tree Routing With Security In Wireless Sensor NetworksIJERA Editor
We propose STR to resolve the main reasons of overall network performance degradation of ZTR, which are the detour path problem and the traffic concentration problem. Second, we prove that the 1-hop neighbor nodes used by STR improve the routing path efficiency and alleviate the traffic load concentrated on tree links in ZTR. Third, we analyze the performance of ZTR, STR, and AODV by differentiating the network conditions such as network density, ZigBee network constraints, traffic types, and the network traffic. For modification security purpose we are also encrypting the data packets during transmission. So that the intermediate nodes are not able to view the data during transmission. For Encryption process, we are using RC4 Algorithm. Short cut tree routing is used for minimizing the routing path from source to destination.
Gateway Forwarding Schemes For Manet-Internet Connectivityijsrd.com
In the real world one of the most important challenge for the broad implementation of mobile ad hoc network (MANET) technology is the finding way to capably interconnect them with the Internet. Yet, such interconnections are very difficult due to differences in mobility, addressing and routing between MANETs and reside IP networks. Imprecise address and routing techniques are hard to integrate. In this paper we propose the half tunnels as a powerful transition technique to integrate various networks. In this paper, we will also discuss some existing solutions like default routes host route etc to interconnect MANETs with the Internet, but on analysis we find them lacking in robustness and flexibility. For example, many solutions do not consider the presence of multiple gateways, and in such scenarios they either fail, or are less efficient due to the lack of multi-homing capabilities.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field
free for the nodes to move. The most important aspect of this kind of network turns into a great
disadvantage when it comes to commercial applications, take as an example: the automotive
networks that allow communication between a groups of vehicles. The ad hoc on-demand
distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main
functions. First, it enables route establishment between a source and a destination node by
initiating a route discovery process. Second, it maintains the active routes, which means finding
alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and
accurately. In this paper, we focused in the first point to enhance the local decision of each node
in the network by the quantification of the mobility of their neighbours. Quantification is made
around RSSI algorithm a well known distance estimation method.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This document discusses software security metrics and validating UML diagrams using metrics. It provides background on using metrics to measure quality attributes of object-oriented designs. Traditional code-level security metrics are insufficient and evaluating security at the design level is important. The paper proposes a system that applies design-level security metrics using genetic algorithms to generate secure design options from a UML diagram. It then implements code from the designs and applies the same metrics at the code level to validate that the code matches the intended secure design. This allows discovering and fixing security issues earlier in the development process.
This document summarizes a research paper that proposes using a genetic algorithm to generate high-quality association rules for measuring data quality. The genetic algorithm evaluates rules based on four metrics: confidence, completeness, comprehensibility, and interestingness. It aims to discover high-level prediction rules that perform better than traditional greedy rule induction algorithms at handling attribute interactions. The genetic algorithm represents rules as chromosomes and uses the four metrics as an objective fitness function to evaluate the quality of each rule.
This document discusses the performance analysis and minimization of black hole attacks in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and discusses how they are vulnerable to black hole attacks. The document then describes the AODV routing protocol and how black hole attacks exploit vulnerabilities in the route discovery process. Existing detection and prevention techniques are outlined. The document proposes modifying the AODV protocol to implement an intrusion detection system (IDSAODV) that can detect and discard fraudulent route replies from black hole nodes, improving packet delivery. Simulation scenarios of varying node counts with and without black holes are used to analyze black hole behavior and evaluate the effectiveness of the IDSAODV approach.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This document summarizes and compares four routing algorithms for mobile ad hoc networks: Disjoint Multipath Routing, Trust based Multipath Routing, Message Trust based Multipath Routing, and a new proposed algorithm called Friend Based Ad-hoc Routing. It describes the key mechanisms of each algorithm, including how they establish routes, incorporate trust levels, and handle packet routing. The proposed FACES algorithm aims to improve security and efficiency by using friend, unauthenticated, and question mark lists to identify trusted routes and avoid malicious nodes.
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self-administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction normalized routing load, average end to end delay by varying speed of nodes, traffic sources and mobility.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This document summarizes a research paper on load balancing protocols in mobile ad hoc networks (MANETs). It begins with an abstract of the paper and introduces MANETs and the importance of load balancing in them given nodes' limited resources. It then discusses various load metrics and load balancing routing protocols. Specific protocols covered include Ad Hoc On-Demand Distance Vector (AODV), Ad hoc On-Demand Multipath Distance Vector (AOMDV), and Scalable Multipath On-Demand Routing (SMORT). AOMDV and SMORT aim to compute multiple loop-free paths during route discovery to help balance traffic load across multiple paths. The document concludes that load balanced routing protocols use different metrics to select routes
This document summarizes and compares two routing protocols for wireless ad hoc networks: Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV). It provides an overview of how each protocol functions, specifically noting that DSR uses source routing while AODV uses a table-driven approach with destination sequence numbers. It then discusses the motivation and goals for evaluating the performance and differences between the two protocols using network simulations.
E-Lins Technology provides an insight on routing. E-Lins Technology are the manufacturers and providers of the one of the best 3G/4G routers across the globe.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETspijans
This document summarizes and surveys several enhanced routing protocols that have been developed for mobile ad hoc networks (MANETs). It begins by providing background on routing challenges in MANETs and classifications of routing protocols. It then describes several traditional and widely used routing protocols, including DSDV, OLSR, TORA, DSR, and AODV. The document focuses on summarizing several new routing protocols that have been proposed to improve upon existing protocols. It discusses protocols such as BAWB-DSR, CCSR, RAMP, AODV-SBA, CBRP-R, and CBTRP - noting techniques, advantages, and disadvantages of each. The overall purpose is to review
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
This document compares the performance of four routing protocols (AODV, DSR, OLSR, GRP) under the security attack of node misbehavior in mobile ad hoc networks (MANETs). The document presents background information on MANETs and the four routing protocols. It then discusses two types of misbehaving nodes (partially selfish and fully selfish) that are modeled in simulations. The simulations vary the percentage of misbehaving nodes and measure performance metrics like packet delivery ratio, end-to-end delay, data dropped, and load. The results show that packet delivery ratio decreases and data dropped increases as the percentage of misbehaving nodes increases for all protocols. OLSR generally has the lowest delay while
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
Secured Preemptive DSR(S-PDSR): An integration of SRP and SMT with Preemptive...ijasuc
This document proposes enhancements to Preemptive DSR (PDSR) called Secured Preemptive DSR (S-PDSR) to provide secured route discovery in mobile ad hoc networks. S-PDSR integrates the Secured Routing Protocol (SRP) and Secured Message Transmission (SMT) with PDSR. PDSR is an on-demand routing protocol that discovers multiple routes to allow for secured data transmission. The proposed S-PDSR protocol exploits this feature of PDSR to incorporate SRP for secured route discovery and allow SMT to use the multiple routes to ensure secure data transmission.
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
This document summarizes a research paper that proposes a new hybrid multipath routing protocol for mobile ad hoc networks called Hybrid Multipath Progressive Routing Protocol (HMPRP). It improves upon existing routing protocols like AODV and OLSR by utilizing multiple paths based on received signal strength to increase packet delivery and reduce overhead. Simulation results showed the proposed protocol achieved better performance than AODV, OLSR and ZRP in terms of packet delivery ratio, throughput, energy consumption and delay.
Shortest Tree Routing With Security In Wireless Sensor NetworksIJERA Editor
We propose STR to resolve the main reasons of overall network performance degradation of ZTR, which are the detour path problem and the traffic concentration problem. Second, we prove that the 1-hop neighbor nodes used by STR improve the routing path efficiency and alleviate the traffic load concentrated on tree links in ZTR. Third, we analyze the performance of ZTR, STR, and AODV by differentiating the network conditions such as network density, ZigBee network constraints, traffic types, and the network traffic. For modification security purpose we are also encrypting the data packets during transmission. So that the intermediate nodes are not able to view the data during transmission. For Encryption process, we are using RC4 Algorithm. Short cut tree routing is used for minimizing the routing path from source to destination.
Gateway Forwarding Schemes For Manet-Internet Connectivityijsrd.com
In the real world one of the most important challenge for the broad implementation of mobile ad hoc network (MANET) technology is the finding way to capably interconnect them with the Internet. Yet, such interconnections are very difficult due to differences in mobility, addressing and routing between MANETs and reside IP networks. Imprecise address and routing techniques are hard to integrate. In this paper we propose the half tunnels as a powerful transition technique to integrate various networks. In this paper, we will also discuss some existing solutions like default routes host route etc to interconnect MANETs with the Internet, but on analysis we find them lacking in robustness and flexibility. For example, many solutions do not consider the presence of multiple gateways, and in such scenarios they either fail, or are less efficient due to the lack of multi-homing capabilities.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field
free for the nodes to move. The most important aspect of this kind of network turns into a great
disadvantage when it comes to commercial applications, take as an example: the automotive
networks that allow communication between a groups of vehicles. The ad hoc on-demand
distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main
functions. First, it enables route establishment between a source and a destination node by
initiating a route discovery process. Second, it maintains the active routes, which means finding
alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and
accurately. In this paper, we focused in the first point to enhance the local decision of each node
in the network by the quantification of the mobility of their neighbours. Quantification is made
around RSSI algorithm a well known distance estimation method.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This document discusses software security metrics and validating UML diagrams using metrics. It provides background on using metrics to measure quality attributes of object-oriented designs. Traditional code-level security metrics are insufficient and evaluating security at the design level is important. The paper proposes a system that applies design-level security metrics using genetic algorithms to generate secure design options from a UML diagram. It then implements code from the designs and applies the same metrics at the code level to validate that the code matches the intended secure design. This allows discovering and fixing security issues earlier in the development process.
This document summarizes a research paper that proposes using a genetic algorithm to generate high-quality association rules for measuring data quality. The genetic algorithm evaluates rules based on four metrics: confidence, completeness, comprehensibility, and interestingness. It aims to discover high-level prediction rules that perform better than traditional greedy rule induction algorithms at handling attribute interactions. The genetic algorithm represents rules as chromosomes and uses the four metrics as an objective fitness function to evaluate the quality of each rule.
This document discusses the performance analysis and minimization of black hole attacks in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and discusses how they are vulnerable to black hole attacks. The document then describes the AODV routing protocol and how black hole attacks exploit vulnerabilities in the route discovery process. Existing detection and prevention techniques are outlined. The document proposes modifying the AODV protocol to implement an intrusion detection system (IDSAODV) that can detect and discard fraudulent route replies from black hole nodes, improving packet delivery. Simulation scenarios of varying node counts with and without black holes are used to analyze black hole behavior and evaluate the effectiveness of the IDSAODV approach.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This document summarizes and compares four routing algorithms for mobile ad hoc networks: Disjoint Multipath Routing, Trust based Multipath Routing, Message Trust based Multipath Routing, and a new proposed algorithm called Friend Based Ad-hoc Routing. It describes the key mechanisms of each algorithm, including how they establish routes, incorporate trust levels, and handle packet routing. The proposed FACES algorithm aims to improve security and efficiency by using friend, unauthenticated, and question mark lists to identify trusted routes and avoid malicious nodes.
This document summarizes a research paper that proposes a machine learning approach for detecting phishing websites. It discusses using heuristic features from CANTINA to train machine learning models. A new domain top-page similarity feature is introduced to improve accuracy. Various modules are described, including site training, site capturing, a phishing dictionary, and image correlation to measure similarity. Experimental results show the approach achieves up to 92.5% f-measure and a 7.5% error rate for phishing detection.
The document proposes two new authentication schemes for PDAs that use session passwords. Session passwords are one-time passwords generated for each login. The first scheme generates passwords based on pairs of letters from a secret text password and their intersections on a grid. The second scheme has users rate colors during registration, and session passwords are generated by the intersections of those colors on a color grid and number grid displayed during login. Both schemes aim to be resistant to dictionary attacks, brute force attacks, and shoulder surfing by changing the grids each time. The techniques were proposed to provide authentication for PDAs but require further testing for usability and effectiveness.
This document describes the design and development of a microcontroller-based system for measuring blood glucose levels. The system uses an amperometric method that relies on glucose oxidase enzymes and a mediator compound to transfer electrons from blood glucose to an electrode, generating an electrical signal. A PIC 18F4520 microcontroller processes, amplifies and converts the signal to a display on an LCD module. The system is intended to be low-cost, portable, and provide frequent blood glucose monitoring to help control diabetes and reduce complications. It works by measuring the current produced from the reaction of blood glucose with glucose oxidase and a mediator compound.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
The document describes a genetic algorithm approach to optimizing the design of steel-concrete composite plane frames to minimize cost. The algorithm uses design variables like beam and column cross-sectional properties to represent potential solutions. It evaluates solutions based on structural analysis and design constraints like moments, shear, buckling and axial forces. The best solution from each generation is preserved to guide the evolution toward an optimal, cost-effective frame design. The approach is demonstrated on example frames.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
The document discusses the characterization and numerical optimization of chromium-free nickel alloy filler materials for dissimilar welding between stainless steel SS304. Eight alloys with compositions ranging from 40-43.5% Ni, 4-20% Mo, 0-16% Co, 10% Cu, 22-25% Fe, 0.5% Al, 1% Ti, and 0.001% C were analyzed. JMatPro software was used to simulate phases present at different temperatures. Welding simulations using ANSYS evaluated residual stresses in the welds. The alloy with 43.499% Ni, 0.5% Al, 14% Co, 6% Mo, 10% Cu, 23% Fe, 2% Mn, 1
This document presents a study on using color texture feature analysis to detect surface defects on pomegranates. The researchers developed a method involving cropping images of pomegranates, converting them to HSI color space, generating SGDM matrices to extract 18 texture features for each image, and using support vector machines (SVM) classification to identify the best features for detecting infections. The optimal features identified were cluster shade, product moment, and mean intensity, achieving classification accuracy of 99.88%, 99.88%, and 99.81% respectively.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Amith Xavier is seeking an opportunity to enhance his personal and professional values. He has over 8 years of experience in credit control, collections, and customer relationship management. His most recent role was with Travel Tours Pvt Ltd from 2011 to 2016 where he was responsible for credit control, collections, client relations, and analysis. Prior to that, he worked at Genpact from 2008 to 2010 as an accounts receivable credit collection executive where he achieved collection targets and drove improvements. He is proficient in MS Office, Oracle, and other systems.
A Survey of Enhanced Routing Protocols for Manetspijans
Mobile Ad Hoc Networks (MANETs) form a class of dynamic multi-hop networks consisting of a set of
mobile nodes that intercommunicate on shared wireless channels. MANETs are self-organizing and selfconfiguring multi-hop wireless networks, where the network structure changes dynamically due to the node
mobility. There exists no fixed topology due to the mobility of nodes, interference, multipath propagation
and path loss. Hence efficient dynamic routing protocols are required for these networks to function
properly. Many routing protocols have been developed to accomplish this task. In this paper we survey
various new routing protocols that have been developed as extensions or advanced versions of previously
existing routing protocols for MANETs such as DSR, AODV, OLSR etc.
This document summarizes a review article about energy efficient routing protocols in mobile ad hoc networks (MANETs). It discusses how MANETs use multi-hop wireless connections between mobile nodes without a fixed infrastructure. It then reviews several prominent routing protocols for MANETs, including reactive protocols like AODV and DSR, proactive protocols like DSDV and OLSR, and a hybrid protocol. Finally, it proposes a new energy-efficient clustering-based routing algorithm that selects cluster heads based on node mobility and battery power to improve path efficiency and stability in MANETs.
ENHANCEMENT OF OPTIMIZED LINKED STATE ROUTING PROTOCOL FOR ENERGY CONSERVATIONcscpconf
Mobile Ad-hoc network (MANET) is infrastructure less network in which nodes are mobile, self
reconfigurable, battery powered. As nodes in MANET are battery powered, energy saving is an
important issue. We are using routing protocol to save energy so as to extend network lifetime.
We have extended original Optimized Linked State Routing (OLSR) protocol by using two
algorithms and named it as Enhancement in OLSR using Residual Energy approach (EOLSRRE)
and Enhancement in OLSR using Energy Consumption approach (EOLSR-EC). To analyze
relative performance of modified protocol EOLSR-RE and EOLSR-EC over OLSR, we
performed various trials using Qualnet simulator. The performance of these routing protocols is
analyzed in terms of energy consumption, control overheads, end to end delay, packet delivery
ratio. The modified OLSR protocol improves energy efficiency of network by reducing 20 %
energy consumption and 50% control overheads.
This document analyzes and compares the scalability of three mobile ad hoc network (MANET) routing protocols - AODV, TORA, and OLSR - by simulating them using varying numbers of nodes. The key findings are:
1) In terms of end-to-end delay, OLSR consistently performs better than AODV and TORA as the number of nodes increases from 25 to 75.
2) For throughput, OLSR outperforms AODV and TORA across all network sizes tested.
3) The study concludes that OLSR demonstrates better scalability than AODV and TORA based on its performance with increasing numbers of nodes in terms of
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
The document evaluates the performance of 5 routing protocols (AODV, DSR, TORA, OLSR, GRP) in a mobile ad hoc network (MANET) using the OPNET simulator. Simulations were run with 30, 60, and 90 nodes using email and video conferencing applications. Performance was analyzed based on throughput, delay, load, and data dropped. In general, GRP and OLSR had the lowest delay, DSR and GRP had the lowest load, and OLSR and AODV had the highest throughput, while TORA often had the worst performance based on the metrics. The evaluation provides insights into the relative performance of the routing protocols under different conditions in a MANET
1) The document analyzes the performance of various routing protocols (AODV, DYMO, OLSR, ZRP, DSR, LAR1) in mobile ad hoc networks (MANETs) under different conditions like node speed and number of nodes.
2) Through simulation, it finds that reactive protocols like AODV and DYMO perform worse than proactive (OLSR) and hybrid (ZRP) protocols as node speed and number increase. DSR also degrades significantly with 100 nodes.
3) It concludes OLSR and ZRP have better performance in terms of total packets received and end-to-end delay compared to AODV and DYMO, especially
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
A Mobile Ad-hoc network is a set of mobile terminals moving in different directions at different
speed being wirelessly connected to each-other. In this paper we study the proactive Link State Routing
Protocol – OLSR, which uses hello and topology control (TC) messages to find then distribute link state
data throughout the mobile ad hoc network. Individual nodes use this topology data to calculate next hop
destinations for all nodes within the network using shortest hop forwarding paths. We then suggest ways
by which the existing algorithm can be optimized in terms of delay, throughput, power consumption, jitter
etc. Finally we summarize the applications of OLSR.
Extension of Optimized Linked State Routing Protocol For Energy Efficient App...pijans
Mobile Ad-hoc network (MANET) is infrastructure less network in which nodes are mobile, self
reconfigurable, battery powered. As nodes in MANET are battery powered, energy saving is an important
issue. We are using routing protocol to save energy so as to extend network lifetime. We have extended
original Optimized Linked State Routing (OLSR) protocol by using two algorithms and named it as
Enhancement in OLSR using Residual Energy approach (EOLSR-RE) and Enhancement in OLSR using
Energy Consumption approach (EOLSR-EC). To analyze relative performance of modified protocol
EOLSR-RE and EOLSR-EC over OLSR, we performed various trials using Qualnet simulator. The
performance of these routing protocols is analyzed in terms of energy consumption, control overheads, end
to end delay, packet delivery ratio. The modified OLSR protocol improves energy efficiency of network by
reducing 20 % energy consumption and 50% control overheads.
Performance analysis on multihop transmission using arp routing protocol in i...eSAT Journals
This document discusses using the Address Resolution Protocol (ARP) routing protocol for multi-hop transmissions in IEEE 802.11 ad hoc networks. It proposes using ARP messages between nodes to establish routes for sending data when the source and destination nodes are out of radio range of each other. Intermediate nodes receiving ARP requests or replies would act as routers, forwarding the data to the destination. The method aims to reduce overhead compared to other ad hoc routing protocols like AODV. Simulation results showed the ARP routing protocol performed comparably to AODV in terms of throughput, packet loss and round trip time for different distances and environments.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRMIOSR Journals
This document proposes a modification to the Dynamic Source Routing (DSR) protocol called Modified DSR (MDSR) to reduce routing overhead caused by frequent link breakages in mobile ad hoc networks. MDSR adds a link breakage prediction algorithm that uses signal strength measurements to predict when a link may break. Intermediate nodes monitor signal strength and warn the source node if a link may soon break. This allows the source to proactively rebuild the route or switch to a backup route to avoid disconnection. Simulation results showed MDSR can reduce the number of dropped packets by at least 25% compared to standard DSR. The document also discusses how DSR works and the proposed proactive route maintenance concept in M
This document discusses wireless sensor networks and their components. It begins with an introduction that describes how wireless sensor networks provide sensory data to smart environments from distributed sensor locations. It then discusses the key components of wireless sensor networks, including network topologies (mesh, star, ring, bus), communication protocols, routing techniques, power management, and hierarchical network structures. The goal is to outline the basic concepts and challenges in designing wireless sensor networks.
Cross-layer based performance optimization for different mobility and traffic...IOSR Journals
This document summarizes a research paper that proposes and evaluates a cross-layer optimization approach for the Dynamic Source Routing (DSR) protocol and the 802.11 MAC layer in mobile ad hoc networks. The approach tracks signal strengths of neighboring nodes to distinguish between packet losses due to mobility versus congestion. This information is provided to DSR to avoid unnecessary route error and maintenance processes when losses are due to congestion rather than broken links. Simulations evaluate the approach under different static and mobile scenarios and traffic patterns, showing improvements in routing overhead, packet losses and throughput compared to the conventional DSR protocol.
An Effective and Scalable AODV for Wireless Ad hoc Sensor Networksijcnes
Appropriate routing protocol in data transfer is a challenging problem of network in terms of lower end-to-end delay in delivery of data packets with improving packet delivery ratio and lower overhead as well. In this paper we explain an effective and scalable AODV (called as AODV-ES) for Wireless Ad hoc Sensor Networks (WASN) by using third party reply model, n-hop local ring and time-to-live based local recovery. Our goal is to reduce time delay for delivery of the data packets, routing overhead and improve the data packet delivery ratio. The resulting algorithm AODV-ES is then simulated by NS-2 under Linux operating system. The performance of routing protocol is evaluated under various mobility rates and found that the proposed routing protocol is better than AODV.
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANETijasuc
This document summarizes and compares two extended versions of the AODV routing protocol for mobile ad hoc networks (MANETs): Reverse AODV (RAODV) and Multicast AODV (MAODV). RAODV aims to improve routing performance by allowing multiple route reply messages, while MAODV allows nodes to send multicast data packets through a multicast group tree. The document outlines the key features and operations of each protocol, including route discovery processes. It then evaluates and compares the performance of RAODV and MAODV using metrics like end-to-end delay and overhead while varying the number of nodes.
This document analyzes the effect of node density on different routing protocols under FTP and HTTP applications. It simulates scenarios with varying node densities (20-130 nodes) using routing protocols AODV, DSR, GRP and OLSR. Key quality of service (QoS) metrics - throughput, delay, network load and packet delivery ratio - are evaluated and compared. The results show that OLSR generally performs best in terms of throughput and delay for both FTP and HTTP applications. GRP performs best for network load, while AODV has the highest packet delivery ratio for FTP. In conclusion, OLSR is the best overall routing protocol for supporting FTP and HTTP applications in mobile ad-hoc networks according to
Freshworks Rethinks NoSQL for Rapid Scaling & Cost-EfficiencyScyllaDB
Freshworks creates AI-boosted business software that helps employees work more efficiently and effectively. Managing data across multiple RDBMS and NoSQL databases was already a challenge at their current scale. To prepare for 10X growth, they knew it was time to rethink their database strategy. Learn how they architected a solution that would simplify scaling while keeping costs under control.
HCL Notes and Domino License Cost Reduction in the World of DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
Driving Business Innovation: Latest Generative AI Advancements & Success StorySafe Software
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
Discover top-tier mobile app development services, offering innovative solutions for iOS and Android. Enhance your business with custom, user-friendly mobile applications.
Have you ever been confused by the myriad of choices offered by AWS for hosting a website or an API?
Lambda, Elastic Beanstalk, Lightsail, Amplify, S3 (and more!) can each host websites + APIs. But which one should we choose?
Which one is cheapest? Which one is fastest? Which one will scale to meet our needs?
Join me in this session as we dive into each AWS hosting service to determine which one is best for your scenario and explain why!
"Choosing proper type of scaling", Olena SyrotaFwdays
Imagine an IoT processing system that is already quite mature and production-ready and for which client coverage is growing and scaling and performance aspects are life and death questions. The system has Redis, MongoDB, and stream processing based on ksqldb. In this talk, firstly, we will analyze scaling approaches and then select the proper ones for our system.
Ivanti’s Patch Tuesday breakdown goes beyond patching your applications and brings you the intelligence and guidance needed to prioritize where to focus your attention first. Catch early analysis on our Ivanti blog, then join industry expert Chris Goettl for the Patch Tuesday Webinar Event. There we’ll do a deep dive into each of the bulletins and give guidance on the risks associated with the newly-identified vulnerabilities.
Introduction of Cybersecurity with OSS at Code Europe 2024Hiroshi SHIBATA
I develop the Ruby programming language, RubyGems, and Bundler, which are package managers for Ruby. Today, I will introduce how to enhance the security of your application using open-source software (OSS) examples from Ruby and RubyGems.
The first topic is CVE (Common Vulnerabilities and Exposures). I have published CVEs many times. But what exactly is a CVE? I'll provide a basic understanding of CVEs and explain how to detect and handle vulnerabilities in OSS.
Next, let's discuss package managers. Package managers play a critical role in the OSS ecosystem. I'll explain how to manage library dependencies in your application.
I'll share insights into how the Ruby and RubyGems core team works to keep our ecosystem safe. By the end of this talk, you'll have a better understanding of how to safeguard your code.
Monitoring and Managing Anomaly Detection on OpenShift.pdfTosin Akinosho
Monitoring and Managing Anomaly Detection on OpenShift
Overview
Dive into the world of anomaly detection on edge devices with our comprehensive hands-on tutorial. This SlideShare presentation will guide you through the entire process, from data collection and model training to edge deployment and real-time monitoring. Perfect for those looking to implement robust anomaly detection systems on resource-constrained IoT/edge devices.
Key Topics Covered
1. Introduction to Anomaly Detection
- Understand the fundamentals of anomaly detection and its importance in identifying unusual behavior or failures in systems.
2. Understanding Edge (IoT)
- Learn about edge computing and IoT, and how they enable real-time data processing and decision-making at the source.
3. What is ArgoCD?
- Discover ArgoCD, a declarative, GitOps continuous delivery tool for Kubernetes, and its role in deploying applications on edge devices.
4. Deployment Using ArgoCD for Edge Devices
- Step-by-step guide on deploying anomaly detection models on edge devices using ArgoCD.
5. Introduction to Apache Kafka and S3
- Explore Apache Kafka for real-time data streaming and Amazon S3 for scalable storage solutions.
6. Viewing Kafka Messages in the Data Lake
- Learn how to view and analyze Kafka messages stored in a data lake for better insights.
7. What is Prometheus?
- Get to know Prometheus, an open-source monitoring and alerting toolkit, and its application in monitoring edge devices.
8. Monitoring Application Metrics with Prometheus
- Detailed instructions on setting up Prometheus to monitor the performance and health of your anomaly detection system.
9. What is Camel K?
- Introduction to Camel K, a lightweight integration framework built on Apache Camel, designed for Kubernetes.
10. Configuring Camel K Integrations for Data Pipelines
- Learn how to configure Camel K for seamless data pipeline integrations in your anomaly detection workflow.
11. What is a Jupyter Notebook?
- Overview of Jupyter Notebooks, an open-source web application for creating and sharing documents with live code, equations, visualizations, and narrative text.
12. Jupyter Notebooks with Code Examples
- Hands-on examples and code snippets in Jupyter Notebooks to help you implement and test anomaly detection models.
Fueling AI with Great Data with Airbyte WebinarZilliz
This talk will focus on how to collect data from a variety of sources, leveraging this data for RAG and other GenAI use cases, and finally charting your course to productionalization.
Your One-Stop Shop for Python Success: Top 10 US Python Development Providersakankshawande
Simplify your search for a reliable Python development partner! This list presents the top 10 trusted US providers offering comprehensive Python development services, ensuring your project's success from conception to completion.
Your One-Stop Shop for Python Success: Top 10 US Python Development Providers
Hj2413101315
1. Hameed khan, Ashok Verma, Ajay Lala, Ashish Chourasia / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622
www.ijera.com Vol. 2, Issue4, July-august 2012, pp.1310-1315
“ An E -2 -E Communica tion Based MPOLSR Pro toco l
fo r Loo p Detectio n a nd Iso la tion in MANET”
Hameed Khan, Ashok Verma, Ajay Lala, Ashish Chourasia
Computer Science & Engineering, GGITS Jabalpur
Abstract
Ad hoc networks consist of a collection of implementation to validate the functions of the
wireless mobile nodes which dynamically protocol.
exchange data without reliance on any fixed based
station or a wired backbone network. They are by Related work
definition self-organized. The frequent topological The objective of this work is to evaluate two
changes make multi-hops routing a crucial issue protocol pro-active / table driven routing protocols
for these networks. In this paper, we propose a namely, Optimized Link State Routing Protocol and
multipath routing protocol named Multipath Multipath Optimized Link State Routing Protocol. In
Optimized Link State Routing (MP-OLSR). It is a a proactive routing protocol, called Multipath
multipath extension of OLSR, and can be Optimized Link State Routing for MANET is
regarded as a hybrid routing scheme because it proposed. The protocol inherits the stability of the
combines the proactive nature of topology sensing link state algorithm. Due to its proactive nature, it has
and reactive nature of multipath computation. The an advantage of having the routes immediately
auxiliary functions as route recovery and loop available when needed. MPOLSR is an optimization
detection are introduced to improve the of a pure link state protocol for MANET. This
performance of the network. evaluation is to be carried out through exhaustive
literature review and simulation. Then we present the
Keywords: Mobile ad hoc network (MANET), functionality of MP-OLSR. The detailed
multiple paths, OLSR, MP-OLSR, specifications for the multipath routing are defined.
MP-OLSR inherits the topology sensing mechanism
INTRODUCTION from OLSR, which helps the nodes in the network to
A MANET [1][2]is a collection of nodes explore the network topology. The Multipath Dijkstra
where the nodes will self configure and self organize Algorithm is proposed to obtain multiple paths from
themselves forming a wireless medium without any the source to the destination. Source routing is
requirement of stationary infrastructure like base employed to forward the packets. To avoid route
station. In these networks each node will not only act failure and possible transient loops in the network,
as a host but also acts as a router. Due to mobility of Route Recovery and Loop Detection are introduced
nodes, the topology of the network is dynamic that is, to improve the performance of the network. The link
it changes most of the time. Some examples where metric based on queue length information is
the possible use of Ad-hoc networks are in military, discussed as a possible replacement of the hop count
in emergency situation like hurricanes, earth quakes, metric. And in the end of the chapter, the problem of
conferences etc. One of the main issues in Ad-hoc compatibility with OLSR is also illustrated.
networks is to develop a routing protocol which must
be capable of handling very large number of nodes Specification of MP-OLSR
with limited bandwidth and power availability. Also Multipath Optimized Link State Routing
they should respond quickly to the hosts that broken (MP-OLSR)
or newly formed in various locations. Many protocols The Multipath Optimized Link State
have been proposed to solve these problems in the Routing (MP-OLSR) can be regarded as a hybrid
ad-hoc networks. multipath routing protocol. It sends out HELLO
In this part of the thesis, we expose our main messages and TC messages periodically to be aware
contribution in the routing protocol: Multipath of the network topology, just like OLSR. The
Optimized Link State Routing (MP-OLSR). It is a difference is that MP-OLSR does not always keep a
multipath extension of OLSR, which can be regarded routing table to all the possible destinations. It only
as a hybrid routing scheme because it combines the calculates the routes when there are data packets need
proactive nature of topology sensing and reactive to be sent out. The core functioning of MP-OLSR has
nature of route computation. two main parts: topology sensing and route
We probe the multipath routing protocol computation. The topology sensing makes the nodes
from design to simulation, and finally the real get to the topology information of the network, which
1310 | P a g e
2. Hameed khan, Ashok Verma, Ajay Lala, Ashish Chourasia / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622
www.ijera.com Vol. 2, Issue4, July-august 2012, pp.1310-1315
includes link sensing, neighbor detection and which have selected the sender node as a MPR. TC
topology discovery. This part gets benefit from messages are flooded to all nodes in the network and
MPRs as well as OLSR. By sending the routing take advantage of MPRs. MPRs enable a better
control messages proactively, the node could be scalability in the distribution of topology information.
aware of the topology of the network: its neighbors, With the broadcast of TC messages to the whole
2-hop neighbors and other links. The routing network, the node is able to get the topology
computation uses the Multipath Dijkstra Algorithm to information that is more than two hops away.
populate the multiple paths based on the information
get from the topology sensing. The source route (the Link Sensing and Neighbor Detection
hops from the source to the destination) will be saved The link sensing and neighbor detection are
in the header of the data packets. The medium hops based on the transmission of HELLO messages.
just read the packet head and forward the packet to Based on the received messages, the procedures
the next hop. The topology sensing and route called link sensing and neighbor detection are
computation make it possible to find multiple paths performed to build the link set and 2-hop set. On
from source to destination. In the specification of the receiving a packet, the node examines the packet
algorithm, the paths will be available and loop-free. header and each of the message headers. If the
However, in practice, the situation will be much more message type is known to the node, the message is
complicated due to the change of the topology and processed locally according to the specification for
the instability of the wireless medium. So route that message type. The message is also independently
recovery and loop detection are also proposed as evaluated for forwarding. If parsing fails at any point
auxiliary functionalities to improve the performance the relevant entity (packet or message) must be
of the protocol. The route recovery can effectively silently discarded. So the incoming packets (TC or
reduce the packet loss, and the loop detection can be HELLO) can be appropriately distributed for next
used to avoid potential loops in the network. step of process. When receiving a HELLO message,
a router must update its Link set for the MANET
Topology Sensing interface on which the HELLO message is received,
To get the topology information of the and update its Neighbor Set. The algorithm will first
network, the nodes use the topology sensing which find all Neighbor Tuples (henceforth matching
includes link sensing, neighbor detection and Neighbor Tuples) where the message’s
topology discovery, just like OLSR. Link sensing N_neighbor_addr_list contains any network address
populates the local link information base (Link Set). which overlaps with any address in the node’s
It is exclusively concerned with OLSR interface Neighbor Address List. If there are no matching
addresses and the ability to exchange packets neighbor tuples, a new neighbor tuple will be created.
between such OLSR interfaces. Neighbor detection If there are one or more matches, then related
populates the neighborhood information base information has to be updated. the procedure to be
(Neighbor Set and 2-hop Neighbor Set) and concerns performed for Neighbor Set updating. The 1-hop
itself with nodes and their main addresses. Both link neighbors are then maintained properly based on the
sensing and neighbor detection is based on the exchange of HELLO messages. In addition to the
periodic exchange of HELLO messages. Neighbor Set, the 2-Hop Set also need to be updated.
Topology Discovery generates the The procedure to be performed for 2-Hop set
information base which concerns the nodes which are updating. So the information of the 2-hop nodes is
more than two hops away (Topology Set). It is based saved in the 2-Hop Set.
on the flooding of the TC messages (optimized by
selecting the MPR set). Through topology sensing, Topology Discovery
each node in the network can get sufficient Link Sensing and Neighbor Detection make
information of the topology to enable routing. The the node be aware of its 1-Hop neighbors and 2-Hop
link state protocol tries to keep the link information neighbors by sending HELLO messages. To get the
of the whole network as mentioned above. By topology information located more than 2 hops away,
default, the path quality is measured by the number Topology Discovery is needed. It is based on the
of hops. For the purpose of making the thesis self- broadcast of TC messages. A node with one or more
contained, this part summarized the Topology OLSRv2 interfaces and with a non-empty neighbor
Sensing functionality. set must generate TC messages. A node with an
Topology Control Message TC messages are empty neighbor set should also generate “empty” TC
broadcasted by each node to the whole network to messages for a period “hold” time after it last
build the intra-forwarding database needed for generated a non- empty TC message. Complete TC
routing packets. The format of TC message allows messages are generated and transmitted periodically
the standard [4] and is defined in [5]. A TC message on all OLSRv2 interfaces, with a default interval
is sent by a node in the network to declare a set of between two consecutive TC transmissions. In
links, which must include at least the links to all addition to the periodic broadcasting, it can be
nodes of its MPR Selector set, i.e., the neighbors generated in response to a change of contents. Only
1311 | P a g e
3. Hameed khan, Ashok Verma, Ajay Lala, Ashish Chourasia / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622
www.ijera.com Vol. 2, Issue4, July-august 2012, pp.1310-1315
MPR can forward the TC messages to the next hop.
When receiving a TC message, it is processed
according to its type. The node first checks the
message is from itself or unavailable. If so, the
message must be discarded. Otherwise, the node will
populate the related information base set (Advertising
Remote Node Set, Topology Set, etc.) based on the
received message. So based on the broadcasting and
processing of TC messages, the topology information
that more than two hops always can be saved in the Figure 1.1: An example of route recovery. S is the
Topology Set. source and D is the destination.
Route Recovery The movement increases the end-to-end
Route Failure in MP-OLSR delay significantly. In[8], the authors propose another
By using the scheme of the Topology method to avoid the effect of short term link
Sensing, we can obtain the topology information of deterioration by using opportunistic paths in mesh
the network with the exchange of HELLO and TC networks. To overcome the disadvantage of the
messages. All this information is saved in the source routing, we propose Route Recovery for MP-
topology information base of the local node: link set, OLSR.[7] The principal is very simple: before an
neighbor set or topology set. Ideally, the topology intermediate node tries to forward a packet to the
information base can be consistent with the real next hop according to the source route, the node first
topology of the network. However, in reality, it is checks if the next hop in the source route is one of its
hard to achieve, mainly because of the mobility of the neighbors (by checking the neighbor set). If yes, the
ad hoc network. Firstly, for the HELLO and TC packet is forwarded normally. If no, then it is
messages, there are certain intervals during each possible that the “next hop” is not available anymore.
message generation (2s for HELLO and 5s for TC by Then the node will recomputed the route and forward
default) [6]. During this period, the topology might the packet by using the new route. We present an
change because of the movement of the nodes. example of route recovery. Node S is trying to send
Secondly, when the control messages (especially the packets to D. The original multiple paths we got are
TC messages) are being transmitted in the network, S_A_B_D and S_C_E_G_D. However, node G
delay or collision might happen. This will result in moves out of the transmission range of node E and
the control message being outdated or even lost. Both makes the second path unavailable. The source node
of the two reasons mentioned above will result in the S is not able to detect the link failure immediately
inconsistency between the real network topology and (because of the delay and long interval of TC
the node’s topology information base. This means messages) and keeps sending the packets along the
that when a node is computing the multiple paths path and all these packets are dropped during this
based on the information base, it might use links that period if only the source routing is used. With Route
do not exist anymore, and cause the route failure. Recovery, when the packet arrives, node E will first
Furthermore, even if the topology information is check if node G is still one of its neighbors, before
correct when the route is being constructed at the forwarding the packet according to the source route.
source node, the topology might change while the If not, node E will recomputed the route to node D,
packets are being forwarded in the network. And and get E_F_D. Then the following packets will be
because of the source routing scheme MP-OLSR sent through the new path. Because the Route
uses, the source route cannot be adapted to this kind Recovery just checks the topology information saved
of changes. For the OLSR, the problem is less serious in the local node, it will not introduce much extra
because it uses hop-by-hop routing. Unlike the source delay. And most importantly, it will effectively
routing, whose routes are decided completely at the improve the packet delivery ratio of the network.
source, the nodes in OLSR just forward the packets
to the next hop. So there is more chance for a node in Loop Detection
OLSR to forward a packet to the next available link. Loops in OLSR and MP-OLSR
It is important to mention the LLN (Link
Route Recovery Algorithm Layer Notification) before coming to the problem of
Several techniques already exist in the the loops of the protocol. LLN is an extended
literature to deal with the route failures in source functionality defined in [8], and implemented in
routing. DSR handles route errors using route different OLSR or MPOLSR simulations and
maintenance, mainly by sending RERR messages, implementations. If link layer information describing
which will of G makes the link from E to G connectivity to neighbor nodes is available (i.e. loss
unavailable. of connectivity though absence of a link layer
acknowledgement), this information can be used in
addition to the information from the HELLO-
1312 | P a g e
4. Hameed khan, Ashok Verma, Ajay Lala, Ashish Chourasia / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622
www.ijera.com Vol. 2, Issue4, July-august 2012, pp.1310-1315
message to maintain the neighbor information base be redirected to node B. The same operation will be
and the MPR selector of the information bases in performed in node B: LLN of the failure of B_C, and
node A and B. One transient loop is formed between Route Recovery. Unfortunately, because node B
A and B set. cannot detect the link failure of A_C immediately,
and the new path obtained by Route Recovery is
B_A_C. Thus the packet will be returned to node A,
and node A to B again, creating a loop. This is not a
permanent loop, but a transient loop which will exist
for several seconds and will disappear when the
related link expires. However, this kind of temporary
loops will block the links in the loop and congest the
related transmission area. In [9], the authors also
address the looping issues in OLSRv2, and LLN will
significantly increase the number of loops.
Source Route Loop Detection
Figure 1.2: An example of loop in the network. The In the authors introduce two types of loop
movement of node C results in inconsistency detection techniques: LD-Mid (Mid-Loop Detection)
The routing protocol can act on the and LD-Post (Post-Loop Detection). LD-Mid just
acknowledgement from LLN (mainly the loss of compares the address of the next hop against the
links), and remove the corresponding links from its address of the previous hop, so it is only able to
information base. The results of the real OLSRv2 detect “two-way” loops between 2 nodes. LD-Post
testbed [9] and our work based on NS2 simulation in records all incoming packets that need to be
can show that LLN is very important and effectively forwarded and compares against each new incoming
improves the packet delivery ratio of the OLSR and packet to see if the same packet has traversed this
MP-OLSR protocol. In theory, the paths generated by node before. So it can detect loops that are farther
the Dijkstra algorithm in MP-OLSR are loop-free. away, by taking more memory. When a loop is
However, in reality, the LLN and Route Recovery detected, the Packet Discard strategy is used to drop
which are used to adapt to the topology changes the packets that are unlikely to reach the destination
make the loops possible in the network. With LLN, but only increase the load of the network. For MP-
when a node tries to send a packet over a link but fail OLSR, we propose a simple method based on source
in the end, the link layer will give a feedback to the routing that can effectively detect loops without
routing protocol to notify the link loss. This kind of causing extra cost of memory: after the Route
abrupt interruption will result in additional operations Recovery is performed, we can get a new set of
on the topology information base rather than just multiple paths from the current node to the
regular HELLO and TC messages. This means that destination. The node will compare the first new path
other nodes cannot be aware of these changes with the ancient source route in the packet. We can
immediately. So LLN might cause some verify if the new path includes the nodes that the
inconsistency of the topology information in different packet had crossed before. If the answer is no, it
nodes. And with Route Recovery, which might means that there will be no loop in the future, and we
change the path in intermediate nodes, loops can will make use of the new path. If the new path
occur temporarily in the network. In Figure 1.1 we includes the node that the packet have passed before,
give an example of how a loop is generated in the there is high probability that a loop will happen (a
network. Node A is an intermediate node of a path. very rare case is that the failed link is recovered in
The packets with source route A_C arrive at node A this short period, in several milliseconds, then the
and need to be forwarded to node C. Then node C loop is released). MP-OLSR will switch to the next
moves out of the transmission range of node A and path of the multiple paths set, until all the paths have
node B,and makes the links A_C, B_C not available been verified. If there is no suitable path, the packet
anymore. When the new packets arrive at node A, the will be discarded. For the example in Figure 1.1,
transmission to node C will fail. Then in node A, the node A will get a path A_B_C by Route Recovery.
routing protocol will be acknowledged by LLN, and Then when the packet arrives at node B, a new path
it will remove the link A_C from node A’s link set. B_A_C will be generated because of link breakage of
For node A, although it can detect the link failure of B_C. Node B will compare the new one with the
A_C by LLN, it is hard to know the failure of B_C ancient source route A_B_C in the packet. We will
immediately. This is because link B_C can only be find that the packet has already crossed node A, and
removed when the NEIGHB HOLD TIME (6 so there might be a loop. Then we will try to find if
seconds by default) expires. In the meantime, Route there is any other possible path, or else the packet
Recovery will be awaken. A new path A_B_C will be will be discarded. Compared with LD-Post, which
established and the following packets will be needs to keep a record of all the incoming packets,
forwarded along the new path. Then the packets will our loop detection mechanism could effectively
1313 | P a g e
5. Hameed khan, Ashok Verma, Ajay Lala, Ashish Chourasia / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622
www.ijera.com Vol. 2, Issue4, July-august 2012, pp.1310-1315
detect the possible loops in the network without End to End Delay
consuming extra memory space. By reducing the The figure shows that initially for 2 nodes
loops in the network, the network congestion can be the End-2- End delay is minor difference between
reduced. So the performance of the network can be OLSR and MPOLSR protocol. As the 10 nodes
improved, especially the end-to-end delay. increases the End-2- End delay for OLSR is greater
as compared to MPOLSR. But again MPOLSR and
RESULTS AND DISCUSSIONS OLSR protocol just approximate equal for 20 nodes.
Packet Delivery Fraction The End-2- End delay is gradually increase when we
The figure shows that initially for 2 nodes set 30 nodes MPOLSR and OLSR protocol are also
the PDF is highest for MPOLSR protocol while the increase but gradually lesser then MPOLSR in N/W.
PDF for OLSR are moderate. As the no of nodes
increases the PDF for MPOLSR and OLSR decreases 250
gradually but again MPOLSR is greater than OLSR
protocol for 10 nodes. The PDF is highest when 200
increase 20 nodes we found both protocol 150
approximately equal and finally 30 node case both 100 MPOLSR
protocol decrease gradually with minor difference.
50 OLSR
0
1.01
1 2 10 20 30
0.99 node node node node
0.98
0.97 MPOLSR
Fig 7.3: End-2- End delay
0.96 OLSR
0.95 Conclusion
2 10 20 30 In this chapter, the specifications of MP-
node node node node OLSR are introduced. The topology sensing (based
on OLSR) and route computation are basic
procedures for multipath routing. To improve the
Fig 7.1: Packet Delivery Fraction performance of the protocol, the route recovery and
loop detection are proposed to avoid route failure and
Throughput reduce transient loops in the network. We proposed a
The figure shows that initially for 2 nodes queue length metric to evaluate the link quality. The
the THROUGHPUT is highest for OLSR protocol queue length information is saved in TLVs and
while the THROUGHPUT for MPOLSR is moderate. propagated to the whole network by HELLO and TC
As the 10 nodes increases the THROUGHPUT for messages. The compatibility between MP-OLSR and
MPOLSR is greater and OLSR decreased gradually OLSR are also studied to make the single path
but again MPOLSR is greater than OLSR protocol routing and multipath routing is able to cooperate
just approximate for 20 nodes. The THROUGHPUT with each other. This further study highlights the
is approximately equal when we set 30 nodes OLSR interest of multiple paths routing to improve quality
and MPOLSR protocol in network. of experience over self-organized networks.
References
800
[1] A. A. Pirzada, C. McDonald, and A. Datta,
600 “Performance Comparison of Trust-Based
Reactive Routing Protocols,” IEEE
400
MPOLSR Transactions on Mobile Computing Vol. 5,
200 No.6 ,pp. 695- 710, 2006 .
OLSR [2] Mamoun H. Mamoun “ Important
0
Characteristic of Differences between DSR
2 10 20 30 and AODV Routing Protocol” 2007
node node node node [3] Clausen, T. & Jacquet, P. (2003). IETF
Request for Comments: 3626, Optimized
Link State Routing Protocol OLSR.
[4] Clausen, T., Dearlove, C., Dean, J., & Adjih,
Fig 7.2: Throughput C. (2009c). IETF Request for Comments:
5444, Generalized Mobile Ad Hoc Network
(MANET) Packet/Message Format.
1314 | P a g e
6. Hameed khan, Ashok Verma, Ajay Lala, Ashish Chourasia / International Journal of
Engineering Research and Applications (IJERA) ISSN: 2248-9622
www.ijera.com Vol. 2, Issue4, July-august 2012, pp.1310-1315
[5] Clausen, T., Dearlove, C., & Jacquet, P.
(2009b). IETF Internet Draft, The
Optimized Link State Routing Protocol
version 2, draft-ietf-manet-olsrv2-10.
[6] Jiazi Yi, Eddy Cizeron, Salima Hamma,
Benoît Parrein and Pascal
Lesage*Implementation of multipath and
Multiple Description Coding in OLSR This
is a proceeding of 4th OLSR
Introp/Workshop, Ottawa, Canada.
[7] Jiazi YI, Asmaa ADNANE, Sylvain
DAVID, Benoˆıt PARREIN Multipath
Optimized Link State Routing for Mobile ad
hoc Networks Preprint submitted to Ad Hoc
Networks September 28, 2010
[8] Speakman, L., Owada, Y., & Mase, K.
(2008). An analysis of loop formation in
OLSRv2 in adhoc networks and limiting its
negative impact. In IEEE International CQR
Workshop, Naples, Florida, USA.
[9] Clausen, T. & Jacquet, P. (2003). IETF
Request for Comments: 3626, Optimized
Link State Routing Protocol OLSR.
1315 | P a g e