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.
IMPROVED NETWORK CONNECTIVITY IN MANETSIJCNCJournal
The growth in wireless communication technologies has resulted in a considerable amount of
attention given to mobile adhoc networks. All mobile hosts in an adhoc network are embedded with
packet forwarding capabilities. It is decentralized and is independent of infrastructure. Since mobile
hosts in an adhoc network usually move freely, the topology of the network changes dynamically and
disconnection occurs frequently. These characteristics require the routing protocols to find an
alternative path towards the destination for data transfer. The existing on-demand routing protocols
does the alternative path establishment only after the disconnection of links in the existing path. The
data sent by the source during alternate path establishment period will be lost leading to incomplete
data transfer. The network traffic will therefore increase considerably. This problem can be overcome
by establishing an alternative path when the existing path is more likely to be broken, by sending a
warning message to the source indicating the likelihood of disconnection. In this paper an attempt has
been made to analyze a protocol that improves the network connectivity by preempting the alternative
path before the existing link gets failed by monitoring the signal strength and ‘age of the path’.
Bandwidth aware on demand multipath routing in manetsijwmn
Mobile Ad-hoc Networks (MANETs) are self configuring, decentralized and dynamic nature wireless
networks which have no infrastructure. These offer a number of advantages, however the demand of high
traffic flows in MANETs increases rapidly. For these demands, limited bandwidth of wireless network is the
important parameter that restrains the development of real time multimedia applications. In this work, we
propose a solution to utilize available bandwidth of the channel for on demand multiple disjoint paths. The
approximate bandwidth of a node is used to find the available bandwidth of the path. The source chooses
the primary route for data forwarding on the basis of path bandwidth. The simulation results show that the
proposed solution reduces the frequency of broadcast and performs well in improving the end to end
throughput, packet delivery ratio, and the end to end delay.
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
As the network size increases the probability of congestion occurrence at nodes increases. This is
because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result
congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses.
In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce
end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector
routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing
(IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy
adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing
performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput
and packet delivery fraction
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
IMPROVED NETWORK CONNECTIVITY IN MANETSIJCNCJournal
The growth in wireless communication technologies has resulted in a considerable amount of
attention given to mobile adhoc networks. All mobile hosts in an adhoc network are embedded with
packet forwarding capabilities. It is decentralized and is independent of infrastructure. Since mobile
hosts in an adhoc network usually move freely, the topology of the network changes dynamically and
disconnection occurs frequently. These characteristics require the routing protocols to find an
alternative path towards the destination for data transfer. The existing on-demand routing protocols
does the alternative path establishment only after the disconnection of links in the existing path. The
data sent by the source during alternate path establishment period will be lost leading to incomplete
data transfer. The network traffic will therefore increase considerably. This problem can be overcome
by establishing an alternative path when the existing path is more likely to be broken, by sending a
warning message to the source indicating the likelihood of disconnection. In this paper an attempt has
been made to analyze a protocol that improves the network connectivity by preempting the alternative
path before the existing link gets failed by monitoring the signal strength and ‘age of the path’.
Bandwidth aware on demand multipath routing in manetsijwmn
Mobile Ad-hoc Networks (MANETs) are self configuring, decentralized and dynamic nature wireless
networks which have no infrastructure. These offer a number of advantages, however the demand of high
traffic flows in MANETs increases rapidly. For these demands, limited bandwidth of wireless network is the
important parameter that restrains the development of real time multimedia applications. In this work, we
propose a solution to utilize available bandwidth of the channel for on demand multiple disjoint paths. The
approximate bandwidth of a node is used to find the available bandwidth of the path. The source chooses
the primary route for data forwarding on the basis of path bandwidth. The simulation results show that the
proposed solution reduces the frequency of broadcast and performs well in improving the end to end
throughput, packet delivery ratio, and the end to end delay.
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
As the network size increases the probability of congestion occurrence at nodes increases. This is
because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result
congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses.
In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce
end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector
routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing
(IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy
adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing
performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput
and packet delivery fraction
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
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.
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
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
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.
Performance comparison of routing protocols in mobile ad hoc networksijujournal
Routing protocols have an important role in any Mobile Ad Hoc Network (MANET). Researchers have elaborated several routing protocols that possess different performance levels. In this paper we give a performance evaluation of AODV, DSR, DSDV, OLSR and DYMO routing protocols in Mobile Ad Hoc
Networks (MANETS) to determine the best in different scenarios. We analyse these MANET routing protocols by using NS-2 simulator. We specify how the Number of Nodes parameter influences their performance. In this study, performance is calculated in terms of Packet Delivery Ratio, Average End to End Delay, Normalised Routing Load and Average Throughput.
P ERFORMANCE C OMPARISON OF R OUTING P ROTOCOLS IN M OBILE A D H OC N E...ijujournal
Routing protocols have
an important
role in any
Mobile Ad Hoc Network
(MANET).
Researchers
have
elaborated several routing protocols that possess different performance levels
. In this
p
aper
we
give a
performance evaluation of
AODV,
DSR,
DSDV
, OLSR and DYMO
routing protocol
s
in
Mobile Ad Hoc
Networks
(MANETS)
to
determine
the best
in different scenarios
. We
analyse
these
MANET
routing
protocols by
using
NS
-
2 simulator
. We specify how
the
Number of No
d
es
parameter influences
their
performance. In this study
,
performance is
calculated
in terms
of Packet Delivery Ratio,
Average
End to
End Delay, Normalised Routing Load and Average Throughput
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
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.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
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, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
COMPARING THREE PROTOCOLS OF DODV, DSR, DSDV FOR VANET NETWORKpijans
An ad hoc network is a network created by wireless hosts that can be mobile. This means that no infrastructure such as a central station, router, roaming, or anything else used by other networks to help network structure or anything else that other networks use to help Network structure, is not used. Rather, they are just a few wireless nodes connecting to non neighboring nodes with the help of the neighboring nodes. Wireless ad hoc mobile network (MANET) and Wireless ad hoc inter-car network (VANET), are among wireless networks which have the most effective parameters in the ability of this type of networksto transfer multimedia from source to destination. In this research, we examine the challenges and solutions presented in DODV, DSR, and DSDV protocols.
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such
Networks are frequently limited by the network split due to either energy depletion or node mobility of the
mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths
becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path
breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric
system of measurement used to select the paths takes into account the stability of the nodes and the
equivalent links.
#NiUnaMenos, de 1 tweet a más muchos más de 500.000 el día de la manifestación colectiva en contra de la violencia de género. La explosión de datos en todas las formas - como blogs, foros, Facebook, Twitter y otros canales de medios sociales - ha dado a los usuarios una tribuna virtual de alcance e influencia sin precedentes. Ahora compartimos públicamente nuestros pensamientos sobre eventos, productos y servicios, y nos unimos para lograr los cambios. Al analizar 135 mil millones de tweets de América Latina identificamos que el futuro, la salud y la educación son los temas de mayor interés para todos nosotros. ¿Qué haremos con esto? Un tweet de 140 caracteres tiene 65 piezas de metadata, es decir, ofrece mucha información sobre nosotros, no sólo la ubicación geográfica, sino intereses, gustos, sueños, desafíos, compromisos, etc. Se publican 500 millones de tweets por día en el mundo. Analizar un conjunto de esos mensajes puede salvar vidas. Por ejemplo, en Indonesia se usa la información para alertar al gobierno sobre más inundaciones, derrumbes, falta de alimentos y hasta pedidos de ambulancias. Si un tweet mueve montañas, cómo aplicamos la tecnología de análisis de datos y procesamiento de lenguaje natural para mejorar la comprensión de los usuarios, salvar más vidas, identificar tendencias de mercado y aprovechar la inteligencia colectiva para innovar? Disertante: Horacio Cuervo de IBM Argentina
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.
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
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
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.
Performance comparison of routing protocols in mobile ad hoc networksijujournal
Routing protocols have an important role in any Mobile Ad Hoc Network (MANET). Researchers have elaborated several routing protocols that possess different performance levels. In this paper we give a performance evaluation of AODV, DSR, DSDV, OLSR and DYMO routing protocols in Mobile Ad Hoc
Networks (MANETS) to determine the best in different scenarios. We analyse these MANET routing protocols by using NS-2 simulator. We specify how the Number of Nodes parameter influences their performance. In this study, performance is calculated in terms of Packet Delivery Ratio, Average End to End Delay, Normalised Routing Load and Average Throughput.
P ERFORMANCE C OMPARISON OF R OUTING P ROTOCOLS IN M OBILE A D H OC N E...ijujournal
Routing protocols have
an important
role in any
Mobile Ad Hoc Network
(MANET).
Researchers
have
elaborated several routing protocols that possess different performance levels
. In this
p
aper
we
give a
performance evaluation of
AODV,
DSR,
DSDV
, OLSR and DYMO
routing protocol
s
in
Mobile Ad Hoc
Networks
(MANETS)
to
determine
the best
in different scenarios
. We
analyse
these
MANET
routing
protocols by
using
NS
-
2 simulator
. We specify how
the
Number of No
d
es
parameter influences
their
performance. In this study
,
performance is
calculated
in terms
of Packet Delivery Ratio,
Average
End to
End Delay, Normalised Routing Load and Average Throughput
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
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.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
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, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
COMPARING THREE PROTOCOLS OF DODV, DSR, DSDV FOR VANET NETWORKpijans
An ad hoc network is a network created by wireless hosts that can be mobile. This means that no infrastructure such as a central station, router, roaming, or anything else used by other networks to help network structure or anything else that other networks use to help Network structure, is not used. Rather, they are just a few wireless nodes connecting to non neighboring nodes with the help of the neighboring nodes. Wireless ad hoc mobile network (MANET) and Wireless ad hoc inter-car network (VANET), are among wireless networks which have the most effective parameters in the ability of this type of networksto transfer multimedia from source to destination. In this research, we examine the challenges and solutions presented in DODV, DSR, and DSDV protocols.
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such
Networks are frequently limited by the network split due to either energy depletion or node mobility of the
mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths
becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path
breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric
system of measurement used to select the paths takes into account the stability of the nodes and the
equivalent links.
#NiUnaMenos, de 1 tweet a más muchos más de 500.000 el día de la manifestación colectiva en contra de la violencia de género. La explosión de datos en todas las formas - como blogs, foros, Facebook, Twitter y otros canales de medios sociales - ha dado a los usuarios una tribuna virtual de alcance e influencia sin precedentes. Ahora compartimos públicamente nuestros pensamientos sobre eventos, productos y servicios, y nos unimos para lograr los cambios. Al analizar 135 mil millones de tweets de América Latina identificamos que el futuro, la salud y la educación son los temas de mayor interés para todos nosotros. ¿Qué haremos con esto? Un tweet de 140 caracteres tiene 65 piezas de metadata, es decir, ofrece mucha información sobre nosotros, no sólo la ubicación geográfica, sino intereses, gustos, sueños, desafíos, compromisos, etc. Se publican 500 millones de tweets por día en el mundo. Analizar un conjunto de esos mensajes puede salvar vidas. Por ejemplo, en Indonesia se usa la información para alertar al gobierno sobre más inundaciones, derrumbes, falta de alimentos y hasta pedidos de ambulancias. Si un tweet mueve montañas, cómo aplicamos la tecnología de análisis de datos y procesamiento de lenguaje natural para mejorar la comprensión de los usuarios, salvar más vidas, identificar tendencias de mercado y aprovechar la inteligencia colectiva para innovar? Disertante: Horacio Cuervo de IBM Argentina
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.
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
A Review of Ad hoc on demand distance vector routing and proposed AR-AODVEditor IJMTER
Mobile Ad-hoc networks are a key in the evolution of wireless networks. In mobile
ad hoc networks, there is no centralized infrastructure to monitor or allocate the resources
used by the mobile nodes. The absence of any central coordinator makes the routing a
complex one compared to cellular networks. The Ad hoc On Demand Distance Vector
(AODV) routing algorithm is a routing protocol designed for ad hoc mobile devices. AODV
uses an on demand approach for finding routes .A class of routing protocols called ondemand protocols has recently found attention because of their low routing overhead. The ondemand protocols depend on query floods to discover routes whenever a new route is needed.
Such floods take up a substantial portion of network bandwidth. The routing in Mobile ad hoc
network is difficult and number of reactive routing protocols like AODV, DSR, and DSDV
has been implemented. In this paper, an attempt has been made to thoroughly study all
AODVs and a new AODV is proposed called AR-AODV
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.
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
Abstract : As the network size increases the probability of congestion occurrence at nodes increases. This is because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses. In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing (IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput and packet delivery fraction. Keywords- DSDV, Hybrid protocol, AODV, IAODV, MANET
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.
Performance Improvement of Multiple Connections in AODV with the Concern of N...pijans
Mobile Ad-hoc Networks (MANETS) consists of a collection of mobile nodes without having a central
coordination. In MANET, node mobility and dynamic topology play an important role in the performance.
MANET provide a solution for network connection at anywhere and at any time. The major features of
MANET are quick set up, self organization and self maintenance. Routing is a major challenge in MANET
due to it’s dynamic topology and high mobility. Several routing algorithms have been developed for
routing. This paper studies the AODV protocol and how AODV is performed under multiple connections in
the network. Several issues have been identified. The bandwidth is recognized as the prominent factor
reducing the performance of the network. This paper gives an improvement of normal AODV for
simultaneous multiple connections under the consideration of bandwidth of node.
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 ON MULTIPATH ROUTING STRATEGY IN MULTI-HOP WIRELESS SENSOR NETWORK ijiert bestjournal
There are number of routing protocols proposed for the data transmission in WSN. Initially single path routing schemes with number of variations are proposed. Sti ll there were some drawbacks in single path routing . Single path routing was unable to provide the reliability and h igh throughput. Also security level was not conside red while routing. Recently,to remove the drawbacks of the s ingle path routing new routing technique is propose d called as multipath routing. In this paper we discussed the different multipath routing protocols with number of variants. Initiall y multipath routing was proposed for the purpose of guaranteed delivery of packet to sink in case of link or node failure. There are other protocols which are proposed for the reli ability,energy saving,security and high throughpu t. Some multipath routing protocols have discussed the load balancing and security during packet transmission.
Multipath Fault Tolerant Routing Protocol in MANET pijans
Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically
exchange data among themselves without the reliance on a fixed base station or a wired backbone network
and it the makes the routing a crucial issue to the design of the MANET. Multiple path routing protocols
are shown to be performance-effective alternatives over single-path routing for ad hoc networks and it
represents a promising routing method for wireless mobile ad hoc networks. Multi-path routing achieves
load balancing and is more resilient to route failures..In this paper we propose an energy efficient
multipath fault tolerant routing protocol to improve the reliability of data routing in Mobile ad hoc
networks. The proposed RFTA is a multi objective routing protocol that meets diverse application
requirements by considering the changing conditions of the network. The efficiency of the proposed
protocol has been evaluated on different scenarios and there has been a noticeable improvement in the
packet delivery ratio and also in the reduction of end-to-end delay comparing to SMR,SMS and MDSR.
Performance Comparison of Link, Node and Zone Disjoint Multi-Path Routing Str...ijwmn
The high-level contribution of this paper is a simulation-based analysis to evaluate the tradeoffs between lifetime and hop count of link-disjoint, node-disjoint and zone-disjoint multi-path routes vis-à-vis singlepath minimum hop routes for mobile ad hoc networks. The link-disjoint, node-disjoint and zone-disjoint algorithms proposed in this paper can be used to arrive at benchmarks for the time between successive multi-path route discoveries, the number of disjoint paths per multi-path set and the hop count per multipath set. We assume a multi-path set exists as long as at least one path in the set exists. Simulation results indicate that the number of zone-disjoint paths per multi-path set can be at most 2, which is far lower than the number of node and link-disjoint paths available per multi-path set. Also, the time between zonedisjoint multi-path discoveries would be far lower than the time between node and link-disjoint multi-path route discoveries and can be at most 45% more than the time between single minimum-hop path route discoveries. However, there is no appreciable difference in the average hop counts per zone-disjoint, node-disjoint and link-disjoint multi-path sets and it can be only at most 15% more than the average minimum hop count determined using single-path routing. We also observe that even though the number of link-disjoint paths per multi-path set can be as large as 35-78% more than the number of node-disjoint paths per multi-path set, the time between two successive link-disjoint multi-path discoveries can be at most 15-25% more than the time between two successive node-disjoint multi-path discoveries, without any significant difference in the hop count per multi-path set.
PERFORMANCE COMPARISON OF LINK, NODE AND ZONE DISJOINT MULTI-PATH ROUTING STR...ijwmn
The high-level contribution of this paper is a simulation-based analysis to evaluate the tradeoffs between
lifetime and hop count of link-disjoint, node-disjoint and zone-disjoint multi-path routes vis-à-vis singlepath minimum hop routes for mobile ad hoc networks. The link-disjoint, node-disjoint and zone-disjoint
algorithms proposed in this paper can be used to arrive at benchmarks for the time between successive
multi-path route discoveries, the number of disjoint paths per multi-path set and the hop count per multipath set. We assume a multi-path set exists as long as at least one path in the set exists. Simulation results
indicate that the number of zone-disjoint paths per multi-path set can be at most 2, which is far lower
than the number of node and link-disjoint paths available per multi-path set. Also, the time between zonedisjoint multi-path discoveries would be far lower than the time between node and link-disjoint multi-path
route discoveries and can be at most 45% more than the time between single minimum-hop path route
discoveries. However, there is no appreciable difference in the average hop counts per zone-disjoint,
node-disjoint and link-disjoint multi-path sets and it can be only at most 15% more than the average
minimum hop count determined using single-path routing. We also observe that even though the number
of link-disjoint paths per multi-path set can be as large as 35-78% more than the number of node-disjoint
paths per multi-path set, the time between two successive link-disjoint multi-path discoveries can be at
most 15-25% more than the time between two successive node-disjoint multi-path discoveries, without
any significant difference in the hop count per multi-path set.
EFFECT OF PAUSE TIME AND NODES ON PERFORMANCE OF AODV AND DSR ROUTING PROTOCO...Editor IJMTER
A central challenge in designing of wireless ad hoc networks is the development of dynamic
routing protocols that can efficiently find routes between two communication nodes when nodes are
mobile. To accomplish this, a number of ad hoc routing protocols had been proposed and implemented.
In wireless ad hoc network the selected protocol should find best route which can insure packet delivery
and packet integrity. Performance evolution of the protocols is the key step before selecting a particular
protocol. In this paper, the performance is compared on Ad hoc On-demand Distance Vector (AODV)
and Dynamic Source Routing (DSR) at application layer by varying the pause time and number of nodes
using QualNet 5.0.2 simulator. The average jitter, end-to-end delay, throughput and packet delivery
fraction (PDF) are the four common measures used for the comparison of the performance of above
protocols. The experimental results show that DSR perform better in low load and high pause time but
in case of high load and less pause time AODV outperform DSR.
An Effective and Scalable AODV for Wireless Ad hoc Sensor Networksijcnes
Appropriate routing protocol in data transfer is a challenging problem of network in terms of lower end-to-end delay in delivery of data packets with improving packet delivery ratio and lower overhead as well. In this paper we explain an effective and scalable AODV (called as AODV-ES) for Wireless Ad hoc Sensor Networks (WASN) by using third party reply model, n-hop local ring and time-to-live based local recovery. Our goal is to reduce time delay for delivery of the data packets, routing overhead and improve the data packet delivery ratio. The resulting algorithm AODV-ES is then simulated by NS-2 under Linux operating system. The performance of routing protocol is evaluated under various mobility rates and found that the proposed routing protocol is better than AODV.
Survey of Modified Routing Protocols for Mobile Ad-hoc Networkijsrd.com
In last few years extensive research work has been done in the field of routing protocols for Ad-hoc Network. Various routing protocols have been evaluated in different network conditions using different performance metrics. A lot of research has been done how to modify standard routing protocol in ad-hoc network to improve its performance. The hop count is not only metric that gives efficient routing path. There are various modified protocols which make the use of other parameters along with hop count to select the best routing path to the destination. In standard Ad-hoc On-demand Distance Vector (AODV) routing protocol only hop count is used for selecting the routing path. In this paper we have studied variants of AODV protocols with modified routing metric.
Survey: Multipath routing for Wireless Sensor NetworkEditor IJMTER
Reliability is playing very vital role in some application of Wireless Sensor Networks
and multipath routing is one of the ways to increase the probability of reliability. More over energy
consumption is constraint. In this paper, we provide a survey of the state-of-the-art of proposed
multipath routing algorithm for Wireless Sensor Networks. We study the design, analyze the tradeoff
of each design, and overview several presenting algorithms.
A Survey of Enhanced Routing Protocols for Manetspijans
Mobile Ad Hoc Networks (MANETs) form a class of dynamic multi-hop networks consisting of a set of
mobile nodes that intercommunicate on shared wireless channels. MANETs are self-organizing and selfconfiguring multi-hop wireless networks, where the network structure changes dynamically due to the node
mobility. There exists no fixed topology due to the mobility of nodes, interference, multipath propagation
and path loss. Hence efficient dynamic routing protocols are required for these networks to function
properly. Many routing protocols have been developed to accomplish this task. In this paper we survey
various new routing protocols that have been developed as extensions or advanced versions of previously
existing routing protocols for MANETs such as DSR, AODV, OLSR etc.
Performance analysis on multihop transmission using arp routing protocol in i...eSAT Journals
Abstract
Mobile Ad Hoc Network (MANET) are becoming more and more important in the modern environment. It can be used instantly to connect to the local or remote network without using the pre-existing infrastructure. The mobile or user in the network can together establish the infrastructure. In order to improve the limited range of radio transmission, multiple network ‘hops’ are needed so that the communication between the mobiles can be establish. There are varieties of protocol that had been proposed for the hopping methods but most of them suffer from high overhead. This project proposed a new method of hopping protocol for IEEE 802.11b using the existing network protocol which is Address Resolution Protocol (ARP). The ARP message is used in the network to find the MAC address of the destination. This can also be done by having multi hops where the proposed method using ARP designed will make an intermediate node act as a router in order to find the destination address and forward the data successfully. In this proposed method, the data is directly passed to the intermediate node and the intermediate node will help to find the route to the destination and passed the data to the destination node. This will reduce the transmission time. From the simulation obtained, it proved that the proposed method using the ARP protocol can works well as the existing network protocol which is Ad Hoc On-Demand Distance Vector (AODV). The simulation is composed into two types of environment which are with and without obstacles. The throughput, the packet loss and the round trip time for various distances is simulated and the results shows that the performance of the proposed method using ARP is much better compared to the AODV.
Index Terms: Address Resolution Protocol (ARP), Ad-Hoc, 802.11 Wifi, Hopping
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Designing Great Products: The Power of Design and Leadership by Chief Designe...
Jj3416911698
1. Jayshree Tajne, Veena Gulhane / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.1691-1698
1691 | P a g e
Multipath Node-Disjoint Routing Protocol to Minimize End To
End Delay and Routing Overhead for MANETs
Jayshree Tajne1
(Student), Veena Gulhane2
(Asst. Prof.)
Department of Computer Science and Engineering
G.H. Raisoni college of Engineering, Nagpur university, Maharashtra, India
ABSTRACT
Today, node-disjoint multipath routing
becomes an essential technique in communication
of packets among various nodes in network.
Mobile ad hoc networks typically having the high
mobility and frequent link failures, so multipath
routing protocol is crucially important. In this
paper, we proposed the multipath node-disjoint
routing based on AODV protocol. This routing
finds three node-disjoint routes from source to
destination. The main goal is to discover multiple
node disjoint paths with a low routing overhead
during a route discovery, also improve the end-to-
end delay and packet delivery ratio. The
performance of the proposed protocol investigated
and compared against the single path AODV and
multipath NDMP-AODV protocols through
simulation using .NET. Results have shown that
the proposed multipath routing protocol
outperforms both protocols in terms of routing
overhead, end to end delay and packet delivery
ratio.
Keywords- AODV, MANET, Multipath Routing,
Node-disjoint
I. INTRODUCTION
A mobile ad hoc network (MANET)
represents a system of wireless mobile nodes that can
self-organize into temporary network topologies,
allowing devices to internetwork in areas without any
pre-existing communication infrastructure. Mobile ad
hoc networks are characterized by high node
mobility, dynamic topology and low channel
bandwidth. In these scenarios, it is essential to
perform routing with maximal throughput and, at the
same time, with minimal control overhead. In the
networking research community, there is tremendous
interest in MANETs Routing [1]. Routing protocols
can be classified as either unipath or multipath based
on the number of routes between the source-
destination pair. Intuitively, network resources can be
better utilized by multipath routing and multipath
routing can offer performance improvements over
unipath routing [2]. Now days there are many
researches on multipath routing protocols for mobile
ad hoc networks [3].
Multipath routing protocols discover and
store more than one route in their routing table for
each destination node. In wireless scenarios, routes
are broken due to mobile nature of node. Also, the
wireless links used for data transmission are
inherently unreliable. Therefore multipath routing has
been used as an attractive alternative for shortest path
routing protocols. Multipath routing provides the
support for fault tolerance and load balancing. But
the existing multipath routing protocols have some
demerits such as larger routing overhead, less
multipath route and more difficult in search for
maximum relevant path. Node disjoint multipath
routing allows the establishment of multiple paths,
each consisting of a unique set of nodes between a
source and destination. We know that MANETs
consist of mobile nodes that cause frequent link
failures. This link failure causes two main problems.
Firstly, when a route break occurs, all packets that
have already been transmitted on that route are
dropped and it decreasing the average packet delivery
ratio (PDR). Secondly, the transmission of data
traffic is halted for the time till a new route is
discovered and it increasing the average end-to-end
delay.
In this paper, we develop multipath node-
disjoint routing protocol to minimize end to end
delay and routing overhead. The proposed approach
minimizes the effect of link failure. Hence, the above
mentioned two problems caused by frequent link
failures are addressed. This protocol ensures that
after a route is broken, the node can continuously
send data without any delay, using one of the backup
routes stored in its routing table during route
discovery process.
The remainder of the paper is structured as
follows. In Section II, related work is given by
providing a brief description of existing multipath
extensions of AODV routing protocol. Section III
presents the proposed multipath protocol. Simulation
and performance evaluation is presented in Section
IV. Finally, the conclusion is provided in Section V.
II. RELATED WORK
In this section, we discuss the previous work
done on multipath routing protocol. Multipath routing
2. Jayshree Tajne, Veena Gulhane / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.1691-1698
1692 | P a g e
creates multiple paths between a source-destination
pair. In case of the failure of first route, the backup
routes are used for continues data transmission. In
multipath routing protocols, the paths between a
source and destination can be link-disjoint, node-
disjoint or non-disjoint.
AOMDV [14] is a multipath extension of
AODV [4] protocol to find out multiple disjoint loop-
free paths between source and destination. It relies on
the routing information already available in the
AODV protocol, thereby limiting the control
overhead incurred in discovering multiple paths.
Long alternate paths are avoided by ignoring
alternate paths that are more than one hop distance
away. It has less number of route discoveries and
more packet delivery ratio than AODV due to
availability of alternate paths. The use of additional
RREPs to form multiple forward paths to the
destination increases the overhead for each route
discovery but the overall overhead is less as
compared to AODV due to less number of route
discoveries. It does not provide scalability.
AODV-ABR [7] is an extension to AODV-
BR which in turn is an extension to AODV. AODV-
ABR tries to overcome the problems occurred in
AODV-BR routing protocol. Overhearing of RREP
and data packets makes the routing protocol more
adaptable to changing topology without transmitting
many extra control messages. Route maintenance is
done by using a handshake process, which is
accomplished by using two networks control signals:
BRRQ and BRRP. The BRRP packet contains hop
count field to solve the problem of choosing longer
alternate path. Based on this hop count field, the node
selects the shortest path available among the many
alternate paths available. This can solve the
congestion and collision problem occurring in
AODV-BR. An aging technique is also going to be
used for alternate route maintenance. AODV-ABR
repairs the link failure by only using immediate
neighbour nodes. So, it has less routing overhead and
better throughput as compared to AODV.
SMORT [8] minimizes the route break
recovery overhead by providing intermediate nodes
on the primary path with multiple paths to the
destination. It uses the idea of fail- safe multiple
paths. There would be more fail safe paths as
compared to node and link disjoint paths. Due to the
usage of fail-safe paths, a link failure can be
corrected at the intermediate node itself, thereby
reducing the route recovery time and the number of
route error packet transmissions. Fall safe multiple
paths have higher fault tolerance to route breaks due
to their higher availability
MP-AODV [9] discovers two routes for
each pair of source-destination, a main route and a
back-up route. Two RREQ messages are used to
discover routes, each for one route. Whenever one
route is broken, the other route is used for data packet
transmission and a RREQ is flooded to maintain the
broken route. This approach has two drawbacks: (1)
MP-AODV contains higher overhead than the
traditional AODV because it requires one RREQ
flooding for one route and additional RREPs for
node-disjoint paths and, (2) This approach is not able
to find all the available node disjoint paths between a
source-destination pair
NDM-AODV [10] finds all node-disjoint
paths between source and destination also considers
the residual energy of the nodes while selecting the
routes. Multiple paths are created by using minimum
routing overhead by making use of Destination
Source Routing (DSR) protocol like source routing in
route discovery process. Local connectivity is
maintained by using Periodic Hello messages for all
active routes during the route maintenance stage. The
main disadvantage of this approach is that, as the size
of the network increases, the size of the RREQ and
RREP messages also increases because of the path
accumulation function. Therefore, the size of routing
table at destination node also increases due to the
storage required to store multiple paths.
AODVM-PSE [11] presents multipath
versions of AODV protocols, but the multiple paths
identified in this approach are link-disjoint rather
than node-disjoint. In this method, data transfer is
started only after all multiple paths are discovered.
Therefore there is an initial delay in data packet
transmission. AODVM [12], AOMDV [13] presents
multipath versions of AODV protocols. The multiple
paths identified in these approaches are link-disjoint.
The links which are created does not match with each
other but may have node in common. Data
transmission is started only after the discovery of all
multiple paths therefore there is an initial delay in
data packet transmission.
III. PROPOSED MULTIPATH ROUTING
PROTOCOL
In this section, the proposed protocol is
described. The main goal of this protocol is to find
three available node-disjoint routes between a source
and destination with minimum routing overhead and
low end to end delay. To achieve this goal, this
protocol works in the following phases: (i) Route
Discovery Phase, (ii) Route Selection Phase and data
packet transmission (iii) Route Maintenance Phase.
A. Route Discovery Phase
When a source node wants to transmit a data
packet to destination, it checks its routing table for
the next-hop towards the destination of the packet. If
there is an active route entry for the destination in the
routing table, then source forwards data packet to the
next hop. Otherwise, the route discovery phase
begins. In the route discovery phase, routes are
discovered using two types of control messages: (i)
Route request messages (RREQs) and (ii) Route
3. Jayshree Tajne, Veena Gulhane / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.1691-1698
1693 | P a g e
reply messages (RREPs). The source node broadcasts
the RREQ message into the network. Each
intermediate node after receiving a RREQ packet,
checks whether it is a fresh or a duplicate one by
searching an entry in the Seen Table [6]. Seen Table
stores three entries (i.e. source address, RREQ
broadcasting ID (bi _RREQ) and seen flag) that
uniquely identify a RREQ message in the network. If
an entry of received RREQ message is present in the
Seen Table, then it is considered as a duplicate
RREQ message and discarded without broadcasting
to its neighbor. Otherwise, the node creates an entry
in the Seen Table and updates its routing table for
forward path before broadcasting the RREQ message.
Source IP
Address
Broadcasting ID Seen flag
--- --- ---
Fig. 1. Seen Table structure
Type R A Reserved Prefix size Hop
count
Destination IP Address
Destination Sequence Number
Source IP Address
Source Sequence Number
Broadcasting ID
Fig. 2. RREP structure
In this protocol, only the destination node
can send RREPs upon reception of a RREQ message.
The intermediate nodes are restricted to send RREPs
even if they have an active route to destination. We
have changed the data structure of Seen Table and
RREP message as shown in figures 1, 2. This is done
so as to get the node-disjoint routes. The destination
node has to send a RREP message packet for each
RREQ received, even if the RREQ message is a
duplicate one. We change the data structure of both
Seen Table and RREP message, by adding an extra
field that works as a flag known as seenflag. At the
beginning this flag is set to FALSE. The RREP
messages initiated by destination node contain one
extra field known as broadcast ID ( _RREP).
The route discovery process is used to
discover node disjoint paths. When a destination
node receives a RREQ message packet, it creates the
corresponding reply as RREP message. The
destination node copies the bi _RREQ from the
received RREQ message into the _RREP field of
sent RREP message. This RREP is sent towards the
source of the RREQ using the reverse route to
construct the forward route. For every RREQ
message received, the destination does the above
mentioned process. When the RREP message has
been received by the intermediate nodes in the
reverse path, the intermediate nodes check the
seenflag value in their Seen Table. If the seenflag is
set to FLASE, this indicates that this is the first
RREP message packet on the reverse path towards
the source node. So, the intermediate node forwards
the RREP towards the source and reset the value of
seenflag. When the intermediate node receives a
RREP message for the same RREQ message it got
earlier, the node simply discards the RREP message
on the basis of seenflag value. Due to this, the
intermediate node’s cannot take part in more than one
route from the existing multiple routes.
Algorithm 1: Route discovery method when a node
receives RREQ message
= Node
S = Source Node
D = Destination Node
I = Intermediate Node
S_flag = FALSE //Initial value of seen flag in seen
table
_RREP= broadcast ID of RREP
bi _RREQ= broadcast ID of RREQ
= FALSE
Y = FALSE
Possible= FALSE
Count = 0
n_routes=3.
if ( has data to send)
{
if ( has route for )
{
Y=
if (Y==TRUE)
{
Find next possible node
Possible= check for possible
communication
if (Possible== TRUE)
Start data transmission
else
Get secondary path.
}
}
else
Initiate RREQ broadcasting
}
if ( receives a RREQ message)
{
if ( = I or N=S)
{
X= check value of seen table for duplicate
RREQs
if (X==TRUE)
Discard RREQ without rebroadcasting
else
Rebroadcast RREQ
4. Jayshree Tajne, Veena Gulhane / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.1691-1698
1694 | P a g e
}
else
{
N is the destination
b _RREP= b _RREQ
Destination node unicast RREP on reverse route
to create forward route
}
}
Algorithm 2: Route discovery method when a node
receives RREP message
if ( RREP)
{
if ( != )
{
S_flag=check and return the value of seenflag
from the seen table
if (! S_flag )
{
Insert first route in routing table
Reset the value of seenflag in seen table to
detect duplicate RREPs
Forward RREP to next hop towards source
else
Drop the duplicate RREP
}
}
else
{
Count=count the numbers of active routes for
destination in routing table
if (Count < n_routes)
Insert secondary routes and sort them in
ascending hop count
else
Drop the RREP message
}
}
A node follows the procedure as shown in
algorithm 1 after getting a RREQ message. When a
source node wants to send a data packet to
destination, it checks its routing table for any active
route available for destination. If an active route is
available, data packet is forwarded to the next hop
towards its destination. Else, it creates a RREQ
message packet and inserts the entry in seen table
about the request packet. The re-sending of RREQ
messages is avoided by using the above process.
Each node does updating in its seen table to avoid
duplicate broadcasting of the RREQ message. When
a node receives RREQ message, the algorithm checks
the node whether it is a source, intermediate or
destination node. If the node is a source or
intermediate node, then RREQ message is processed
same as is done in the traditional AODV protocol. A
destination node creates a RREP message after
receiving the RREQ and copies bid_RREQ value
from RREQ into the extra field provided in RREP.
Destination node does not check whether the received
RREQ message is fresh or duplicate as is done in
traditional AODV protocol. It replies to every
received RREQ message to establish multiple paths.
In discovery process, when a node receives a
RREP message, Algorithm 2 is used to discover
multiple node-disjoint routes. The RREP message is
received by the node then the algorithm checks
whether the node is an intermediate or source node. If
the node is an intermediate node then its seenflag is
checked from its seen table. In a Seen Table if
seenflag is FALSE then this indicates that it is the
first RREP message for this particular source-
destination pair. The algorithm resets the value of
seenflag for particular node corresponding to the
source-destination pair and the primary route for the
destination node is inserted. The RREP message is
then forwarded to the next hop towards source. The
duplicate RREP message is discarded. This ensures
that all the discovered routes are node-disjoint. If the
RREP message is received by the source node then
the discovered node-disjoint path is inserted as
primary or secondary, based on the value of seenflag
and the number of routes already present for this
destination in routing table.
Route discovery process of traditional AODV
protocol is shown in figure 3. In Figure 4, we
demonstrate with an example how the route
discovery process in MND-AODV gets all node-
disjoint routes between a source-destination pair.
Suppose, node S is the source node and node D is the
destination node. When node S has data to send, it
initiates the route discovery process by broadcasting
RREQ in the network.
Fig. 3. AODV route discovery process
Let us assume that destination D receives its
first RREQ from intermediate node H at time 1 and
D initiates the RREP1 message. RREP1 is unicast
towards source S by creating the reverse path
D→H→G→F→S. When RREP1 is received by an
intermediate node along the reverse route each
intermediate node resets the value of seenflag in their
Seen Table. Suppose, D receives the first duplicate
RREQ message from E at time 2. Again node D
initiates a RREP2 for this duplicate RREQ and sends
5. Jayshree Tajne, Veena Gulhane / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.1691-1698
1695 | P a g e
it back towards node S through the same path it came
to D (i.e. S→A→B→C→E→D) to make the reverse
route D→E→C→B→A→S. This helps to create a
forward route towards node D. Finally, say at time
3, node D receives the third duplicate RREQ
message from node I. Node D initiates RREP3 for
this duplicate RREQ and sends it towards S through
I. The RREP3 reaches node H through I. Node H
checks the value of seenflag for RREP3 before
forwarding it to next hop. Node H determines that the
seenflag is set to TRUE. So node H considers RREP3
as a duplicate message and drops it. This helps to
maintain the node-disjoint property of our method.
Fig. 4. MND- AODV route discovery process
B. Route Selection Process and Data Packet
Transmission
If the source node has data packets to send
and there is no route available in routing table, the
node starts the route discovery phase. The data packet
transmission is started as soon as it gets the first route
for destination node known as primary route. All the
other node-disjoint routes that are discovered will be
stored in the routing table as secondary routes. After
storing the primary route and specified number of
secondary routes in the routing table, all the other
routes are not stored. All the other routes that have
lower hop count for destination as compared to
existing secondary paths can replace the existing
ones. The route selection phase works in such a way
that whenever a route is required for data packet
transmission, it always selects the primary route if it
is available in routing table. If the primary route is
not active, then the route selection process selects the
route with lowest hop count from the available
secondary routes in the routing table.
C. Route Maintenance Process
Due to node behavior as random mobile and
the rapid change in network topology, link
interruption may occur frequently in mobile ad hoc
network. Therefore there is a need to consider the
route maintenance. Route maintenance process is
invoked when an active route is broken during
transmission of data packets. We implement and
analyze the performance of the route maintenance
method in case of route breaks. In this method, when
the primary route is broken due to the failure or
mobility of an intermediate node, transmission of
data is continued using the next possible node in the
same path. This method decreases the RERR
messages in network caused by intermediate nodes
due to link breaks, thus increasing the network
capacity. It also increases the PDR by not dropping
the packets that are already on the broken route. If the
next possible node is not in the range of the
intermediate node previous to the failure node then
the secondary path is used. To keep the secondary
routes active while using the primary route, we
increase the lifetime of each active secondary route
after a fixed amount of time. When all the secondary
routes are also broken, the source starts a new route
discovery process. In this way, we can minimize the
routing overhead caused in finding and maintaining
multiple routes. Only one RREQ is used to find all
available node-disjoint paths as compared to one
RREQ required for each path, as in the case of
traditional AODV and other existing multipath
extensions of AODV.
IV. SIMULATION AND PERFORMANCE
EVALUATION
In this section, we evaluate and compare the
performance of the modified AODV scheme to the
NDMP-AODV and the conventional AODV using
.net for simulation.
The schemes are evaluated using the following three
performance metrics:
1) Routing Control overhead - the total number of
routing control messages per the total number of
packets in the network (i.e. control messages plus
data packets).
2) Average end-to-end delay - the average time
taken for all data packets to be transmitted across a
network from source to destination.
3) Packet delivery ratio - the number of received
data packets divided by the number of generated data
packets.
A. Simulation Setup
Our simulation modeled a network of 100
nodes placed randomly within a 1200 X 1200 sq.
meter area. The random waypoint mobility model
was used. Each node randomly selects a new position
and moves towards that location with a pause time 0
and 300s. Once nodes reach the position, they
become stationary for a predefined pause time and
then select another position after a delay. The data
rate is of 2mbps. This process continues until the end
of simulation. Simulations were performed for 700
6. Jayshree Tajne, Veena Gulhane / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.1691-1698
1696 | P a g e
seconds with data transmission. We compared with
the simulation results of AODV, NDMP-AODV and
MND-AODV.
TABLE I
SIMULATION PARAMETERS
B. Results and Analysis
In this section, we discuss the results
obtained from simulation that have been performed to
show the effectiveness of proposed route discovery
and route maintenance method. The simulation
results include the average packet delivery ratio
(PDR), average end-to-end delay (EED), and routing
control overhead caused by route discovery and route
maintenance process. The effectiveness of proposed
method is checked against the effect of node
mobility. Figure 6 shows the overhead caused by
routing control messages during route discovery
process. Low routing overhead saves the bandwidth
of the network, thus increasing the network capacity.
The number of routes stored in routing table for a
destination from the available node-disjoint routes
greatly depends on the mobility of network. If the
network mobility is high, the probability that the
secondary route is expired with the primary route is
high. As shown in Figure 5, AODV has the highest
routing overhead because only one route for
destination is stored in the routing table. Due to this,
AODV has to broadcast the RREQ messages
whenever route is broken to maintain the data
transmission at all times.
Fig. 5. Routing control overhead with change in node
mobility
Effect of mobility of the node on end to end
delay and packet delivery ratio are shown in Figure 6
and Figure 7. The delay in MND-AODV is less as
compared to other protocols. This is because MND-
AODV keeps a backup routing path more than 50%
of the time when the primary route fails with the
lowest routing overhead. We can observe from
Figure 6, that end to end delay of all routing
protocols decreases with increase in node pause time.
Packet delivery ratio increases with increase in pause
time of MND-AODV as shown in Figure 7. This is
because the on-route data packets that are currently
on the broken route are rerouted using the backup
route from the point of route break.
Fig. 6. Average end to end with change in node
mobility.
Parameters Values
Number of nodes 100
Simulation time 700sec
Scenario Dimension 1200x1200 sq. meter
Transport protocol UDP
Routing protocol MND-AODV
Mobility model Random way-point
Pause Time 0 to 300 sec
Radio type 802.11b
Data rate 2mbps
Number of Primary
Routes
1
Number of Secondary
Routes
2
7. Jayshree Tajne, Veena Gulhane / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.1691-1698
1697 | P a g e
Fig. 7. Packet delivery ratio with change in node
mobility.
TABLE II
COMPARATIVE ANALYSIS OF PROTOCOLS
V. CONCLUSION
In this paper, we proposed multipath node-
disjoint routing protocol to minimize end to end
delay and routing overhead. Frequent link failure
occurs in mobile ad hoc networks because of its
features like dynamic topology and resource
constraints. The proposed protocol provides the
improvement of on-demand multipath routing
method in terms of packet delivery ratio, average
end-to-end delay, and routing control overhead. The
proposed routing finds three node-disjoint routes
from source to destination. The performance of the
proposed protocol investigated and compared against
the single path AODV and multipath NDMP-AODV
protocols through simulation using .NET. Results
show that our multipath routing protocol performs
better than both protocols in terms of routing
overhead, end to end delay and packet delivery ratio.
MND-AODV causes approximately 24% less routing
overhead in moderate or low mobility networks (i.e.
when node pause time is greater than 100 sec) as
compared to NDMP-AODV. Packet delivery ratio
increases by 4% and end to end delay decreases by
6% as compared to NDMP-AODV.
In future work, we will extend the proposed
method to work efficiently in high mobility networks
by dynamically updating the backup route status. The
applications like video on demand have high
transmission rates as compared to the available
channel bandwidth. Therefore a rate adaptation
scheme should be combined with our multipath
protocol.
REFERENCES
[1] M. Abolhasan, T. Wysocki, E. Dutkiewicz,
“A review of routing Protocol for mobile ad
hoc networks, Ad Hoc Networks,” Vol. 2,
No. 1, pp.1-22, 2004.
[2] Shafqat Ur Rehman1, Wang-Cheol Song2
and Gyung-Leen Park. “Associativity-Based
On-Demand Multi-Path Routing In Mobile
Ad Hoc Networks”. KSII
TRANSACTIONS ON INTERNET AND
INFORMATION SYSTEMS VOL. 3, NO.
5, pp.475-496, October 2009.
[3] S. Mueller, D. Ghosal, “Multipath Routing
in Mobile Ad Hoc Networks: Issues and
Challenges”, Lecture Notes in Computer
Science, Springer, Berlin, pp. 209-2342004.
[4] Charles E. Perkins and Elizabeth M. Royer.
Ad hoc on-demand distance vector routing.
In Proceedings of the 2nd IEEE Workshop
on Mobile Computing Systems and
Applications, New Orleans, LA, pp. 90–
100, 1999.
[5] David B. Johnson, David A. Maltz and Yih-
Chun Hu, The Dynamic Source Routing
Protocol for Mobile Ad Hoc Networks
(DSR), INTERNET-DRAFT, 15 April 2003.
[6] Chhagan Lal, V.Laxmi, M.S.Gaur, “A
Node-Disjoint Multipath Routing Method
based on AODV protocol for MANETs”,
2012 26th IEEE International Conference on
Advanced Information Networking and
Applications, pages 399-405, 2012.
[7] Wei Kuang Lai, Sheng-Yu Hsiao, and Yuh-
Chung Lin, "Adaptive Backup Routing for
Ad-Hoc Networks," Elsevier, Computer
Communications, vol. 30, pp. 453-463,
2007.
[8] L.Reddeppa Reddy and S.V. Raghavan,
"SMORT: Scalable Multipath On-Demand
Routing for Mobile Ad Hoc Networks,"
Elsevier, Ad Hoc Networks, vol. 5, pp. 162-
188, 2007.
[9] Chang-Woo Ahn, Sang-Hwa Chung, Tae-
Hun Kim, and Su-Young Kang,” A Node-
Disjoint Multipath Routing Protocol Based
on AODV in Mobile Ad hoc Networks”,
Information Technology: New Generations
8. Jayshree Tajne, Veena Gulhane / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 4, Jul-Aug 2013, pp.1691-1698
1698 | P a g e
(ITNG), 2010 Seventh International
Conference on, pages 828 –833, April 2010.
[10] Shunli Ding and Liping Liu, “A Node-
Disjoint Multipath Routing Protocol Based
on AODV”, Distributed Computing and
Applications to Business Engineering and
Science (DCABES), 2010 Ninth
International Symposium on, pages 312 –
316, aug. 2010.
[11] Fubao Yang and Baolin Sun, “Ad hoc On-
demand Distance Vector Multipath Routing
Protocol with Path Selection Entropy”,
Consumer Electronics, Communications and
Networks (CECNet), 2011 International
Conference on, pages 4715 –4718, april
2011.
[12] Tsung-Chuan Huang, Sheng-Yu Huang and
Lung Tang, “AODV-Based Backup Routing
Scheme in Mobile Ad Hoc Networks”,
International Conference on
Communications and Mobile Computing,
2010.
[13] YuHua Yuan, HuiMin Chen, and Min Jia.,
“An Optimized Ad-hoc On Demand
Multipath Distance Vector (AOMDV)
routing protocol”, Communications, 2005
Asia-Pacific Conference on, pages 569 –
573, oct. 2005.
[14] Mahesh K. Marina and Samir R. Das, "Ad
Hoc On-Demand Multipath Distance
Vector Routing," Wiley InterScience,
Wireless Communications and Mobile
Computing, vol. 6, pp.969-988, 2006.