This document summarizes a research paper that analyzes the impact of variable transmission range and scalability with respect to mobility and zone size on the Zone Routing Protocol (ZRP) for mobile ad hoc networks. The paper simulates ZRP performance under different transmission ranges, zone radii, node speeds and network sizes. Results show that packet delivery ratio increases with transmission range for 25 nodes but decreases for 50 nodes. Packet delivery also decreases with higher node mobility and is highest when the zone radius is maximum.
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.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
The Impact of Signal Strength over Routing Protocols in Wireless NetworksDr. Amarjeet Singh
In ad hoc routing protocols the source node
may need an intermediate nodes to transmit the packets into
the destination if the destination is not within transmission
range of the source. This paper studies the impact of signal
strength of nodes over ad hoc routing protocols and explains
an important effect of signal strength on ad hoc routing
protocols in four different directions including the routes and
the nodes. As a result the study give an important
improvement in ad hoc routing protocols when using signal
strength compared to other ad hoc routing protocols without
considering signal strength.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A 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).
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
As the network size increases the probability of congestion occurrence at nodes increases. This is
because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result
congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses.
In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce
end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector
routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing
(IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy
adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing
performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput
and packet delivery fraction
Routing in Networks using Genetic AlgorithmjournalBEEI
With the increase in traffic, internet service providers are trying their best to provide maximum utilization of resources available. The current traffic load has to be taken into account for computation of paths in routing protocols. Network applications; require the shortest paths to be used for communication purposes. Addressing the selection of path, from a known source to destination is the basic aim of this paper. This paper proposes a method of calculating the shortest path for a network using a combination of Open shortest path first and Genetic Algorithm (OSGA). Genetic Algorithm is used in this paper for optimization of routing. It helps in enhancing the performance of the routers.
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.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
The Impact of Signal Strength over Routing Protocols in Wireless NetworksDr. Amarjeet Singh
In ad hoc routing protocols the source node
may need an intermediate nodes to transmit the packets into
the destination if the destination is not within transmission
range of the source. This paper studies the impact of signal
strength of nodes over ad hoc routing protocols and explains
an important effect of signal strength on ad hoc routing
protocols in four different directions including the routes and
the nodes. As a result the study give an important
improvement in ad hoc routing protocols when using signal
strength compared to other ad hoc routing protocols without
considering signal strength.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A 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).
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
As the network size increases the probability of congestion occurrence at nodes increases. This is
because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result
congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses.
In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce
end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector
routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing
(IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy
adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing
performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput
and packet delivery fraction
Routing in Networks using Genetic AlgorithmjournalBEEI
With the increase in traffic, internet service providers are trying their best to provide maximum utilization of resources available. The current traffic load has to be taken into account for computation of paths in routing protocols. Network applications; require the shortest paths to be used for communication purposes. Addressing the selection of path, from a known source to destination is the basic aim of this paper. This paper proposes a method of calculating the shortest path for a network using a combination of Open shortest path first and Genetic Algorithm (OSGA). Genetic Algorithm is used in this paper for optimization of routing. It helps in enhancing the performance of the routers.
Long-Term Evolution (LTE), an emerging and promising fourth generation mobile technology, is expected
to offer ubiquitous broadband access to the mobile subscribers. In this paper, the performance of Frame
Level Scheduler (FLS), Exponential (EXP) rule, Logarithmic (LOG) rule and Maximum-Largest Weighted
Delay First (M-LWDF) packet scheduling algorithms has been studied in the downlink 3GPP LTE cellular
network. To this aim, a single cell with interference scenario has been considered. The performance
evaluation is made by varying the number of UEs ranging from 10 to 50 (Case 1) and user speed in the
range of [3, 120] km/h (Case 2). Results show that while the number of UEs and user speed increases, the
performance of the considered scheduling schemes degrades and in both case FLS outperforms other three
schemes in terms of several performance indexes such as average throughput, packet loss ratio (PLR),
packet delay and fairness index.
Packet delivery ratio, delay, throughput, routing overhead etc are the strict quality of service requirements
for applications in Ad hoc networks. So, the routing protocol not only finds a suitable path but also the path
should satisfy the QoS constraints also. Quality of services (QoS) aware routing is performed on the basis
of resource availability in the network and the flow of QoS requirement. In this paper we developed a
source routing protocol which satisfying the link bandwidth and end –to- end delay factor. Our protocol
will find multiple paths between the source and the destination, out of those one will be selected for data
transfer and others are reserve at the source node those can be used for route maintenance purpose. The
path selection is strictly based on the bandwidth and end-to-end delay in case two or more then two paths
are having the same values for QoS constraints then we will use hop as a parameter for path selection.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
The maximization of a networks lifetime is an important part of research in the present scenario. In ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper a novel approach is analyzed to improve the networks lifetime where the data transfer is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator and the simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks.
MMINIMUM RESOURCE CONSUMPTIONS ROUTING FOR OPTICAL NETWORKSprj_publication
The problem of determining primary and backup paths for survivable optical WDM
networks is considered. Results of various available routing techniques that try to minimize
the combined cost of primary and the backup path are analyzed for the effects on network
parameters such as mean load, variance of the load on route, number of converters required
by the route and the length of the route. The route cost is modelled such a way that it is
extensible to include any new parameter and vary their relative importance. The efficiency of
such wavelength routed networks has been proved to improve for certain parameters, such as
reduction in blocking probability and number of converters required for desired performance.
The routing is enhanced to analyse effect on network parameters for all node full range
converters, limited number full converters, reserved primary and back up wavelengths and
with no such reservation.
Fuzzy Controller Based Stable Routes with Lifetime Prediction in MANETsCSCJournals
In ad hoc networks, the nodes are dynamically and arbitrary located in a manner that the interconnections between nodes are changing frequently. Thus, designing an effective routing protocol is a critical issue. In this paper, we propose a fuzzy based routing method that selects the most stable route (FSRS) considering the number of intermediate nodes, packet queue occupancy, and internodes distances. Also it takes the produced cost of the selected route as an input to another fuzzy controller predicts its lifetime (FRLP), the evaluation of the proposed method is performed using OMNet++4.0 simulator in terms of packet delivery ratio, average end-to-end delay and normalized routing load.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Long-Term Evolution (LTE), an emerging and promising fourth generation mobile technology, is expected
to offer ubiquitous broadband access to the mobile subscribers. In this paper, the performance of Frame
Level Scheduler (FLS), Exponential (EXP) rule, Logarithmic (LOG) rule and Maximum-Largest Weighted
Delay First (M-LWDF) packet scheduling algorithms has been studied in the downlink 3GPP LTE cellular
network. To this aim, a single cell with interference scenario has been considered. The performance
evaluation is made by varying the number of UEs ranging from 10 to 50 (Case 1) and user speed in the
range of [3, 120] km/h (Case 2). Results show that while the number of UEs and user speed increases, the
performance of the considered scheduling schemes degrades and in both case FLS outperforms other three
schemes in terms of several performance indexes such as average throughput, packet loss ratio (PLR),
packet delay and fairness index.
Packet delivery ratio, delay, throughput, routing overhead etc are the strict quality of service requirements
for applications in Ad hoc networks. So, the routing protocol not only finds a suitable path but also the path
should satisfy the QoS constraints also. Quality of services (QoS) aware routing is performed on the basis
of resource availability in the network and the flow of QoS requirement. In this paper we developed a
source routing protocol which satisfying the link bandwidth and end –to- end delay factor. Our protocol
will find multiple paths between the source and the destination, out of those one will be selected for data
transfer and others are reserve at the source node those can be used for route maintenance purpose. The
path selection is strictly based on the bandwidth and end-to-end delay in case two or more then two paths
are having the same values for QoS constraints then we will use hop as a parameter for path selection.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
The maximization of a networks lifetime is an important part of research in the present scenario. In ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper a novel approach is analyzed to improve the networks lifetime where the data transfer is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator and the simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks.
MMINIMUM RESOURCE CONSUMPTIONS ROUTING FOR OPTICAL NETWORKSprj_publication
The problem of determining primary and backup paths for survivable optical WDM
networks is considered. Results of various available routing techniques that try to minimize
the combined cost of primary and the backup path are analyzed for the effects on network
parameters such as mean load, variance of the load on route, number of converters required
by the route and the length of the route. The route cost is modelled such a way that it is
extensible to include any new parameter and vary their relative importance. The efficiency of
such wavelength routed networks has been proved to improve for certain parameters, such as
reduction in blocking probability and number of converters required for desired performance.
The routing is enhanced to analyse effect on network parameters for all node full range
converters, limited number full converters, reserved primary and back up wavelengths and
with no such reservation.
Fuzzy Controller Based Stable Routes with Lifetime Prediction in MANETsCSCJournals
In ad hoc networks, the nodes are dynamically and arbitrary located in a manner that the interconnections between nodes are changing frequently. Thus, designing an effective routing protocol is a critical issue. In this paper, we propose a fuzzy based routing method that selects the most stable route (FSRS) considering the number of intermediate nodes, packet queue occupancy, and internodes distances. Also it takes the produced cost of the selected route as an input to another fuzzy controller predicts its lifetime (FRLP), the evaluation of the proposed method is performed using OMNet++4.0 simulator in terms of packet delivery ratio, average end-to-end delay and normalized routing load.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Changing the social advertsing setting on Linked In. Left checked, Linked In can use your phot and name in social advertising without further notification to you or specific consent.
Medical Events is a platform for promoting your current medical events & conferences. Avail the benefits of the updated information on current medical fairs, medical trade shows, upcoming medical trade events, global medical fairs, business healthcare trade shows, medical conferences and meetings, medical exhibitions & medical congress, medical expos, medical seminars.
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
Abstract : As the network size increases the probability of congestion occurrence at nodes increases. This is because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses. In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing (IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput and packet delivery fraction. Keywords- DSDV, Hybrid protocol, AODV, IAODV, MANET
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.
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.
Routing protocols for mobile ad-hoc networks have to
face the challenge of frequently changing topology, low
transmission power and asymmetric links. Both
proactive and reactive routing protocols prove to be
inefficient under these circumstances. The Zone Routing
Protocol (ZRP) combines the advantages of the proactive
and reactive approaches by maintaining an up-to-date
topological map of a zone centered on each node. Within
the zone, routes are immediately available. For
destinations outside the zone, ZRP employs a route
discovery procedure, which can benefit from the local
routing information of the zones.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
Performance comparison of mobile ad hoc network routing protocolsIJCNCJournal
Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust
dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find
optimized routes from source to the destination and prominent among them are Dynamic Source Routing
(DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV)
routing protocols. The performance comparison of these protocols should be considered as the primary
step towards the invention of a new routing protocol. This paper presents a performance comparison of
proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery
ratio, average end-to-end delay, throughput, jitter), normalized routing overhead and normalized MAC
overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility
speed, number of nodes and data rate. The comparison results show that AODV performs optimally well
not the best among all the studied protocols.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The present paper describes a novel Raspberry Pi and Arduino UNO architecture used as a meteorological station. One of the advantages of the proposed architecture is the huge quantity of sensors developed for its usage; practically one can find them for any application, and weather sensing is not an exception. The principle followed is to configure Raspberry as a collector for measures obtained from Arduino, transmitting occurs via USB; meanwhile, Raspberry broadcasts them via a web page. For such activity is possible thanks to Raspbian, a Linux-based operating system. It has a lot of libraries and resources available, among them Apache Web Server, that gives the possibility to host a web-page. On it, the user can observe temperature, humidity, solar radiance, and wind speed and direction. Information on the web-page is refreshed each five minute; however, measurements arrive at Raspberry every ten seconds. This low refreshment rate was determined because weather variables normally do not abruptly change. As an additional feature, system stores all information on the log file, this gives the possibility for future analysis and processing.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay. Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
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.
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.
Network Lifetime Analysis of Routing Protocols of Short Network in QualnetIOSR Journals
Abstract: A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with each other without using any existing infrastructure, access point or centralized administration. Mobile ad-hoc network have the attributes such as wireless connection, continuously changing topology, distributed operation and ease of deployment. In this paper we have compared the energy consumption of reactive, proactive & hybrid routing protocol AODV,DSR,RIP & ZRP by using different mobility model. We have analyzed the Network lifetime of protocols by varying pay load, mobility, pause time and type of traffic (CBR). A detailed simulation has been carried out in qualnet. The metrics used for performance analysis are energy consumed & battery consumption. It has been observed that RIP has better network lifetime than other.
Network Lifetime Analysis of Routing Protocols of Short Network in QualnetIOSR Journals
A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with
each other without using any existing infrastructure, access point or centralized administration. Mobile ad-hoc
network have the attributes such as wireless connection, continuously changing topology, distributed operation
and ease of deployment. In this paper we have compared the energy consumption of reactive, proactive &
hybrid routing protocol AODV,DSR,RIP & ZRP by using different mobility model. We have analyzed the
Network lifetime of protocols by varying pay load, mobility, pause time and type of traffic (CBR). A detailed
simulation has been carried out in qualnet. The metrics used for performance analysis are energy consumed &
battery consumption. It has been observed that RIP has better network lifetime than other
Similar to Impact of Variable Transmission Range and Scalability With Respect To Mobility and Zone Size on Zone Routing Protocol Over Manets (20)
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Impact of Variable Transmission Range and Scalability With Respect To Mobility and Zone Size on Zone Routing Protocol Over Manets
1. Jitender Grover et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 5, Sep-Oct 2013, pp.1639-1646
RESEARCH ARTICLE
www.ijera.com
OPEN ACCESS
Impact of Variable Transmission Range and Scalability With
Respect To Mobility and Zone Size On Zone Routing Protocol
Over Manets
Jitender Grover*, Parneet Kaur**
*(Assistant Professor, Computer Science & Engineering Department M. M. University, Sadopur, Ambala,
India)
** (M.Tech Student, Computer Science & Engineering Department M. M. University, Sadopur, Ambala, India)
ABSTRACT
A variety of protocols are used in ad hoc network but the most popular protocol one is Zone Routing Protocol
(ZRP). ZRP is a hybrid routing protocol. Transmission power affects the design and performance of all the
protocols in Mobile Ad hoc Networks (MANETs). Mobility of nodes and selection of Zone Size in ZRP are also
the major issues. In this paper, the impact of Transmission Ranges and Scalability by varying Mobility rate along
with Zone Radius on QoS based performance metrics has been analyzed. The environment has been simulated
using NS2.33 Simulator. The objective of our work is to analyze that at what speed and by taking how much
zone radius ZRP will be able to perform efficiently and effectively for Mobile Ad hoc Networks.
Keywords - MANETs, ZRP, QoS, Transmission Range.
I.
INTRODUCTION
Mobile Adhoc Network (MANET) is a self
created and self organised network. MANET refers to
a multi-hop packet-based wireless network composed
of a set of mobile nodes that can communicate and
move at the same time without using any kind of fixed
wired infrastructure [1]. MANETs are actually
adaptive networks that can be formed and deformed on
the fly without the need of any centralized
administration. In adhoc networks each and every node
works as router [2]. This exclusive characteristic
allows the use of MANETs in many particular civilian
and military situations as well as in the emerging
sensor networks technology. As other packet data
networks, one-to-one communication in MANET is
achieved by unicast routing for each single packet.
Routing in MANETs is challenging due to the
constraints existing on the transmission bandwidth,
battery power, CPU time and the requirement to cope
with frequent topological changes resulting from the
mobility of nodes. We argue that variable range
transmission control should underpin the design of
future wireless ad hoc networks, and not, commonrange transmission control. Power control affects the
performance of the network layer. A high transmission
power increases the connectivity of the network by
increasing the number of direct links seen by each
node but this is at the expense of reducing network
capacity. The type of power control used can also
impact the connectivity and performance of the
network layer. Choosing a higher transmission power
increases the connectivity of the network. In addition,
power control impacts the signalling overhead of
routing protocols used in mobile wireless ad hoc
networks. Higher transmission power decreases the
www.ijera.com
number of forwarding hops between source-destination
pairs, therefore reducing the signalling load necessary
to maintain routes when nodes are mobile. The
signalling overhead of routing protocols can consume a
significant percentage of the available resources at the
network layer, reducing the end user’s bandwidth and
power availability. The goal of QoS provisioning is to
achieve more deterministic network behaviours, so that
information carried by the network can be better
delivered and network resources can be better utilized.
The QoS parameters differ from application to
application for example in case of multimedia
application bandwidth, delay jitter and average delay
are the key QoS parameters [3]. In this paper, we have
analyzed the impact of an alternative approach and
make a case for variable-range transmission control
and scalability with Mobility speed and zone radius.
Scalability is a very important issue in routing
protocol. Because this is direct relate with routing
overhead.[4] The performance of routing protocol is
depend upon size of network, mobility speed,
transmission range and zone radius. In MANET
routing protocols are divided into three types:
Proactive Routing Protocol:
This approach is known as a table driven
routing, to guarantee that routing tables are up-to-date
and reflect the actual network topology, nodes running
a proactive protocol continuously exchange route
updates and recalculate paths to all possible
destinations. The main advantage of proactive
protocols is that a route is immediately available when
it is needed for data transmissions. However, if user
traffic is not generated, then resources are wasted due
to the proactive route update mechanism. Also,
1639 | P a g e
2. Jitender Grover et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 5, Sep-Oct 2013, pp.1639-1646
proactive protocols do not scale well to large networks
and do not converge if the mobility rate is high,
although differential route updates and variable update
rates may mitigate such limitations [5].
Reactive Routing Protocols:
A different approach in the design of a routing
protocol is to calculate a path only when it is necessary
for data transmissions. Protocols of this family are
dubbed reactive protocols or on ÿ demand routing
protocols. A reactive protocol is characterized by a
path discovery procedure and a maintenance
procedure. Path discovery is based upon a query-reply
cycle that adopts flooding of queries. The destination is
eventually reached by the query and at least one reply
is
generated. Path discovery is triggered
asynchronously on-demand when there is a need for
the transmission of a data packet and no path to the
destination is known by the source node. Discovered
paths are maintained by the route maintenance
procedure until they are no longer used. The main
advantage of reactive protocols is that if data traffic is
not generated by nodes, then the routing activity is
totally absent. The main drawback is the network-wide
path discovery required to obtain routing information.
Since discovery must be based on flooding, such a
procedure is very costly.
Hybrid Routing Protocol:
It combines the best features of proactive and
reactive protocols. The rest of the paper is organized as
follows: section II gives a brief description of related
works which help in improvement of the ZRP
performance. Section III explains overview of ZRP for
MANETs. Section IV presents simulation based
results, evaluation and performance comparison graphs
of our work. Finally, conclusion and future work are
presented in section V.
II.
RELATED WORK
Savita Gandhi et al in [6] compared the
performance of DSR, OLSR and ZRP in different
mobile scenario by random waypoint model and result
have conclude that average e2e delay, average jitter,
NRL is highest on ZRP than other protocol. Dinesh
Singh, Ashish K. Maurya et al in [7] examined the
performance differences of LANMAR, LAR1, DYMO
and ZRP routing protocol. A. Loutfi et al [8] Impact
the network size, traffic load & zone radius and result
show that radius zone of 3 is preferred & optimal value
compare to radius 2 when traffic load is important &
also experiment on IARP & IERP traffic with different
zone radius and different node density. Yuki Sato et al
[9] Introduction a EZRP in this less control packets are
send and nodes send control packet when nodes are
moving, and conclude that the control packet is
decrease so the waiting time is also decrease .The
delay is decreased and data transmission rate and
throughput are increased when the number of nodes is
increased.[10] Compare AODV, DYMO, ZRP, OLSR
www.ijera.com
www.ijera.com
on Qualnet 4.5 Developer and conclude that ZRP
demonstrates the best performance than the remaining
three routing protocols. Brijesh Patel et al. in [11]
proposed an analytical model that allows us to
determine the routing overhead incurred by the
scalable routing framework on ZRP. In order to make
ZRP adaptive, the mechanisms must be devised for
detecting the non-optimality of zone radius setting. In
addition to that, the cost-benefit analysis must be done
to understand the tradeoff involved between the
optimality detection cost and additional overhead cost
incurred due to non-optimality. S. Ramachandram [12]
Genetic Zone Routing Protocol(GZRP) was proposed
Modified Timer based caching technique to GZRP. Its
performance analysis is done using GloMoSim
(Version 2.03). improvement for GZRP with caching
over normal GZRP. Application of caching scheme
removes the stale routes and makes the search faster.
The delivery of packets is seen to a maximum of 40%
improvement for cached GZRP over GZRP with the
help of load balancing, fault tolerance and caching.
Rajneesh Kumar Gujral et al [13] Analyze that at what
speed and by taking how much zone radius ZRP will
be able to perform efficiently and effectively for
MANETs. Give a results that if the radius zone is small
then the nodes act as reactive protocol so if the zone is
less than the average delay is more. When the mobility
rate is less then throughput , packet delivery ratio is
maximum and if the mobility rate and zone size is
increase the control overhead is also increased.
Arivubrakan P. et al In [14] the performance of AODV
and DSDV routing protocols by varying transmission
range and simulation time has been analyzed. It is
observed that the transmission range as a system
parameter affects the overall energy consumption of
wireless ad hoc networks. Karthiga G et al[15] the
performance of transport layer protocols TCP and UDP
on AODV, DSDV, TORA and DSR routing protocols
in multicast environment by varying pause time with
50 nodes scenario has been simulated. The result
indicates that TCP is not appropriate transport protocol
for highly mobile multi hop networks and UDP is
preferred. Nicles Beijar in [16] discussed the problem
of routing in Ad hoc network and analyzed that ZRP
reduces traffic amount compared to pure proactive or
reactive routing. Yuanzhu Peter Chen et al. [17]
presented zone routing algorithm for finding weakly
connected dominating set and suggested clustering to
simplify routing. Sree Ranga Raju et al. [18]
considered protocols of AODV and DSR as a reference
for analyzing ZRP with QUALNET simulator. They
observed ZRP uses additional time as it uses IARP,
IERP by studying ZRP operation of route discovery.
They took different parameters for performance
analysis like end to end delay, packets received etc.
From the above analyzed survey, their result have
concluded that lot of work has been done on ZRP, but
no research work suggested us how well ZRP will
adapt in MANET with respect to nodes mobility, zone
size and scalability. So in this paper, we have analyzed
1640 | P a g e
3. Jitender Grover et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 5, Sep-Oct 2013, pp.1639-1646
impact of scalability with respect to mobility and zone
size on ZRP over MANETs.
III.
OVERVIEW OF ZONE ROUTING
PROTOCOL
ZRP is a hybrid routing protocol based on
parameter called routing zone [19]. ZRP is proposed to
reduce the control overhead of proactive routing
protocols and decrease the latency caused by routing
discover in reactive routing protocols [20]. A node
routing zone is defined as a collection of nodes whose
minimum distance from the node in question is no
longer greater than a parameter called zone radius [21].
In ZRP there are further two sub-protocols,: Intra-zone
routing protocol (IARP) [22] is used inside routing
zones where a particular node employs proactive
routing and a reactive routing protocol: Inter-zone
routing protocol (IERP) is used between routing zones,
respectively. A route to a destination within the local
zone can be established from the proactively cached
routing table of the source by IARP; therefore, if the
source and destination is in the same zone, the packet
can be delivered immediately. Most of the existing
proactive routing algorithms can be used as the IARP
for ZRP. IERP route discovery operates as follows.
The source node first checks whether the destination
node is within its zone if so path to the destination is
known and no further route discovery is required if the
destination is not within the source routing zone the
source border casts a route request to its peripheral
nodes. Peripheral nodes are the nodes whose minimum
distance to the nodes is equal to zone radius. Peripheral
nodes executes the same algorithm-checks whether
destination is within zone if so route reply is sent back
to the source otherwise peripheral nodes forward route
request to their peripheral nodes which follows same
procedure. Figure 1 illustrates the routing zone of
radius 2, 3 and 4 w.r.t. node T.
IV.
www.ijera.com
QOS BASED PERFORMANCE METRICS
The performance of ZRP with Constant Bit
Rate (CBR) Traffic has been analyzed using NS2.33
simulator. The performance metrics includes the
following QoS parameters such as Packet Delivery
Ratio (PDR), Throughput, End to End Delay and
Routing Overhead. The parameters taken for
simulation are summarized in Table 1.
Packet Delivery Ratio (PDR): PDR also known as
the ratio of the data packets delivered to the
destinations to those generated by the CBR sources.
This metric characterizes both the completeness and
correctness of the routing protocol.
n
PDR
CBRrece
1
n
CBRsent
*100
1
Average End to End Delay: Average End to End
delay is the average time taken by a data packet to
reach from source node to destination node. It is ratio
of total delay to the number of packets received.
n
Avg _ End _ to _ End _ Delay
(CBRrecetime CBRsenttime)
1
n
CBRrece
* 100
1
Throughput: Throughput is the ratio of total number
of delivered or received data packets to the total
duration of simulation time.
n
Throughput
CBRrece
1
simulationtime
Normalized Protocol Overhead/ Routing Load:
Routing Load is the ratio of total number of the routing
packets to the total number of received data packets at
destination.
RTRPacket
Routing _ Load
CBRrece
V.
SIMULATION RESULTS AND
DISCUSSION
The performance of ZRP has been analyzed
with varying Transmission Range, Mobility, Zone Size
and Number of Nodes. The parameters used for
simulation are summarized in Table 1 and positioning
of 25 and 50 nodes is illustrated in Figure 2 and Figure
3. The performance metrics comprises of QoS
parameters such as packet delivery ratio, end to end
delay, routing overhead and throughput.
Fig 1: Zone Routing with Radius 2, 3 and 4
www.ijera.com
1641 | P a g e
4. Jitender Grover et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 5, Sep-Oct 2013, pp.1639-1646
TABLE I.
Simulation Parameters
Parameters
Values
No of Node
25, 50
Simulation Time
100 sec
Environment Size
1200x1200
Traffic Size
CBR (Constant Bit Rate)
Queue Length
50
Source Node
Node 0
Destination Node
Node 2
Mobility Model
Random Waypoint
Antenna Type
Omni Directional
Connection Type
UDP
Simulator
NS-2.33
Mobility Speed
100,200,300 m/s
Transmission Range (in 200,300,400,500 and 600
meters)
Operating System
Linux Enterprise Edition5
www.ijera.com
highly mobility environment and no effect of zone
radius is there.
Fig 4 Impact of varying Transmission Range & Zone
radius on Packet Delivery Ratio is with 100 mobility
speed for 25 nodes.
Fig 5 Impact of varying Transmission Range & Zone
radius on Packet Delivery Ratio is with 200 mobility
speed for 25 nodes
Fig 2 Initial Positioning of 25 Nodes
Fig 6 Impact of varying Transmission Range & Zone
radius on Packet Delivery Ratio is with 300 mobility
speed for 25 nodes
Fig 3 Initial Positioning of 50 Nodes.
A Packet Delivery Ratio
Packet Delivery Ratio (PDR) of ZRP is
shown in Figure 4-6 for 25 nodes and in Figure 7-9 for
50 nodes. It has been observed that the packet delivery
ratio is at higher side when Zone Radius is maximum
i.e. 5R with all transmission ranges. PDR increases
with the increase in Transmission Range for 25 nodes
scenario but decrease with the increase in
Transmission range in 50 nodes scenario. It is also
observed that packet delivery rate start decreasing at
www.ijera.com
Fig 7 Impact of varying Transmission Range & Zone
radius on Packet Delivery Ratio is with 100 mobility
speed for 50 nodes.
1642 | P a g e
5. Jitender Grover et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 5, Sep-Oct 2013, pp.1639-1646
Fig 8 Impact of varying Transmission Range & Zone
radius on Packet Delivery Ratio is with 200 mobility
speed for 50 nodes.
Fig 9 Impact of varying Transmission Range & Zone
radius on Packet Delivery Ratio is with 300 mobility
speed for 50 nodes.
www.ijera.com
Fig 11 Impact of varying Transmission Range & Zone
radius on Average End to End Delay is with 200
mobility speed for 25 nodes.
Fig 12 Impact of varying Transmission Range & Zone
radius on Average End to End Delay is with 300
mobility speed for 25 nodes.
B End to End delay
Average End to End Delay of ZRP is shown
in Figure 10-12 for 25 nodes and in Figure 13-15 for
50 nodes. It has been observed that the Average End to
End Delay is decreasing with the increase in
Transmission Range. Delay is minimum when Zone
Size is smaller in almost all cases. It is also observed
that the delay is constantly decreasing with increase in
mobility speed. ZRP is hybrid routing protocol in
which within zone proactive routing is done, so as we
increase the zone radius then nodes get more nodes
information within their routing table that decrease the
average delay.
Fig 13 Impact of varying Transmission Range & Zone
radius on Average End to End Delay is with 100
mobility speed for 50 nodes.
Fig 10 Impact of varying Transmission Range & Zone
radius on Average End to End Delay is with 100
mobility speed for 25 nodes.
Fig 14 Impact of varying Transmission Range & Zone
radius on Average End to End Delay is with 200
mobility speed for 50 nodes.
www.ijera.com
1643 | P a g e
6. Jitender Grover et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 5, Sep-Oct 2013, pp.1639-1646
Fig 15 Impact of varying Transmission Range & Zone
radius on Average End to End Delay is with 300
mobility speed for 50 nodes.
C Throughput
Average Throughput of ZRP is shown in
Figure 16-18 for 25 nodes and in Figure 19-21 for 50
nodes. It has been observed that the Average
Throughput is highest when the mobility rate and zone
radius is minimum. It has also been observed that
Average Throughput increases with the increase in
Transmission Range for 25 nodes scenario but
decrease with the increase in Transmission range in 50
nodes scenario. It is also analysed that with the
increase in mobility rate lot of routes break that causes
large numbers of packets dropped. It is also observed
that throughput is directly proportional to number of
packets received by the receiver node.
Fig 16 Impact of varying Transmission Range & Zone
radius on Throughput with 100 mobility speed for 25
nodes.
Fig 17 Impact of varying Transmission Range & Zone
radius on Throughput with 200 mobility speed for 25
nodes.
www.ijera.com
www.ijera.com
Fig 18 Impact of varying Transmission Range & Zone
radius on Throughput with 300 mobility speed for 25
nodes.
Fig 19 Impact of varying Transmission Range & Zone
radius on Throughput with 100 mobility speed for 50
nodes.
Fig 20 Impact of varying Transmission Range & Zone
radius on Throughput with 200 mobility speed for 50
nodes.
Fig 21 Impact of varying Transmission Range & Zone
radius on Throughput with 300 mobility speed for 50
nodes.
1644 | P a g e
7. Jitender Grover et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 5, Sep-Oct 2013, pp.1639-1646
D Routing Overhead
Routing Overhead of ZRP is shown in Figure
22-24 for 25 nodes and in Figure 25-27 for 50 nodes. It
has been observed that the Routing Overhead is
decreasing with increase in Transmission Range for 25
nodes and increasing with increase in Transmission
Range for 50 nodes scenario. It is observer that with
higher mobility speed and bigger Zone Size, Routing
Overhead is maximum for 50 nodes scenario. Analysis
shows that Routing Overhead is more in high mobility
rate that are due to frequent route break occurs and lots
of route reconfiguration requests are generated and it
start increasing when the zone size is getting bigger.
Fig 22 Impact of varying Transmission Range & Zone
radius on Routing Overhead with 100 mobility speed
for 25 nodes.
Fig 23 Impact of varying Transmission Range & Zone
radius on Routing Overhead with 200 mobility speed
for 25 nodes.
Fig 25 Impact of varying Transmission Range & Zone
radius on Routing Overhead with 100 mobility speed
for 50 nodes.
Fig 26 Impact of varying Transmission Range & Zone
radius on Routing Overhead with 200 mobility speed
for 50 nodes.
Fig 27 Impact of varying Transmission Range & Zone
radius on Routing Overhead with 300 mobility speed
for 50 nodes.
VI.
Fig 24 Impact of varying Transmission Range & Zone
radius on Routing Overhead with 300 mobility speed
for 25 nodes.
www.ijera.com
www.ijera.com
CONCLUSION
The Transmission Range, Zone Size, Mobility
and different number of nodes as a system parameter
affects the overall wireless ad-hoc networks. The
performance of ZRP shows some differences by
varying Transmission Range, Zone Size, Mobility and
different number of nodes. From our experimental
analysis we conclude that transmission range has
inverse effect with scalability. When number of nodes
are less then with the increase in transmission range
performance is getting better every time but when we
scale up the network with the increase in transmission
1645 | P a g e
8. Jitender Grover et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 5, Sep-Oct 2013, pp.1639-1646
range performance of ZRP is getting poorer. It is also
conclude that when zone size is very small it act as
reactive routing protocol because the probability of
destination node with in routing zone is less, so
average delay is more. ZRP uses proactive routing
within the zone as zone size gets increased then delay
keeps on reducing destination nodes can come under
the routing zone. We also concluded that when nodes
mobility rate is less then throughput, packet delivery
ratio is maximum as packets drop is less and as
mobility rate and zone size is increased the control
overhead also increased. In future work, simulations
can be performed by increasing number of mobile
nodes and varying transmission range is also great
concern.
[11]
[12]
[13]
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
Jeremy Pitt, Pallapa Venkatarram, and Abe
Mamdani, “QoS Management in MANETS
Using Norm-Governed AgentSocieties”,
ESAW 2005, LNAI 3963, 2006, pp. 221- 240.
Rajneesh Kumar Gujral, Manpreet Singh
"Analyzing the Impact of Scalability on QoS
Aware Routing for MANETs "International
Journal of Computer Science MANETs vol.
8(3), May 2011, pp no. 487-495.
Mr. Rajneesh Gujral, Dr. Anil Kapil “Secure
QoS Enabled On-Demand Link-State
Multipath Routing in MANETS” Proceeding
of BAIP 2010, SPRINGER LNCS-CCIS,
Trivandrum, Kerala , India, March 26-27,
2010, pp. 250-257.
N.Adam, M.Y.Ismail, J.Abdullah, “Effect of
Node Density on Performances of Three
Manet Routing Protocols,” Proceeding of
International Conference on Electronic
Devices,
Systems
and
Applications
(ICEDSA’10), April 2010, pp. 321-325.
C Siva Ram Murthy and BS Manoj “Ad Hoc
Wireless
Networks
architectures
and
protocols”,Pearson education,2005.
Savita Gandhi et al “Performance Evaluation
of DSR, OLSR and ZRP in MANAT. (ICCCI
-2012), Jan. 10 – 12, 2012, Coimbatore.
Dinesh Singh, Ashish K. Maurya et al
“Comparative Performance Analysis of
LANMAR,LARI,DYMO and ZRP Routing
Protocol in
MANAT using Random
Waypoint Mobilty Model” 2011 IEEE.
A. Loutfi et al “Evaluation and enhancement
of ZRP performances” MIS team, SIME Lab
B.P. 715, ENSIAS Rabat, Morocco, IEEE
2010
Yuki Sato et al “A Zone Based Routing
Protocol for
Ad- Hoc
Networks and Its Performance Improvement
by Reduction of Control Packets” DOI
10.1109/BWCCA.2010.43
Md. Arafatur Rahman and Farhat Anwar et al
“A
Simulation
Based
Performance
www.ijera.com
[14]
[15]
[16]
[17]
[18]
[19]
[20]
[21]
[22]
www.ijera.com
Comparison of Routing Protocol on Mobile
Ad-hoc Network (Proactive, Reactive and
Hybrid)” (ICCCE 2010), 11-13 May 2010.
Brijesh Patel et al “Performance Analysis of
Zone Routing Protocols in Mobile Ad Hoc
Networks” Dhirubhai Ambani Institute of
Information and Communication Technology
Gandhinagar 382 007, India 2010 IEEE.
S. Ramachandram et al”The Performance
Evaluation of Cached Genetic Zone Routing
Protocol for MANETs” Member, IEEE,
Professor & Head Osmania University,
Hyderabad.
Rajneesh Kumar Gujral et al”Impact of
Scalability with respect to Mobility and Zone
Size on Zone Routing Protocol over
MANETs” DOI 10.1109/ICCS.2012.82
Arivubrakan P. and Sarma Dhulipala V.R.,
“QoS Enhancement by varying Transmission
Range in Wireless Ad-hoc Networks”,
International
Journal
of
Computer
Applications (0975 – 8887), vol. 37(9),
January 2012.
Karthiga G., Benitha Christinal J., Jeban
Chandir Moses, “Performance Analysis of
Various Ad hoc Routing Protocols in
Multicast Environment”, IJCST vol. 2(1),
March 2011.
Nicklas Beijar “Zonal Routing Protocol”
networking Laboratory, Helsinky university
of technology, finland , vol.9(4), 2008 pp
427-438.
Yuanzhu Peter Chen and Arthur Liestman “a
zonal routing algorithm for clustering Ad hoc
networks”,
international
journal
of
foundations of computer Science
Sree Ranga Raju and Jitendranath Mungara
“Performance Evaluation of ZRP over AODV
and DSR in MANETs using Qualnet”,
European Journal of Scientific Research,vol.
45(4), (2010), pp 651-667.
Zygmunt J Haas and Marc R Pearlman and
Prince Samar “the Intrazone routing protocol
for Ad hoc network(IARP)”, July 2002.
Zygmunt J Haas and Marc R Pearlman and
Prince Samar “the zonal Routing protocol for
Ad hoc network(ZRP)”, July 2002.
Nicklas Beijar “Zonal Routing Protocol”
networking Laboratory , Helsinky university
of technology, finland ,2008 vol.9(4), pp 427438.
Zygmunt J Haas and Marc R Pearlman and
Prince Samar “The Intrazone Routing
protocol for Ad hoc network(IARP)”, June
2001.
1646 | P a g e