Routing protocols have an important role in any Mobile Ad Hoc Network (MANET). Researchers have
elaborated several routing protocols that possess different performance levels. In this paper we give a
performance evaluation of AODV, DSR, DSDV, OLSR and DYMO routing protocols in Mobile Ad Hoc
Networks (MANETS) to determine the best in different scenarios. We analyse these MANET routing
protocols by using NS-2 simulator. We specify how the Number of Nodes parameter influences their
performance. In this study, performance is calculated in terms of Packet Delivery Ratio, Average End to
End Delay, Normalised Routing Load and Average Throughput.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any
pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as
a router, forwarding information packets for other mobile nodes. There are many routing protocols that
possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV,
OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational
conditions for each MANETs protocol. We study these five MANETs routing protocols by different
simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This
performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay,
Normalized Routing Load and Average Throughput.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
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.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any
pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as
a router, forwarding information packets for other mobile nodes. There are many routing protocols that
possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV,
OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational
conditions for each MANETs protocol. We study these five MANETs routing protocols by different
simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This
performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay,
Normalized Routing Load and Average Throughput.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that
possess different performance levels in different scenarios. The main task is to evaluate the existing routing protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different
simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
In this paper, we proposed a replacement hybrid multipath routing protocol for
MANET known as Hybrid Multipath Progressive Routing Protocol for MANET (HMPRP),
during this work we improve the performance of accepted MANET routing protocols,
namely, the Ad-hoc On-demand Distance Vector routing protocol and use of their most
popular properties to formulate a replacement Hybrid routing protocol using the received
signal strength. The proposed routing protocol optimizes the information measure usage of
MANETs by reducing the routing overload and overhead. This proposed routing protocol
additionally extends the battery lifetime of the mobile devices by reducing the specified
variety of operations for (i) Route determination (ii) for packet forwarding. Simulation
results are used to draw conclusions regarding the proposed routing algorithm and
compared it with the AODV, OLSR, and ZRP protocol. Experiments carried out based on
this proposed algorithm, shows that better performance are achieved with regard to AODV,
OLSR, and ZRP routing algorithm in terms of packet delivery ratio, throughput, energy
consumed and end-to-end packet delay.
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)
Survey comparison estimation of various routing protocols in mobile ad hoc ne...ijdpsjournal
MANET is
an autonomous system of mobile nodes attached by wireless links. It represents
a complex and
dynamic distributed systems that consist of mobile wireless nodes that can freely self organize into
an ad
-
hoc network topology. The devices in the network may hav
e limited transmission
range therefore multiple
hops may be needed by one node to transfer data to another node in network. This leads to the need f
or an
effective routing protocol. In this paper we study various classifications of routing protocols and
th
eir types
for wireless mobile ad
-
hoc networks like DSDV, GSR, AODV, DSR, ZRP, FSR, CGSR, LAR, and Geocast
Protocols. In this paper we also compare different routing proto
cols on based on a given set of
parameters
Scalability, Latency, Bandwidth, Control
-
ov
erhead, Mobility impact
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).
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.
T HE I MPACT OF TCP C ONGESTION W INDOW S IZE ON THE P ERFORMANCE E VA...ijwmn
A mobile ad hoc network (MANET) is a temporary coll
ection of mobile nodes randomly moved within a
limited terrain area. The nodes are connected to fo
rm a wireless network without use any communication
infrastructure. Because of the limiting resources o
f MANET nodes, multiple hops
scheme is proposed for
data exchange
across the network. Varieties of mobile ad hoc rout
ing protocols have been developed to
support the multi-hop scheme of ad hoc networks. A
popular Transmission Control Protocol (TCP)
provides a reliable connection in a computer networ
k environment; it sets its congestion window size i
n
response to the behavior of the network to achieve
the best performance. This work aims to investigate
and
compare the MANET protocol
performance, such as DSDV, AODV and DSR in terms of
network
throughput, average routing load, the packet delive
ry ratio (PDR), and average end-to-end delay by
varying the maximum congestion window size. Our si
mulation has been implemented using a well-known
NS-2.35 network simulator. The simulated results sh
ow that the demonstrates of the concepts of MANET
routing protocols with respect to TCP congestion wi
ndow size in MANET environment
Effect of node mobility onaomdv protocol in manetijwmn
In this paper, we have analyzed the effect of node mobility on theperformance of AOMDV multipath routing
protocol. This routing protocol in ad hoc network has been analyzed with random way point mobility model
only. This is not sufficient to evaluate the behavior of a routing protocol. Therefore, in this paper, we
have considered Random waypoint, Random Direction and Probabilistic Random Walk mobility Model for
performance analysis of AOMDV protocol. The result reveals that packet delivery ratio decreases with the
increasing node mobility forall mobility models. Also, average end-to-end delay is also vary with varying
node speed, initially upto 20 nodes in all mobility models delay is minimum.
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).
Quality of Service Routing in Mobile Ad Hoc Networks Using Location and Energ...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multipath protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
Users Approach on Providing Feedback for Smart Home Devices – Phase IIijujournal
Smart Home technology has accomplished extraordinary success in making individuals' lives more straightforward and relaxing. Technology has recently brought about numerous savvy and refined frame works that advanced clever living innovation. In this paper, we will investigate the behavioral intention of user's approach to providing feedback for smart home devices. We will conduct an online survey for a sample of three to five students selected by simple random sampling to study the user's motto for giving feedback on smart home devices and their expectations. We have observed that most users are ready to actively share their input on smart home devices to improve the product's service and quality to fulfill the user’s needs and make their lives easier.
Users Approach on Providing Feedback for Smart Home Devices – Phase IIijujournal
Smart Home technology has accomplished extraordinary success in making individuals' lives more
straightforward and relaxing. Technology has recently brought about numerous savvy and refined frame
works that advanced clever living innovation. In this paper, we will investigate the behavioral intention of
user's approach to providing feedback for smart home devices. We will conduct an online survey for a
sample of three to five students selected by simple random sampling to study the user's motto for giving
feedback on smart home devices and their expectations. We have observed that most users are ready to
actively share their input on smart home devices to improve the product's service and quality to fulfill the
user’s needs and make their lives easier.
More Related Content
Similar to PERFORMANCE COMPARISON OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
In this paper, we proposed a replacement hybrid multipath routing protocol for
MANET known as Hybrid Multipath Progressive Routing Protocol for MANET (HMPRP),
during this work we improve the performance of accepted MANET routing protocols,
namely, the Ad-hoc On-demand Distance Vector routing protocol and use of their most
popular properties to formulate a replacement Hybrid routing protocol using the received
signal strength. The proposed routing protocol optimizes the information measure usage of
MANETs by reducing the routing overload and overhead. This proposed routing protocol
additionally extends the battery lifetime of the mobile devices by reducing the specified
variety of operations for (i) Route determination (ii) for packet forwarding. Simulation
results are used to draw conclusions regarding the proposed routing algorithm and
compared it with the AODV, OLSR, and ZRP protocol. Experiments carried out based on
this proposed algorithm, shows that better performance are achieved with regard to AODV,
OLSR, and ZRP routing algorithm in terms of packet delivery ratio, throughput, energy
consumed and end-to-end packet delay.
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)
Survey comparison estimation of various routing protocols in mobile ad hoc ne...ijdpsjournal
MANET is
an autonomous system of mobile nodes attached by wireless links. It represents
a complex and
dynamic distributed systems that consist of mobile wireless nodes that can freely self organize into
an ad
-
hoc network topology. The devices in the network may hav
e limited transmission
range therefore multiple
hops may be needed by one node to transfer data to another node in network. This leads to the need f
or an
effective routing protocol. In this paper we study various classifications of routing protocols and
th
eir types
for wireless mobile ad
-
hoc networks like DSDV, GSR, AODV, DSR, ZRP, FSR, CGSR, LAR, and Geocast
Protocols. In this paper we also compare different routing proto
cols on based on a given set of
parameters
Scalability, Latency, Bandwidth, Control
-
ov
erhead, Mobility impact
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).
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.
T HE I MPACT OF TCP C ONGESTION W INDOW S IZE ON THE P ERFORMANCE E VA...ijwmn
A mobile ad hoc network (MANET) is a temporary coll
ection of mobile nodes randomly moved within a
limited terrain area. The nodes are connected to fo
rm a wireless network without use any communication
infrastructure. Because of the limiting resources o
f MANET nodes, multiple hops
scheme is proposed for
data exchange
across the network. Varieties of mobile ad hoc rout
ing protocols have been developed to
support the multi-hop scheme of ad hoc networks. A
popular Transmission Control Protocol (TCP)
provides a reliable connection in a computer networ
k environment; it sets its congestion window size i
n
response to the behavior of the network to achieve
the best performance. This work aims to investigate
and
compare the MANET protocol
performance, such as DSDV, AODV and DSR in terms of
network
throughput, average routing load, the packet delive
ry ratio (PDR), and average end-to-end delay by
varying the maximum congestion window size. Our si
mulation has been implemented using a well-known
NS-2.35 network simulator. The simulated results sh
ow that the demonstrates of the concepts of MANET
routing protocols with respect to TCP congestion wi
ndow size in MANET environment
Effect of node mobility onaomdv protocol in manetijwmn
In this paper, we have analyzed the effect of node mobility on theperformance of AOMDV multipath routing
protocol. This routing protocol in ad hoc network has been analyzed with random way point mobility model
only. This is not sufficient to evaluate the behavior of a routing protocol. Therefore, in this paper, we
have considered Random waypoint, Random Direction and Probabilistic Random Walk mobility Model for
performance analysis of AOMDV protocol. The result reveals that packet delivery ratio decreases with the
increasing node mobility forall mobility models. Also, average end-to-end delay is also vary with varying
node speed, initially upto 20 nodes in all mobility models delay is minimum.
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).
Quality of Service Routing in Mobile Ad Hoc Networks Using Location and Energ...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multipath protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
Similar to PERFORMANCE COMPARISON OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS (20)
Users Approach on Providing Feedback for Smart Home Devices – Phase IIijujournal
Smart Home technology has accomplished extraordinary success in making individuals' lives more straightforward and relaxing. Technology has recently brought about numerous savvy and refined frame works that advanced clever living innovation. In this paper, we will investigate the behavioral intention of user's approach to providing feedback for smart home devices. We will conduct an online survey for a sample of three to five students selected by simple random sampling to study the user's motto for giving feedback on smart home devices and their expectations. We have observed that most users are ready to actively share their input on smart home devices to improve the product's service and quality to fulfill the user’s needs and make their lives easier.
Users Approach on Providing Feedback for Smart Home Devices – Phase IIijujournal
Smart Home technology has accomplished extraordinary success in making individuals' lives more
straightforward and relaxing. Technology has recently brought about numerous savvy and refined frame
works that advanced clever living innovation. In this paper, we will investigate the behavioral intention of
user's approach to providing feedback for smart home devices. We will conduct an online survey for a
sample of three to five students selected by simple random sampling to study the user's motto for giving
feedback on smart home devices and their expectations. We have observed that most users are ready to
actively share their input on smart home devices to improve the product's service and quality to fulfill the
user’s needs and make their lives easier.
October 2023-Top Cited Articles in IJU.pdfijujournal
International Journal of Ubiquitous Computing (IJU) is a quarterly open access peer-reviewed journal that provides excellent international forum for sharing knowledge and results in theory, methodology and applications of ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the journal is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
ACCELERATION DETECTION OF LARGE (PROBABLY) PRIME NUMBERSijujournal
In order to avoid unnecessary applications of Miller-Rabin algorithm to the number in question, we resort
to trial division by a few initial prime numbers, since such a division take less time. How far we should go
with such a division is the that we are trying to answer in this paper?For the theory of the matter is fully
resolved. However, that in practice we do not have much use.Therefore, we present a solution that is
probably irrelevant to theorists, but it is very useful to people who have spent many nights to produce
large (probably) prime numbers using its own software.
A novel integrated approach for handling anomalies in RFID dataijujournal
Radio Frequency Identification (RFID) is a convenient technology employed in various applications. The
success of these RFID applications depends heavily on the quality of the data stream generated by RFID
readers. Due to various anomalies found predominantly in RFID data it limits the widespread adoption of
this technology. Our work is to eliminate the anomalies present in RFID data in an effective manner so that
it can be applied for high end applications. Our approach is a hybrid approach of middleware and
deferred because it is not always possible to remove all anomalies and redundancies in middleware. The
processing of other anomalies is deferred until the query time and cleaned by business rules. Experimental
results show that the proposed approach performs the cleaning in an effective manner compared to the
existing approaches.
UBIQUITOUS HEALTHCARE MONITORING SYSTEM USING INTEGRATED TRIAXIAL ACCELEROMET...ijujournal
Ubiquitous healthcare has become one of the prominent areas of research inorder to address the
challenges encountered in healthcare environment. In contribution to this area, this study developed a
system prototype that recommends diagonostic services based on physiological data collected in real time
from a distant patient. The prototype uses WBAN body sensors to be worn by the individual and an android
smart phone as a personal server. Physiological data is collected and uploaded to a Medical Health
Server (MHS) via GPRS/internet to be analysed. Our implemented prototype monitors the activity, location
and physiological data such as SpO2 and Heart Rate (HR) of the elderly and patients in rehabilitation. The
uploaded information can be accessed in real time by medical practitioners through a web application.
ENHANCING INDEPENDENT SENIOR LIVING THROUGH SMART HOME TECHNOLOGIESijujournal
The population of elderly folks is ballooning worldwide as people live longer. But getting older often
means declining health and trouble living solo. Smart home tech could keep an eye on old folks and get
help quickly when needed so they can stay independent. This paper looks at a system combining wireless
sensors, video watches, automation, resident monitoring, emergency detection, and remote access. Sensors
track health signs, activities, appliance use. Video analytics spot odd stuff like falls. Sensor fusion and
machine learning find normal patterns so wonks can see unhealthy changes and send alerts. Multi-channel
alerts reach caregivers and emergency folks. A LabVIEW can integrate devices and enables local and
remote oversight and can control and handle emergency responses. Benefits seem to be early illness clues,
quick help, less burden on caregivers, and optimized home settings. But will old folks use all this tech? Can
we prove it really helps folks live longer and better? More research on maximizing reliability and
evaluating real-world impacts is needed. But designed thoughtfully, smart homes could may profoundly
improve the aging experience.
HMR LOG ANALYZER: ANALYZE WEB APPLICATION LOGS OVER HADOOP MAPREDUCEijujournal
In today’s Internet world, log file analysis is becoming a necessary task for analyzing the customer’s
behavior in order to improve advertising and sales as well as for datasets like environment, medical,
banking system it is important to analyze the log data to get required knowledge from it. Web mining is the
process of discovering the knowledge from the web data. Log files are getting generated very fast at the
rate of 1-10 Mb/s per machine, a single data center can generate tens of terabytes of log data in a day.
These datasets are huge. In order to analyze such large datasets we need parallel processing system and
reliable data storage mechanism. Virtual database system is an effective solution for integrating the data
but it becomes inefficient for large datasets. The Hadoop framework provides reliable data storage by
Hadoop Distributed File System and MapReduce programming model which is a parallel processing
system for large datasets. Hadoop distributed file system breaks up input data and sends fractions of the
original data to several machines in hadoop cluster to hold blocks of data. This mechanism helps to
process log data in parallel using all the machines in the hadoop cluster and computes result efficiently.
The dominant approach provided by hadoop to “Store first query later”, loads the data to the Hadoop
Distributed File System and then executes queries written in Pig Latin. This approach reduces the response
time as well as the load on to the end system. This paper proposes a log analysis system using Hadoop
MapReduce which will provide accurate results in minimum response time.
SERVICE DISCOVERY – A SURVEY AND COMPARISONijujournal
With the increasing number of services in the internet, companies’ intranets, and home networks: service
discovery becomes an integral part of modern networked system. This paper provides a comprehensive
survey of major solutions for service discovery. We cover techniques and features used in existing systems.
Although a few survey articles have been published on this object, our contribution focuses on comparing
and analyzing surveyed solutions according eight prime criteria, which we have defined before. This
comparison will be helpful to determine limits of existing discovery protocols and identify future research
opportunities in service discovery.
SIX DEGREES OF SEPARATION TO IMPROVE ROUTING IN OPPORTUNISTIC NETWORKSijujournal
Opportunistic Networks are able to exploit social behavior to create connectivity opportunities. This
paradigm uses pair-wise contacts for routing messages between nodes. In this context we investigated if the
“six degrees of separation” conjecture of small-world networks can be used as a basis to route messages in
Opportunistic Networks. We propose a simple approach for routing that outperforms some popular
protocols in simulations that are carried out with real world traces using ONE simulator. We conclude that
static graph models are not suitable for underlay routing approaches in highly dynamic networks like
Opportunistic Networks without taking account of temporal factors such as time, duration and frequency of
previous encounters.
International Journal of Ubiquitous Computing (IJU)ijujournal
International Journal of Ubiquitous Computing (IJU) is a quarterly open access peer-reviewed journal that provides excellent international forum for sharing knowledge and results in theory, methodology and applications of ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the journal is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
PERVASIVE COMPUTING APPLIED TO THE CARE OF PATIENTS WITH DEMENTIA IN HOMECARE...ijujournal
The aging population and the consequent increase in the incidence of dementias is causing many
challenges to health systems, mainly related to infrastructure, low services quality and high costs. One
solution is to provide the care at house of the patient, through of home care services. However, it is not a
trivial task, since a patient with dementia requires constant care and monitoring from a caregiver, who
suffers physical and emotional overload. In this context, this work presents an modelling for development of
pervasive systems aimed at helping the care of these patients in order to lessen the burden of the caregiver
while the patient continue to receive the necessary care.
A proposed Novel Approach for Sentiment Analysis and Opinion Miningijujournal
as the people are being dependent on internet the requirement of user view analysis is increasing
exponentially. Customer posts their experience and opinion about the product policy and services. But,
because of the massive volume of reviews, customers can’t read all reviews. In order to solve this problem,
a lot of research is being carried out in Opinion Mining. In order to solve this problem, a lot of research is
being carried out in Opinion Mining. Through the Opinion Mining, we can know about contents of whole
product reviews, Blogs are websites that allow one or more individuals to write about things they want to
share with other The valuable data contained in posts from a large number of users across geographic,
demographic and cultural boundaries provide a rich data source not only for commercial exploitation but
also for psychological & sociopolitical research. This paper tries to demonstrate the plausibility of the idea
through our clustering and classifying opinion mining experiment on analysis of blog posts on recent
product policy and services reviews. We are proposing a Nobel approach for analyzing the Review for the
customer opinion
International Journal of Ubiquitous Computing (IJU)ijujournal
International Journal of Ubiquitous Computing (IJU) is a quarterly open access peer-reviewed journal that provides excellent international forum for sharing knowledge and results in theory, methodology and applications of ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the journal is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
USABILITY ENGINEERING OF GAMES: A COMPARATIVE ANALYSIS OF MEASURING EXCITEMEN...ijujournal
Usability engineering and usability testing are concepts that continue to evolve. Interesting research studies
and new ideas come up every now and then. This paper tests the hypothesis of using an EDA-based
physiological measurements as a usability testing tool by considering three measures; which are observers‟
opinions, self-reported data and EDA-based physiological sensor data. These data were analyzed
comparatively and statistically. It concludes by discussing the findings that has been obtained from those
subjective and objective measures, which partially supports the hypothesis.
SECURED SMART SYSTEM DESING IN PERVASIVE COMPUTING ENVIRONMENT USING VCSijujournal
Ubiquitous Computing uses mobile phones or tiny devices for application development with sensors
embedded in mobile phones. The information generated by these devices is a big task in collection and
storage. For further, the data transmission to the intended destination is delay tolerant. In this paper, we
made an attempt to propose a new security algorithm for providing security to Pervasive Computing
Environment (PCE) system using Public-key Encryption (PKE) algorithm, Biometric Security (BS)
algorithm and Visual Cryptography Scheme (VCS) algorithm. In the proposed PCE monitoring system it
automates various home appliances using VCS and also provides security against intrusion using Zigbee
IEEE 802.15.4 based Sensor Network, GSM and Wi-Fi networks are embedded through a standard Home
gateway.
Optical Character Recognition (OCR) is a technique, used to convert scanned image into editable text
format. Many different types of Optical Character Recognition (OCR) tools are commercially available
today; it is a useful and popular method for different types of applications. OCR can predict the accurate
result depends on text pre-processing and segmentation algorithms. Image quality is one of the most
important factors that improve quality of recognition in performing OCR tools. Images can be processed
independently (.png, .jpg, and .gif files) or in multi-page PDF documents (.pdf). The primary objective of
this work is to provide the overview of various Optical Character Recognition (OCR) tools and analyses of
their performance by applying the two factors of OCR tool performance i.e. accuracy and error rate.
Optical Character Recognition (OCR) is a technique, used to convert scanned image into editable text
format. Many different types of Optical Character Recognition (OCR) tools are commercially available
today; it is a useful and popular method for different types of applications. OCR can predict the accurate
result depends on text pre-processing and segmentation algorithms. Image quality is one of the most
important factors that improve quality of recognition in performing OCR tools. Images can be processed
independently (.png, .jpg, and .gif files) or in multi-page PDF documents (.pdf). The primary objective of
this work is to provide the overview of various Optical Character Recognition (OCR) tools and analyses of
their performance by applying the two factors of OCR tool performance i.e. accuracy and error rate.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to
different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high
throughput for the network and increase the chance for multi path routing. This is because the multiple
channel availability for transmission decreases the probability of the most elegant problem called as
interference problem which is either of interflow and intraflow type. For avoiding the problem like
interference and maintaining the constant network performance or increasing the performance the WMN
need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting
several packets ready for transmission and sending them to the intended recipient through the channel,
while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different
available multiple paths is most the important factor in the both case for a routing algorithm. Hence the
most challenging factor is to determine a forwarding strategy which will provide the schedule for each
node for transmission within the channel. In this research work we have tried to implement two forwarding
strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We
have implemented Global State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding
and packet aggregation. After the successful implementation the network performance has been measured
by means of simulation study.
A SURVEY: TO HARNESS AN EFFICIENT ENERGY IN CLOUD COMPUTINGijujournal
Cloud computing affords huge potential for dynamism, flexibility and cost-effective IT operations. Cloud
computing requires many tasks to be executed by the provided resources to achieve good performance,
shortest response time and high utilization of resources. To achieve these challenges there is a need to
develop a new energy aware scheduling algorithm that outperform appropriate allocation map of task to
optimize energy consumption. This study accomplished with all the existing techniques mainly focus on
reducing energy consumption
Techniques to optimize the pagerank algorithm usually fall in two categories. One is to try reducing the work per iteration, and the other is to try reducing the number of iterations. These goals are often at odds with one another. Skipping computation on vertices which have already converged has the potential to save iteration time. Skipping in-identical vertices, with the same in-links, helps reduce duplicate computations and thus could help reduce iteration time. Road networks often have chains which can be short-circuited before pagerank computation to improve performance. Final ranks of chain nodes can be easily calculated. This could reduce both the iteration time, and the number of iterations. If a graph has no dangling nodes, pagerank of each strongly connected component can be computed in topological order. This could help reduce the iteration time, no. of iterations, and also enable multi-iteration concurrency in pagerank computation. The combination of all of the above methods is the STICD algorithm. [sticd] For dynamic graphs, unchanged components whose ranks are unaffected can be skipped altogether.
As Europe's leading economic powerhouse and the fourth-largest hashtag#economy globally, Germany stands at the forefront of innovation and industrial might. Renowned for its precision engineering and high-tech sectors, Germany's economic structure is heavily supported by a robust service industry, accounting for approximately 68% of its GDP. This economic clout and strategic geopolitical stance position Germany as a focal point in the global cyber threat landscape.
In the face of escalating global tensions, particularly those emanating from geopolitical disputes with nations like hashtag#Russia and hashtag#China, hashtag#Germany has witnessed a significant uptick in targeted cyber operations. Our analysis indicates a marked increase in hashtag#cyberattack sophistication aimed at critical infrastructure and key industrial sectors. These attacks range from ransomware campaigns to hashtag#AdvancedPersistentThreats (hashtag#APTs), threatening national security and business integrity.
🔑 Key findings include:
🔍 Increased frequency and complexity of cyber threats.
🔍 Escalation of state-sponsored and criminally motivated cyber operations.
🔍 Active dark web exchanges of malicious tools and tactics.
Our comprehensive report delves into these challenges, using a blend of open-source and proprietary data collection techniques. By monitoring activity on critical networks and analyzing attack patterns, our team provides a detailed overview of the threats facing German entities.
This report aims to equip stakeholders across public and private sectors with the knowledge to enhance their defensive strategies, reduce exposure to cyber risks, and reinforce Germany's resilience against cyber threats.
Show drafts
volume_up
Empowering the Data Analytics Ecosystem: A Laser Focus on Value
The data analytics ecosystem thrives when every component functions at its peak, unlocking the true potential of data. Here's a laser focus on key areas for an empowered ecosystem:
1. Democratize Access, Not Data:
Granular Access Controls: Provide users with self-service tools tailored to their specific needs, preventing data overload and misuse.
Data Catalogs: Implement robust data catalogs for easy discovery and understanding of available data sources.
2. Foster Collaboration with Clear Roles:
Data Mesh Architecture: Break down data silos by creating a distributed data ownership model with clear ownership and responsibilities.
Collaborative Workspaces: Utilize interactive platforms where data scientists, analysts, and domain experts can work seamlessly together.
3. Leverage Advanced Analytics Strategically:
AI-powered Automation: Automate repetitive tasks like data cleaning and feature engineering, freeing up data talent for higher-level analysis.
Right-Tool Selection: Strategically choose the most effective advanced analytics techniques (e.g., AI, ML) based on specific business problems.
4. Prioritize Data Quality with Automation:
Automated Data Validation: Implement automated data quality checks to identify and rectify errors at the source, minimizing downstream issues.
Data Lineage Tracking: Track the flow of data throughout the ecosystem, ensuring transparency and facilitating root cause analysis for errors.
5. Cultivate a Data-Driven Mindset:
Metrics-Driven Performance Management: Align KPIs and performance metrics with data-driven insights to ensure actionable decision making.
Data Storytelling Workshops: Equip stakeholders with the skills to translate complex data findings into compelling narratives that drive action.
Benefits of a Precise Ecosystem:
Sharpened Focus: Precise access and clear roles ensure everyone works with the most relevant data, maximizing efficiency.
Actionable Insights: Strategic analytics and automated quality checks lead to more reliable and actionable data insights.
Continuous Improvement: Data-driven performance management fosters a culture of learning and continuous improvement.
Sustainable Growth: Empowered by data, organizations can make informed decisions to drive sustainable growth and innovation.
By focusing on these precise actions, organizations can create an empowered data analytics ecosystem that delivers real value by driving data-driven decisions and maximizing the return on their data investment.
Levelwise PageRank with Loop-Based Dead End Handling Strategy : SHORT REPORT ...Subhajit Sahu
Abstract — Levelwise PageRank is an alternative method of PageRank computation which decomposes the input graph into a directed acyclic block-graph of strongly connected components, and processes them in topological order, one level at a time. This enables calculation for ranks in a distributed fashion without per-iteration communication, unlike the standard method where all vertices are processed in each iteration. It however comes with a precondition of the absence of dead ends in the input graph. Here, the native non-distributed performance of Levelwise PageRank was compared against Monolithic PageRank on a CPU as well as a GPU. To ensure a fair comparison, Monolithic PageRank was also performed on a graph where vertices were split by components. Results indicate that Levelwise PageRank is about as fast as Monolithic PageRank on the CPU, but quite a bit slower on the GPU. Slowdown on the GPU is likely caused by a large submission of small workloads, and expected to be non-issue when the computation is performed on massive graphs.
Data Centers - Striving Within A Narrow Range - Research Report - MCG - May 2...pchutichetpong
M Capital Group (“MCG”) expects to see demand and the changing evolution of supply, facilitated through institutional investment rotation out of offices and into work from home (“WFH”), while the ever-expanding need for data storage as global internet usage expands, with experts predicting 5.3 billion users by 2023. These market factors will be underpinned by technological changes, such as progressing cloud services and edge sites, allowing the industry to see strong expected annual growth of 13% over the next 4 years.
Whilst competitive headwinds remain, represented through the recent second bankruptcy filing of Sungard, which blames “COVID-19 and other macroeconomic trends including delayed customer spending decisions, insourcing and reductions in IT spending, energy inflation and reduction in demand for certain services”, the industry has seen key adjustments, where MCG believes that engineering cost management and technological innovation will be paramount to success.
MCG reports that the more favorable market conditions expected over the next few years, helped by the winding down of pandemic restrictions and a hybrid working environment will be driving market momentum forward. The continuous injection of capital by alternative investment firms, as well as the growing infrastructural investment from cloud service providers and social media companies, whose revenues are expected to grow over 3.6x larger by value in 2026, will likely help propel center provision and innovation. These factors paint a promising picture for the industry players that offset rising input costs and adapt to new technologies.
According to M Capital Group: “Specifically, the long-term cost-saving opportunities available from the rise of remote managing will likely aid value growth for the industry. Through margin optimization and further availability of capital for reinvestment, strong players will maintain their competitive foothold, while weaker players exit the market to balance supply and demand.”
PERFORMANCE COMPARISON OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS
1. International Journal of UbiComp (IJU), Vol.6, No.2, April 2015
DOI:10.5121/iju.2015.6201 01
PERFORMANCE COMPARISON OF ROUTING
PROTOCOLS IN MOBILE AD HOC NETWORKS
Mohamed Elboukhari1
, Mostafa Azizi1
and Abdelmalek Azizi2,3
1
Department of Applied Engineering, ESTO, Oujda, Morocco
2
Departement Mathematics & Computer Science, FSO, Oujda, Morocco
3
Academy Hassan II of Sciences & Technology, Rabat, Morocco
ABSTRACT
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.
KEYWORDS
Mobile Ad Hoc Networks (MANETs), Performance Comparaison, AODV, DSR, DSDV, OLSR, DYMO.
1. INTRODUCTION
Actually Mobile Ad Hoc Network (MANET) is very used. A network of type MANET is a group
of mobile stations sharing a radio transmission and they do not have any fixed centralized
administration. MANET operates in a dynamic topology. Each station possesses limited resources
such as processing power and battery. Mobile stations in MANET exchanges messages with each
other in a multi-hop manner. Hence, a station transmits a packet to a destination to another node
through intermediate mobile stations and each station may operate as an end point and also can
operate as a router.
Figure 1. Mobile stations operate in MANET as routers
2. International Journal of UbiComp (IJU), Vol.6, No.2, April 2015
2
many work has been elaborated in the design of routing protocols in different kinds of ad hoc
networks like MANETs (Mobile Ad Hoc Networks), VANETS (Vehicular Ad-Hoc Networks),
WSNs (Wireless Sensor Networks), and WMNs (Wireless Mesh Networks) etc. [1].
Implementing the routing protocols is the main goal of the MANETs. For such implementations
concepts of game-theoretic approach, dynamic control approach, information-theoretic approach,
or ad hoc networks routing-based approach has been applied [2].
a station in MANETs can exchanges messages with other mobile stations whether they are in the
same wireless channel or not. so, four essential functions are to be designed by the routing
protocols: channel assignment, packet routing, network topology, scheduling and maintaining
network connectivity. Routing protocols in MANETs are implemented with some basic
objectives that are minimum control overhead, dynamic topology maintenance, multi-hop routing,
loop prevention and minimum processing overhead [3].
The remainder of the article is organized as follows. We describe the related works in section 2,
in section 3 we give a presentation of MANET routing protocols. In section 4, we describes
simulation environment. The results of our simulation are analysed in section 5. Finally, in
section 6 we conclude the paper.
2. RELATED WORKS
Several works have been done concerning the performance evaluation of many MANET routing
protocols. We focus on those works performed by network simulator NS-2[4].
Table 1 shows that comparative performance evaluation for all the parameters namely Packet
Delivery Ratio, Throughput, Average End to End Delay, Jitter, Routing Load, and Routing
Frequency among the routing protocols have not been done in a single paper.
Table 1. Performance analysis of MANET routing protocols.
Ref.
no
Protocols used Performance metrics Variable Parameters
[5] AODV, DSR,
DSDV
End to End Delay, Packet Delivery Ratio,
Normalized routing load, Throughput
Mobility
[6] AODV, DSR,
DSDV
End to End Delay, Packet Delivery Ratio,
Throughput
Number of nodes
[7] AODV, DSR,
DSDV
Packet Delivery Ratio, End to End Delay,
Normalized Routing Load
Pause time, Mobility and
Sending rate
[8] AODV, DSR,
DSDV
Average End to End Delay, Normalized
Routing Load, Packet Delivery Ratio,
Number of Nodes,
Speed, Pause time,
Transmission Power
[9] DSDV, AODV,
DSR, TORA
Throughput, Routing Overhead, Path
Optimality, Packet Loss, Average delay
Traffic Load, Movement
patterns
[10] AODV, DSR,
DSDV
Packet Delivery Ratio, Average End to
End Delay, Routing Overhead
Pause time
[11] AODV, DSR,
DSDV
Packet Delivery Ratio, Average End to
End Delay, Normalized Routing Load
Pause time, Number of
nodes and mobility
[12] DSDV, AODV,
DSR, TORA
Average Delay,Jitter, Routing Load, Loss
Ratio, Throughput and Connectivity
Network size
[13] DSDV, AODV Packet Delivery Fraction, Average End to
End Delay, Throughput
Number on nodes,
Speed, Time
[14] AODV, DSDV Packet Delivery Ratio, Average End to
End Delay
Mobility of nodes
3. International Journal of UbiComp (IJU), Vol.6, No.2, April 2015
3
In our article, we will compare five MANET protocols (AODV, DSR, DSDV, OLSR, and
DYMO). There is no work in our knowledge in the literature which deals with these five MANET
routing protocols by considering the variation of Number of Nodes parameter.
3. ROUTING PROTOCOLS IN MANET
The MANET routing protocols are divided into three classifications depending to their
performance and functionality: Table-driven (Proactive) routing protocols, On-demand (Reactive)
routing protocols and Hybrid routing protocols [15].
Proactive Routing Protocols: The routing data in these MANET protocols is organised in tables
stored by each station. The tables must be updated because the network topology is changing
dynamically. These protocols are employed where the route requirements are frequent. FSR,
STAR, GSR, DSDV, OLSR, CGSR and WRP are the examples.
Reactive Routing Protocols: These routing protocols choose routes to other stations only when
they are needed. A route discovery process is lunched when a station wants to communicate with
another station for which it does not possess any route table access. AODV, DSR, LAR, TORA,
CBRP and ARA are the examples.
Hybrid Routing Protocols: These MANET protocols employ functionality of both the reactive
and proactive protocols. For illustration, proactive protocols could be employed between
networks and reactive protocols inside the networks. DST, ZRP, DDR, ZHLS are the examples.
Figure 2. Examples of MANET Routing Protocols
3.1. Ad-hoc On-Demand distance Vector routing protocol (AODV)
AODV [16, 17] is a MANET routing protocol which employs an on-demand approach to find
routes, that is, a route is discovered only when it is needed by a source statin. AODV uses
sequence numbers to make certain freshness of routes. AODV employs route request (RREQ)
packets broadcasted through the group of connections to discover the paths needed by a source
station. it allows stations to find routes very fast for new destinations, and does not need stations
to store routes to destinations which are not moving. AODV aids stations to operate in response to
an alteration in network topology and link breakages quickly and the AODV operation is loop-
free [18]. When a route to a new station is demanded, the source broadcasts a RREQ packet to
discover a route to the needed destination. A transitional station that captures a RREQ replies to it
using a route reply packet only if it has a route to the destination station whose analogous
destination sequence number is greater or equal to the one presented in the RREQ packet.
Another important point to mention is that the RREQ also contains the most recent sequence
number for the destination of which the source node is responsive. A station capturing the RREQ
packet can transmit a route reply (RREP) packet if it is either the destination station or if it
4. International Journal of UbiComp (IJU), Vol.6, No.2, April 2015
4
possesses a route to the destination station with equivalent sequence number greater than or equal
to that appeared in the RREQ packet. In this case, it sends (unicasts) a RREP reverse to the source
station. Otherwise, it rebroadcasts the RREQ message. Nodes store track of the RREQ‟s source IP
address and broadcast ID.
3.2. Dynamic Source Routing (DSR)
Dynamic Source Routing (DSR) [19] is a wireless mesh networks routing protocol. Its
implementation is based on a method named “source routingˮ. DSR aids the network to be
completely self-configuring and self-organizing.
The Dynamic Source Routing protocol possesses two main mechanisms route discovery and route
maintenance. In the route discovery process a source node wishing to drive a packet to a
destination node, as certain a source route to the destination. In route maintenance process a
station which wants to send a message to a destination is capable to perceive, while employing a
source route to the destination, if the network topology has changed such that it can no longer
make use of its route to destination station. In case when Route Maintenance shows a source route
is no longer work, source station can try to employ any other route, or it can lunch route
discovery mechanism again to determine a new route for subsequent packets to destination
station.
3.3. Dynamic MANET On-Demand Routing Protocol (DYMO)
DYMO [20] uses large variety of mobility patterns by finding dynamically routes on-demand. It
also manages a wide selection of traffic patterns. The fundamental functionality of DYMO are
route discovery and route maintenance.
In the route discovery, a DYMO router lunches a Route Request packet (RREQ) to find a route to
a destination station. During the hop-by-hop broadcasting mechanism, each intermediate DYMO
router receiving the RREQ packet stores a route to the originator station. When the target‟s
DYMO router captures the RREQ packet, it stores a route to the originator station and unicasts
using a Route Reply (RREP) hop-by-hop through the originating DYMO router. Each transitional
DYMO router that captures the RREP packet prepares a route to the target station, and then the
RREP packet is unicast hop-by-hop through the originator. When the originator‟s DYMO router
receives finally the RREP packet, routes have been established between the the target DYMO
router and originating DYMO router in two directions. Route maintenance is composed of two
operations. To maintain routes in use, DYMO routers increase life of route upon successfully
forwarding a packet. To operate in response to the modifications in network topology, DYMO
routers monitor traffic being forwarded. When a packet is received to be forwarded and a route
for the destination station is not determined or the route is broken down, hence the DYMO router
of the source station of the packet is notified. A Route Error (RERR) is transmitted to point out
the route to one or more disrupted destination addresses is misplaced or broken. When the
source‟s DYMO router captures the RERR packet, it considers the route as broken. Before the
DYMO router can forward a message to the same destination station, it must lunch the route
discovery again for the destination station.
3.4. Destination Sequenced Distance Vector (DSDV) Protocol
DSDV [21] is one of the examples of proactive protocol. DSDV adds a new parameter, sequence
number, to each route table at each station. Each node maintains a routing table at its own and
which aids in packet transmission.
5. International Journal of UbiComp (IJU), Vol.6, No.2, April 2015
5
For the transmission of packets each node stores routing table. The routing possesses the data for
the connectivity to many nodes. These nodes provide all the number of stations (hops) and the
available destinations needed to obtain each destination station in the routing table. The routing
entry is tagged with a sequence number which is originated by the destination node. Each station
sends and updates its routing table periodically. The messages being flooded between stations
show a list of accessible nodes and the number of stations needed to obtain that particular node.
Routing information is broadcast periodically by broadcasting or multicasting the packets. Each
mobile station in DSDV protocol must publish its data routing table to its neighboring nodes. As
the information in the table may change frequently, the advertisement should be done on the
continuous basis so that every station can locate its neighbors in the network. It ensures the
shortest number of nodes (hops) required from source station to a destination station.
The information flooded by each node will contain its new sequence number parameter and the
following information for each new route: the number of hops required to reach the destination,
the new sequence number and the destination address.
3.5. Opitmized Link State Routing (OLSR) Protocol
OLSR protocol [22] is a pure link state protocol. Whenever there is any modification in the
topology then information is flooded to all nodes. This causes overheads and such overheads are
decreased by Multipoint relays (MPR). Two types of control messages are employed in OLSR;
they are topology control and hello messages. There is also Multiple Interface Declaration (MID)
packets which are employed for declaring other station that the declaring station can have several
OLSR interface addresses [23]. The MID message is broadcasted throughout the network only by
MPRs. Also there is a “Host and Network Association” (HNA) packet which gives the external
routing data by providing the possibility for routing to the external addresses.
4. SIMULATION ENVIRONMENT
4.1. Mobility Model
Mobility model describes changes in the stations velocity and acceleration over time and their
movement. Basic parameters related to node movement are mobility speed, number of nodes,
sending rate, pause time, number of connections, simulation duration. Mobility models can be
categorized in two types group and entity models. The motions of mobile stations in entity
models are independent from each other, but in group models the movements of stations are
dependent on each other [24].
In our article we chose the Random Waypoint Mobility, generated by the software BonnMotion
[25]. It is an entity model. A station in this model can select any random velocity and any random
destination. The station begins moving towards the chosen destination station. After obtaining the
destination station, the station stops for a small amount of time defined by the “Pause Time”
attribute and again the station repeats the process until the simulation stops.
4.2. Simulation Parameters
We elaborate the experiments for the evaluation of the performance of ad hoc routing protocols
AODV, DSR, DSDV, OLSR and DYMO with varying Number of Nodes. We have 30
simulations run in total out of which 30 trace files has been generated for Random Waypoint
Mobility each. We studied all performance metrics in our simulation under varying Number of
Nodes (20 to 70 Nodes) and while other attributes are fixed. Table 2 presents the simulation
parameters adapted to our simulation.
6. International Journal of UbiComp (IJU), Vol.6, No.2, April 2015
6
Table 2. Simulations parameters
4.3. NS-2 simulator
The network simulations have been performed using network simulator NS-2. The NS-2 is
software used to simulate discrete event for networks. It simulates events such as sending,
receiving, dropping and forwarding packets. The ns-allinone-2.34 [4] integrates simulation for
MANET routing protocols as AODV, DSR and DSDV. The simulation of protocols OLSR and
DYMO are based on the work presented in [26]. NS-2 is implemented in C++ programming
language with Object Tool Common Language.
Although NS-2. 34 can be implemented on different Operating Systems, for this article, we select
a Linux platform i.e. Ubuntu LTS 12.04, as Linux provides development tools as AWK [27] that
can be employed with the simulation. To run a NS-2.34 simulation, the user must write the OTCL
simulation script. NS-2 gives a visual presentation of the network by tracing stations movements
and events and writing them in a file named as Network Animator file (or NAM file) [4]. The
performance parameters are graphically visualized in MATLAB [28].
4.4. Performance Metrics
RFC2501 [29] illustrates a number of quantitative metrics that can be used for evaluating the
performance of MANET routing protocols. To analyze routing protocols (AODV, DSR, DSDV,
OLSR and DYMO), we have focused on four performance metrics for evaluation which are
Packet Delivery Ration, Average End to End Delay, Normalized Routing Load and Average
Throughput.
4.4.1. Packet Delivery Fraction
Packet Delivery Fraction is defined as the ratio of number of received information packets
successfully at the destinations statins over the number of information packets transmitted by the
sources stations. Packet Loss Fraction is defined as 1- Packet Delivery Fraction.
4.4.2. Average End to End Delay
The Average End to end delay is the average time from the sending of a packet at a source station
until packet delivery to a destination station. It contains all possible delays generated by queuing
at the interface queue, retransmission delays, propagation, transfer times of data and packets
buffering during route discovery process.
Parameters Value
Simulator NS-2.34
Data packet size 512 byte
Simulation duration 50 sec
Environnement size 500m × 500m
Number of Nodes 20, 30, 40, 50, 60, 70
Pause Time 5 sec
MAC Layer Protocol IEEE 802.11
Traffic Type CBR
Number of connections 15
Maximum Mobility 20 m/s
Mobility Model Random Waypoint
Protocols AODV, DSR, DSDV, OLSR, DYMO
7. International Journal of UbiComp (IJU), Vol.6, No.2, April 2015
7
4.4.3. Normalized Routing Load
The Normalized Routing Load is the ratio of all routing control packets send by all sources nodes
to number of received data packets at the destination nodes.
4.4.4. Average Throughput
Average Throughput is defined as the average number of packets successfully obtained their
destinations per unit time. This parameter is calculated as the number of bits delivered per second.
5. SIMULATION RESULTS AND ANALYSIS
The results after simulation are viewed in five figures. The performance of routing protocols
based on the varying the Number of Node is done on parameters like Packet Delivery Ratio,
Average End to End Delay, Normalized Routing Load and Average Throughput.
5.1. Packet Delivery Ratio
From Figure 3, we note that DSDV protocol has the lowest Packet Delivery Ratio compared to
other protocol (AODV, DSR, OLSR and DYMO). DSR and AODV demonstrate good
performance (height Packet Delivery Ratio), but DSR is better than AODV. In comparing on-
demand protocols, DSR shows the highest and DYMO the lowest Packet Delivery Ratio. As
table-driven protocols, OLSR outperforms DSDV in terms of Packet Delivery Ratio.
Figure 3: Packet Delivery Ratio versus Number of Nodes
5.2. Average End to End Delay
Figure 4 shows that AODV protocol has the highest value of Average End to End Delay (low
performance) compared to other protocols. This figure does not precise the behavior of the
protocols: DSR, DSDV, OLSR and DYMO. For this reason we elaborate the Figure 5. From this
figure, the performance of DSR and DYMO as on-demand protocol are approximately the same.
It seems as table-driven protocols have the lowest Average End to End Delay than on-demand
protocols when we vary the Number of Nodes. OLSR and DSDV as table-driven protocols have
8. International Journal of UbiComp (IJU), Vol.6, No.2, April 2015
8
routing tables and they do not need to discover the route for the same destination (low value of
Average End to End Delay).
Figure 4: Average End of End Delay versus Number of Nodes
Figure 5: Average End of End Delay versus Number of Nodes
5.3. Normalized Routing Load
We remark from Figure 6 that when the Number of Nodes increase, the Normalized Routing
Load increases. DSR has the lowest value of Normalized Routing Load (good performance) while
the OLSR has the highest value (low performance). As driven-protocols, DSDV has better
performance than OLSR in terms of Normalized Routing Load. By considering only on-demand
protocols and the value of Normalized Routing Load observed, DSR outperforms other protocols
(AODV and DYMO) and DYMO demonstrates the lowest performance.
9. International Journal of UbiComp (IJU), Vol.6, No.2, April 2015
9
Figure 6: Normalized Routing Load versus Number of Nodes
5.4. Average Throughput
Figure 7 shows that DSDV demonstrates the lowest Average Throughput compared to other
protocols (low performance). DSR and AODV give a good performance (highest value of
Average Throughput). OLSR outperforms the other table-driven protocol DSDV in terms of
Average Throughput. DYMO compared to the other on-demand protocols (AODV and DSR) has
the lowest value of Average Throughput (low performance).
Figure 7: Average Throughput versus Number of Nodes
6. CONCLUSIONS
We study in this article several MANET routing protocols such as AODV, DSR, DSDV, OLSR
and DYMO. With the help of NS-2 simulation we compared these protocols under different
network conditions. By varying Number of Nodes, We measure Average Throughput, the Packet
Delivery Ratio, Normalised Routing Load and Average End to End Delay as performance
matrices.
In terms of Packet Delivery Ratio, AODV, DSR have higher value than other protocols (DSDV,
OLSR and DYMO). As table-driven protocols, DSDV and OLSR show the lowest Average End
10. International Journal of UbiComp (IJU), Vol.6, No.2, April 2015
10
to End Delay (good performance) compared to on-demand protocols (AODV, DSR and DYMO).
DSR demonstrates the lowest Normalised Routing Load than other protocols. In almost all
scenarios, AODV and DSR outperform other protocols (DSDV, OLSR and DYMO) in terms of
Average Throughput.
Our focus in the future work is to extend the set of the experiments by taking into consideration
other simulations parameters (propagation models, MAC protocols, etc.). Our future simulation
will be elaborated in NS-3[30]
REFERENCES
[1] Rahman A, Islam S, Talevski A., “Performance measurement of various routing protocols in ad-
hoc network”, In: Proceedings of the international multiconference of engineers and computer
scientists, vol. 1. Hong Kong: IMECS; 2009.
[2] Tyagi SS, Chauhan RK., “Performance analysis of proactive and reactive routing protocols for ad
hoc networks”, Int J Comput Appl 2010;1(14).
[3] Basagni S, Conti M, Giordano S, Stojmenovic I., “Mobile ad hoc networking”, A John wiley and
sons, Inc., Publication; 2004.
[4] NS -2, the ns Manual, Available at http: //www. isi.edu/nsnam/ns/doc.
[5] AkshaiAggarwal, SavitaGandhi, NirbhayChaubey, “Performance Analysis of AODV, DSDV and
DSR in MANETs”, IJDPS, Vol.2, No.6,. November 2011.
[6] P. Manickam T. Guru Baskar, M.Girija, Dr.D.Manimegala, “Performance Comparisons of
Routing Protocols in Mobile Ad Hoc Networks”, International Journal of Wireless & Mobile
Networks (IJWMN), pp. 98-106, February 2011.
[7] Sabina Barakovic, Suad Kasapovic, Jasmina Barakovic, “Comparison of MANET Routing
Protocols in Different Traffic and Mobility Models”, Telfor Journal, Vol. 2, No. 1, 2010.
[8] Guntupalli Lakshmikant, A Gaiwak, P.D. Vyavahare, “Simulation Based Comparative
Performance Analysis of Adhoc Routing Protocols”, In proceedings of TENCON 2008.
[9] Chenna Reddy, P.; ChandraSekhar Reddy, P., “Performance Analysis of Adhoc Network Routing
Protocolsˮ, ISAUHC„06, International Symposium on Ad Hoc andUbiquitous Computing, vol.,
no., pp.186-187, 20-23 Dec. 2006.
[10] Kapang Lego, Pranav Kumar Singh, Dipankar Sutradhar, “Comparative Study of Adhoc Routing
Protocol AODV, DSR and DSDV in Mobile Adhoc NETwork”, Indian Journal of Computer
Science and Engineering Vol. 1 No. 4 364-371, 2011.
[11] Ginni Tonk, Indu Kashyap, S.S. Tyagi, “Performance Comparison of Ad-Hoc Network Routing
Protocols using NS-2”, International Journal of Innovative Technology and Exploring Engineering
(IJITEE)ISSN: 2278-3075,Volume- 1, Issue-1, June 2012.
[12] Li Layuan, Li Chunlin, Yaun Peiyan, “Performance evaluation and simulation of routing protocols
in ad hocnetworks”, Computer Communications 30 (2007) 1890- 1898.
[13] Vijayalaskhmi M. Avinash Patel, Linganagouda Kulkarni, “QoS Parameter Analysis on AODV
and DSDV Protocols in a Wireless Network”, International Journal of Communication Network
and Security, Volume-1, Issue-1, 2011.
[14] Deepak Kumar, Ashutosh Srivastava, S C Gupta, “Performance Comparison of DSDV and AODV
Routing Protocols in MANETS”, International Journal of Electronics Communication and
Computer Technology (IJECCT) Volume 2 Issue 3, May 2012.
[15] Jun-Zhao Sun, “Mobile Ad Hoc Networking: An Essential Technology for Pervasive Computing”,
Proceedings of International conference on info-tech and info-net, Vol-3, pp. 316-321, 2001.
11. International Journal of UbiComp (IJU), Vol.6, No.2, April 2015
11
[16] C.E. Perkins and E.M. Royer, “Ad-hoc On-Demand Distance Vector Routing”, Proceeding of 2nd
IEEE Workshop, Mobile Computing System Applications, pp:90-100, 1999
[17] Perkins, E. Belding-Royer, and S. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,
“draft-ietf-manet-aodv-13.txt, Feb. 2003
[18] S. A. Ade1& P.A.Tijare, “Performance Comparison of AODV, DSDV, OLSR and DSR Routing
Protocols in Mobile Ad Hoc Networks”, International Journal of Information Technology and
Knowledge Management July-December 2010, Volume 2, No. 2, pp. 545-548.
[19] J. Broch, D. Jhonson, and D. Maltz, “The dynamic source routing protocol for mobile adhoc
networks for IPv4”, IETF RFC 4728, Feb 2007
[20] I. Chakeres and C. Perkins, “Dynamic MANET On-Demand (DYMO) Routing”, IETF Internet-
Draft, draft-ietf-manet-dymo-23, Oct. 2012
[21] Charles E. Perkins and Pravin Bhagwat, “Highly dynamic destination-sequenced distance-vector
routing (DSDV) for mobile computers”, Technical report, IBM Research and University of
Maryland, USA, 1994.
[22] T. Clausen and P. Jacquet, “Optimized link State Routing protocol (OLSR)”, RFC-3626, IETF
Networking Group, 2003.
[23] Aleksandr Huhtonen, “Comparing AODV and OLSR routing protocols”, Helsinki University of
Technology, Telecommunication software and multimedia laboratory, 2004.
[24] Valentina Timcenko, Mirjana Stojanovic, Slavica Bostjancic Rakas (2009), “MANET Routing
Protocols vs. Mobility Models: Performance Analysis and Comparison”, Proceedings of the 9th
WSEAS International Conference on Applied Informatics and Communications (AIC '09).
[25] BonnMotion: A mobility scenario generation and analysis tool, Available at
http://sys.cs.uos.de/bonnmotion/
[26] http://masimum.inf.um.es/fjrm/development/
[27] Robins A.D, “GAWK: an effective AWK programming”, 3rd ed, April 2010.
[28] MATLAB: The language of Technical Computing, Available at http://www.mathworks.com/
[29] S.Corson and J.Macker, “Routing Protocol Performance Issues and Evaluation considerations”,
RFC2501, IETF Network Working Group, January 1999.
[30] The NS-3 reference manual, Available at http://www.nsnam.org/
Authors
Mohamed elboukhari received the DESA (diploma of high study) degree in numerical analysis, computer
science and treatment of signal in 2005 from the University of Science, Oujda, Morocco. He is currently
an assistant professor, department of Applied Engineering, ESTO, university Mohamed First, Oujda,
Morocco. His research interests include cryptography, quantum cryptography and wireless network
security, Mobile Ad Hoc Networks (MANETS).
Mostafa azizi received the diploma of engineer in automatic and computer industry in 1993 from school
Mohammadia of engineers, Rabat, Morocco and he received the Ph. D in computer science in 2001 from
the university Montreal, Canada. He is currently professor at university of Mohamed first, Oujda,
Morocco. His main interests include aspect of real time, embedded system, security and communication
and management of the computer systems in relation with process industry.
Abdelmalek azizi received the Ph. D in theory of numbers in 1993 from university Laval, Canada. He is
professor at department of mathematics in university Mohamed First, Oujda, Morocco. He is interesting
in history of mathematics in Morocco and in the application of the theory of number in cryptography.