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.
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.
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.
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.
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
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.
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.
Analysis of FSR, LANMAR and DYMO under MANETidescitation
A movable ad hoc system (MANET) is a self-configuring communications set of
connections of mobile procedure associated by wireless. Each mechanism in a MANET is
free to move independently in some way, and will therefore modify its relations to other
devices frequently [2]. The primary purpose of any ad-hoc network routing protocol is to
meet the challenges of the dynamically changing topology and establish an efficient route
connecting every two nodes. In this paper three protocols FSR, LANMAR and DYMO are
compared by using random waypoint mobility in few nodes with varying packet sizes in
CBR traffic. The parameters or metrics are used to assess the performance of protocols with
and without Black Hole attack, that are data Packet Delivery ratio and Average Jitter with
varying data traffic CBR (Constant Bit Ratio) using Qual Net 5.0.2 simulator.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field free for the
nodes to move. The most important aspect of this kind of network turns into a great disadvantage when it
comes to commercial applications, take as an example: the automotive networks that allow communication
between a groups of vehicles. The ad hoc on-demand distance vector (AODV) routing protocol, designed
for mobile ad hoc networks, has two main functions. First, it enables route establishment between a source
and a destination node by initiating a route discovery process. Second, it maintains the active routes, which
means finding alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and accurately.
In this paper, we focused in the first point to enhance the local decision of each node in the network by the
quantification of the mobility of their neighbours. Quantification is made around RSSI algorithm a well
known distance estimation method.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Improved aodv based on energy strength and dropping ratioIJLT EMAS
Wireless Sensor Networks are the latest trends in the
market due to the demand for communication and networking
among the wireless network devices. The routing protocols are
used in the Wireless Sensor Networks for efficient
communication of data between sensor nodes. The designs of
routing protocols in Wireless Sensor Networks are very concern
because they are influenced by many challenging factors. To
design the networks, the factors needed to be considered are the
coverage area, mobility, energy power consumption,
communication capabilities etc.. Broadcasting is an inevitable
operation in the route discovery phase of AODV protocol. A
probability based AODV is proposed, it uses nodes remaining
energy and threshold random delay to generate the
rebroadcasting of route request packet. The route request packet
of AODV is modified to gather nodes remaining energy strength.
The performance of probability based AODV is compared with
AODV over packet delivery fraction, normalized routing
overhead, delay and average acquisition latency.
NS-2 based simulator is used to evaluate the performance of
routing protocol.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field
free for the nodes to move. The most important aspect of this kind of network turns into a great
disadvantage when it comes to commercial applications, take as an example: the automotive
networks that allow communication between a groups of vehicles. The ad hoc on-demand
distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main
functions. First, it enables route establishment between a source and a destination node by
initiating a route discovery process. Second, it maintains the active routes, which means finding
alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and
accurately. In this paper, we focused in the first point to enhance the local decision of each node
in the network by the quantification of the mobility of their neighbours. Quantification is made
around RSSI algorithm a well known distance estimation method.
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
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’.
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.
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.
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.
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.
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
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.
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.
Analysis of FSR, LANMAR and DYMO under MANETidescitation
A movable ad hoc system (MANET) is a self-configuring communications set of
connections of mobile procedure associated by wireless. Each mechanism in a MANET is
free to move independently in some way, and will therefore modify its relations to other
devices frequently [2]. The primary purpose of any ad-hoc network routing protocol is to
meet the challenges of the dynamically changing topology and establish an efficient route
connecting every two nodes. In this paper three protocols FSR, LANMAR and DYMO are
compared by using random waypoint mobility in few nodes with varying packet sizes in
CBR traffic. The parameters or metrics are used to assess the performance of protocols with
and without Black Hole attack, that are data Packet Delivery ratio and Average Jitter with
varying data traffic CBR (Constant Bit Ratio) using Qual Net 5.0.2 simulator.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field free for the
nodes to move. The most important aspect of this kind of network turns into a great disadvantage when it
comes to commercial applications, take as an example: the automotive networks that allow communication
between a groups of vehicles. The ad hoc on-demand distance vector (AODV) routing protocol, designed
for mobile ad hoc networks, has two main functions. First, it enables route establishment between a source
and a destination node by initiating a route discovery process. Second, it maintains the active routes, which
means finding alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and accurately.
In this paper, we focused in the first point to enhance the local decision of each node in the network by the
quantification of the mobility of their neighbours. Quantification is made around RSSI algorithm a well
known distance estimation method.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Improved aodv based on energy strength and dropping ratioIJLT EMAS
Wireless Sensor Networks are the latest trends in the
market due to the demand for communication and networking
among the wireless network devices. The routing protocols are
used in the Wireless Sensor Networks for efficient
communication of data between sensor nodes. The designs of
routing protocols in Wireless Sensor Networks are very concern
because they are influenced by many challenging factors. To
design the networks, the factors needed to be considered are the
coverage area, mobility, energy power consumption,
communication capabilities etc.. Broadcasting is an inevitable
operation in the route discovery phase of AODV protocol. A
probability based AODV is proposed, it uses nodes remaining
energy and threshold random delay to generate the
rebroadcasting of route request packet. The route request packet
of AODV is modified to gather nodes remaining energy strength.
The performance of probability based AODV is compared with
AODV over packet delivery fraction, normalized routing
overhead, delay and average acquisition latency.
NS-2 based simulator is used to evaluate the performance of
routing protocol.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field
free for the nodes to move. The most important aspect of this kind of network turns into a great
disadvantage when it comes to commercial applications, take as an example: the automotive
networks that allow communication between a groups of vehicles. The ad hoc on-demand
distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main
functions. First, it enables route establishment between a source and a destination node by
initiating a route discovery process. Second, it maintains the active routes, which means finding
alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and
accurately. In this paper, we focused in the first point to enhance the local decision of each node
in the network by the quantification of the mobility of their neighbours. Quantification is made
around RSSI algorithm a well known distance estimation method.
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
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’.
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.
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.
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.
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.
To improve the QoS in MANETs through analysis between reactive and proactive ...CSEIJJournal
A Mobile Ad hoc NETwork (MANET), is a self-configuring infra structure less network of mobile devices
connected by wireless links. ad hoc is Latin and means "for this purpose". Each device in a MANET is free
to move independently in any direction, and will therefore change its links to other devices frequently. Each
must forward traffic unrelated to its own use, and therefore be a router. The primary challenge in building
a MANET is equipping each device to continuously maintain the information required to properly route
traffic. QOS is defined as a set of service requirements to be met by the network while transporting a
packet stream from source to destination. Intrinsic to the notion of QOS is an agreement or a guarantee by
the network to provide a set of measurable pre-specified service attributes to the user in terms of delay,
jitter, available bandwidth, packet loss, and so on. The analysis is mainly between proactive or table-driven
protocols like OLSR (Optimized Link State Routing) viz DSDV (Destination Sequenced Distance Vector) &
CGSR (Cluster Head Gateway Switch Routing) and reactive or source initiated routing protocols viz
AODV (Ad hoc on Demand distance Vector) & DSR (Dynamic Source Routing). The QoS analysis of the
above said protocols is simulated on NS2 and results are shown thereby.
Experiment of Routing Protocol AODV (AdHoc On-demand Distance Vector)IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Survey of Enhanced Routing Protocols for Manetspijans
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.
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.
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
In this paper, we proposed a replacement hybrid multipath routing protocol for
MANET known as Hybrid Multipath Progressive Routing Protocol for MANET (HMPRP),
during this work we improve the performance of accepted MANET routing protocols,
namely, the Ad-hoc On-demand Distance Vector routing protocol and use of their most
popular properties to formulate a replacement Hybrid routing protocol using the received
signal strength. The proposed routing protocol optimizes the information measure usage of
MANETs by reducing the routing overload and overhead. This proposed routing protocol
additionally extends the battery lifetime of the mobile devices by reducing the specified
variety of operations for (i) Route determination (ii) for packet forwarding. Simulation
results are used to draw conclusions regarding the proposed routing algorithm and
compared it with the AODV, OLSR, and ZRP protocol. Experiments carried out based on
this proposed algorithm, shows that better performance are achieved with regard to AODV,
OLSR, and ZRP routing algorithm in terms of packet delivery ratio, throughput, energy
consumed and end-to-end packet delay.
Performance analysis of routing protocols and tcp variants under http and ftp...IJCNCJournal
MANET stands for mobile ad-hoc network that has multi-hop and dynamic nature, where each station changes its location frequently and automatically configures itself. In this paper, four routing protocols
that areOLSR,GRP,DSR, and AODV are discussed along with three TCP variants that are SACK, New Reno and Reno. The main focus of this paper is to study the impact
scalability, mobility and traffic loads on routing protocols and TCP variants. Thepaper results shows that the proactive protocols OLSR and GRP outperform the reactive protocols AODV and DSR with the same nodes size, nodes speed, and traffic load. On the other hand, the TCP variants research reveal the superiority of the TCP SACK variant over the other two variants in case of adapting to varying network size, while the TCP Reno variant acts more
robustly in varying mobility speeds and traffic loads.
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
EVALUATION OF PROACTIVE, REACTIVE AND HYBRID AD HOC ROUTING PROTOCOL FOR IEEE...cscpconf
In VANET high speed is the real characteristics which leads to frequent breakdown,
interference etc. Therefore Performance of adhoc routing protocols is helpful to improve the
Quality of Service (QOS). In this paper we studied various adhoc routing protocols, Reactive,
Proactive & Hybrid, taking in to consideration parameters like speed, altitude, mobility etc in
real VANET scenario. The AODV and DYMO (Reactive), OLSR (Proactive) and ZRP (hybrid)
protocols are compared for IEEE 802.11(MAC) and IEEE 802.11(DCF) standard using
Qualnet as a Simulation tool. Since IEEE 802.11, covers both physical and data link layer.
Hence performance of the protocols in these layers helps to make a right selection of Protocol
for high speed mobility. Varying parameters of VANET shows that in the real traffic scenarios
proactive protocol performs more efficiently for IEEE 802.11 (MAC) and IEEE 802.11(DCF)
T HE I MPACT OF TCP C ONGESTION W INDOW S IZE ON THE P ERFORMANCE E VA...ijwmn
A mobile ad hoc network (MANET) is a temporary coll
ection of mobile nodes randomly moved within a
limited terrain area. The nodes are connected to fo
rm a wireless network without use any communication
infrastructure. Because of the limiting resources o
f MANET nodes, multiple hops
scheme is proposed for
data exchange
across the network. Varieties of mobile ad hoc rout
ing protocols have been developed to
support the multi-hop scheme of ad hoc networks. A
popular Transmission Control Protocol (TCP)
provides a reliable connection in a computer networ
k environment; it sets its congestion window size i
n
response to the behavior of the network to achieve
the best performance. This work aims to investigate
and
compare the MANET protocol
performance, such as DSDV, AODV and DSR in terms of
network
throughput, average routing load, the packet delive
ry ratio (PDR), and average end-to-end delay by
varying the maximum congestion window size. Our si
mulation has been implemented using a well-known
NS-2.35 network simulator. The simulated results sh
ow that the demonstrates of the concepts of MANET
routing protocols with respect to TCP congestion wi
ndow size in MANET environment
Performance comparison of mobile ad hoc network routing protocolsIJCNCJournal
Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust
dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find
optimized routes from source to the destination and prominent among them are Dynamic Source Routing
(DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV)
routing protocols. The performance comparison of these protocols should be considered as the primary
step towards the invention of a new routing protocol. This paper presents a performance comparison of
proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery
ratio, average end-to-end delay, throughput, jitter), normalized routing overhead and normalized MAC
overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility
speed, number of nodes and data rate. The comparison results show that AODV performs optimally well
not the best among all the studied protocols.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
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!
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.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
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.
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/
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
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
UiPath Test Automation using UiPath Test Suite series, part 3
Enhanced aodv route discovery and route establishment for qos provision for real time transmission in manet
1. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
DOI : 10.5121/ijcnc.2014.6207 79
ENHANCED AODV ROUTE DISCOVERY AND
ROUTE ESTABLISHMENT FOR QOS PROVISION FOR
REAL TIME TRANSMISSION IN MANET
Iftikhar Ahmad1
, Uzma Ashraf1
, Sadia Anum1
, and Hira Tahir1
1
Department of CS & IT Mirpur University of Science and Technology
Mirpur, AJK, Pakistan
ABSTRACT
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.
KEYWORDS
AD-HOC, MANET, AODV, Quality of service, Real Time traffic.
1. INTRODUCTION
Wireless AD-HOC network is distributed network having no centralized infrastructure, each
node forward data packets in routing, sometimes other normal nodes may become router or
gateway. The first wireless AD-HOC networks were the “packet radio” networks (PRNETs),
developed by DARPA in 1970. This network overcome the problem of fixed centralized
infrastructure in the environment where single centralized node and fixed nodes via wired links,
does not work accurately. This AD-HOC network is very useful in Emergency conditions, ease
of deployment, speed of deployment and decreased dependence on infrastructure.
There are three basic types of wireless AD-HOC network: MANET, Wireless mesh network and
Wireless sensor network.MANET [1] is a combination of independent mobile nodes that are
connected with wireless links (radio waves) to perform peer-to-peer communication. MANET
may operate in a standalone fashion, or may be connected to the other larger network like
Internet. Applications of MANETs include military use in battle fields, where a centralized
command center is not only infeasible but also undesirable; and disaster management
scenarios, where on the run, communication between various rescue teams is required in the
absence of any existing communication infrastructure. There are three major protocols used for
MANET are: Proactive (table driven), Reactive (on-demand) and Hybrid (both proactive and
reactive) which are discussed below.
2. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
80
1.1 Proactive (table driven)
This type of protocols maintains fresh lists of destinations and their routes by periodically
distributing routing tables throughout the network. The main disadvantages of such algorithms
include: Respective amount of data for maintenance, slow reaction on restructuring and failures.
Examples of proactive are DSDV (destination sequenced distance vector) and OLSR (Optimized
Link State Routing).
1.2 Reactive (on-demand)
This type of protocols finds a route on demand by flooding the network with Route Request
packets. Determine route if and when needed Source initiates route discovery. Examples are DSR
(dynamic source routing) and AODV (ad-hoc on demand distance vector).
1.3 Hybrid
This category is called as Adaptive; Combination of proactive and reactive. Example ZRP (zone
routing protocol)
AODV [2] is efficient for both unicast and multicast routing, it builds routes between nodes only
when desired (on-demand) by source nodes, routes are maintain as long as these are needed by
source. AODV has four types of messages: RREQ (route request), RREP (route reply), RERR
(route error) and hello message.
These messages are used in establishing the route between source and destination. If node wants
to send data packet to some destination, it first checks the route to that destination from source, if
there is no route is present between source and destination. Then, first by route discovery method
route is established between source and destination for data delivery. Source node broadcast
RREQ message to its neighbors, node which receive RREQ may send RREP to source if it is
destination node or it has route to destination with corresponding sequence number greater than or
equal to that contained in the RREQ. Otherwise, it rebroadcasts the RREQ. Nodes keep track of
the RREQ's source IP address and broadcast ID. If they receive a RREQ which they have already
processed, they discard the RREQ and do not forward it. When source node receive RREP
message from destination node route is established between source and destination, then HELLO
message generate by source to destination through newly discovered route to check before the
data transmission, then source send data through this route to destination. If due to any reason
topology change or node die, then link failure occurs and RERR message send to source. After
receiving the RERR, if the source node still desires the route, it can reinitiate route discovery.
The rest of this paper is organized as follows. Related work and problem definition is presented in
Section II. The solution and design is covered in Section III, followed by implementation results
and performance evaluation in Section IV. This paper is concluded in Section V while the
references are given towards the end of this paper.
2. RELATED WORK
Enhanced Load Balanced AODV Routing Protocol [3] was proposed to overcome the problem for
longer period of time a protocol is proposed which selects route on the basis of traffic load on
node and reset path as topology changes.
AODVLM [4] which is new load balanced AODV routing protocol, provide a scheme for load
distribution among nodes in MANET. AODVLM improves throughput, reduce average end-to-
delay and overall network performance.
3. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
81
Energy efficient route discovery method [5] was proposed which reduce the broadcast cost and
overall energy of network. In this approach node Discovery process uses regions similar to disk
which have variable dimensions and as a result time and energy reduces.
AODV-NC-WLB [6] a modified route request broadcast approach was presented based on node
caching. They overcome the drawback of CDS overuse of dominating nodes by a new load
balancing scheme in which they measure the protocol fairness using as parameter distribution
among nodes of the forwarding load. Work load balance technique is based on the idea by
dropping RREQ packet according to load status of each node and load status is set by the value of
threshold.
EEMLAR protocol [7] discussed, a node is involved in any transaction, it losses some of its
energy whose values depend upon the following factors: nature of packet, size, and distance
between nodes. For calculating all these factors, proposed protocol gives an optimized function.
After receiving many route request it calls the optimization function to determine the best path to
select and send RREP .It also store some inferior paths as backup.
Paper [8] proposed an enhancement in AODV protocol to provide QOS support for real time
traffic by using time slot bandwidth reservation in two cases first when both the nodes are in the
MANET and second when one node is in MANET or other is in fixed network.
FQMM model [9] (flexible QOS model) consider the characteristics of MANET and combines
high quality services of QOS models (intserv and diffserv). FQMM features include: dynamic
roles of nodes, hybrid provisioning and adaptive conditioning.
Real Time On-demand Distance Vector in Mobile Ad hoc Networks [10] includes load parameter
in the RREQ message that helps in the selection of route with low congestion during route
discovery process.
Energy Level and Link State Aware AODV Route Request Forwarding Mechanism Research [11]
presented an AODV protocol with enhancements. In route discovery the route selection is made
on the basis of node power, load status and link state between.
[12] Combine the shortest route selection criteria of AODV with real network status including
link quality, the remaining power capacity and traffic load. This paper contributed by giving
status adoptive routing which improves network life and delivery ratio.
[13] Proposed a new QOS routing protocol based on load distribution algorithm intended for a
variety of traffic classes to establish the best routing paths. The proposed algorithm calculates the
cost metric on the basis of the load on the links. The traffic can be classified as real time traffic
and normal traffic. Real time traffic is considered as high priority and normal traffic as low
priority. In the absence of real time traffic, the lesser loaded path can be utilized by normal traffic.
[14] Presents a comparative analysis of mobile ad-hoc routing protocols over real time video
streaming. Their analysis exploits the built-in support for real time multimedia streaming in ad-
hoc routing protocols. The performance evaluation has been based on various network level
metrics, including average end-to-end delay and packet drop rate.
In the previous techniques there is the problem of RREQ rejection which leads to pre-
transmission delay and don’t have QOS in real time transmission. When a source node wants to
communicate with another node, it sends RREQ to its neighbor nodes, and waits for route reply.
If all the neighbor nodes are busy they do not receive RREQ packets and rejected RREQ packets
again and again. This leads to the problem of delay in the initial stage of transmission. Resulting
into more packet drops and decreased overall throughput. This is called pre -transmission delay.
4. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
82
3. SOLUTION AND DESIGN
Our solution to resolve the pre-transmission delay problem is to modify existing AODV route
request mechanism in such a way that it will give greater performance then existing AODV
protocol. We are enhancing the existing AODV protocol route discovery process and also reduce
the pre transmission delay of RREQ in RT transmission. We give priority to the source node of
real time transmission. When RREQ packet is broadcasted to neighbor node, for real time
transmission it accept route request on priority basis. In basic AODV the route once selected for
transmission does not expires until unless the transmission is completed. In our mechanism we
have to expire active routes of TCP when UDP transmission starts.As we discussed above that we
give priority to real time transmission real time transmission. The drop ratio of packets gradually
decreased, then throughput increase by delivering more packets at destination and delivery ratio
also increased as a result of which QOS improves. We create scenario in TCL including two
flows for TCP (normal packets) and one for UDP (real time packets). We give priority to the
source node of UDP connection, when UDP transmission starts there is less drop rate, increased
throughput and delivery ratio.
According to EAODV, real time traffic (UDP) gets priority on normal packets. UDP transmission
starts at 60 sec in the network, after start of UDP transmission, no TCP transmission starts. UDP
has priority to send and receive the packets and in routing table only store information about CBR
over UDP transmission.
Table 1: EAODV Mechanism
Source node Packet Type Time to start Destination node
1 TCP 5.0 sec 3
4 TCP 35.0 sec 7
5 UDP 60.0 sec 8
Table 1 shows, there are three flows of transmission of packets. There are two flows of TCP
transmission and one flow of UDP transmission. TCP is used to transmit normal packets and UDP
is used to transmit real time packets. Source node 1 start transmission at 5.0 sec, its packet type is
TCP for normal packets; its destination node is 3. Then, at 35.0 sec source node 4 start
transmission of normal packets TCP, its destination node is 7. When at 60.0 sec UDP
transmission of real time traffic starts, it has priority with normal packets. After 60.0 sec in
routing table, there is no packet of normal traffic. Source node of TCP packet sends their packets
but no data received of normal traffic at destination of TCP packets. UDP real time traffic has
priority over TCP normal traffic, that’s why when UDP transmission starts there is no packet of
normal traffic is stored in routing table. As a result, there are more packets of UDP transmission
are received at destination, throughput increased, packet loss rate decreased and delivery ratio
increased. Hence it is clear that, EAODV is more efficient protocol and also provide QOS
qualities in real time transmission.
3.1 Enhanced route discovery algorithm
Following is the brief description of our enhanced route discovery algorithm that provides
solution to the problem stated earlier in the problem statement.
5. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
83
Give priority to source node of special (real time) packets
• Fill in the essential RREQ fields and
• Broad cost of RREQ Message
• Active route time is set to a constant
• Reception of RREQ.
Check If RREQ is special type of packet then expire already store entry in routing
table and store special packet on priority basis, accept RREQ.
• Update the routing entry otherwise do not bother.
Forward it to next node.
• If I am the destination Send RREP message to the updated reverse rout in the table.
• Set the Route expire time to current time + active route timeout
Transmission of Real time data packets starts on priority basis.
4. IMPLEMENTATIONAND ANALYSIS
We implement EAODV in NS2 [15] and compare its performance with basic AODV. Propagation
model is Two Ray Ground and Mobility model is Random Way Point [16] because these models
are most widely implemented in simulations of most literature work.
4.1 NS-2 Parameter setting
Other parameters of NS2 are configured for our network scenario is shown in the Table 2. NS2 is
discrete network simulator that is used for implementation for performance comparison MANET
protocols
Table 2. NS-2 Parameter Setting
Routing protocol AODV
Link layer type LL
MAC type Mac/802_11
Interface Queue Queue/Drop Tail/PriQueue
Maximum packets in Ifq 20
Antenna model Antenna/Omni Antenna
Radio propagation model Propagation/TwoRay Ground
6. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
84
Network Interface Phy/WirelessPhy
Channel type Channel/Wireless Channel
Number of mobile nodes 10
Simulation time 150 seconds
4.2 Performance Metric
We will compare our enhanced protocol with basic AODV. We evaluates performance mainly
according to following metric.
4.2.1 Average throughput
Throughput is the total number of packets received successfully in the given time.
4.2.2 Packet delivery ratio
It is the ratio of the number of packets received successfully to the total number of packets
transmitted.
4.2.3 Packet loss
It is the packet loss rate of the transmission.
4.3 Simulation results
The Basic AODV is first implemented and run on given MANET scenario in NS-2 and
performance parameters are calculated. Results are generated in graphical form produced by
using trace files that is generated during simulation. Then our proposed protocol for real time
traffic is implemented and results are produced in graphical form.Results are compared by taking
pause time on X-axis and performance metrics throughput and delay on Y-axis.
4.4 Comparison of performance
We simulated the results in NS2 by taking parameters (pause time) on x-axis and performance
metric (delivery ratio, packet loss rate and throughput) on Y-axis. The pause time is the time
interval during which different parameters are calculated .In the figure below at equal intervals
the throughput is calculated as shown in figure 1.
7. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
85
Figure 1. Comparison of throughput of AODV and EAODV
In figure 1 the throughput comparison between AODV and EAODV is given and it is clear that
the throughput of EAODV is greater than basic AODV as indicated by red line in the graph. At
point 1, 2 and 3 throughput of CBR packets is zero because UDP transmission is not started yet.
At point 3 UDP transmission start and a large increase occur in throughput of CBR packets during
UDP transmission. After point 3 graphs shows a continuous increase in throughput rate of CBR
packets as compare to basic AODV.
Figure 2. Comparison of packet loss of AODV and EAODV
The packet loss rate of basic AODV and EAODV is compared in figure 2. The packet loss rate of
both protocols is calculated at fixed interval of time. First we calculated the number of packets
during fixed intervals and packet loss then packet loss rate is calculated. At point 1, 2 and 3
packet loss is zero because UDP transmission is not start at that time. At point 3 UDP
transmission start and a large decrease occur in packet loss of CBR packets during UDP
transmission as compare to basic AODV. The packet loss rate for the EAODV is smaller than
basic AODV.
0
500
1000
1500
2000
2500
3000
3500
4000
4500
1 2 3 4 5 6
THROUGHPUT
PAUSE TIME
AODV
EAODV
0
500
1000
1500
2000
2500
3000
1 2 3 4 5 6
PACKETLOSS
PAUSE TIME
AODV
EAODV
8. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
86
Figure 3. Comparison of delivery ratio of AODV and EAODV
Figure 3 shows the delivery ratio of both protocols. Red line is indicating the delivery ratio of
EAODV and blue line indicates the basic AODV. At point 1, 2 and 3 delivery ratio is zero
because UDP transmission is not start. At point 3 UDP transmission start and a large increase
occur in delivery ratio of CBR packets during UDP transmission. Graphs shows continuous
increase in delivery ratio because during UDP transmission no TCP packets are send or received,
due to priority only CBR packets are transmitted. Hence delivery ratio of CBR packets is
increased.
5. CONCLUSION
We developed a protocol with an enhanced route discovery mechanism that avoids the RREQ
rejection and in results reduces the pre transmission delay. EAODV give priority to the source
node of RT transmission. When RREQ packet sends to neighbor node, for RT transmission it
accept route request on priority basis and starts the RT transmission. EAODV expire active routes
of TCP when UDP transmission starts.
The drop ratio of packets decreased, then throughput increase by receiving more packets at
destination and delivery ratio also increased. Our technique focuses to maintain real time
transmissions. With these enhancements our protocol increases the overall throughput of network
and packet delivery ratio for real time transmission as compare to the basic AODV routing
protocol. The simulation result proves the improvement in the performance of the protocol.
REFERENCES
[1] S. Corson and J. Macker, “Mobile Ad hoc Networking (MANET): Routing Protocol Performance
issues and Evaluation Considerations”, Network Working Group, RFC2501, January 1999.
[2] C. Perkins, E. Belding Royer and S. Das “Ad hoc on-demand Distance Vector (AODV) Routing”
IETF RFC3561, July 2003.
[3] Iftikhar Ahmad & Mata ur Rehman“Efficient AODV routing based on traffic load and mobility of
node in MANET” 6th International Conference on Emerging Technologies (ICET),2010.
[4] Iftikhar Ahmad & Humaira Jabeen “Enhanced Load Balanced AODV Routing Protocol” (IJCSIS)
International Journal of Computer Science and Information Security,Vol. 9, No. 1,January 2011.
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
0.4
0.45
1 2 3 4 5 6
DELIVERYRATIO
PAUSE TIME
AODV
EAODV
9. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
87
[5] Abdullah waqas, shahid Imran & hasan mahmood“Energy Efficient Route Discovery for Reactive
Protocols in Wireless Ad Hoc Networks”, 2012 International Conference on Emerging Sciences
(ICET),8-9 Oct. 2012.
[6] Nisar Hundewale, Sunsook Jung & Alex Zelikovsky“Energy Efficient Node Caching and Load
Balancing Enhancement of Reactive Ad Hoc Routing Protocols” Journal of Universal Computer
Science, vol. 13, no. 1 (2007), 110-132.
[7] Mrs. Shilpi Jain, Mr.Sourabh Jain “Energy Efficient Maximum Lifetime Ad-Hoc Routing
(EEMLAR)”,IRACST –International Journal of Computer Networks and Wireless
Communications (IJCNWC), ISSN: 2250-3501 Vol.2, No4, August 2012.
[8] Iftikhar Ahmad,Humaira Jabeen & Faisal Riaz, “ImprovedQOS Routing for Real Time Traffic in
Mobile Ad hoc Network”International Journal of Computer Networks & Communications (IJCNC)
Vol.5, No.4,July 2013.
[9] H. XIAO, Winston K.G. SEAH, Anthony LO and Kee Chiang CHUA “ Flexible Quality Service
Model for Ad-HOC Networks” In proceedings of the IEEE Vehicular Technology Conference,
Tokyo, Japan, May 2000.
[10] Sanjeev Jain, Vankateswarla Pitti and Bhupendra Verma. “Real Time On-demand Distance Vector
in Mobile Ad hoc Networks” Asian Journal of Information Technology 5(4): 454-459, 2005.
[11] Li Hao Jutao, Zhao Jingjing and Minglu, “Energy Level and Link State Aware AODV Route
Request Forwarding Mechanism Research” WSEAS Transactions on Communications, Issue 2,
Volume 8, February 2009.
[12] LI Ting, TANG Rui-bu and JI Hong,”Status adaptive routing with delayed rebroadcast scheme in
AODV-based MANETs” Science Direct, September 2008 Elsevier.
[13] P.Sivakumar , Dr.K.Duraiswamy Research Scholar “A QOS Routing Protocol for Mobile Ad Hoc
Networks based on the Load Distribution”IEEE International Conference on Computational
Intelligence and Computing Research (iccic’10) 2010.
[14] Chhagan Lal, V.Laxmi, M.S.Gaur “Performance Analysis of MANET Routing Protocols for
Multimedia Traffic” International Conference on Computer & Communication Technology
(ICCCT)-2011.
[15] M. Gunes¸ and M. Wenig ,”Models for Realistic Mobility and Radio Wave Propagation for Ad
Hoc Network Simulations” Springer-Verlag London Limited,2009.(A chapter of book “Guide to
Wireless Ad Hoc Networks” ).
[16] K. Fall and K. Varahan, editors, “NS Notes and Documentation” The VINT Project, UC Berkeley,
LBL, USC/ISI, and Xerox PARC, November 1997.