This document summarizes a research paper that proposes a location-aware routing protocol (LAROD) for intermittently connected mobile ad hoc networks (IC-MANETs). LAROD uses greedy geographical forwarding with a store-carry-forward approach when greedy forwarding is not possible. It is supplemented by a location service called Location Dissemination Service (LoDiS) that maintains location information through periodic gossiping between nodes. The paper reviews related work on routing and location services for IC-MANETs and delay tolerant networks. It then describes the design and operation of LAROD and LoDiS in more detail.
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.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
Â
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
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.
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.
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.
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.
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
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK cscpconf
Â
A Mobile Ad-hoc Network (MANET) is a collection of mobile nodes that communicate and collaborate with each other without reliance on any pre-existing infrastructure. In MANETs, wireless links are subject to frequent breakages due to nodes high mobility. While several routing protocols such AODV and DSR have been designed for MANETs, many of operate efficiently under low network mobility conditions and do not adapt well with high mobility conditions. Therefore, considering mobility is a demanding task that should be performed efficiently and accurately. Here, we proposed novel mobility-aware routing protocol based on the well known Ad-hoc On Demand Distance Vector (AODV) routing protocol called: MA-AODV (Mobility Aware Ad-hoc On Demand Distance Vector) in an attempt to improve the handling of high mobility factor in ad-hoc networks. MA-AODV protocols perform periodic quantification of nodes mobility for the sake of establishing more stable paths between source/destination pairs, hence, avoiding the frequent link breakages associated with using unstable paths that contain high mobile nodes.
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.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
Â
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
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.
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.
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.
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.
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
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK cscpconf
Â
A Mobile Ad-hoc Network (MANET) is a collection of mobile nodes that communicate and collaborate with each other without reliance on any pre-existing infrastructure. In MANETs, wireless links are subject to frequent breakages due to nodes high mobility. While several routing protocols such AODV and DSR have been designed for MANETs, many of operate efficiently under low network mobility conditions and do not adapt well with high mobility conditions. Therefore, considering mobility is a demanding task that should be performed efficiently and accurately. Here, we proposed novel mobility-aware routing protocol based on the well known Ad-hoc On Demand Distance Vector (AODV) routing protocol called: MA-AODV (Mobility Aware Ad-hoc On Demand Distance Vector) in an attempt to improve the handling of high mobility factor in ad-hoc networks. MA-AODV protocols perform periodic quantification of nodes mobility for the sake of establishing more stable paths between source/destination pairs, hence, avoiding the frequent link breakages associated with using unstable paths that contain high mobile nodes.
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
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.
Energy efficient routing protocol to increase manet life time using cluster 2IAEME Publication
Â
This document presents an energy efficient routing protocol to increase the lifetime of mobile ad hoc networks (MANETs). It proposes modifying the ad hoc on-demand distance vector (AODV) routing protocol by implementing a hierarchical network structure with clustering. Cluster heads will select routes based on nodes' battery thresholds to optimize energy efficiency. The protocol aims to improve network lifetime by preventing nodes from depleting energy through routing. Its performance will be evaluated based on metrics like packet delivery ratio, throughput, and average energy consumption, and compared to standard AODV using network simulation software.
Research Inventy : International Journal of Engineering and Science is publis...researchinventy
Â
This document summarizes research on improving the performance of route caches in the Dynamic Source Routing (DSR) protocol for mobile ad hoc networks. DSR maintains route caches but they have issues like stale entries, incomplete error notification, and insufficient cache size. The paper proposes a reliable and effective cache management technique for DSR. It estimates a combined weight for each cached route based on length, traffic load, energy level, and freshness. Routes are sorted by weight, with lowest weighted routes removed first. As an alternate route, it selects the most reliable route from the sorted cache before a link breaks. This aims to improve DSR performance by reducing delay, packet loss, overhead, and increasing throughput.
Network Lifetime Analysis of Routing Protocols of Short Network in QualnetIOSR Journals
Â
A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with
each other without using any existing infrastructure, access point or centralized administration. Mobile ad-hoc
network have the attributes such as wireless connection, continuously changing topology, distributed operation
and ease of deployment. In this paper we have compared the energy consumption of reactive, proactive &
hybrid routing protocol AODV,DSR,RIP & ZRP by using different mobility model. We have analyzed the
Network lifetime of protocols by varying pay load, mobility, pause time and type of traffic (CBR). A detailed
simulation has been carried out in qualnet. The metrics used for performance analysis are energy consumed &
battery consumption. It has been observed that RIP has better network lifetime than other
Comparative and Behavioral Study on VANET Routing ProtocolsIOSR Journals
Â
This document provides a summary and comparison of various routing protocols for vehicular ad hoc networks (VANETs). It discusses topology-based protocols like CGSR and DSDV, reactive protocols like DSR, and position-based protocols like GSR, A-STAR, GPCR, VADD, CAR, DIR, and B-MFR. The position-based protocols are considered the best for handling issues in VANETs like packet delay, traffic congestion, and throughput. The paper analyzes the characteristics and behaviors of different VANET routing protocols and concludes that position-based protocols are most suitable for the dynamic environment of vehicular networks.
This document summarizes an article that proposes improvements to the Ad hoc On-Demand Distance Vector (AODV) routing protocol for use in Vehicular Ad hoc Networks (VANETs). It first provides background on VANETs and discusses different types of routing protocols used in VANETs, including topology-based, position-based, and hybrid protocols. It then focuses on improvements made to the reactive AODV routing protocol, including adding link layer security checks and a method to reduce packet delay called AODV_BD. The goal of these improvements is to create more stable routes and reduce packet delay for safety communications between vehicles.
A survey on energy aware routing issues and cross layering in mane tsIAEME Publication
Â
This document summarizes a survey on energy aware routing and cross-layering in mobile ad hoc networks (MANETs). It discusses how energy conservation is critical in MANETs since nodes are battery powered. It reviews existing energy efficient routing protocols and notes they do not consider quality of service parameters. Cross-layer design allows interaction between layers to improve network performance without degrading quality of service. The document surveys energy aware routing using cross-layer approaches to improve energy efficiency while maintaining quality of service in MANETs.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
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
Enhanced location based self adaptive routing algorithm for wsn in industrial...eSAT Publishing House
Â
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
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
Multipath routing protocol for effective local route recoveryIJARBEST JOURNAL
Â
In mobile Ad hoc network, frequent mobility during the data transmission of data
causes route failure which results in route discovery. In this we propose multipath routing protocol
for effective local route recovery in mobile Ad hoc networks. In this protocol each source and
destination pair establishes multiple paths in single route discovery and they are cached in their route
caches. The cached routes are sorted on the basis of their bandwidth availability. In case of route
failure in the primary route, a recovery node which is an over heading neighbor, detects it and
establishes a local recovery path with maximum bandwidth from its route cache. This proposed
technique improves network performance and it prevents frequent collision.
Analyzing the Effect of Varying CBR on AODV, DSR, IERP Routing Protocols in M...IOSR Journals
Â
This document analyzes the performance of the AODV, DSR, and IERP routing protocols in a mobile ad hoc network (MANET) with varying constant bit rate (CBR) traffic loads. It conducts simulations in QualNet 6.1 and evaluates the protocols based on average end-to-end delay, throughput, average jitter, and packet delivery ratio under different CBR values. The results show that AODV generally performs best with low and stable delay, jitter and high throughput and delivery ratio. DSR has better performance than IERP for throughput and delivery ratio. IERP shows the worst performance for delay and jitter as CBR increases. The document concludes by stating AODV is best overall but
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
The document describes an intersection-based geographical routing protocol (IGRP) for vehicular ad hoc networks (VANETs) that uses an anonymous batch authentication and key agreement scheme (ABAKA) for security. IGRP selects optimal routes between intersections to ensure network connectivity while satisfying quality of service constraints. It formulates the routing problem as an optimization problem solved using a genetic algorithm. ABAKA allows for batch authentication of multiple requests and establishes session keys efficiently using elliptic curve cryptography to reduce overhead. It provides anonymity and deals with invalid requests. The proposed approach uses IGRP with ABAKA to provide a secure routing environment for value-added services in VANETs.
Quick Routing for Communication in MANET using Zone Routing Protocolijceronline
Â
rnational Journal of Computational Engineering Resaerch 2014, Volume 4 ~ Issue 11 (November 2014)
Abstract
The paper discusses the voltage control of a critical load bus using dynamic voltage restorer (DVR) in a distribution system. The critical load requires a balanced sinusoidal waveform across its terminals preferably at system nominal frequency of 50Hz .It is assumed that the frequency of the supply voltage can be varied and it is different from the system nominal frequency. The DVR is operated such that it holds the voltage across critical load bus terminals constant at system nominal frequency irrespective of the frequency of the source voltage. In case of a frequency mismatch, the total real power requirement of the critical load bus has to be supplied by the DVR. Proposed method used to compensate for frequency variation, the DC link of the DVR is supplied through an uncontrolled rectifier that provides a path for the real power required by the critical load to flow .A simple frequency estimation technique is discussed which are Discrete Fourier transform (DFT), ANN controller. The present work study the compensation principle and different control strategies of DVR used here are based on DFT, and ANN Controller .Through detailed analysis and simulation studies using MATLAB. It is shown that the voltage is completely controlled across the critical load.
Delay Tolerant Network (DTN) is a promising technology which aims to provide efficient
communication between devices in a network with no guaranteed continuous connectivity. Most
of the existing routing schemes for DTNs achieve message delivery through message replication
and forwarding. However, due to the lack of contemporaneous end-to-end communication path,
designing routing protocols that can achieve high delivery rate with low communication
overhead is a challenging problem. Some routing protocols appear with high similarity, but
their performance are significantly different. In this paper, we evaluate several popular routing
protocols in DTNs, including Epidemic, Spray and Wait, PRoPHET, and 3R through extensive
trace-driven simulations. The objective is to evaluate the performance of different routing
schemes using different data traces and investigate the optimal configuration setting for each
routing scheme. This paper provides important guidances on the design and selection of routing
protocols for given delay tolerant networks.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
User centric data dissemination in disruption tolerant networkasShowyou Tang
Â
This document summarizes a presentation on user-centric data dissemination in disruption tolerant networks. It discusses the problem of maximizing cost-effectiveness in uncontrollable network environments. An approach is presented that uses centrality metrics and multi-hop centrality to select optimal relay nodes. Simulation results on realistic DTN traces show the approach outperforms flooding and has better performance under different time, buffer, and network information constraints.
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...eSAT Publishing House
Â
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
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
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.
Energy efficient routing protocol to increase manet life time using cluster 2IAEME Publication
Â
This document presents an energy efficient routing protocol to increase the lifetime of mobile ad hoc networks (MANETs). It proposes modifying the ad hoc on-demand distance vector (AODV) routing protocol by implementing a hierarchical network structure with clustering. Cluster heads will select routes based on nodes' battery thresholds to optimize energy efficiency. The protocol aims to improve network lifetime by preventing nodes from depleting energy through routing. Its performance will be evaluated based on metrics like packet delivery ratio, throughput, and average energy consumption, and compared to standard AODV using network simulation software.
Research Inventy : International Journal of Engineering and Science is publis...researchinventy
Â
This document summarizes research on improving the performance of route caches in the Dynamic Source Routing (DSR) protocol for mobile ad hoc networks. DSR maintains route caches but they have issues like stale entries, incomplete error notification, and insufficient cache size. The paper proposes a reliable and effective cache management technique for DSR. It estimates a combined weight for each cached route based on length, traffic load, energy level, and freshness. Routes are sorted by weight, with lowest weighted routes removed first. As an alternate route, it selects the most reliable route from the sorted cache before a link breaks. This aims to improve DSR performance by reducing delay, packet loss, overhead, and increasing throughput.
Network Lifetime Analysis of Routing Protocols of Short Network in QualnetIOSR Journals
Â
A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with
each other without using any existing infrastructure, access point or centralized administration. Mobile ad-hoc
network have the attributes such as wireless connection, continuously changing topology, distributed operation
and ease of deployment. In this paper we have compared the energy consumption of reactive, proactive &
hybrid routing protocol AODV,DSR,RIP & ZRP by using different mobility model. We have analyzed the
Network lifetime of protocols by varying pay load, mobility, pause time and type of traffic (CBR). A detailed
simulation has been carried out in qualnet. The metrics used for performance analysis are energy consumed &
battery consumption. It has been observed that RIP has better network lifetime than other
Comparative and Behavioral Study on VANET Routing ProtocolsIOSR Journals
Â
This document provides a summary and comparison of various routing protocols for vehicular ad hoc networks (VANETs). It discusses topology-based protocols like CGSR and DSDV, reactive protocols like DSR, and position-based protocols like GSR, A-STAR, GPCR, VADD, CAR, DIR, and B-MFR. The position-based protocols are considered the best for handling issues in VANETs like packet delay, traffic congestion, and throughput. The paper analyzes the characteristics and behaviors of different VANET routing protocols and concludes that position-based protocols are most suitable for the dynamic environment of vehicular networks.
This document summarizes an article that proposes improvements to the Ad hoc On-Demand Distance Vector (AODV) routing protocol for use in Vehicular Ad hoc Networks (VANETs). It first provides background on VANETs and discusses different types of routing protocols used in VANETs, including topology-based, position-based, and hybrid protocols. It then focuses on improvements made to the reactive AODV routing protocol, including adding link layer security checks and a method to reduce packet delay called AODV_BD. The goal of these improvements is to create more stable routes and reduce packet delay for safety communications between vehicles.
A survey on energy aware routing issues and cross layering in mane tsIAEME Publication
Â
This document summarizes a survey on energy aware routing and cross-layering in mobile ad hoc networks (MANETs). It discusses how energy conservation is critical in MANETs since nodes are battery powered. It reviews existing energy efficient routing protocols and notes they do not consider quality of service parameters. Cross-layer design allows interaction between layers to improve network performance without degrading quality of service. The document surveys energy aware routing using cross-layer approaches to improve energy efficiency while maintaining quality of service in MANETs.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
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
Enhanced location based self adaptive routing algorithm for wsn in industrial...eSAT Publishing House
Â
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
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
Multipath routing protocol for effective local route recoveryIJARBEST JOURNAL
Â
In mobile Ad hoc network, frequent mobility during the data transmission of data
causes route failure which results in route discovery. In this we propose multipath routing protocol
for effective local route recovery in mobile Ad hoc networks. In this protocol each source and
destination pair establishes multiple paths in single route discovery and they are cached in their route
caches. The cached routes are sorted on the basis of their bandwidth availability. In case of route
failure in the primary route, a recovery node which is an over heading neighbor, detects it and
establishes a local recovery path with maximum bandwidth from its route cache. This proposed
technique improves network performance and it prevents frequent collision.
Analyzing the Effect of Varying CBR on AODV, DSR, IERP Routing Protocols in M...IOSR Journals
Â
This document analyzes the performance of the AODV, DSR, and IERP routing protocols in a mobile ad hoc network (MANET) with varying constant bit rate (CBR) traffic loads. It conducts simulations in QualNet 6.1 and evaluates the protocols based on average end-to-end delay, throughput, average jitter, and packet delivery ratio under different CBR values. The results show that AODV generally performs best with low and stable delay, jitter and high throughput and delivery ratio. DSR has better performance than IERP for throughput and delivery ratio. IERP shows the worst performance for delay and jitter as CBR increases. The document concludes by stating AODV is best overall but
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
The document describes an intersection-based geographical routing protocol (IGRP) for vehicular ad hoc networks (VANETs) that uses an anonymous batch authentication and key agreement scheme (ABAKA) for security. IGRP selects optimal routes between intersections to ensure network connectivity while satisfying quality of service constraints. It formulates the routing problem as an optimization problem solved using a genetic algorithm. ABAKA allows for batch authentication of multiple requests and establishes session keys efficiently using elliptic curve cryptography to reduce overhead. It provides anonymity and deals with invalid requests. The proposed approach uses IGRP with ABAKA to provide a secure routing environment for value-added services in VANETs.
Quick Routing for Communication in MANET using Zone Routing Protocolijceronline
Â
rnational Journal of Computational Engineering Resaerch 2014, Volume 4 ~ Issue 11 (November 2014)
Abstract
The paper discusses the voltage control of a critical load bus using dynamic voltage restorer (DVR) in a distribution system. The critical load requires a balanced sinusoidal waveform across its terminals preferably at system nominal frequency of 50Hz .It is assumed that the frequency of the supply voltage can be varied and it is different from the system nominal frequency. The DVR is operated such that it holds the voltage across critical load bus terminals constant at system nominal frequency irrespective of the frequency of the source voltage. In case of a frequency mismatch, the total real power requirement of the critical load bus has to be supplied by the DVR. Proposed method used to compensate for frequency variation, the DC link of the DVR is supplied through an uncontrolled rectifier that provides a path for the real power required by the critical load to flow .A simple frequency estimation technique is discussed which are Discrete Fourier transform (DFT), ANN controller. The present work study the compensation principle and different control strategies of DVR used here are based on DFT, and ANN Controller .Through detailed analysis and simulation studies using MATLAB. It is shown that the voltage is completely controlled across the critical load.
Delay Tolerant Network (DTN) is a promising technology which aims to provide efficient
communication between devices in a network with no guaranteed continuous connectivity. Most
of the existing routing schemes for DTNs achieve message delivery through message replication
and forwarding. However, due to the lack of contemporaneous end-to-end communication path,
designing routing protocols that can achieve high delivery rate with low communication
overhead is a challenging problem. Some routing protocols appear with high similarity, but
their performance are significantly different. In this paper, we evaluate several popular routing
protocols in DTNs, including Epidemic, Spray and Wait, PRoPHET, and 3R through extensive
trace-driven simulations. The objective is to evaluate the performance of different routing
schemes using different data traces and investigate the optimal configuration setting for each
routing scheme. This paper provides important guidances on the design and selection of routing
protocols for given delay tolerant networks.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
User centric data dissemination in disruption tolerant networkasShowyou Tang
Â
This document summarizes a presentation on user-centric data dissemination in disruption tolerant networks. It discusses the problem of maximizing cost-effectiveness in uncontrollable network environments. An approach is presented that uses centrality metrics and multi-hop centrality to select optimal relay nodes. Simulation results on realistic DTN traces show the approach outperforms flooding and has better performance under different time, buffer, and network information constraints.
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...eSAT Publishing House
Â
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
2010-04-24-DTN-based Delivery of Word-of-Mouth Information with Priority and ...Kawai (Sun) Akira (Weihua)
Â
1) The document proposes a method for delivering word-of-mouth information in rural areas using delay tolerant networks and priority-based scheduling at information boxes.
2) It aims to maximize user satisfaction by estimating delivery times, replicating data appropriately, and prioritizing higher importance data with deadlines.
3) The method was tested in a simulation and showed improved total user satisfaction compared to FIFO and deadline-based scheduling.
Efficient routing in intermittently connected mobileleftbank12345
Â
This document summarizes a seminar presentation on efficient routing in intermittently connected mobile networks using multiple copies. It discusses routing techniques like proactive, on-demand, and location-based routing. It also describes ad-hoc networks, their structure and differences from cellular networks. Flooding is explained as the simplest routing mechanism in ad-hoc networks along with its limitations. Multiple copy routing strategies are compared to single-copy and existing schemes like spray and wait. The advantages of lower delay and higher robustness and limitation of low efficiency of multiple copy routing are outlined.
Name a naming mechanism for delay disruption tolerant networkIJCNCJournal
Â
This paper presents the design and implementation of the naming mechanism (NAME), a resource
discovery and service location approach for Delay/Disruption-Tolerant Network (DTN). First discuss the
architecture of NAME mainly including Name Knowledge Base, Name Dissemination, Name Resolution
and Name-based Routing. In the design and implementation of NAME, we introduce the simple namespecifiers
to describe name, the name-tree for name storage and the efficient predicate-based routing
algorithm. Future work is finally discussed for completing NAME and providing APIs for abundant
applications.
The document discusses efficient routing techniques for intermittently connected mobile networks (ICMNs). It begins by introducing ICMNs and the challenges of routing in such networks where end-to-end paths may not always exist. It then summarizes various routing approaches including flooding-based epidemic routing and single-copy schemes. The document proposes two spray-based routing techniques: (1) Spray and Wait, which sprays a fixed number of message copies and waits for a copy to reach the destination, and (2) Spray and Focus, which uses utility-based routing to focus copies towards the destination after the spray phase. Expected delays are analyzed for Spray and Wait. Different mobility models for analysis are also discussed.
Improved aodv based on energy strength and dropping ratioIJLT EMAS
Â
Wireless Sensor Networks are the latest trends in the
market due to the demand for communication and networking
among the wireless network devices. The routing protocols are
used in the Wireless Sensor Networks for efficient
communication of data between sensor nodes. The designs of
routing protocols in Wireless Sensor Networks are very concern
because they are influenced by many challenging factors. To
design the networks, the factors needed to be considered are the
coverage area, mobility, energy power consumption,
communication capabilities etc.. Broadcasting is an inevitable
operation in the route discovery phase of AODV protocol. A
probability based AODV is proposed, it uses nodes remaining
energy and threshold random delay to generate the
rebroadcasting of route request packet. The route request packet
of AODV is modified to gather nodes remaining energy strength.
The performance of probability based AODV is compared with
AODV over packet delivery fraction, normalized routing
overhead, delay and average acquisition latency.
NS-2 based simulator is used to evaluate the performance of
routing protocol.
ROUTING IN OPTICAL MESH NETWORKS-A QOS PERSPECTIVEijasuc
Â
Wireless Ad-Hoc Mesh Networks are characterized by static nodes connected in a mesh topology. A routing
protocol discovers and maintains the route for successful transmission of data in a network. The routing
protocol should also provide load balancing and fault tolerance for improved network performance. In
Free Space Optical networks (FSO) line of sight (LOS) should be maintained between the two
communicating nodes. In a multihop scenario maintaining LOS during routing is a challenge. In this paper
we propose a routing protocol Quality of Service-Directional Routing Protocol (QDRP) - which assures a
certain level of performance to a data flow in terms of delay and implemented on FSO MANET. Through
simulations it is observed that QDRP chooses the path with the least delay and performs satisfactorily
under varying node densities and transmission rates achieving end to end delay of .14 s and packet delivery
percentage of 96% when simulated for an area of 1300 m *1300 m for 100 nodes. This work explores the
potential of the proposed routing protocol for free space optical mesh networks. QDRP is compared with
ORRP (Orthogonal Rendezvous Routing Protocol) and AODV (Ad-Hoc on Demand Distance Vector), a
reactive protocol which is also implemented in free space optical environment. We support our conclusions
that QDRP gains in terms of packet delivery percentage, end to end delay and goodput.
Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANETijsrd.com
Â
It is a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc networks. The existing work presented two self-adaptive on-demand geographic routing schemes to build efficient paths based on the needs of user applications and adapt to various scenarios for provide efficient and reliable routing. To overcome the impact due to inaccurate local topology knowledge, the topology information is updated at a node in the specific time periods. The on-demand routing mechanism reduces to control overhead made on geographic routing. The route optimization scheme adapts routing path according to the topology changes and actual data traffic requirements. Adaptive parameter setting scheme is introduced to allow each node to determine and adjust the protocol parameter values independently. However, existing work did not address resource parameters such as energy, bandwidth and data loss. The proposal presents and Integrated Resource Adaptive on Demand Geographic Routing (IRA-ODGR) for MANET. The node energy resource is optimized with path energy consumption rate and bandwidth utilization of the path is analysed. Loss rate is reduced in geographic routing with dynamic routes. The simulation conducted to demonstrate IRA-ODGR routing protocols.
ROUTING IN OPTICAL MESH NETWORKS-A QOS PERSPECTIVEijasuc
Â
Wireless Ad-Hoc Mesh Networks are characterized by static nodes connected in a mesh topology. A routing
protocol discovers and maintains the route for successful transmission of data in a network. The routing
protocol should also provide load balancing and fault tolerance for improved network performance. In
Free Space Optical networks (FSO) line of sight (LOS) should be maintained between the two
communicating nodes. In a multihop scenario maintaining LOS during routing is a challenge. In this paper
we propose a routing protocol Quality of Service-Directional Routing Protocol (QDRP) - which assures a
certain level of performance to a data flow in terms of delay and implemented on FSO MANET. Through
simulations it is observed that QDRP chooses the path with the least delay and performs satisfactorily
under varying node densities and transmission rates achieving end to end delay of .14 s and packet delivery
percentage of 96% when simulated for an area of 1300 m *1300 m for 100 nodes. This work explores the
potential of the proposed routing protocol for free space optical mesh networks. QDRP is compared with
ORRP (Orthogonal Rendezvous Routing Protocol) and AODV (Ad-Hoc on Demand Distance Vector), a
reactive protocol which is also implemented in free space optical environment. We support our conclusions
that QDRP gains in terms of packet delivery percentage, end to end delay and goodput.
A Survey On Hybrid Routing Protocols In MANETSSabrina Ball
Â
This document summarizes a survey on hybrid routing protocols in mobile ad hoc networks (MANETs). It begins by defining MANETs and explaining that hybrid routing protocols combine reactive and proactive routing approaches. It then briefly describes proactive, reactive, and hybrid routing protocols. The body of the document focuses on explaining several examples of hybrid routing protocols in more detail, including Zone Routing Protocol (ZRP), Fisheye State Routing (FSR), and others. It provides overview information on how each protocol combines reactive and proactive routing mechanisms to optimize performance for MANETs.
International Journal of Computational Engineering Research(IJCER)ijceronline
Â
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
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.
Dvr based hybrid routing protocols in mobile ad-hoc network application and c...eSAT Publishing House
Â
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
This document summarizes and compares three routing protocols for mobile ad hoc networks (MANETs): AODV, DSR, and DSDV. It describes that MANETs are infrastructureless wireless networks without centralized administration. Routing in MANETs is complex due to frequent changes in network topology as nodes move. The document then provides an overview of AODV as a reactive routing protocol that establishes routes on demand, DSR as another reactive source-initiated protocol using source routing, and DSDV as a proactive table-driven protocol that maintains routing tables. It notes that AODV routing messages require little processing to minimize overhead and allows quick reaction to link breaks.
Survey of Reactive Routing Protocols for MANETIOSR Journals
Â
Abstract : A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. The main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides a scalable solution to relatively large network topologies. The design follows the idea that each node tries to reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is needed. The performance differentials are analyzed using varying performance metrics. These simulations are carried out using the ns-2 network simulator. Keywords â AODV, DSR, MANET, NS-2, Reactive routing protocols, Survey.
Survey of Reactive Routing Protocols for MANETIOSR Journals
Â
A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any
network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes
are free to move about and organize themselves into a network. These nodes change position frequently. The
main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy
is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides
a scalable solution to relatively large network topologies. The design follows the idea that each node tries to
reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV
are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is
needed. The performance differentials are analyzed using varying performance metrics. These simulations are
carried out using the ns-2 network simulator
Network size variation of geographical aided routing protocols in MANETnooriasukmaningtyas
Â
In position-based or geo-casting ad hoc networking applications, the data packets flooded in a limited area of the expected region toward the destination node. In such networks, a multi-hop routing is to followed when the position of the destination node is residing off-range the wireless transmission of the source node. Scientific literature references in this concept have been conducted depended on the diversity of quantitative metrics-tests regarding the size of the assigned networks so that this space is intended to be the variation in the density of the moving nodes (the number of nodes per unit of measurement). In this work, we studied the impact of the change in the size (area) of the ad hoc network with the concept of variation in the network's area while remaining the total number of nodes as a constant volume. In this paper, three of the position-based routing protocols have evaluated in terms of a network size variation. These routing protocols are: locations aided routing LAR, the distance routing effect algorithm for mobility DREAM, and the greedy perimeter stateless routing GPSR. With each simulation test, a quantitative metrics evaluation determined the most efficient protocol and the most efficient accessibility with the network environment changes in terms of actual workspace.
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
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
ECA MODEL BASED QOS AODV ROUTING FOR MANETSIJCNCJournal
Â
Applications like banking, interactive multimedia, movie on demand, VOIP, etc., are delay sensitive by
nature. The QoS given to users will be affected by network delay, which can be mitigated by employing
QoS routing and efficient data transfer. To build routing table, normal AODV routing uses flooding
technique, which will not consider QoS requirements. Hence QoS based routing which is stable for the
entire application is essential, which understands the dynamic nature of the MANET and establishes the
required route, in minimum possible time. We have proposed an intelligent routing protocol based ECA
model and AODV for establishing QoS route.
The simulation results shows that the ECA model gives better results, while considering the local
connectivity time, source to destination connectivity time, number of data packets successfully delivered to
the destination, local and global error correction time, compared to AODV.
This document proposes a secured-bandwidth reservation distance vector routing protocol for mobile ad hoc networks (MANETs). It aims to improve quality of service (QoS) parameters like bandwidth reservation while providing security. The protocol is an extension of the Destination Sequence Distance Vector Routing Protocol (DSDV) that additionally reserves bandwidth along routing paths and includes nodes' bandwidth information in routing table updates. It uses an intruder detection method and secure key agreement between source and destination nodes using RSA encryption to authenticate nodes and securely transmit data. The protocol is evaluated through network simulations which show it can authorize nodes, authenticate nodes, ensure non-repudiation and protect message integrity.
This document summarizes a research paper that proposes a new routing protocol called Timer Based DFS-LAROD (TBD-LAROD) for intermittently connected mobile ad hoc networks (MANETs). The protocol uses a timer function and depth first search approach to handle voids (areas with no nodes) during packet routing. When a node encounters a void, it sets a void flag. This flag is passed along routes to help avoid voids. The timer function considers void flags, node progress towards the destination, and load balancing to select the next hop. Simulation results show TBD-LAROD improves delivery ratio compared to the existing LAROD-LoDiS protocol without void handling.
This document summarizes a research paper that compares the performance of two reactive routing protocols (AODV and DSR) in mobile ad hoc networks (MANETs) using the NS-2 simulator. It provides background on MANETs and describes the key mechanisms of AODV and DSR. The document then outlines the simulation setup, including mobility and traffic models, and the performance metrics used to evaluate and compare the protocols: packet delivery ratio, throughput, and average end-to-end delay.
Similar to IJCER (www.ijceronline.com) International Journal of computational Engineering research (20)
Ocean lotus Threat actors project by John Sitima 2024 (1).pptxSitimaJohn
Â
Ocean Lotus cyber threat actors represent a sophisticated, persistent, and politically motivated group that poses a significant risk to organizations and individuals in the Southeast Asian region. Their continuous evolution and adaptability underscore the need for robust cybersecurity measures and international cooperation to identify and mitigate the threats posed by such advanced persistent threat groups.
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdfChart Kalyan
Â
A Mix Chart displays historical data of numbers in a graphical or tabular form. The Kalyan Rajdhani Mix Chart specifically shows the results of a sequence of numbers over different periods.
leewayhertz.com-AI in predictive maintenance Use cases technologies benefits ...alexjohnson7307
Â
Predictive maintenance is a proactive approach that anticipates equipment failures before they happen. At the forefront of this innovative strategy is Artificial Intelligence (AI), which brings unprecedented precision and efficiency. AI in predictive maintenance is transforming industries by reducing downtime, minimizing costs, and enhancing productivity.
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.
Taking AI to the Next Level in Manufacturing.pdfssuserfac0301
Â
Read Taking AI to the Next Level in Manufacturing to gain insights on AI adoption in the manufacturing industry, such as:
1. How quickly AI is being implemented in manufacturing.
2. Which barriers stand in the way of AI adoption.
3. How data quality and governance form the backbone of AI.
4. Organizational processes and structures that may inhibit effective AI adoption.
6. Ideas and approaches to help build your organization's AI strategy.
Dive into the realm of operating systems (OS) with Pravash Chandra Das, a seasoned Digital Forensic Analyst, as your guide. đ This comprehensive presentation illuminates the core concepts, types, and evolution of OS, essential for understanding modern computing landscapes.
Beginning with the foundational definition, Das clarifies the pivotal role of OS as system software orchestrating hardware resources, software applications, and user interactions. Through succinct descriptions, he delineates the diverse types of OS, from single-user, single-task environments like early MS-DOS iterations, to multi-user, multi-tasking systems exemplified by modern Linux distributions.
Crucial components like the kernel and shell are dissected, highlighting their indispensable functions in resource management and user interface interaction. Das elucidates how the kernel acts as the central nervous system, orchestrating process scheduling, memory allocation, and device management. Meanwhile, the shell serves as the gateway for user commands, bridging the gap between human input and machine execution. đ»
The narrative then shifts to a captivating exploration of prominent desktop OSs, Windows, macOS, and Linux. Windows, with its globally ubiquitous presence and user-friendly interface, emerges as a cornerstone in personal computing history. macOS, lauded for its sleek design and seamless integration with Apple's ecosystem, stands as a beacon of stability and creativity. Linux, an open-source marvel, offers unparalleled flexibility and security, revolutionizing the computing landscape. đ„ïž
Moving to the realm of mobile devices, Das unravels the dominance of Android and iOS. Android's open-source ethos fosters a vibrant ecosystem of customization and innovation, while iOS boasts a seamless user experience and robust security infrastructure. Meanwhile, discontinued platforms like Symbian and Palm OS evoke nostalgia for their pioneering roles in the smartphone revolution.
The journey concludes with a reflection on the ever-evolving landscape of OS, underscored by the emergence of real-time operating systems (RTOS) and the persistent quest for innovation and efficiency. As technology continues to shape our world, understanding the foundations and evolution of operating systems remains paramount. Join Pravash Chandra Das on this illuminating journey through the heart of computing. đ
Building Production Ready Search Pipelines with Spark and MilvusZilliz
Â
Spark is the widely used ETL tool for processing, indexing and ingesting data to serving stack for search. Milvus is the production-ready open-source vector database. In this talk we will show how to use Spark to process unstructured data to extract vector representations, and push the vectors to Milvus vector database for search serving.
Letter and Document Automation for Bonterra Impact Management (fka Social Sol...Jeffrey Haguewood
Â
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on automated letter generation for Bonterra Impact Management using Google Workspace or Microsoft 365.
Interested in deploying letter generation automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Nunit vs XUnit vs MSTest Differences Between These Unit Testing Frameworks.pdfflufftailshop
Â
When it comes to unit testing in the .NET ecosystem, developers have a wide range of options available. Among the most popular choices are NUnit, XUnit, and MSTest. These unit testing frameworks provide essential tools and features to help ensure the quality and reliability of code. However, understanding the differences between these frameworks is crucial for selecting the most suitable one for your projects.
Skybuffer SAM4U tool for SAP license adoptionTatiana Kojar
Â
Manage and optimize your license adoption and consumption with SAM4U, an SAP free customer software asset management tool.
SAM4U, an SAP complimentary software asset management tool for customers, delivers a detailed and well-structured overview of license inventory and usage with a user-friendly interface. We offer a hosted, cost-effective, and performance-optimized SAM4U setup in the Skybuffer Cloud environment. You retain ownership of the system and data, while we manage the ABAP 7.58 infrastructure, ensuring fixed Total Cost of Ownership (TCO) and exceptional services through the SAP Fiori interface.
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Â
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
A Comprehensive Guide to DeFi Development Services in 2024Intelisync
Â
DeFi represents a paradigm shift in the financial industry. Instead of relying on traditional, centralized institutions like banks, DeFi leverages blockchain technology to create a decentralized network of financial services. This means that financial transactions can occur directly between parties, without intermediaries, using smart contracts on platforms like Ethereum.
In 2024, we are witnessing an explosion of new DeFi projects and protocols, each pushing the boundaries of whatâs possible in finance.
In summary, DeFi in 2024 is not just a trend; itâs a revolution that democratizes finance, enhances security and transparency, and fosters continuous innovation. As we proceed through this presentation, we'll explore the various components and services of DeFi in detail, shedding light on how they are transforming the financial landscape.
At Intelisync, we specialize in providing comprehensive DeFi development services tailored to meet the unique needs of our clients. From smart contract development to dApp creation and security audits, we ensure that your DeFi project is built with innovation, security, and scalability in mind. Trust Intelisync to guide you through the intricate landscape of decentralized finance and unlock the full potential of blockchain technology.
Ready to take your DeFi project to the next level? Partner with Intelisync for expert DeFi development services today!
Skybuffer AI: Advanced Conversational and Generative AI Solution on SAP Busin...Tatiana Kojar
Â
Skybuffer AI, built on the robust SAP Business Technology Platform (SAP BTP), is the latest and most advanced version of our AI development, reaffirming our commitment to delivering top-tier AI solutions. Skybuffer AI harnesses all the innovative capabilities of the SAP BTP in the AI domain, from Conversational AI to cutting-edge Generative AI and Retrieval-Augmented Generation (RAG). It also helps SAP customers safeguard their investments into SAP Conversational AI and ensure a seamless, one-click transition to SAP Business AI.
With Skybuffer AI, various AI models can be integrated into a single communication channel such as Microsoft Teams. This integration empowers business users with insights drawn from SAP backend systems, enterprise documents, and the expansive knowledge of Generative AI. And the best part of it is that it is all managed through our intuitive no-code Action Server interface, requiring no extensive coding knowledge and making the advanced AI accessible to more users.
Programming Foundation Models with DSPy - Meetup SlidesZilliz
Â
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether youâre at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. Weâll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
IJCER (www.ijceronline.com) International Journal of computational Engineering research
1. Sadhana V, Ishthaq Ahamed K /International Journal Of Computational Engineering Research
/ Issn: 2250â3005
Location Aware Routing in Intermittently Connected MANETs
Sadhana V, Ishthaq Ahamed K
G. Pulla Reddy Engineering College, Department of CSE
Nandyal Road, Kurnool-518002,Andhra Pradesh
Abstract
Existing mobile ad hoc routing protocols like AODV, DSR and GPSR allow nodes to communicate with one another with
an assumption that there exists a connected path from source to destination. Due to limited transmission range, power
limitations, mobility of nodes, and the wide physical conditions over which ad hoc networks must be deployed; in some
scenarios it is likely that this assumption is invalid leading to intermittent connectivity and absence of end-to-end
connections. In this work, we propose a geographical routing algorithm called location-aware routing for delay-tolerant
networks (LAROD), enhanced with a location service, location dissemination service (LoDiS), which together are shown to
suit an intermittently connected MANET (IC-MANET). LAROD uses a beaconless strategy combined with a position-
based routing for forwarding the packets resulting in less overhead. LoDiS maintains a local database of node locations,
which is updated using broadcast gossip combined with routing overhearing.
Keywordsâ Delay-tolerant networks, location service, mobile ad hoc networks (MANETs), routing protocols,
intermittent connectivity.
I. INTRODUCTION
Intermittently connected mobile ad hoc networks (IC-MANET) are wireless networks where the nodes do not form a
completely connected network. Instead, they will form connected partitions that changes their topology often. This kind of
intermittent connectivity may happen when the network is quite sparse, in which case it can be viewed as a set of
disconnected, time-varying clusters of nodes. Intermittently connected mobile ad hoc networks is a type of Delay Tolerant
Networks (DTN) [1], that is, networks were incurred delays can be very large and unpredictable. There are many real
networks that fall into this category. Examples include disaster scenarios and military operations, wildlife tracking and
habitat monitoring sensor networks (IPN) etc.
Since in the IC-MANET model there may not exist an end-to-end path between a source and a destination, existing ad-
hoc network routing protocols, such as GPSR, DSR, AODV etc., would fail. To overcome the disconnected nature of IC-
MANETs and to successfully route the packets under such conditions, a store-carry forward technique is used. Mobility can
be exploited when wireless nodes cannot forward the packet.
In this paper we present a geographical routing protocol called Location Aware Routing for Opportunistic Delay-
Tolerant networks (LAROD) which relies on position information of the nodes. LAROD is a beaconless protocol that
greedily forwards packets towards the destination. When greedy forwarding is not possible a packet is temporarily stored
by the current custodian until a suitable forwarding node comes up. Routing of packets toward the geographical location
has shown to work well in IC-MANETs.
Clearly, a geographical routing protocol needs to be supplemented by a location service [2] that can provide the current
physical location of the destination node for a packet. A location service can range from simple flooding-based services to
hierarchical services. There have been many suggestions on how a location service can be provided in MANETs, but there
have been no suggestions on how this service can be provided in an IC-MANET or DTN setting. The location
dissemination service (LoDiS) is the first location service for IC-MANETs which disseminates node locations in the
network using a Brownian gossip technique.
In the next section we go over some existing routing algorithms for IC-MANETs and location services. Section III
presents LAROD and LoDiS protocol. Section IV, presents our evaluation of LAROD with LoDiS and compare the results
with spray and wait. Finally in section V we end the paper with some conclusions and ideas on future work.
II. BACKGROUND AND RELATED WORK
Proposals on how we can route packets in fully connected MANETs have been studied to a great extent. In the last
decade, this interest has broadened into networks with intermittent connectivity. In this section, we give an overview of IC-
MANET routing and location services.
A. Routing in IC-MANET
IJCER | July-August 2012 | Vol. 2 | Issue No.4 |1005-1011 Page 1005
2. Sadhana V, Ishthaq Ahamed K /International Journal Of Computational Engineering Research
/ Issn: 2250â3005
In a wireless mobile ad hoc network where an end-to-end path can never be assumed to exist between any two nodes,
mobility can be used to bridge the partitions. When there is no suitable forwarding node, a routing node can choose to
temporarily store a packet until node mobility presents a suitable forwarding node. This routing principle is called storeâ
carryâforward.
The design of an IC-MANET routing protocol depends on the amount of contact information available with the node.
The mobility of the nodes will constantly change the network topology and that nodes constantly come in contact with new
nodes and leave the communication range of others. Node contacts can be classified based on their predictability into
scheduled, predicted and opportunistic contacts. In scheduled contacts, the nodes know when they will be able to
communicate with a specific node. In predicted contacts, nodes can estimate likely meeting times or meeting frequencies
with specific nodes. If no such contact information is available with node then the contacts are opportunistic. LAROD
neither requires scheduled contacts nor predicted contacts and is thus well suited for networks with opportunistic contacts.
Routing in IC-MANETs with opportunistic contacts is challenging since contact information is not known in advance.
Three simple location unaware routing protocols for this environment are Randomized Routing, Epidemic Routing and
Spray and Wait. Randomized Routing [3] is a single copy routing scheme in which a packet randomly moves around the
network until it reaches the destination. Epidemic routing [6] extends the concept of flooding in IC-MANETs where every
node in the network receives a copy of the packet. Spray and Wait [5] routing protocol âspraysâ a limited number of copies
into the network, and then âwaitsâ until one of these nodes meets the destination.
If nodes are location-aware, then the relative position of the nodes can be used to make the forwarding decision. This is
a property used by LAROD. In addition to LAROD there are two other delay-tolerant geographical routing protocols
published. These protocols are motion vector (MoVe) and GeoDTN+Nav. Both these protocols are used in vehicular ad hoc
networks (VANETs) and assume the destination to be static.
Most of the proposed MANET routing protocols transfer packets between nodes in a unicast transfer mode and thus
does not exploit the broadcast nature of wireless transmissions. Opportunistic routing (OR) [8] fully embraces the broadcast
nature of wireless medium and thus an optimal route is constructed between the source and the destination by selecting the
âbestâ next forwarder. One way of selecting the best forwarder is by geographical selection that is the selection depends on
closeness to the destination. This approach is used in contention-based forwarding (CBF) [11] and beaconless routing
(BLR) [10]. LAROD is built on these principles and extends them to meet the requirements of an IC-MANET.
B. Location Services
A geographical routing protocol must be complemented by a location service that can provide position information for
all potential destinations. In this section, we will give an overview of the location services [2] used in MANETs and
discuss why most of them are not directly applicable to an IC-MANET.
Fig 1 shows taxonomy of the location services. At the top level, location services can be divided into flooding-based and
rendezvous-based or mapping-based approaches. A major difference between the flooding-based location services and the
mapping-based services lies with the number of nodes that act as location servers.
In the flooding-based services, all nodes in the network act
Fig. 1 Taxonomy of location services
as location servers. In the mapping-based services, only a subset of the nodes in the network act as location servers and the
location queries must be routed to one of these location servers.
In a mapping-based location service, the node that needs the location information of the destination node sends the
request to one of the node that act as location servers. In a delay-tolerant perspective, this case will significantly delay the
time until a message can be sent toward its destination due to the transport time for a location request and its response.
In the flooding-based services, the location information is located in the source node itself so there is no delay for
reaching the location service, but the time to acquire the location information differs between proactive and reactive
IJCER | July-August 2012 | Vol. 2 | Issue No.4 |1005-1011 Page 1006
3. Sadhana V, Ishthaq Ahamed K /International Journal Of Computational Engineering Research
/ Issn: 2250â3005
location services. A reactive location service tries to obtain the destination position information only when needed. If the
required information is not available in the local cache, then the location server broadcasts a location query over the
network. Due to the disconnected nature of the network, the reactive location services will result in delays as for the
mapping-based location services. To limit the cost of a location request the location service uses a Brownian gossip [13]
technique. In Brownian gossiping, nodes exchange information on previous encounters when two nodes meet. This
information can be used to guide a location request toward the destination nodeâs position.
In the proactive location service, each node periodically distributes its location information to other nodes in the network,
which means that location information is immediately available when needed in the source node. Examples of proactive
location services are: 1) the DREAM location service (DLS) [9] and 2) the simple location service (SLS) [9]. In DLS, a
node broadcasts its location to nearby nodes at a given rate and to nodes far away at a lower rate. The rates depend on a
nodeâs speed. In SLS, location data are only exchanged between neighbors. This exchanging of location tables between
neighbors keeps the communication local while permitting the location data to be distributed globally in the system. In both
DLS and SLS, if the required location data are not available in the source node, they inquire a node location by
broadcasting a request. As previously discussed, these systemwide broadcasts are problematic in an IC-MANET.
In order to minimize routing delays in an IC-MANET, all nodes must have a location service that has location data for all
other nodes in the network. Due to the disconnected nature of IC-MANETs, this information provided by the location
service might be old for some nodes. Even such inaccurate data can be used to route the packets successfully with a proper
design of the routing protocol. LoDiS is based on SLS and modify the concept as required to meet the demands of an IC-
MANET environment.
III.
LOCATION AWARE ROUTING
This section describes the IC-MANET geographical routing protocol LAROD [4], followed by a description of the IC-
MANET location service LoDiS.
A. LAROD
LAROD is a geographical routing protocol for IC-MANETs that use greedy packet forwarding when possible. When
greedy forwarding is not possible, the node that currently holds the packet (the custodian) waits until node mobility makes
it possible to resume greedy forwarding. It is a beaconless protocol that combines geographical routing with the storeâ
carryâforward principle.
A custodian forwards a message toward the destination by simply broadcasting it. All nodes within a predefined
forwarding area are called tentative custodians and are eligible to forward the packet. All tentative custodians set a delay
timer td specific for each node, and the node whose delay timer expires first is selected as the new custodian. The new
custodian forwards the message in the same manner as the previous custodian. The old custodian that forwarded the
message and other tentative custodians will overhear this broadcast and conclude that a new node has taken over custody of
the packet. If the current custodian does not overhear any such broadcast within an interval of tr (rebroadcast time), it
repeats the broadcast of the message until a new custodian becomes available due to node mobility.
It is also possible that all nodes in the forwarding area may not overhear the transmission made by the new custodian,
thereby producing packet duplicates. This case will not only increase the load in the system but results in exploration of
multiple paths toward the destination. When the paths of two copies cross, only one copy will continue to be forwarded.
When the time to live tTTL for a packet, which is expressed as duration, expires, a packet is deleted by its custodian. This is
done to prevent a packet from indefinitely trying to find a path to its destination.
Fig 2 LAROD forwarding areas
IJCER | July-August 2012 | Vol. 2 | Issue No.4 |1005-1011 Page 1007
4. Sadhana V, Ishthaq Ahamed K /International Journal Of Computational Engineering Research
/ Issn: 2250â3005
Source node at data packet generation
Get location data for destination from location service
Broadcast data packet
Set up the timer for rebroadcast to tr
Destination node at data packet reception
If the packet is received for the first time
Deliver data packet to application
Broadcast ack packet
Else
Broadcast ack packet
All intermediate (non-destination) nodes at data packet
reception
Update location service with location information of the
data packet
//Packet has been received by the destination
If an ack has been received for the packet
Broadcast ack packet
//The node is a tentative custodian
If the node is the forwarding area
If the node has an active copy of the packet
Set up timer for rebroadcast to td
Else
Do nothing
Else
Remove active copy of the packet if it has one
At ack packet reception
Update location service with location information of the
ack packet
If the node has an active copy of the packet
Broadcast ack packet
Remove data packet
Else
Do nothing
When a data packet rebroadcasting timer expires
If the packetâs TTL has expired
Remove packet
Else
Update data packetâs location information with
location server data
Broadcast data packet
Set up the timer for rebroadcast to tr
Fig 3 LAROD pseudo code
The forwarding area can have many shapes as shown in fig 2. Examples of shapes include a 60⊠circle sector, a
Reuleaux, triangle, or a circle [Fig. 2(a)â(c)]. The longest distance between two points within these shapes must be the
assumed radio range. If we want to maximize the probability of determining a new custodian, then the forwarding area
should include all nodes that guarantee progress toward the destination [Fig. 2(d)]. In this paper, we have chosen progress
forwarding area.
IJCER | July-August 2012 | Vol. 2 | Issue No.4 |1005-1011 Page 1008
5. Sadhana V, Ishthaq Ahamed K /International Journal Of Computational Engineering Research
/ Issn: 2250â3005
When a packet has been received by the destination, it sends an acknowledgement packet (ack) to stop further
transmission of a packet by custodians and tentative custodians. All nodes that hear an acknowledgement will store the
acknowledgement information until the packet times out. If a node receives a packet for which it previously has received an
acknowledgement, then it broadcasts an acknowledgement packet to stop further transmission of the packet.
LAROD inquires the location service at each packet hop to overcome the inaccuracies of an IC-MANET location
service, and if more recent position data are available, then the routed packet is updated. In this way, the location data is
incrementally updated with accurate data as the packet approaches the destination. To still improve the quality of the
location data in the location service, LAROD routing protocol provides it with the location data available in received
packets. Fig. 3 shows the pseudocode for LAROD routing protocol.
B. LoDiS
Due to the network partitioning of an IC-MANET environment, the information exchanged between the nodes can be
delayed, which means that any time-dependent information that is received is more or less inaccurate. This indicates that
any location service in an IC-MANET will generally provide inaccurate location data. This may be due to the time taken
for a location update to reach the location server and/or the time taken for a location request to be answered by a location
service. To avoid such delays, in LoDiS, every node acts as a location server, and location updates are made by data
exchanges as nodes encounter each other. The reason for treating all nodes as location servers is to avoid delaying the
packet at the source node.
When the routing protocol requests a location from the location service, LoDiS, the location data provided by
LoDiS will be wrong due to the mobility of the nodes, but if the provided location points the data packet in the approximate
right direction, it should be possible to use it as an initial estimate. To limit the location error, the geographical routing
protocol should update the packetâs location information for each node that the packet traverses. This is carried out by
inquiring the nodeâs local location server whether it has more accurate location information for the destination. This is
based on the fact that nodes closer to the destination should have correct information on the destinationâs location. Thus the
accuracy of the destination location is incrementally increased.
LoDiS is built on the conceptual solution used by SLS. A LoDiS location server periodically broadcasts the
information it has in its location table. Any node receiving this broadcast compares the information with the one it has, and
the most recent information will be propagated when that node makes its LoDiS broadcast. In this way, the location
information is distributed throughout the network. In addition to this
Broadcast location data at a set interval
Select location data vector with elements(node, location,
timestamp)
Broadcast location data
When a LoDiS broadcast is received
If the received location data is more recent
Update the entry in the LoDiS server
When the location data is received from the routing protocol
If the data received is more recent
Update the entry in the LoDiS server
Fig 4 LoDiS pseudocode
routing protocol. The geographical routing protocol provides the location service with location information present in the
packet that it routes, which helps to improve the data in the location service. The pseudocode for LoDiS is shown in Fig.4.
IV. EVALUATION
In this section, the results from the evaluations of LARODâLoDiS are shown. The routing protocols have been evaluated
in the network simulator ns-2. The LARODâLoDiS scheme is compared with an efficient delay-tolerant routing algorithm
called spray and wait and is shown to have a competitive edge, both in terms of delivery ratio and overhead.
Delivery ratio and effort required for each generated data packet (overhead) are the two main evaluation metrics
used. The delivery ratio determines the quality of service as perceived by the user or application and it is the most
important evaluation criterion. The effort will be measured as the number of transmissions performed per generated data
packet.
IJCER | July-August 2012 | Vol. 2 | Issue No.4 |1005-1011 Page 1009
6. Sadhana V, Ishthaq Ahamed K /International Journal Of Computational Engineering Research
/ Issn: 2250â3005
Comparing the delivery ratio and overhead of LARODâLoDiS with spray and wait, a leading nongeographic delay
tolerant routing scheme, we see that the benefit of using geographical information and active forwarding is very high (see
Figs. 5â8). Fig. 5 shows the impact of the packet lifetime on the delivery ratio. As shown, both routing protocols benefit
from having more time to find a path from the source to the destination. The performance of LAROD is high compared to
spray and wait because spray and wait mainly uses node mobility to forward packets, whereas LAROD actively forwards
the packet through peers toward the destination. Due to frequent node encounters, the protocols that actively forward the
packets outperform protocols that rely on node mobility. As shown in fig. 6, the overhead for spray and wait is about
double that of LARODâLoDiS. Overhead in spray and wait are due to the beacons and the query and response packets, i.e.,
packets not present in LARODâLoDiS.
Comparing the two routing protocols with respect to varying node densities, we can make some interesting observations.
For both routing protocols, the delivery ratio improves with increased node density (see Fig. 7). Looking at
Fig 5 Delivery Ratio for different packet life times
Fig 6 Overhead for different packet lifetimes
Fig 7 Delivery ratio for different node densities
Fig 8 Overhead for different node densities
IJCER | July-August 2012 | Vol. 2 | Issue No.4 |1005-1011 Page 1010
7. Sadhana V, Ishthaq Ahamed K /International Journal Of Computational Engineering Research
/ Issn: 2250â3005
the overhead in Fig. 8, we observe that the overhead for LAROD-LoDiS is less compared to spray and wait.
V. CONCLUSION
Geographical routing protocols works efficiently in MANETs and IC-MANETs due to the availability of node location
information. One major criterion for a geographical routing protocol is a well-performing location service. The location
service provides the location information of the destination to route a packet toward.
This paper has shown that, by continuous updation of packetâs location information, geographical routing in IC-
MANETs is possible. The location service (LoDiS) has then been integrated with a routing protocol (LAROD) and
thoroughly studied in comparison with a high-performance baseline.
Further studies can be done on different location services for MANETs and IC-MANETs. Performance metrics
can be evaluated for LAROD-LoDiS based on the location service chosen.
LAROD-LoDiS routing algorithm handles intermittent connectivity but it is not suitable for systems with varying
density (sparse and dense areas). For sparse systems, distribution of location information takes much time. For very large
systems with thousands of nodes, the difficulty will be to distribute the location information to all the nodes in the system.
The transfer of location information in such dense systems consumes much bandwidth of the network. In such scenarios,
one can probably employ the density based techniques to overcome the density variation problem. The basic idea behind
this technique is to detect the density of the network and defining the broadcast rate based on density.
REFERENCES
[1] F. Warthman, Delay-Tolerant Networks (DTNs): A Tutorial v1.1. Warthman Assoc., Mar. 2003. [Online]. Available:
http://www.dtnrg.
org/docs/tutorials/warthman-1.1.pdf
[2] S. M. Das, H. Pucha, and Y. C. Hu, âPerformance comparison of scalable location services for geographic ad hoc
routing,â in Proc. IEEE 24th Annu. Joint Conf. IEEE Comput. Commun. Soc., 2005, pp. 1228â1239.
[3] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, âEfficient routing in intermittently connected mobile networks:
The single-copy case,â IEEE/ACM Trans. Netw., vol. 16, no. 1, pp. 63â76, Feb. 2008.
[4] E. Kuiper and S. Nadjm-Tehrani, âGeographical routing in intermittently connected ad hoc networks,â in Proc. 1st
IEEE Int.Workshop Opportunistic Netw., 2008, pp. 1690â1695.
[5] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, âSpray and wait: An efficient routing scheme for intermittently
connected mobile networks,â in Proc. ACM SIGCOMM Workshop Delay-Tolerant Netw., 2005, pp. 252â259.
[6] A. Vahdat and D. Becker, âEpidemic routing for partially connected ad hoc networks,â Duke Univ., Durham, NC,
Tech. Rep. CS-2000-06, 2000.
[7] V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, and H.Weiss, Delay-tolerant networking
architecture. RFC 4838. [Online]. Available: ftp://ftp.rfc-editor.org/in-notes/rfc4838.txt
[8] R. Bruno and M. Nurchis, âSurvey on diversity-based routing in wireless mesh networks: Challenges and solutions,â
Comput. Commun., vol. 33, no. 3, pp. 269â282, Feb. 2010.
[9] T. Camp, J. Boleng, and L. Wilcox, âLocation information services in mobile ad hoc networks,â in Proc. IEEE Int.
Conf. Commun., 2002, pp. 3318â3324.
[10] M. HeissenbĂŒttel, T. Braun, T. Bernoulli, and M. WĂ€lchi, âBLR: Beaconless routing algorithm for mobile ad hoc
networks,â Comput. Commun., vol. 27, no. 11, pp. 1076â1086, Jul. 2004.
[11] H. FĂŒler, J. Widmer, M. KĂ€semann, M. Mauve, and H. Hartenstein, âContention-based forwarding for mobile ad hoc
networks,â Ad Hoc Netw., vol. 1, no. 4, pp. 351â369, Nov. 2003.
[12] D. Johnson and D. Maltz, âDynamic source routing in ad hoc wireless networks,â in Mobile Computing. Norwell,
MA: Kluwer, 1996, pp. 153â181.
[13] R. R. Choudhury, âBrownian gossip: Exploiting node mobility to diffuse information in ad hoc networks,â in Proc.
Int. Conf. Collaborative Comput.: Netw., Appl. Worksharing, 2005, pp. 1â5.
IJCER | July-August 2012 | Vol. 2 | Issue No.4 |1005-1011 Page 1011