Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self-administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction normalized routing load, average end to end delay by varying speed of nodes, traffic sources and mobility.
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...Eswar Publications
Ad hoc networks are collections of mobile nodes communicating with each other using wireless media without any fixed infrastructure. During both route discovery and traversal of route-reply packets from destination to source,
broadcast of packets is required which incurs huge message cost. The present article deals with the message cost
reduction during transmission of route-reply from destination to source. Also the redundancy that is visible within the 2-hop neighborhood of a node is minimized during broadcasting of route-reply. This improves the average lifetime of network nodes by decreasing the possibility of network partition. The scheme of 2NI can be used with any reactive routing protocol in MANETs.
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
On the routing overhead in infrastructureless multihop wireless networksNarendra Singh Yadav
Routing in infrastructureless multihop wireless networks is a challenging task and has received a vast amount of attention from researchers. This has lead to development of many different routing protocols each having their own superiorities and pitfalls making it very difficult to decide on a better protocol under vulnerable scenarios in such networks. In this paper the performance of three routing protocols (DSR, AODV and CBRP) in terms of routing overhead in bytes and in packets is presented under growing density and varying mobility in different traffic conditions. The simulation results show that CBRP outperforms both DSR and AODV in all scenarios.
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.
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...Eswar Publications
Ad hoc networks are collections of mobile nodes communicating with each other using wireless media without any fixed infrastructure. During both route discovery and traversal of route-reply packets from destination to source,
broadcast of packets is required which incurs huge message cost. The present article deals with the message cost
reduction during transmission of route-reply from destination to source. Also the redundancy that is visible within the 2-hop neighborhood of a node is minimized during broadcasting of route-reply. This improves the average lifetime of network nodes by decreasing the possibility of network partition. The scheme of 2NI can be used with any reactive routing protocol in MANETs.
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
On the routing overhead in infrastructureless multihop wireless networksNarendra Singh Yadav
Routing in infrastructureless multihop wireless networks is a challenging task and has received a vast amount of attention from researchers. This has lead to development of many different routing protocols each having their own superiorities and pitfalls making it very difficult to decide on a better protocol under vulnerable scenarios in such networks. In this paper the performance of three routing protocols (DSR, AODV and CBRP) in terms of routing overhead in bytes and in packets is presented under growing density and varying mobility in different traffic conditions. The simulation results show that CBRP outperforms both DSR and AODV in all scenarios.
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.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
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
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such
Networks are frequently limited by the network split due to either energy depletion or node mobility of the
mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths
becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path
breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric
system of measurement used to select the paths takes into account the stability of the nodes and the
equivalent links.
Optimized Link State Routing (OLSR) protocol is a proactive type of routing protocol that uses Multipoint
Relay (MPR) set as the virtual backbone structure. The existing literature has identified various issues with
respect to its backbone structure and has accordingly proposed improvements. In this paper, the focus is on
improving the OLSR protocol by employing a Connected Dominating Set (CDS) based virtual backbone
structure that is dynamically adaptable to rapid topology changes. A new Dynamically Adaptable Improved
Optimized Link State Routing (DA-IOLSR) protocol is proposed that uses the local topology information to
adapt the virtual backbone to topology changes. This assumes significance especially in networks that
experience very high mobility. Changes in the network topology caused by node additions, node deletions
and node mobility are taken care of. Simulations are carried out to assess the performance of DA-IOLSR
protocol and OLSR protocol. Packet delivery achieved by both the protocols is examined under varying
mobility by using various combinations of node speed and pause time values. It is found that DA-IOLSR
protocol provides better packet delivery as compared to OLSR protocol, under varying mobility conditions.
Quality of service Routing Using Stable Nodes in Mobile Ad hoc Networksijceronline
An efficient and secured routing protocol design is the vital concern for mobile ad hoc networks in view of major problems raising on security issues and loss of the network resources is due to changes within the connections of the network like Node failures, link breakages in the network. Our proposed scheme enhances the secured and reliable transmission of data, which also improves the network constancy, efficient packet delivery ratio and network life time by integrating through the AODV Routing protocol. It unites the authentication, stable routes and signal strength of the nodes to attain the secure and reliable transmission of data through nodes.
Analysis of FSR, LANMAR and DYMO under MANETidescitation
A movable ad hoc system (MANET) is a self-configuring communications set of
connections of mobile procedure associated by wireless. Each mechanism in a MANET is
free to move independently in some way, and will therefore modify its relations to other
devices frequently [2]. The primary purpose of any ad-hoc network routing protocol is to
meet the challenges of the dynamically changing topology and establish an efficient route
connecting every two nodes. In this paper three protocols FSR, LANMAR and DYMO are
compared by using random waypoint mobility in few nodes with varying packet sizes in
CBR traffic. The parameters or metrics are used to assess the performance of protocols with
and without Black Hole attack, that are data Packet Delivery ratio and Average Jitter with
varying data traffic CBR (Constant Bit Ratio) using Qual Net 5.0.2 simulator.
Improved aodv based on energy strength and dropping ratioIJLT EMAS
Wireless Sensor Networks are the latest trends in the
market due to the demand for communication and networking
among the wireless network devices. The routing protocols are
used in the Wireless Sensor Networks for efficient
communication of data between sensor nodes. The designs of
routing protocols in Wireless Sensor Networks are very concern
because they are influenced by many challenging factors. To
design the networks, the factors needed to be considered are the
coverage area, mobility, energy power consumption,
communication capabilities etc.. Broadcasting is an inevitable
operation in the route discovery phase of AODV protocol. A
probability based AODV is proposed, it uses nodes remaining
energy and threshold random delay to generate the
rebroadcasting of route request packet. The route request packet
of AODV is modified to gather nodes remaining energy strength.
The performance of probability based AODV is compared with
AODV over packet delivery fraction, normalized routing
overhead, delay and average acquisition latency.
NS-2 based simulator is used to evaluate the performance of
routing protocol.
Performance Comparison of AODV, DSR and LAR1 in Mobile Ad-hoc Network based o...IOSR Journals
Abstract: In the last couple of years, the use of wireless networks has become more and more popular. A
MANET is a collection of self-organizing mobile nodes which is infrastructure less, autonomous, and standalone
networks. Each node in a MANET is free to move independently in any direction and will therefore change its
links to other devices frequently. Each must forward traffic unrelated to its own use and therefore be a router.
Simulation result has been obtained by a performance comparison of three routing protocols i.e. Ad hoc Ondemand
Distance Vector (AODV), Dynamic Source Routing (DSR), Location Aided Routing (LAR1) against
Simulation time. The Result is obtained using QualNet simulator version 6.1. Different protocols are evaluated
based on measures such as Average End to End delay (s), Average Jitter(s), and Packet delivery ratio.
Keywords: MANET, AODV, DSR, LAR1, QualNet 6.1
Mobile ad-hoc networks (MANETs) are particular type of networks in which the nodes mobility is quite high. No node can join or leave to the network any time as there is no centralized control and static infrastructure in MANETs. All nodes are considered to be equal in processing power. ant colony optimization basics
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
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.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
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
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such
Networks are frequently limited by the network split due to either energy depletion or node mobility of the
mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths
becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path
breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric
system of measurement used to select the paths takes into account the stability of the nodes and the
equivalent links.
Optimized Link State Routing (OLSR) protocol is a proactive type of routing protocol that uses Multipoint
Relay (MPR) set as the virtual backbone structure. The existing literature has identified various issues with
respect to its backbone structure and has accordingly proposed improvements. In this paper, the focus is on
improving the OLSR protocol by employing a Connected Dominating Set (CDS) based virtual backbone
structure that is dynamically adaptable to rapid topology changes. A new Dynamically Adaptable Improved
Optimized Link State Routing (DA-IOLSR) protocol is proposed that uses the local topology information to
adapt the virtual backbone to topology changes. This assumes significance especially in networks that
experience very high mobility. Changes in the network topology caused by node additions, node deletions
and node mobility are taken care of. Simulations are carried out to assess the performance of DA-IOLSR
protocol and OLSR protocol. Packet delivery achieved by both the protocols is examined under varying
mobility by using various combinations of node speed and pause time values. It is found that DA-IOLSR
protocol provides better packet delivery as compared to OLSR protocol, under varying mobility conditions.
Quality of service Routing Using Stable Nodes in Mobile Ad hoc Networksijceronline
An efficient and secured routing protocol design is the vital concern for mobile ad hoc networks in view of major problems raising on security issues and loss of the network resources is due to changes within the connections of the network like Node failures, link breakages in the network. Our proposed scheme enhances the secured and reliable transmission of data, which also improves the network constancy, efficient packet delivery ratio and network life time by integrating through the AODV Routing protocol. It unites the authentication, stable routes and signal strength of the nodes to attain the secure and reliable transmission of data through nodes.
Analysis of FSR, LANMAR and DYMO under MANETidescitation
A movable ad hoc system (MANET) is a self-configuring communications set of
connections of mobile procedure associated by wireless. Each mechanism in a MANET is
free to move independently in some way, and will therefore modify its relations to other
devices frequently [2]. The primary purpose of any ad-hoc network routing protocol is to
meet the challenges of the dynamically changing topology and establish an efficient route
connecting every two nodes. In this paper three protocols FSR, LANMAR and DYMO are
compared by using random waypoint mobility in few nodes with varying packet sizes in
CBR traffic. The parameters or metrics are used to assess the performance of protocols with
and without Black Hole attack, that are data Packet Delivery ratio and Average Jitter with
varying data traffic CBR (Constant Bit Ratio) using Qual Net 5.0.2 simulator.
Improved aodv based on energy strength and dropping ratioIJLT EMAS
Wireless Sensor Networks are the latest trends in the
market due to the demand for communication and networking
among the wireless network devices. The routing protocols are
used in the Wireless Sensor Networks for efficient
communication of data between sensor nodes. The designs of
routing protocols in Wireless Sensor Networks are very concern
because they are influenced by many challenging factors. To
design the networks, the factors needed to be considered are the
coverage area, mobility, energy power consumption,
communication capabilities etc.. Broadcasting is an inevitable
operation in the route discovery phase of AODV protocol. A
probability based AODV is proposed, it uses nodes remaining
energy and threshold random delay to generate the
rebroadcasting of route request packet. The route request packet
of AODV is modified to gather nodes remaining energy strength.
The performance of probability based AODV is compared with
AODV over packet delivery fraction, normalized routing
overhead, delay and average acquisition latency.
NS-2 based simulator is used to evaluate the performance of
routing protocol.
Performance Comparison of AODV, DSR and LAR1 in Mobile Ad-hoc Network based o...IOSR Journals
Abstract: In the last couple of years, the use of wireless networks has become more and more popular. A
MANET is a collection of self-organizing mobile nodes which is infrastructure less, autonomous, and standalone
networks. Each node in a MANET is free to move independently in any direction and will therefore change its
links to other devices frequently. Each must forward traffic unrelated to its own use and therefore be a router.
Simulation result has been obtained by a performance comparison of three routing protocols i.e. Ad hoc Ondemand
Distance Vector (AODV), Dynamic Source Routing (DSR), Location Aided Routing (LAR1) against
Simulation time. The Result is obtained using QualNet simulator version 6.1. Different protocols are evaluated
based on measures such as Average End to End delay (s), Average Jitter(s), and Packet delivery ratio.
Keywords: MANET, AODV, DSR, LAR1, QualNet 6.1
Mobile ad-hoc networks (MANETs) are particular type of networks in which the nodes mobility is quite high. No node can join or leave to the network any time as there is no centralized control and static infrastructure in MANETs. All nodes are considered to be equal in processing power. ant colony optimization basics
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
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.
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such Networks are frequently limited by the network split due to either energy depletion or node mobility of the mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric system of measurement used to select the paths takes into account the stability of the nodes and the equivalent links.
PERFORMANCE ESTIMATION OF ADHOC ROUTING PROTOCOLS WITH NS2 SIMULATORIAEME Publication
A mobile adhoc network is a collection of wireless mobile nodes dynamically creating a temporary network without usage of any prevailing network infrastructure or consolidated management. Several routing protocols like Dynamic Source Routing (DSR), Adhoc On-Demand Distance Vector Routing (AODV) and Destination Sequenced Distance-Vector (DSDV) have been implemented. In this paper, an attempt has been made to compare the performance of two prominent on-demand reactive routing protocols for mobile ad hoc networks: DSR and AODV, along with the traditional proactive DSDV protocol. A simulation model with MAC and physical layer models is used to study interlayer interactions and their performance inferences. The On-demand protocols, AODV and DSR perform better than the table-driven DSDV protocol. Although DSR and AODV share similar on-demand performance, the differences in the protocol mechanics can lead to significant performance differentials. A variation of workload and scenarios, as characterized by mobility, load and size of the ad hoc network were simulated. The performance analysis is evaluated by means of varying network load, mobility, and network size. These simulations are conceded out based on the Rice Monarch Project that has made considerable additions to the NS-2 network simulator to track adhoc simulations
PERFORMANCE ESTIMATION OF ADHOC ROUTING PROTOCOLS WITH NS2 SIMULATORIAEME Publication
A mobile adhoc network is a collection of wireless mobile nodes dynamically creating a temporary network without usage of any prevailing network infrastructure or consolidated management. Several routing protocols like Dynamic Source Routing (DSR), Adhoc On-Demand Distance Vector Routing (AODV) and Destination Sequenced Distance-Vector (DSDV) have been implemented. In this paper, an attempt has been made to compare the performance of two prominent on-demand reactive routing protocols for mobile ad hoc networks: DSR and AODV, along with the traditional proactive DSDV protocol. A simulation model with MAC and physical layer models is used to study interlayer interactions and their performance inferences. The On-demand protocols, AODV and DSR perform better than the table-driven DSDV protocol. Although DSR and AODV share similar on-demand performance, the differences in the protocol mechanics can lead to significant performance differentials. A variation of workload and scenarios, as characterized by mobility, load and size of the ad hoc network were simulated. The performance analysis is evaluated by means of varying network load, mobility, and network size. These simulations are conceded out based on the Rice Monarch Project that has made considerable additions to the NS-2 network simulator to track adhoc simulations
The Effects of Speed on the Performance of Routing Protocols in Mobile Ad-hoc...Narendra Singh Yadav
Mobile 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. Researchers have conducted many simulations comparing the performance of these routing protocols under various conditions and constraints. One question that arises is whether speed of nodes affects the relative performance of routing protocols being studied. This paper addresses the question by simulating two 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 speed.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
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.
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 multi path 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.
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
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.
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
MANET is a cooperative wireless network in which mobile nodes are responsible for routing and
forwarding packets from and to other nodes. Noncooperation is a challenge that definitely degrades the
performance of MANET. A misbehaving or selfish node may make use of other nodes in the network, but
decline to share its own resources with them. These selfish nodes may severely affect the performance of
routing protocols in MANET.
In this paper, we compare the performance of four routing protocols under security attack of node
misbehavior in MANET. We investigate AODV and DSR reactive routing protocols and OLSR and GRP
proactive routing protocols using Riverbed Modeler simulator. The performance comparison is carried out
using two types of misbehaving nodes. The metrics used are End-to-End delay, Packet Delivery Ratio, Data
dropped and the Load. The experimental results show that AODV routing protocol performs better than the
other routing protocols with higher packet delivery ratio. Further, OLSR routing protocol outperforms the
other routing protocols with minimum End-to-End delay.
Similar to Performance Evaluation and Comparison of Ad-Hoc Source Routing Protocols (20)
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
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.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Search and Society: Reimagining Information Access for Radical FuturesBhaskar Mitra
The field of Information retrieval (IR) is currently undergoing a transformative shift, at least partly due to the emerging applications of generative AI to information access. In this talk, we will deliberate on the sociotechnical implications of generative AI for information access. We will argue that there is both a critical necessity and an exciting opportunity for the IR community to re-center our research agendas on societal needs while dismantling the artificial separation between the work on fairness, accountability, transparency, and ethics in IR and the rest of IR research. Instead of adopting a reactionary strategy of trying to mitigate potential social harms from emerging technologies, the community should aim to proactively set the research agenda for the kinds of systems we should build inspired by diverse explicitly stated sociotechnical imaginaries. The sociotechnical imaginaries that underpin the design and development of information access technologies needs to be explicitly articulated, and we need to develop theories of change in context of these diverse perspectives. Our guiding future imaginaries must be informed by other academic fields, such as democratic theory and critical theory, and should be co-developed with social science scholars, legal scholars, civil rights and social justice activists, and artists, among others.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Performance Evaluation and Comparison of Ad-Hoc Source Routing Protocols
1. THE PROCEEDINGS OF IEEE SPONSORED INTERNATIONAL CONFERENCE RASIET-07
IET ALWAR (RAJ) 22nd
– 23rd
DEC 07. RASIET 07/COMPUTING
166
Performance Evaluation and Comparison of Ad-Hoc
Source Routing Protocols
Narendra Singh Yadav* R.P.Yadav**
Abstract
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop
wireless links and capable of operating without any fixed infrastructure support. In order to
facilitate communication within such self-creating, self-organizing and self-administrating
network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network
routing protocol is to discover and establish a correct and efficient route between a pair of nodes
so that messages may be delivered in a timely manner. Route construction should be done with a
minimum of overhead and bandwidth consumption. This paper examines two routing protocols,
both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR),
an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture
based and evaluates both routing protocols in terms of packet delivery fraction normalized
routing load, average end to end delay by varying speed of nodes, traffic sources and mobility.
Keywords: Mobile ad hoc networks; Routing protocols; Dynamic source routing; Cluster based
routing protocol; Simulation; Performance evaluation
1. Introduction
Mobile ad hoc networks are formed by
autonomous system of mobile nodes that
utilize multi-hop radio relaying and connected
by wireless links without any preexisting
communication infrastructure or centralized
administration. Such networks are also known
as infrastructure less or multi-hop wireless
networks.
Communication is directly between nodes or
through intermediate nodes acting as routers.
Such network requires each mobile host to be
*Asst prof. Department of Electronics &
Communication Engineering
narensinghyadav@yahoo.com
** Dr. R.P. Yadav, Malaviya National Institute of
Technology, Jaipur,
rp_yadav@yahoo.com
more intelligent so that it can perform both
functions of transmitting and receiving of data
as a host and of forwarding packets for other
mobile host as a router. The advantages of such
a network are rapid deployment, robustness,
flexibility and inherent support for mobility.
Ad hoc networks, due to their quick and
economically less demanding deployment, find
applications in military operations,
collaborative and distributed computing,
emergency operations, wireless mesh networks,
wireless sensor networks and hybrid networks.
Due to dynamic topology, lack of fixed
infrastructure and frequent link failure the
traditional routing for wired networks cannot
be directly applied to mobile ad hoc networks
because wired routing methods assume the
network to be stable and routing overhead to be
almost negligible. They either lack the ability
to adapt to the dynamic topology change of
mobile ad hoc networks or may cause large
2. THE PROCEEDINGS OF IEEE SPONSORED INTERNATIONAL CONFERENCE RASIET-07
IET ALWAR (RAJ) 22nd
– 23rd
DEC 07. RASIET 07/COMPUTING
167
overhead that degrades network performance.
Therefore, routing is the most studied problem
in mobile ad hoc networks and a number of
routing protocols have been proposed [1-13],
derived from either distance-vector [14] or
link-state [15] based on classical routing
algorithms.
Routing protocols for Mobile ad hoc networks
can be classified into two main categories:
Proactive or table driven routing protocols and
Reactive or on-demand routing protocols. In
proactive protocols, every node maintains the
network topology information in the form of
routing tables by periodically exchanging
routing information. They include the
Destination Sequenced Distance Vector
(DSDV) [2], the Wireless Routing Protocol
(WRP) [3], Source-Tree Adaptive Routing
(STAR) [5] and Cluster-head Gateway Switch
Routing protocol (CGSR) [4]. On the other
hand, reactive protocols obtain routes only on
demand, which include the Dynamic Source
Routing (DSR) protocol [6], the Ad hoc On-
demand Distance Vector (AODV) protocol [7],
the Temporally Ordered Routing Algorithm
(TORA) [8], and the Associativity Based
Routing (ABR) protocol [10].
A crucial issue for mobile ad hoc networks is
the handling of a large number of nodes. As
more nodes join a mobile ad hoc network,
contention is more likely and the open nature
of a mobile ad hoc network makes it important
that a network continues to operate even if
there are more nodes involved Most of the
previous work [16-23] is limited on performing
simulations for ad hoc networks with a limited
number of nodes (50-100 nodes) deployed in
small geographical areas. The main reason is
that simulations with many nodes, spread in a
large area, need too much time to be completed
using common simulators such as ns-2.
Nowadays, the ad hoc network technology
becomes more and more popular and, as a
result, large-scale ad hoc networks may be
deployed in battlefields, regions of disaster and
large towns.
The rest of the paper is organized as follows:
Section II provides an overview of the routing
protocols used in the study. The simulation
environment and performance metrics are
described in Section III and then the results are
presented in Section IV. Finally Section V
concludes the paper.
2. Overview Of DSR And CBRP
As each protocol has its own merits and
demerits, none of them can be claimed as
absolutely better than others. Two mobile ad
hoc routing protocols – the Dynamic Source
Routing (DSR), the flat architecture based On-
Demand source routing protocol and the
Cluster Based Routing Protocol (CBRP), the
cluster architecture based On-Demand source
routing protocol are selected for study.
Dynamic Source Routing protocol (DSR)
The Dynamic Source Routing Protocol [15] is
an on-demand routing protocol designed to
restrict the bandwidth consumed by control
packets by eliminating the periodic table-
update messages required in the table-driven
approach. It is beacon-less and hence does not
require periodic hello packet transmissions,
which are used by a node to inform its
neighbors of its presence. The key
distinguishing feature of DSR is the use of
source routing. That is, the sender knows the
complete hop-by-hop route to the destination.
These routes are stored in a route cache. The
data packets carry the source route in the
packet header.
When a node in the ad hoc network attempts to
send a data packet to a destination for which it
does not already know the route, it uses a route
discovery process to dynamically determine
such a route. Route discovery works by
3. THE PROCEEDINGS OF IEEE SPONSORED INTERNATIONAL CONFERENCE RASIET-07
IET ALWAR (RAJ) 22nd
– 23rd
DEC 07. RASIET 07/COMPUTING
168
flooding the network with route request
(RREQ) packets. Each node receiving an
RREQ rebroadcasts it, unless it is the
destination or it has a route to the destination in
its route cache. Such a node replies to the
RREQ with a route reply (RREP) packet that is
routed back to the original source. RREQ and
RREP packets are also source routed. The
RREQ builds up the path traversed across the
network. The RREP routes back to the source
by traversing this path backward. The route
carried back by the RREP packet is cached at
the source for future use. If any link on a
source route is broken, the source node is
notified using a route error (RERR) packet.
The source removes any route using this link
from its cache. A new route discovery process
must be initiated by the source if this route is
still needed. DSR makes very aggressive use of
source routing and route caching. No special
mechanism to detect routing loops is needed.
Also, any forwarding node caches the source
route in a packet it forwards for possible future
use.
Cluster Based Routing Protocol (CBRP)
In CBRP [16] the nodes of a wireless network
are divided into clusters. The diameter of a
cluster is only two hops and clusters can be
disjoint or overlapping. Each cluster elects one
node as the clusterhead, responsible for the
routing process. The head of a cluster knows
the addresses of its members. Clusterheads
communicate with each other through gateway
nodes. A gateway is a node that has two or
more clusterheads as its neighbors when the
clusters are overlapping or at least one
clusterhead and another gateway node when
the clusters are disjoint.
The routing process works in two steps. First, it
discovers a route from a source node S to a
destination node D, afterwards it routes the
packets. When a source has to send data to
destination, it floods route request packets (but
only to the neighboring cluster-heads). On
receiving the request a cluster head checks to
see if the destination is in its cluster. If yes,
then it sends the request directly to the
destination else it sends it to all its adjacent
cluster-heads. The cluster-heads address is
recorded in the packet so a cluster-head
discards a request packet that it has already
seen. When the destination receives the request
packet, it replies back with the route that had
been recorded in the request packet. If the
source does not receive a reply within a time
period, it backs off exponentially before trying
to send route request again. In CBRP, routing
is done using source routing. It also uses route
shortening that is on receiving a source route
packet, the node tries to find the farthest node
in the route that is its neighbor and sends the
packet to that node thus reducing the route.
While forwarding the packet if a node detects a
broken link it sends back an error message to
the source and then uses local repair
mechanism.
3. Simulation and Performance
Metrics
A. Simulation model
Network Simulator2 (NS-2) [26] a object-
oriented, discrete event driven network
simulator developed at UC Berkely written in
C++ and OTcl, particularly popular in the ad
hoc networking research community is used for
the simulations. The traffic sources are CBR
(continuous bit – rate). The source-destination
pairs are spread randomly over the network.
The node movement generator of ns-2 is used
to generate node movement scenarios. The
movement generator takes the number of
nodes, pause time, maximum speed, field
configuration and simulation time as input
parameters. The propagation model is the Two
way ground model [27]. Each data point in the
following figures is the average of 5 runs each
lasting for 300s of the simulated time with the
4. THE PROCEEDINGS OF IEEE SPONSORED INTERNATIONAL CONFERENCE RASIET-07
IET ALWAR (RAJ) 22nd
– 23rd
DEC 07. RASIET 07/COMPUTING
169
same scenario configuration but different
random seeds.
Performance metrics
In order to compare the performance of cluster
architecture based, CBRP and flat architecture
based, DSR this paper focus on the following
performance metrics for evaluation:
Packet Delivery Fraction: The ratio of the data
packets delivered to the destinations to those
generated by the sources.
Average end-to-end delay: This includes all
possible delays caused by buffering during
route discovery latency, queuing at the
interface queue, retransmission delays at the
MAC, and propagation and transfer times.
Normalized routing load: The number of
routing packets transmitted per data packet
delivered at the destination.
results
The simulation results are shown in the
following section in the form of line graphs.
Graphs show comparison between the two
protocols on the basis of the above-mentioned
metrics as a function of node density in high
mobility (pause time = 0s) and stationary
(pause time = 300s) scenarios with 30%, 70%
traffic sources.
Packet delivery fraction
Fig.1 shows the packet delivery fraction as a
function of both speed and different number of
traffic sources. Each graph shows the PDF of
both the protocols, DSR and CBRP, in a high
mobility (pause time = 0s) and stationary
(pause time = 300s) scenarios.
0
10
20
30
40
50
60
70
80
5 10 15 20 25
Speed (m/s)
Packetdeliveryfraction(%)
DSR, p = 0s CBRP, p = 0s
DSR, p = 300s CBRP, p = 300s
(a) 30% sources
0
5
10
15
20
25
30
35
40
45
5 10 15 20 25
Speed (m/s)
Packetdeliveryfraction(%)
DSR, p = 0s CBRP, p = 0s
DSR, p = 300s CBRP, p = 300s
(b) 70% sources
Figure1. Packet delivery fraction as a function of
speed and 30%, 70% traffic sources.
In high mobility (p = 0s) scenarios, the packet
delivery fraction of DSR improves up to S = 10
m/s after that PDF degrades from 64.05% at S
= 10 to 25.85% at S = 25 m/s. as the speed of
nodes increases. The PDF is maximum at S =
10 m/s for DSR. In CBRP packet delivery
improves from 62.77% at S = 5 to 69.83% at S
= 15 m/s after that PDF degrades as the speed
increases. CBRP depicts maximum PDF
(69.83%) at S = 15 m/s. In static scenarios (p =
300s) with 30% CBR sources, DSR performs
better than CBRP.
However in stationary (p = 300s) scenarios
with 70% CBR sources, both the protocols
have nearly the same PDF. However this is not
true for high mobility (p = 0s) scenarios. In
high mobility scenarios CBRP performs better
than DSR and with S = 10 or more CBRP
clearly outperforms DSR at a factor of ~ 2.
DSR has a lower PDF than CBRP in high
mobility (0s pause time) scenarios and more or
less same PDF in stationary (300s pause time)
scenarios. The PDF due to 30% traffic sources
is better than that due to 70% traffic sources.
The performance degradation in PDF is due to
packet drops by the routing algorithm after
being failed to transfer data in the active routes.
The packet drops are due to network
partitioning, link break, collision and
congestion in the ad hoc network
5. THE PROCEEDINGS OF IEEE SPONSORED INTERNATIONAL CONFERENCE RASIET-07
IET ALWAR (RAJ) 22nd
– 23rd
DEC 07. RASIET 07/COMPUTING
170
Average end to end delay Fig. 2 shows the
average end to end delay of both the protocols,
DSR and CBRP, as a function of both nodes
speed- 5, 10, 15, 20 and 25 m/s and different
number of traffic sources- 30% and 70% CBR
sources. Each chart shows average end-to-end
delay of both the protocols in a high mobility
(p = 0s) and a stationary (p = 300s) scenarios
(a) 30% sources
0
1
2
3
4
5
6
7
8
9
5 10 15 20 25
Speed (m/s)
Averageendtoenddelay
DSR, p = 0s CBRP, p = 0s
DSR, p = 300s CBRP, p = 300s
(b) 70% sources
Figure2. Average end-to-end delay as a function of
speed and 30%, 70% traffic sources.
In high mobility (p = 0s) scenarios with 30%
CBR traffic sources, average end to end delay
for DSR is more than CBRP up to S = 10 m/s.
At speed equal to 15 m/s both the protocols
have nearly comparable PDF after the DSR
performs better than CBRP. For stationary (p =
300s) scenarios, average end-to-end delay is
less than 4s for both the protocols except at S =
15 where DSR performs better than CBRP.
In high mobility (p = 0s) scenarios with 70%
traffic sources, both the protocols have nearly
same average end to end delay up to S = 15 m/s
after that the average delay for DSR decreases
where as the average delay for CBRP
increases. In stationary (p = 300s), CBRP
performs better than DSR at all speeds except
at 20 m/s where both protocols have same
delay.
Normalized routing load
Fig. 3 shows the normalized routing load as a
function of both nodes density and different
number of traffic sources. Each graph shows
the normalized routing load of both the
protocols, DSR and CBRP, in a high mobility
(pause time = 0s) and stationary (pause time =
300s) scenarios.
0
5
10
15
20
25
5 10 15 20 25
Speed (m/s)
Normalizedroutingload
DSR, p = 0s CBRP, p = 0s
DSR, p = 300s CBRP, p = 300s
(a) 30% sources
0
10
20
30
40
50
60
70
5 10 15 20 25
Speed (m/s)
Normalizedroutingload
DSR, p = 0s CBRP, p = 0s
DSR, p = 300s CBRP, p = 300s
(b) 70% sources
Figure3. Normalized routing load as a function of 5,
10, 15, 20, 25 m/s and 30%, 70% traffic sources.
In high mobility (p = 0s) with 30% traffic
sources, both the protocols have nearly same
NRL at S = 5 m/s but as the speed of node
increases, the NRL for DSR grows and at S =
25 m/s NRL is about 24. CBRP exhibits less
NRL than DSR for all speeds and it is well
below 2. In static (p = 300s) scenarios both the
protocols show nearly comparable NRL (well
below 2).
4. Conclusions
This paper compared the performance of DSR
and CBRP, two on-demand source routing
protocols for ad hoc wireless networks. DSR
and CBRP both use on-demand route
discovery, but with different flooding behavior.
In particular, DSR use network-wide flooding
0
1
2
3
4
5
6
7
5 10 15 20 25
Speed (m/s)
Averageendtoenddelay
DSR, p = 0s CBRP, p = 0s
DSR, p = 300s CBRP, p = 300s
6. THE PROCEEDINGS OF IEEE SPONSORED INTERNATIONAL CONFERENCE RASIET-07
IET ALWAR (RAJ) 22nd
– 23rd
DEC 07. RASIET 07/COMPUTING
171
for route discovery and does not depend on any
periodic hello message or timer-based
activities. CBRP, on the other hand, only
broadcasts route requests to cluster heads,
largely reducing the network traffic. Hello
messages are the integral part of CBRP and the
size of a hello message may be large as it
contains the neighbor table and cluster
adjacency table of the sender. As a result, while
CBRP uses hello messages to establish clusters
and in turn reduce the flood in route discovery,
the hello message itself is another kind of
overhead. The general observation from the
simulation is that in static scenarios, due to
similar performance any, either DSR or CBRP,
can be used in large ad hoc wireless networks
but in high mobility scenarios, CBRP
outperforms DSR.
References
1. E. M. Royer and C. K. Toh, “A review of current
routing protocols for ad hoc mobile wireless
networks,” IEEE Personal Communications
magazine, April 1999, pp. 46–55.
2. C. E. Perkins and P. Bhagwat, “Highly Dynamic
Destination-Sequenced Distance-Vector Routing
(DSDV) for Mobile Computers,” in Proceedings of
ACM SIGCOMM 1994, August 1994, pp. 234-244.
3. S. Murhty and J. J. Garcia-Luna-Aceves, “An
Efficient Routing Protocol for Wireless Networks,”
ACM Mobile Networks and Applications Journal,
Special Issue on Routing in Mobile Communication
Networks, Vol. 1, no. 2, October 1996, pp. 183-197.
4. C. C. Chiang, H. K. Wu, W. Liu and M. Gerla,
“Routing in Clustered Multi-Hop Mobile Wireless
Networks with Fading Channel,” in Proceedings of
IEEE SICON 1997, April 1997, pp. 197-211.
5. J. J. Garcia-Luna-Aceves and M. Spohn, “Source-
Tree Routing in Wireless Networks,” in Proceedings
of IEEE ICNP 1999, October 1999, pp. 273-282.
6. D. B. Johnson and D. A. Malta, “Dynamic Source
Routing in Ad Hoc Wireless Networks,” Mobile
Computing, Kluwer Academic Publishers, vol. 353,
1996, pp. 153-181.
7. C. E. Perkins and E. M. Royer, “Ad Hoc On-
Demand Distance Vector Routing,” Proceedings of
IEEE Workshop on Mobile Computing Systems and
Applications 1999, February 1999, pp. 90-100.
8. V. D. Park and M. S. Corson, “A Highly Adaptive
Distributed Routing Algorithm for Mobile Wireless
Networks,” in Proceedings of IEEE INFOCOM
1997, April 1997, pp. 1405-1413.
9. Y. Ko and N. H. Vaidya, “Location-Aided Routing
(LAR) in Mobile Ad Hoc Networks,” in Proceedings
of ACM MOBICOM 1998, October 1998, pp. 66-75.
10. C. K. Toh, “Associativity-Based Routing for Ad Hoc
Mobile Networks,” Wireless Personal
Communications, vol. 4, no. 2, March 1997, pp. 1-
36.
11. P. Sinha, R. Shivkumar and V. Bharghavan,
“CEDAR: A Core Extraction Distributed Ad Hoc
Routing Algorithm,” IEEE Journal on Selected
Areas in Communications, vol. 17, no. 8, August
1999, pp. 1454-1466.
12. Z. J. Haas, “The Routing Algorithm for the
Reconfigurable Wireless Networks,” in Proceedings
of ICUPC 1997, vol. 2, October 1997, pp. 562-566.
Dr. R.P.Yadav received M.Tech.
degree from Indian Institute of
Technology, Delhi, India in
Integrated Electronics and Circuits in
1987 and completed Ph.D in
Communication Engineering from
University of Rajasthan in 2001. He
is currently working as Professor &
Head, Department of Electronics and Communication
Engineering at Malaviya National Institute of
Technology, Jaipur, India. He is an active member of
various professional bodies and has organized many
workshops, conferences and seminars. His research
interests include MIMO and Ad hoc Networking,
Microstrip Antennas, coding and Digital Communication
Systems.
Narendra Singh Yadav received
M.Tech. degree in Computer
Science from Birla Institute of
Technology, Ranchi, India in 2002.
He is a Ph.D student at Malaviya
National Institute of Technology,
Jaipur, India. His research interests
include Clustering, Routing and
Security in ad hoc wireless networks, wireless sensor
networks and wireless hybrid networks.