A Vehicular Ad Hoc Network (VANET) is a network formed purely among vehicles without presence of any
communication infrastructure as base stations and/or access point. Frequent topological changes due to
high mobility is one of the main issues in VANETs. In this paper we evaluate Ad-hoc On-Demand Distance
Vector (AODV) and Optimized Link State Routing (OLSR) routing protocols using 802.11a and 802.11p in
a realistic urban scenario. For this comparison, we chose five performance metrics: Path Availability, Endto-
End Delay, Number of Created Paths, Path Length and Path Duration. Simulation results show, that for
most of the metrics evaluated, OLSR outperforms AODV when 802.11p and that 802.11p is more efficient
in urban VANETs.
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.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
Simulation based comparison of routing protocols in wireless multihop ad hoc ...IJECEIAES
Routing protocols are responsible for providing reliable communication between the source and destination nodes. The performance of these protocols in the ad hoc network family is influenced by several factors such as mobility model, traffic load, transmission range, and the number of mobile nodes which represents a great issue. Several simulation studies have explored routing protocol with performance parameters, but few relate to various protocols concerning routing and quality of service (QoS) metrics. This paper presents a simulation-based comparison of proactive, reactive, and multipath routing protocols in mobile adhoc networks (MANETs). Specifically, the performance of AODV, DSDV, and AOMDV protocols are evaluated and analyzed in the presence of varying the number of mobile nodes, pause time, and traffic connection numbers. Moreover, Routing and QoS performance metrics such as normalized routing load, routing packet, packet delivery ratio, packet drop, end-to-end delay, and throughput are measured to conduct a performance comparison between three routing protocols. Simulation results indicate that AODV outperforms the DSDV and AOMDV protocols in most of the metrics. AOMDV is better than DSDV in terms of end-to-end delay. DSDV provides lower throughput performance results. Network topology parameters have a slight impact on AODV performance.
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.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
Simulation based comparison of routing protocols in wireless multihop ad hoc ...IJECEIAES
Routing protocols are responsible for providing reliable communication between the source and destination nodes. The performance of these protocols in the ad hoc network family is influenced by several factors such as mobility model, traffic load, transmission range, and the number of mobile nodes which represents a great issue. Several simulation studies have explored routing protocol with performance parameters, but few relate to various protocols concerning routing and quality of service (QoS) metrics. This paper presents a simulation-based comparison of proactive, reactive, and multipath routing protocols in mobile adhoc networks (MANETs). Specifically, the performance of AODV, DSDV, and AOMDV protocols are evaluated and analyzed in the presence of varying the number of mobile nodes, pause time, and traffic connection numbers. Moreover, Routing and QoS performance metrics such as normalized routing load, routing packet, packet delivery ratio, packet drop, end-to-end delay, and throughput are measured to conduct a performance comparison between three routing protocols. Simulation results indicate that AODV outperforms the DSDV and AOMDV protocols in most of the metrics. AOMDV is better than DSDV in terms of end-to-end delay. DSDV provides lower throughput performance results. Network topology parameters have a slight impact on AODV performance.
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
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Narendra Singh Yadav
An ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple “hops” may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. This paper presents performance comparison of the three routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and pause time. Simulation revealed that although DSDV perfectly scales to small networks with low node speeds, AODV is preferred due to its more efficient use of bandwidth.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
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.
Mobile Ad hoc Networks (MANETs) are characterized by open structure, lack of standard infrastructure
and un-accessibility to the trusted servers. The performance of various MANET routing protocols is
significantly affected due to frequently changing network topology, confined network resources and
security of data packets. In this paper, a simulation based performance comparison of one of the most
commonly used on-demand application oriented routing protocols, AODV (Ad hoc on-demand Distance
Vector) and its optimized versions R-AODV (Reverse AODV) and PHR-AODV (Path hopping based
Reverse AODV) has been presented. Basically the paper evaluates these protocols based on a wide set of
performance metrics by varying both the number of nodes and the nodes maximum speed. A NS-2 based
simulation study shows that, as compared to AODV and PHR-AODV, R-AODV enhances the packet
delivery fraction by 15-20% and reduces the latency approximately by 50%. R-AODV requires lesser node
energy for data transmission.
In mobile ad hoc networks (MANETs), multipath routing protocols are more popular due to overcomes the certain limitation of single path routing like lower end-to-end delay, load balancing, energy efficiency and network lifetime. By providing multiple paths between a source-destination pair, multipath routing protocols are avoid such above problems. AOMDV (Ad Hoc On-Demand Multipath Distance Vector) routing protocol is an on-demand multipath routing and which is a relatively maturity and extensive application protocol. It doesn’t consider residual energy and load situation of the node on the time of route discovery process. So AOMDV’s efficiency declines sharply in case of high load and fast moving velocity. To solve the above problems, we propose an improved protocol Energy Efficient- AOMDV (EAOMDV) of AOMDV routing algorithm. EAOMDV is based on a strategy of energy model and load balancing concept. It will consider the residual energy and the load situation of the nodes, when it starts the route discovery phase. After considering the above concept and according to the simulation results, the EAOMDV routing protocol improves the efficiency, the packet delivery ratio and reduces the routing load.
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’.
ENERGY AND PERFORMANCE EVALUATION OF REACTIVE, PROACTIVE, AND HYBRID ROUTING ...ijwmn
This paper evaluates the energy consumption of well-known routing protocols, along with other metrics
such as throughput, packet delivery ratio (PDR), and delay in different scenarios. We consider two other
metrics in order to capture the efficiency of the energy consumption: e-throughput which is the ratio
between the consumed energy and the throughput; and the e-PDR which is the ratio between the
consumed energy and the PDR. We compare four routing protocols: AODV, OLSR, and HWMP in
Reactive and Proactive modes. The number of nodes is varying between 25 and 81 nodes, with different
mobility models. Simulations are conducted using NS3 and the parameters of a real network interface
card. From the results, AODV presents the lowest energy consumption and a better e-Throughput. OLSR
provides a better e-PDR in mobile scenarios. With a smaller e-PDR and e-Throughput, the proactive
mode of HWMP is more energy efficient than the reactive mode.
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
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
IJCER (www.ijceronline.com) International Journal of computational Engineeri...ijceronline
Call for paper 2012, hard copy of Certificate, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJCER, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, research and review articles, IJCER Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathematics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer review journal, indexed journal, research and review articles, engineering journal, www.ijceronline.com, research journals,
yahoo journals, bing journals, International Journal of Computational Engineering Research, Google journals, hard copy of Certificate,
journal of engineering, online Submission
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)
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksIJCNCJournal
A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.
Analysis of Hierarchical Scheduling for Heterogeneous Traffic over NetworkIJCNCJournal
Scheduling real time and non real time packets at network nodes has an important impact by reducing the
processing overhead, queuing delay and response time. Most of the existing packet scheduling algorithms
used in network based on First-In First-Out (FIFO), non-preemptive priority, and preemptive priority
scheduling. However, these algorithms incur a large processing overhead, queuing delay and response
time and are not dynamic to the data traffic changes. In this paper, we present a new hierarchical
scheduling algorithm to assign priority, Hierarchical Hybrid EDF/FIFO which can not only serve the real
time traffic but also provide best effort service to non real time traffic. To examine our approach for
scheduling, we realized our analytical study to express the worst case queuing delay and the worst case
response time for different traffics. The simulation results showed that the Hierarchical hybrid EDF/FIFO
achieved the minimum packet delay and adequate loss packet for non real time traffic when compared with
Hierarchical FIFO. In general, the performances of our approach draw near to Hierarchical EDF which
confirms the effectiveness of this approach.
Mesh pull backup parent pools for video-on-demand multicast treesIJCNCJournal
Resilient multicast is a challenging issue for overlay trees particularly because of high churn. In this work,
we propose a mechanism that allows scalable video multicast. While the regular operation involves treepush
of the video, any node that looses its parent on the tree solicits video from a predetermined backup set
of nodes in a mesh-pull fashion. The main idea is to allocate less bandwidth for backup to improve
bandwidth utilization while maintaining the best possible video quality. The choice of essential design
parameters are studied together with seamlessness of the streaming under variety of fault scenarios.
Simulation results indicate the optimality of the proposed approach as far as resiliency, bandwidth
utilization, delay and video quality are concerned.
Centrality-Based Network Coder Placement For Peer-To-Peer Content DistributionIJCNCJournal
Network coding has been shown to achieve optimal multicast throughput, yet at an expensive computation
cost: every node in the network has to code. Interested in minimizing resource consumption of network
coding while maintaining its performance, in this paper, we propose a practical network coder placement
algorithm which achieves comparable content distribution time as network coding, and at the same time,
substantially reduces the number of network coders compared to a full network coding solution in which all
peers have to encode, i.e. become encoders. Our algorithm is derived from two key elements. First, it is
based on the insight that coding at upstream peers eliminates information duplication to downstream peers,
which results in efficient content distribution. Second, our placement strategy exploits centrality
characteristics of the network topology to quickly determine key positions to place encoders. Performance
evaluation using various topology and algorithm parameters confirms the effectiveness of our proposed
method.
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
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Narendra Singh Yadav
An ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple “hops” may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. This paper presents performance comparison of the three routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and pause time. Simulation revealed that although DSDV perfectly scales to small networks with low node speeds, AODV is preferred due to its more efficient use of bandwidth.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
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.
Mobile Ad hoc Networks (MANETs) are characterized by open structure, lack of standard infrastructure
and un-accessibility to the trusted servers. The performance of various MANET routing protocols is
significantly affected due to frequently changing network topology, confined network resources and
security of data packets. In this paper, a simulation based performance comparison of one of the most
commonly used on-demand application oriented routing protocols, AODV (Ad hoc on-demand Distance
Vector) and its optimized versions R-AODV (Reverse AODV) and PHR-AODV (Path hopping based
Reverse AODV) has been presented. Basically the paper evaluates these protocols based on a wide set of
performance metrics by varying both the number of nodes and the nodes maximum speed. A NS-2 based
simulation study shows that, as compared to AODV and PHR-AODV, R-AODV enhances the packet
delivery fraction by 15-20% and reduces the latency approximately by 50%. R-AODV requires lesser node
energy for data transmission.
In mobile ad hoc networks (MANETs), multipath routing protocols are more popular due to overcomes the certain limitation of single path routing like lower end-to-end delay, load balancing, energy efficiency and network lifetime. By providing multiple paths between a source-destination pair, multipath routing protocols are avoid such above problems. AOMDV (Ad Hoc On-Demand Multipath Distance Vector) routing protocol is an on-demand multipath routing and which is a relatively maturity and extensive application protocol. It doesn’t consider residual energy and load situation of the node on the time of route discovery process. So AOMDV’s efficiency declines sharply in case of high load and fast moving velocity. To solve the above problems, we propose an improved protocol Energy Efficient- AOMDV (EAOMDV) of AOMDV routing algorithm. EAOMDV is based on a strategy of energy model and load balancing concept. It will consider the residual energy and the load situation of the nodes, when it starts the route discovery phase. After considering the above concept and according to the simulation results, the EAOMDV routing protocol improves the efficiency, the packet delivery ratio and reduces the routing load.
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’.
ENERGY AND PERFORMANCE EVALUATION OF REACTIVE, PROACTIVE, AND HYBRID ROUTING ...ijwmn
This paper evaluates the energy consumption of well-known routing protocols, along with other metrics
such as throughput, packet delivery ratio (PDR), and delay in different scenarios. We consider two other
metrics in order to capture the efficiency of the energy consumption: e-throughput which is the ratio
between the consumed energy and the throughput; and the e-PDR which is the ratio between the
consumed energy and the PDR. We compare four routing protocols: AODV, OLSR, and HWMP in
Reactive and Proactive modes. The number of nodes is varying between 25 and 81 nodes, with different
mobility models. Simulations are conducted using NS3 and the parameters of a real network interface
card. From the results, AODV presents the lowest energy consumption and a better e-Throughput. OLSR
provides a better e-PDR in mobile scenarios. With a smaller e-PDR and e-Throughput, the proactive
mode of HWMP is more energy efficient than the reactive mode.
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
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
IJCER (www.ijceronline.com) International Journal of computational Engineeri...ijceronline
Call for paper 2012, hard copy of Certificate, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJCER, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, research and review articles, IJCER Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathematics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer review journal, indexed journal, research and review articles, engineering journal, www.ijceronline.com, research journals,
yahoo journals, bing journals, International Journal of Computational Engineering Research, Google journals, hard copy of Certificate,
journal of engineering, online Submission
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)
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksIJCNCJournal
A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.
Analysis of Hierarchical Scheduling for Heterogeneous Traffic over NetworkIJCNCJournal
Scheduling real time and non real time packets at network nodes has an important impact by reducing the
processing overhead, queuing delay and response time. Most of the existing packet scheduling algorithms
used in network based on First-In First-Out (FIFO), non-preemptive priority, and preemptive priority
scheduling. However, these algorithms incur a large processing overhead, queuing delay and response
time and are not dynamic to the data traffic changes. In this paper, we present a new hierarchical
scheduling algorithm to assign priority, Hierarchical Hybrid EDF/FIFO which can not only serve the real
time traffic but also provide best effort service to non real time traffic. To examine our approach for
scheduling, we realized our analytical study to express the worst case queuing delay and the worst case
response time for different traffics. The simulation results showed that the Hierarchical hybrid EDF/FIFO
achieved the minimum packet delay and adequate loss packet for non real time traffic when compared with
Hierarchical FIFO. In general, the performances of our approach draw near to Hierarchical EDF which
confirms the effectiveness of this approach.
Mesh pull backup parent pools for video-on-demand multicast treesIJCNCJournal
Resilient multicast is a challenging issue for overlay trees particularly because of high churn. In this work,
we propose a mechanism that allows scalable video multicast. While the regular operation involves treepush
of the video, any node that looses its parent on the tree solicits video from a predetermined backup set
of nodes in a mesh-pull fashion. The main idea is to allocate less bandwidth for backup to improve
bandwidth utilization while maintaining the best possible video quality. The choice of essential design
parameters are studied together with seamlessness of the streaming under variety of fault scenarios.
Simulation results indicate the optimality of the proposed approach as far as resiliency, bandwidth
utilization, delay and video quality are concerned.
Centrality-Based Network Coder Placement For Peer-To-Peer Content DistributionIJCNCJournal
Network coding has been shown to achieve optimal multicast throughput, yet at an expensive computation
cost: every node in the network has to code. Interested in minimizing resource consumption of network
coding while maintaining its performance, in this paper, we propose a practical network coder placement
algorithm which achieves comparable content distribution time as network coding, and at the same time,
substantially reduces the number of network coders compared to a full network coding solution in which all
peers have to encode, i.e. become encoders. Our algorithm is derived from two key elements. First, it is
based on the insight that coding at upstream peers eliminates information duplication to downstream peers,
which results in efficient content distribution. Second, our placement strategy exploits centrality
characteristics of the network topology to quickly determine key positions to place encoders. Performance
evaluation using various topology and algorithm parameters confirms the effectiveness of our proposed
method.
The Extended Clustering Ad Hoc Routing Protocol (Ecrp)IJCNCJournal
Ad hoc networks are a collection of mobile nodes communicating via wireless channels without any fixed
infrastructure. Because of their ease and low cost of building, ad hoc networks have a lot of attractive
applications in different fields. The topology of ad hoc networks changes dynamically, and each node in the
network can act as a host or router. With the increase in the number of wireless devices and large amount
of traffic to be exchanged, the demand for scalable routing protocols has increased. This paper presents a
scalable routing protocol, based on AODV protocol, called the Extended Clustering Ad Hoc Routing
Protocol (ECRP). This is a hybrid protocol, which combines reactive and proactive approaches in routing.
The protocol uses the Global Positioning System to determine the position of certain nodes in the network.
The evaluation methodology and simulation results obtained show that the protocol is efficient and scales
well in large networks
STUDY THE EFFECT OF PARAMETERS TO LOAD BALANCING IN CLOUD COMPUTINGIJCNCJournal
The rapid growth of users on the cloud service and number of services to the user increases the load on the
servers at cloud datacenter. This issue is becoming a challenge for the researchers. And requires used
effectively a load balancing technique not only to balance the resources for servers but also reduce the
negative impact to the end-user service. The current, load balancing techniques have solved the various
problems such as: (i) load balancing after a server was overloaded; (ii) load balancing and load forecast
for the allocation of resources; iii) improving the parameters affecting to load balancing in cloud. The
study of improving these parameters have great significance to improving system performance through
load balancing. From there, we can propose more effective methods of load balancing, in order to increase
system performance. Therefore, in this paper we researched some parameters affecting the performance
load balancing on the cloud computing.
Probability Density Functions of the Packet Length for Computer Networks With...IJCNCJournal
The research on Internet traffic classification and identification, with application on prevention of attacks
and intrusions, increased considerably in the past years. Strategies based on statistical characteristics of
the Internet traffic, that use parameters such as packet length (size) and inter-arrival time and their
probability density functions, are popular. This paper presents a new statistical modeling for packet length,
which shows that it can be modeled using a probability density function that involves a normal or a beta
distribution, according to the traffic generated by the users. The proposed functions has parameters that
depend on the type of traffic and can be used as part of an Internet traffic classification and identification
strategy. The models can be used to compare, simulate and estimate the computer network traffic, as well
as to generate synthetic traffic and estimate the packets processing capacity of Internet routers
A Compact Dual Band Dielectric Resonator Antenna For Wireless ApplicationsIJCNCJournal
This paper presents the design of a dual band rectangular Dielectric Resonator Antenna (DRA)
coupled to narrow slot aperture that is fed by microstrip line. The fundamental TE111 mode and
higher-order TE113 mode are excited with their resonant frequencies respectively. These
frequencies can be controlled by changing the DRA dimensions. A dielectric resonator with high
permittivity is used to miniaturize the global structure. The proposed antenna is designed to have
dual band operation suitable for both DCS (1710 - 1880 MHz) and WLAN (2400 - 2484 MHz)
applications. The return loss, radiation pattern and gain of the proposed antenna are evaluated.
Reasonable agreement between simulation and experimental results is obtained.
Reducing the Peak to Average Power Ratio of Mimo-Ofdm SystemsIJCNCJournal
In this paper, we proposed a particle swarm optimization (PSO) based partial transmit sequence (PTS)
technique in order to achieve the lowest Peak-to-Average Power Ratio(PAPR) in Multiple Input Multiple
Output- Orthogonal Frequency Division Multiplexing (MIMO-OFDM) systems. Our approach consist of
applying the PSO based PTS on each antenna of the system in order to find the optimal phase factors,
which is a straightforward method to get the minimum PAPR in such a system. The simulation results
demonstrate that the PSO based PTS algorithm when applied to MIMO-OFDM systems with a wide range
of phase factors, tends to give a high performance. In addition, there is no need to increase the number of
particles of the PSO algorithm to enhance the performance of the system. As a result of this, the complexity
of finding the minimum PAPR is kept at a reasonable level.
A FRAMEWORK FOR SOFTWARE-AS-A-SERVICE SELECTION AND PROVISIONINGIJCNCJournal
As cloud computing is increasingly transforming the information technology landscape, organizations and
businesses are exhibiting strong interest in Software-as-a-Service (SaaS) offerings that can help them
increase business agility and reduce their operational costs. They increasingly demand services that can
meet their functional and non-functional requirements. Given the plethora and the variety of SaaS
offerings, we propose, in this paper, a framework for SaaS provisioning, which relies on brokered Service
Level agreements (SLAs), between service consumers and SaaS providers. The Cloud Service Broker (CSB)
helps service consumers find the right SaaS providers that can fulfil their functional and non-functional
requirements. The proposed selection algorithm ranks potential SaaS providers by matching their offerings
against the requirements of the service consumer using an aggregate utility function. Furthermore, the CSB
is in charge of conducting SLA negotiation with selected SaaS providers, on behalf of service consumers,
and performing SLA compliance monitoring
Analytical Modelling of Localized P2P Streaming Systems under NAT ConsiderationIJCNCJournal
NAT has been design to work with Internet client-server structure. The emerged of Peer-to-Peer (P2P)
networks and applications revealed the incompatibility between P2P applications and NAT. Many methods
has been developed and implemented to solve connectivity between peers behind NAT devices.
Nevertheless, various NATing types can’t communicate with one another. In this work, we are going to
study the impact of NAT types on the start-up delay time of peers in P2P streaming systems. We will
demonstrate the ability of NATing to expel peers in P2P live streaming systems. A new neighbour selecting
algorithm will be proposed. This algorithm will utilize NAT-types configurations as a parameter. We have
utilized NS2 simulator to show the performance of the new algorithm in increasing the connectivity,
reducing the number of expelled peers and implementing of locality.
Qos group based optimal retransmission medium access protocol for wireless se...IJCNCJournal
This paper presents, a Group Based Optimal Retransmission Medium Access (GORMA) Protocol is
designed that combines protocol of Collision Avoidance (CA) and energy management for low-cost, shortrange,
low-data rate and low-energy sensor nodes applications in environment monitoring, agriculture,
industrial plants etc. In this paper, the GORMA protocol focuses on efficient MAC protocol to provide
autonomous Quality of Service (QoS) to the sensor nodes in one-hop QoS retransmission group and two
QoS groups in WSNs where the source nodes do not have receiver circuits. Hence, they can only transmit
data to a sink node, but cannot receive any control signals from the sink node. The proposed protocol
GORMA provides QoS to the nodes which work independently on predefined time by allowing them to
transmit each packet an optimal number of times within a given period. Our simulation results shows that
the performance of GORMA protocol, which maximize the delivery probability of one-hop QoS group and
two QoS groups and minimize the energy consumption.
A multi tenant platform for sms integrated servicesIJCNCJournal
This paper presents the design and development of a Linux based infrastructure and platform for a
wholesale service provider to offer SMS integrated services to retail providers for resale. The multi-tenant
platform, capable of providing multiple types of SMS integrated services, was designed and built mainly
with off-the-shelf components and open source software. The platform is highly reliable and flexible,
enabling fast provision of customisable services by integrating SMS, voice, VoIP, and web services in
innovative ways. This paper describes the design of the platform and presents four major application areas.
PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS WITH ROADSIDE UNIT INFRASTRUCTURE I...IJCNCJournal
Vehicular ad-hoc networks (VANETs) represent a powerful and active field of research and have given rise to many challenges related to routing protocols and communication problems with other vehicles or fixed infrastructure called roadside units (RSU). The dynamic topology and the obstacles encountered in VANET environments mean that the routing of data and the communication between vehicles is confronted with many problems, and particularly in vehicular applications that require reliable communication and satisfactory quality of service (QoS). This paper promotes the intention of infrastructure in an urban
scenario and studies the performance of routing protocols considering the constraint of mobility. This leads us to analyze a wide range of routing protocols to ensure optimal coverage and continuous connectivity, taking into consideration two types of data traffic in realistic environments that depend on certain performance metrics. The paper also investigates which protocols provide better performance with RSUs by ranking the results for QoS.
Evaluation The Performance of MAODV and AODV Protocols In VANETs ModelsCSCJournals
This paper to study, analyse the performance of multicast technology using the MAODV (Multicast On-demand Distance Vector Routing Protocol) in the VANETs (Vehicle Ad-Hoc Networks), this protocol using widely in MANETs (Mobile Ad-Hoc Network). The wireless nodes in the wireless vehicle networks are the same wireless devices, which are integrated with a sensor and designed specifically for the design of safety, privacy and security applications. Researchers are interested in developing and enhancing the number of service quality parameters (packets received, delay, productivity, node power consumption, etc.). The aim of this paper is to introduce and optimize VANETS multi-cast transmission technology to reduce delay, increase throughput and reduce packet loss. Although, presents an analytical study of the Enhanced Protocol (MAODV) Protocol (AODV) and compares it to AODV performance in VANETs.
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.
ACR: A CLUSTER-BASED ROUTING PROTOCOL FOR VANET ijwmn
Clustering is a technique used in network routing to enhance the performance and conserve the network
resources. This paper presents a cluster-based routing protocol for VANET utilizing a new addressing
scheme in which each node gets an address according to its mobility pattern. Hamming distance technique
is used then to partition the network in an address-centric manner. The simulation results show that this
protocol enhances routing reachability, whereas reduces routing end-to-end delay and traffic received
comparing with two benchmarks namely AODV and DSDV.
ACR: A CLUSTER-BASED ROUTING PROTOCOL FOR VANET ijwmn
Clustering is a technique used in network routing to enhance the performance and conserve the network resources. This paper presents a cluster-based routing protocol for VANET utilizing a new addressing scheme in which each node gets an address according to its mobility pattern. Hamming distance technique is used then to partition the network in an address-centric manner. The simulation results show that this protocol enhances routing reachability, whereas reduces routing end-to-end delay and traffic received
comparing with two benchmarks namely AODV and DSDV.
Performance Evaluation AODV, DYMO, OLSR and ZRPAD Hoc Routing Protocol for IE...pijans
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).
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.
Evaluating feasibility of using wireless sensor networks in a coffee crop thr...IJCNCJournal
A Wireless Sensor Networks is a network formed with sensors that have characteristics to sensor an area to
extract a specific metric, depending of the application.
We would like to analyse the feasibility to use sensors in a coffee crop.In this work we are evaluating routing protocolsusing real dimensions and characteristics of a coffee crop. We evaluate, through simulation, AODV, DSDV and AOMDV and two variants known in this work as AODVMOD and AOMDVMOD with 802.15.4 MAC Protocol
.For this comparison, we defined three performance metrics: Packet Delivery Ratio (PDR), End-to-End Delay
and Average Energy Consumption. Simulation results show that AOMDVMOD overall, outperforms others
routing protocols evaluated, showing that is possible to use WSN in a real coffee crop environment.
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.
A Performance Comparison of Routing Protocols for Ad Hoc NetworksIJERA Editor
Mobile Ad hoc Network (MANET) is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many routing protocols have been proposed like OLSR, AODV so far to improve the routing performance and reliability. In this paper, we describe the Optimized Link State Routing Protocol (OLSR) and the Ad hoc On-Demand Distance Vector (AODV). We evaluate their performance through exhaustive simulations using the Network Simulator 2 (ns2) by varying conditions (node mobility, network density).
Performance Analysis of Ad-hoc on Demand Distance Vector Routing (AODV) and D...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Performance 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.
Improved greedy routing protocol for VANETEditor IJCATR
VANET (vehicular ad-hoc network) is a classification of MANET in which vehicles act as mobile node and provides a different
approach to Intelligent transport System (ITS). VANET is an emerging area for Intelligent Transportation System (ITS) which can result in
increased traffic safety, collision warning through exchange of messages through wireless media. Efficient routing protocols are required for
efficient communication among vehicles. In the given paper, we surveyed various VANETs protocols and along with its advantages and
disadvantages. We compare our proposed protocols via NS-2 based simulations and show the performance of different protocols
Improved greedy routing protocol for VANETEditor IJCATR
VANET (vehicular ad-hoc network) is a classification of MANET in which vehicles act as mobile node and provides a different approach to Intelligent transport System (ITS). VANET is an emerging area for Intelligent Transportation System (ITS) which can result in increased traffic safety, collision warning through exchange of messages through wireless media. Efficient routing protocols are required for efficient communication among vehicles. In the given paper, we surveyed various VANETs protocols and along with its advantages and disadvantages. We compare our proposed protocols via NS-2 based simulations and show the performance of different protocols.
Similar to Performance comparison of aodv and olsr using 802.11 a and dsrc (802.11p) protocols in urban vanets (20)
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.
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
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 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 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
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.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...
Performance comparison of aodv and olsr using 802.11 a and dsrc (802.11p) protocols in urban vanets
1. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
PERFORMANCE COMPARISON OF AODV AND OLSR
USING 802.11A AND DSRC (802.11P) PROTOCOLS IN
URBAN VANETS
Ederval Pablo Ferreira da Cruz1 and Bruno dos Santos Silva2
1
2
Federal Institute of Espirito Santo (IFES) – Campus Itapina, Colatina-ES, Brazil
Federal University of State of Rio de Janeiro (UNIRIO) , Rio de Janeiro-RJ, Brazil
ABSTRACT
A Vehicular Ad Hoc Network (VANET) is a network formed purely among vehicles without presence of any
communication infrastructure as base stations and/or access point. Frequent topological changes due to
high mobility is one of the main issues in VANETs. In this paper we evaluate Ad-hoc On-Demand Distance
Vector (AODV) and Optimized Link State Routing (OLSR) routing protocols using 802.11a and 802.11p in
a realistic urban scenario. For this comparison, we chose five performance metrics: Path Availability, Endto-End Delay, Number of Created Paths, Path Length and Path Duration. Simulation results show, that for
most of the metrics evaluated, OLSR outperforms AODV when 802.11p and that 802.11p is more efficient
in urban VANETs.
KEYWORDS
OLSR, AODV, Vehicular Networks, VANET, Performance & 802.11p
1. INTRODUCTION
In 1999, the Federal Communication Commission (FCC) defined to allocate a frequency
spectrum for vehicle-to-vehicle (V2V) and vehicle-to-roadside (V2R) wireless communication. A
public safety and private applications communication service that uses the 5.850-5.925 GHz band
(or simply 5.9 GHz band) was established by the FCC in 2003. Such service is called Dedicated
Short Range Communications (DSRC) or 802.11p
[1,2] where the vehicles and beacons on
roadsides can form a Vehicular Ad Hoc Network (VANET). Several research groups and
automotive makers consider VANET an important technology for improving passenger’s safety
avoiding more accidents and deaths, efficiency of the actual transportation system and great
opportunities in commercial applications [3,4,5].
VANET consists of vehicles with radio-enabled equipments acting as mobile nodes and/or routers
for others nodes, with no existing pre-established infrastructure where such nodes connect
themselves in a decentralized, self-organizing manner and also establish multi hop routes. In a
VANET, it is possible to exchange information among vehicles, allowing the development of new
applications, introducing new services such as on-board-entertainment during the travels.
Furthermore, this technology can improve passengers’ safety by implementing active safety
systems (e.g. emergency breaking according to the traffic received) or automatic emergency calls
when an accident occurs.
VANET has some unique characteristics that distinguish it from other kinds of mobile ad hoc
networks.
DOI : 10.5121/ijcnc.2013.5612
195
2. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
•
Very dynamic topology: Vehicles move in high speed and with different mobility
patterns, reflecting in constant changes on the topology of VANETs.
•
Partitioned network and reduced contact time: Due to dynamic topology, the
connectivity of the VANETs can change frequently, creating a partitioned network, interfering
the communication of the nodes, especially when the vehicles density is low.
•
High range transmission: The DSRC service allows a range transmission up to 1000
meters.
Therefore, VANETs have some characteristics that make it very challenging. One of these
challenges is routing data between sender-destination nodes in a multi hop way.
Basically, the proposed protocols to VANET are classified in two groups [6]: 1) topology-based
protocols and 2) geography-based protocols. In this paper we compare two classics mobile
networks routing protocols: Optimized Link State Routing (OLSR) and Ad Hoc On-Demand
Distance Vector (AODV) using the 802.11a and 802.11p. The main contributions of our work
when compared to the existing literature are the following: 1) We measure the performance of
802.11p and 802.11a in a realistic urban scenario. 2) We also evaluate other performance metrics
when compared with other papers.
2. RELATED WORKS
Authors in [7] compare and evaluate performance of Ad-hoc On-Demand Distance Vector
(AODV), Dynamic Source Routing (DSR) and Swarm Intelligence based protocol. A variety of
simulations for VANET is performed, characterized by networks’ mobility and size.
In [8] transmission probabilities of 802.11p are modelled evaluating the effects of these
probabilities in DSR, Fish-Eye State Routing (FSR) and OLSR. AODV and OLSR are evaluated
in urban scenario where the authors enhanced HELLO and TC interval of OLSR and observe that
overall enhanced OLSR performs better than AODV in urban environments.
In the paper [9] an evaluation of AODV performance in VANET is realized by varying the
number of nodes maintaining the maximum velocity using 802.11.
Our work evaluates OLSR and AODV using 802.11p and 802.11a protocols in realistic urban
scenario. Moreover, five metrics performances are selected for evaluating performance of routing
protocols in VANETs
3. ROUTING PROTOCOLS
The ad hoc network protocols have as main objective to reduce energy consumption and the
signaling messages. Such protocols search to find the better route between a source-destiny node
by the information existing in the links of the network In Vehicular Ad Hoc Networks (VANET),
it is a great challenge to develop a protocol that copes with its characteristics and meets several
applications requirements. With the exchange of signalling messages, it is possible to cope with
the topology changes of the network. Thus, each node in the network has, previously, a routing
table containing the next hop or hops forward to the destiny node.
Figure 1, based in [10], displays a brief classification of the routing protocols used in VANETs.
The topology-based routing is divided in proactive and reactive mode.
196
3. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
VANET Routing Protocols
Geography-based
Topology-based
Proactive
Reactive
OLSR
AODV TORA
Non-DTN
DTN
Hybrid
DSR
Figure 1. Brief classification of VANET routing protocol
3.1 Proactive routing (Table-driven) protocols
Proactive routing protocols or table-driven routing only create paths when it is necessary to
forward a packet and it is not necessary to know all routes to all destiny nodes in the network.
These protocols require each node to maintain one or more tables to store routing information,
and they respond to change in network topology by propagating route update throughout the
network to maintain consistent network view. We can cite as examples of proactive protocol:
OLSR
I)
OLSR Protocol
The OLSR protocol [11] is based in topology information that works in a proactive mode and it is
one of the main routing protocols for ad hoc network. Each node periodically constructs and
maintains the set of neighbors that can reach in 1-hop and 2-hops. Furthermore, it presents an
extension called MPR (Multi Point Relay) [12,13], that minimizes the number of active relays
needed to achieve 2-hops neighbors avoiding flooding, reducing the signalling messages as can
be seen in the Figure 2.
(a)
(b)
Figure 2. Types of flooding: traditional flooding (a) and flooding using MPRs (b)
197
4. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
3.2 Reactive (On-Demand) routing protocols
In reactive (or on demand) routing protocols, the routes are created when required. When a source
node wants to send to a destination node, it invokes the route discovery mechanism to find the
path to the destination. This process is completed when once a source is found or all possible
route permutation has been examined. Once a route has been discovered and established, it is
maintained by some form of route maintenance procedure until either the destination becomes
inaccessible along every path from the source or route is no longer desired.
I)
AODV Protocol
AODV (Ad-hoc On-demand Distance Vector) [14] is a loop-free routing protocol for ad-hoc
networks based on vector distance algorithm, as DSDV [15]. It is designed to be self-starting in
an environment of mobile nodes, withstanding a variety of network behaviours such as node
mobility, link failures and packet losses.
The AODV protocol is based in topology information that works in a reactive mode, in other
words, when a source node wants to send data to a destination node, a route discovery process is
started. In this process, the source node broadcasts a ROUTE REQUEST (RREQ) packet to all
your neighbors. Neighbors nodes which do not know an active route to destination node, forward
the packet to their neighbors until an available route is found or the maximum number of hops is
reached. When an intermediate node knows an active route to the requested destination node, it
sends back a ROUTE REPLY (RREP) packet to the source node in unicast mode, enabling to the
node creates the route among the source and destination nodes. The main problem of the AODV
protocol in VANET environments is the route instability due to high mobility of the nodes,
breaking established paths constantly. Consequently, more packets are discarded and overhead
generated due to notifications of path breaks increase significantly.
4. PERFORMANCE EVALUATION
This section presents the evaluation of the AODV and OLSR protocols under 802.11a and
802.11p in an urban realistic scenario. The simulations were realized in the NS-2 simulator
version 2.33 [16]. We consider 3 different mobility scenarios, where the number of vehicles
varies from as follows: 40 vehicles (low density), 80 vehicles (medium density) and 120 vehicles
(high density). Table 1 summarizes the configuration of the simulation.
All vehicles are assumed to have a radio range of 350 meters and they are moving in the urban
scenario at a maximum speed of 20 meters per second. Vehicles are inserted in the map at a rate
of one vehicle per second and to better characterize a realistic urban scenario, there are trafficlights in the intersections and various lanes. Vehicles are launched in the map at a rate of one new
vehicle per second using random positions. When the vehicles mobility starts, the map is totally
empty, and the path requests start at the hundredth second (this means that the routing protocols
are only started after having a reasonable amount of running vehicles).
198
5. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Table 1: Mobility scenarios and parameters set considered in the simulation
Scenario
Number of
Vehicles
Maximum
Speed (m/s)
Radio range
(meters)
Scenario 1
Scenario 2
Scenario 3
40
80
120
20
20
20
350
350
350
Propagation model
Unicast traffic
Broadcast traffic
Simulation
time
(seconds)
437
424
561
Two Ray Ground
11 Mbps
2 Mbps
The scenario of simulated urban VANET was generated using TraNS tool [17] that integrates
SUMO tool [18] and it was extracted from the TIGER/Line database of the US Census Bureau
[19]. Such scenario has a dimension of 4100 m x 3100 m area as illustrated in the Figure 3.
Figure3. Map of a Manhattan region, used in the realistic simulation urban scenario
Considering that all vehicles present in the map are able to route packets according to the routing
protocol being evaluated, the generation of the packets is divided in two phases:
1st phase: a packet is randomly destined to one of the active mobile nodes. This is the
packet responsible for the path creation if the routing protocol is reactive;
2nd phase: after the path being created, the source node periodically generates packets to
the same destination marked in the first phase (the period was set to 1s). The node stops the
packet generation when the original path breaks.
The results presented in this paper are averaged of 10 simulations for each mobility scenario and
for each protocol and each communication pattern. All simulations results presented were
obtained guaranteeing a 95% confidence interval.
4.1 Performance Metrics
As showed in the Table 1, the performance of the routing protocols AODV and OLSR with
802.11p and 802.11a MAC protocols was realized by varying the network density. The metrics to
assess the performance are given as follows:
1.
Path Availability: It is an available path between source node and destination node.
199
6. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
2.
End-to-End Delay: To the path P = {n1, n2,…, nk} where n1 is the source node and nk is
the destination node. Assuming that the packet is sent from node n1 at the moment t’1 and it is
received by node nk at the moment t’k, the delay is marked as t’1 - t’k.
3.
Number of Created Paths: It is sum of all created paths during the simulation.
4.
Path Length: A path P = {n1, n2,…, nk} of k nodes at the instant t1, the path length is set
by the number of hops that a packet realizes between a node source n1 and a destination node nk .
The final value about this metric is given by k-1 hops.
5.
Path Duration: Considering again a path P = {n1, n2,…, nk} of k nodes at the instant t1, the
path duration is set as the length of the major interval of time [t1, t2], while P sequence is
maintained.
5. RESULTS AND ANALYSIS
To visualize the results, they are showed in the Figures as follows and such results are discussed
for each performance metric evaluated.
•
Path availability: The results showed in the Figure 4 demonstrate that AODV and OLSR
protocols have better performance when 802.11p is used in all scenarios evaluated when
compared with 802.11a. By using 802.11p, AODV and OLSR protocols have practically the same
results.
Figure 4. Path availability of the AODV and OLSR protocols using 802.11a and 802.11p
•
End-to-End Delay: In the Figure 5, as can be seen, OLSR protocol when use 802.11p
outperforms 802.11a. Considering that delay is a crucial factor to be considering in VANETs, the
results show that using 802.11p is more efficient than 802.11a. AODV has poor performance as
the density increases where the cost of repeated route discovery procedures in AODV introduces
a large control traffic overhead and OLSR using 802.11p ends up outperforming AODV in almost
150% when AODV is using 802.11p and about 300% when AODV is using 802.11a.
200
7. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 5. End-to-End Delay of the AODV and OLSR protocols using 802.11a and 802.11p
•
Number of Created Paths: In the Figure 6 is presented the results of the number of created
paths by the OLSR and AODV protocols using 802.11p and 802.11a. The results show that using
AODV and OLSR protocols using 802.11p, more paths are created and consequently, more cars
can communicate with each other. AODV has better results due to the fact to use flooding
technique, getting more information about the network and creating more paths. Such technique
has more bandwidth consumption and collisions, consequently, increasing delay.
Figure 6. Number of Created Paths of the AODV and OLSR protocols using 802.11 and 802.11p
•
Path Length: AODV protocol has poor results using 802.11a and 802.11p. More number
of hops leads to higher probability of broken links. Then, OLSR protocol has more stables paths,
with minor probability of broken links.
201
8. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 7. Path Length of the AODV and OLSR protocols using 802.11a and 802.11p
•
Path Duration: Finally, Figure 8 shows the path duration. OLSR protocol uses MPR
nodes, reducing signaling messages and getting better results when compared with AODV,
mainly in scenario with medium vehicle density.
Figure 8. Path Duration of the AODV and OLSR protocols using 802.11a and 802.11p
6. CONCLUSIONS
In this paper, we evaluate AODV and OLSR topology-based protocols under 802.11a and
802.11p in an urban scenario considering different vehicle density. VANETs have a high dynamic
topology, where AODV protocol suffers to maintain routing table constantly updated increasing
signalling control messages. For most of the metrics evaluated in this paper, OLSR has better
performance that AODV, mainly when 802.11p is used showing that OLSR can be an alternative
to use in VANETs.
202
9. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
As future works, the authors are also interested in evaluating routing protocols for VANET in
urban scenarios with other realistic characteristics such as accidents, overtaking, points of interest
and higher number of nodes.
ACKNOWLEDGEMENTS
The authors would like to thank professor Larissa Broetto by revision the article and giving some
suggestions.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
The FCC DSRC web site. http://wireless.fcc.gov/services/its/dsrc/
Bryan Parno, Adrian Perrig, “Challenges in Securing Vehicular Networks”, Poster presented at
USENIX Security Symposium,August-04.
Szczurek P, Xu B, Wolfson O, Lin J. A methodology for the development of novel, vanet safety
applications. Proceedings of the ninth ACM international workshop on Vehicular internetworking, systems, and applications, June 2012; 119-122.
Vaghela VB, Shad DJ. Vehicular parking space discovery with agent approach. Proceedings of the
International Conference and Workshop on Emerging Trends in Technology. February 2011; 613617
Huang CM, Lin SY. An early collision warning algorithm for vehicles based on v2v
communication. International Journal of Communications Systems 2012; 25(6): 779-795.
Chennikara, J., Chen, W., Altintas, O., & Cai, S. (2001). Survey of routing protocols for intervehicle communications. Trird Annual International Conference Mobile and Ubiquitous Systems:
Networking and Services, 1-5.
Manvi, SS et al., ”Performance Analysis of AODV, DSR, and Swarm Intelligence Routing
Protocols In Vehicular Ad hoc Network Environment”, ICFCC, 2009
Nadeem Javaid, Ayesha Bibi, Safdar Hussain Bouk, Akmal Javaid, and Iwao Sasase. Modeling
enhancements in DSR, FSR, OLSR under mobility and scalability constraints in VANETs. ICC,
page 6504-6508. 2012
Khan, I. and Qayyum, A., ”Performance evaluation of AODV and OLSR in highly fading
vehicular ad hoc network environments”, INMIC, 2009
"Survey of Routing Protocols in Vehicular Ad Hoc Networks," Kevin C. Lee, Uichin Lee, Mario
Gerla, Advances in Vehicular Ad-Hoc Networks: Developments and Challenges, IGI Global, Oct,
2009.
Jacquet, P., Muhlerthaler, P., Clausen, T., et al (2001). Optimized link state routing protocol for ad
hoc networks. IEEE International Multi Topic Conference, 62-68
Saadi Boudjit. “Autoconfiguration Algorithm For a Multiple Interfaces Adhoc Network Running
OLSR Routing Protocol”. International Journal of Computer Networks and Communications
(IJCNC). Vol. 5, No. 1, January 2013, 153-170.
Emanuel Bacelli, Juan Antonio Cordero and Philippe Jacquet. “OSPF over Multi-Hop Ad Hoc
Wireless Communications”. International Journal of Computer Networks and Communications
(IJCNC). Vol. 2, No. 5, September 2010, 37-56.
Perkins, C.E., & Royer, C.M. (1999). Ad-hoc on-demand distance vector routing. Second IEEE
Workshop on Mobile Computing Systems and Applications, 90-100.
Mahdipour, E. Rahmani, A.M. Aminian, E. ,” Performance Evaluation of Destination-Sequenced
Distance-Vector (DSDV) Routing Protocol”, Proceeding March 2009 , page(s): 186 – 190, ISBN:
978-0-7695-3567-8
Information Sciences Institute (2011). NS-2 Network Simulator (version 2.33). Available at
http://nsnam.isi.edu/nsnam/index.php/Main Page
TraNS (2011), Open source tool for realistic simulations of VANET applications. Available at
http://trans.ep.ch/
Krajzewicz, D.; Hertkorn, G.; Wagner, P. et al (2002)., Sumo (simulation of urban mobility), an
open-source trace simulation. 4th Middle East Symposium on Simulation and Modelling
(MESM2002), 183-187.
203
10. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
[19]
U.S. Census Bureau (2011). TIGER database / Line - Second edition. Available at:
http://www.census.gov/geo/www/tiger
Authors
Ederval Pablo Ferreira da Cruz received the graduation in Data Processing from the
University Center of Espirito Santo (UNESC), Brazil, in 2001 and the M.Sc degree from the
Federal University of State of Rio de Janeiro (UNIRIO), Brazil, in 2012. He is currently
professor of the Federal Institute of Espirito Santo (IFES) - Campus Itapina. His research
interests include vehicular networks and wireless sensor networks
Bruno dos Santos Silva is an undergraduate student at Federal University of State of Rio de
Janeiro (UNIRIO). Currently, he has a scholarship from CNPq at National Institute for Pure
and Applied Mathematics (IMPA).
204