Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which
are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active
research area, basically for supporting real time applications that are based upon interaction
between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve
more deterministic behavior of the network i.e. a stable path, so that information carried by the
network can be delivered in an uninterrupted fashion and for better resource utilization. In this
paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing
algorithm for MANETs with better route failure management and which will be highly adaptive
and energy efficient.
Solving bandwidth guaranteed routing problem using routing dataIJCNCJournal
This paper introduces a traffic engineering routing algorithm that aims to accept as many routing demands
as possible on the condition that a certain amount of bandwidth resource is reserved for each accepted
demand. The novel idea is to select routes based on not only network states but also information derived
from routing data such as probabilities of the ingress egress pairs and usage frequencies of the links.
Experiments with respect to acceptance ratio and computation time have been conducted against various
test sets. Results indicate that the proposed algorithm has better performance than the existing popular algorithms including Minimum Interference Routing Algorithm (MIRA) and Random Race based Algorithm for Traffic Engineering (RRATE)
.
Determining the Optimum Number of Paths for Realization of Multi-path Routing...TELKOMNIKA JOURNAL
Multi-Protocol Label Switching for Traffic Engineering (MPLS-TE) technology is an intelligent and
advanced tool for handling traffic through the core networks and implementing new services based on
virtual transport. Since MPLS-TE combines channel and network layer mechanisms, network
administrators can optimally integrate and allocate the traffic loads while maintaining the speed of
technologies such as Asynchronous Transfer Mode (ATM) technology. In this paper, the problem of the
developed algorithm of multi-path routing which allows us to determine the optimum number of
independent shortest paths is theoretically solved. In details, the article proposes a way for finding the set
of shortest paths using Dijkstra's algorithm, and then determination of the maximum flow for each of the
shortest paths based on the mathematical concepts and finally, introducing the solution of the multi-criteria
optimization problem for a set of shortest paths. According to our approach, optimizing the use of
resources in the core networks is possible with using the MPLS-TE technology.
Effect of mobility models on the performance of multipath routing protocol in...csandit
In this paper, we have analyzed the performance of multipath routing protocol with various mobility
models for Mobile Ad Hoc Networks. The basic purpose of any multipath routing protocol
is to overcome various problems occurs while data delivery through a single path routing protocol.
For high acceptability of routing protocol, analysis of routing protocol in ad hoc network
only with random way point mobility model is not sufficient. Here, we have considered Random
waypoint, Random Direction and Probabilistic Random Walk mobility Model for proper analysis
of AOMDV routing protocol. Results obtained show that with increasing node density, packet
delivery ratio increases but with increasing node mobility Packet delivery ratio decreases.
An approach to dsr routing qos by fuzzy genetic algorithmsijwmn
Although, all prior works improved routing on MANETs, there is no strong advancement on QoS. One of
the newest challenges to improve quality of routing in MANETs is combining the Genetic and Fuzzy
algorithms into routing protocols. The improvements on routing QoS are approached by using Genetic and
Fuzzy algorithms in this project. In cause of storing route information during route discovery, the DSR
routing protocol is chosen by this project. First of all, the suggested protocol in this project added Current
Time into DSR header. So, next intermediate node can obtain its previous link’s cost by this attachment and
adds the Link Cost to route discovery packet. Then, when the route discovery packet received to destination
node, it will expect for other packets till end of packet TTL. Next, the destination node will use collected
packets in Genetic Algorithm to find the two optimum routes. Finally, the destination node sends these
routes to source node. Next improvement is using Fuzzy Triangle Numbers to change route update. In this
case, the suggested protocol uses route error packets’ count and also Triangle Numbers to change route
update period time.
Research Inventy : International Journal of Engineering and Scienceinventy
Research Inventy : International Journal of Engineering and Science
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed
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.
Analysis of Latency and Throughput of 2D Torus Topology using Modified XY Rou...IDES Editor
Network-on-Chip (NoC) is a packet switched onchip
communication network designed using a layered
methodology i.e. “routes packets, not wires”. It is an efficient
on chip communication architecture for System on Chip (SoC)
architectures. NoCs solved the disadvantages of SoCs and are
scalable. Each route in NoC includes some routers and it takes
a few clock periods by passing a router.
When the network is in congestion, the package transmission
will produce much more time delay. So adopting an appropriate
routing algorithm to get the balance between the time delay
and throughput rate becomes the key problem. In this paper
we tried to solve that problem using torus topology with our
modified XY routing algorithm.
We used NIRGAM simulator for analysis of latency and
throughput of modified XY routing algorithm for 2D torus
topology. 3x3 network size used for analyze the performance.
We consider all tiles as source, all tiles as destination and
vary the packet size & traffic used is Constant Bit Rate (CBR)
random traffic. It is found that packet size increases then
latency/packet increases and throughput (in Gbps) also
increases but latency/flit decreases.
Performance evaluation of proactive, reactive and hybrid routing protocols wi...eSAT Journals
Abstract Our work mainly focused on the performance and effects of different mobility models like Random Waypoint, Reference Point Group, and Manhattan mobility models in different aspects to improve and analyze the behavior of Optimized Link-State Routing (OLSR), Temporally-Ordered Routing Algorithm (TORA) and Zone Routing Protocol (ZRP) routing protocols. These three routing protocols can be classified into the following three general categories, based on the timing when the routes are discovered and updated-proactive (OLSR), reactive (TORA) and hybrid (ZRP). In literature various researchers have discussed the performance issues in AODV, DSDV and DSR routing protocols in Random Waypoint mobility model on Mobile Ad hoc Networks (MANETs) is not satisfactory due to link failure and late acknowledgement. To resolve the specified issue, we have come up with other alternatives like Reference Point Group, and Manhattan mobility model and also other routing protocols like OSLR, TORA and ZRP. A simulation was carried out in NS2 and Bonnmotion for above said protocols and mobility models in Constant Bit Rate (CBR) traffic to analyzed using various metrics like packet delivery fraction, end to end delay and normalized routing load. In our simulation it was shown that few mobility model performed better in different routing protocols. In our simulation results, we got a high Normalized Routing Load for Random Waypoint compared to Reference Point Group, and Manhattan mobility model in both DRP and OSLR protocols. Index Terms: MANET, CBR, Routing protocols, Mobility models, NS2
Solving bandwidth guaranteed routing problem using routing dataIJCNCJournal
This paper introduces a traffic engineering routing algorithm that aims to accept as many routing demands
as possible on the condition that a certain amount of bandwidth resource is reserved for each accepted
demand. The novel idea is to select routes based on not only network states but also information derived
from routing data such as probabilities of the ingress egress pairs and usage frequencies of the links.
Experiments with respect to acceptance ratio and computation time have been conducted against various
test sets. Results indicate that the proposed algorithm has better performance than the existing popular algorithms including Minimum Interference Routing Algorithm (MIRA) and Random Race based Algorithm for Traffic Engineering (RRATE)
.
Determining the Optimum Number of Paths for Realization of Multi-path Routing...TELKOMNIKA JOURNAL
Multi-Protocol Label Switching for Traffic Engineering (MPLS-TE) technology is an intelligent and
advanced tool for handling traffic through the core networks and implementing new services based on
virtual transport. Since MPLS-TE combines channel and network layer mechanisms, network
administrators can optimally integrate and allocate the traffic loads while maintaining the speed of
technologies such as Asynchronous Transfer Mode (ATM) technology. In this paper, the problem of the
developed algorithm of multi-path routing which allows us to determine the optimum number of
independent shortest paths is theoretically solved. In details, the article proposes a way for finding the set
of shortest paths using Dijkstra's algorithm, and then determination of the maximum flow for each of the
shortest paths based on the mathematical concepts and finally, introducing the solution of the multi-criteria
optimization problem for a set of shortest paths. According to our approach, optimizing the use of
resources in the core networks is possible with using the MPLS-TE technology.
Effect of mobility models on the performance of multipath routing protocol in...csandit
In this paper, we have analyzed the performance of multipath routing protocol with various mobility
models for Mobile Ad Hoc Networks. The basic purpose of any multipath routing protocol
is to overcome various problems occurs while data delivery through a single path routing protocol.
For high acceptability of routing protocol, analysis of routing protocol in ad hoc network
only with random way point mobility model is not sufficient. Here, we have considered Random
waypoint, Random Direction and Probabilistic Random Walk mobility Model for proper analysis
of AOMDV routing protocol. Results obtained show that with increasing node density, packet
delivery ratio increases but with increasing node mobility Packet delivery ratio decreases.
An approach to dsr routing qos by fuzzy genetic algorithmsijwmn
Although, all prior works improved routing on MANETs, there is no strong advancement on QoS. One of
the newest challenges to improve quality of routing in MANETs is combining the Genetic and Fuzzy
algorithms into routing protocols. The improvements on routing QoS are approached by using Genetic and
Fuzzy algorithms in this project. In cause of storing route information during route discovery, the DSR
routing protocol is chosen by this project. First of all, the suggested protocol in this project added Current
Time into DSR header. So, next intermediate node can obtain its previous link’s cost by this attachment and
adds the Link Cost to route discovery packet. Then, when the route discovery packet received to destination
node, it will expect for other packets till end of packet TTL. Next, the destination node will use collected
packets in Genetic Algorithm to find the two optimum routes. Finally, the destination node sends these
routes to source node. Next improvement is using Fuzzy Triangle Numbers to change route update. In this
case, the suggested protocol uses route error packets’ count and also Triangle Numbers to change route
update period time.
Research Inventy : International Journal of Engineering and Scienceinventy
Research Inventy : International Journal of Engineering and Science
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed
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.
Analysis of Latency and Throughput of 2D Torus Topology using Modified XY Rou...IDES Editor
Network-on-Chip (NoC) is a packet switched onchip
communication network designed using a layered
methodology i.e. “routes packets, not wires”. It is an efficient
on chip communication architecture for System on Chip (SoC)
architectures. NoCs solved the disadvantages of SoCs and are
scalable. Each route in NoC includes some routers and it takes
a few clock periods by passing a router.
When the network is in congestion, the package transmission
will produce much more time delay. So adopting an appropriate
routing algorithm to get the balance between the time delay
and throughput rate becomes the key problem. In this paper
we tried to solve that problem using torus topology with our
modified XY routing algorithm.
We used NIRGAM simulator for analysis of latency and
throughput of modified XY routing algorithm for 2D torus
topology. 3x3 network size used for analyze the performance.
We consider all tiles as source, all tiles as destination and
vary the packet size & traffic used is Constant Bit Rate (CBR)
random traffic. It is found that packet size increases then
latency/packet increases and throughput (in Gbps) also
increases but latency/flit decreases.
Performance evaluation of proactive, reactive and hybrid routing protocols wi...eSAT Journals
Abstract Our work mainly focused on the performance and effects of different mobility models like Random Waypoint, Reference Point Group, and Manhattan mobility models in different aspects to improve and analyze the behavior of Optimized Link-State Routing (OLSR), Temporally-Ordered Routing Algorithm (TORA) and Zone Routing Protocol (ZRP) routing protocols. These three routing protocols can be classified into the following three general categories, based on the timing when the routes are discovered and updated-proactive (OLSR), reactive (TORA) and hybrid (ZRP). In literature various researchers have discussed the performance issues in AODV, DSDV and DSR routing protocols in Random Waypoint mobility model on Mobile Ad hoc Networks (MANETs) is not satisfactory due to link failure and late acknowledgement. To resolve the specified issue, we have come up with other alternatives like Reference Point Group, and Manhattan mobility model and also other routing protocols like OSLR, TORA and ZRP. A simulation was carried out in NS2 and Bonnmotion for above said protocols and mobility models in Constant Bit Rate (CBR) traffic to analyzed using various metrics like packet delivery fraction, end to end delay and normalized routing load. In our simulation it was shown that few mobility model performed better in different routing protocols. In our simulation results, we got a high Normalized Routing Load for Random Waypoint compared to Reference Point Group, and Manhattan mobility model in both DRP and OSLR protocols. Index Terms: MANET, CBR, Routing protocols, Mobility models, NS2
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Delay Sensitive Packet Scheduling Algorithm for MANETs by Cross LayerAM Publications
The delay sensitive packet scheduling and routing algorithm to effectively deliver delay sensitive data’s over a multihop
networks. First packet urgency, node urgency, route urgency are calculated on the basis of end-to-end delay requirements.
Based on these urgency metrics, the proposed packet scheduling algorithm determines the transmission order of each packet to
minimize the node urgency without unnecessary packet drop, and the proposed routing algorithm establishes a route to minimize
the derivatives of route urgency in order to maximize the number of packets delivered within the required end-to-end delay.
Finally experimental results are presented to evaluate the performance of the proposed joint working algorithms.
Solving QoS multicast routing problem using ACO algorithmAbdullaziz Tagawy
Many Internet multicast applications have stringent Quality-of-Service (QoS) requirements that include delay, loss rate, bandwidth, and delay jitter. In this paper, we present a Swarm intelligence based on Ant Colony Optimization (ACO) technique to optimize the multicast tree
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 Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
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
Ad hoc networks are mobile wireless networks where each node is acting as a router. The existing routing protocols such as Destination sequences distance vector (DSDV), Optimized list state routing protocols (OLSR), Ad hoc on demand routing protocol (AODV), dynamic source routing (DSR) are optimized versions of distance vector or link state routing protocols. Reinforcement Learning is new method evolved recently which is learning from interaction with an environment. Q Learning which is based on reinforcement learning that learns from the delayed reinforcements and becomes more popular in areas of networking. Q Learning is applied to the routing algorithms where the routing tables in the distance vector algorithms are replaced by the estimation tables called as Q values. These Q values are based on the link delay. In this paper, various optimization techniques over Q routing are described in detail with their algorithms.
Effect of node mobility onaomdv protocol in manetijwmn
In this paper, we have analyzed the effect of node mobility on theperformance of AOMDV multipath routing
protocol. This routing protocol in ad hoc network has been analyzed with random way point mobility model
only. This is not sufficient to evaluate the behavior of a routing protocol. Therefore, in this paper, we
have considered Random waypoint, Random Direction and Probabilistic Random Walk mobility Model for
performance analysis of AOMDV protocol. The result reveals that packet delivery ratio decreases with the
increasing node mobility forall mobility models. Also, average end-to-end delay is also vary with varying
node speed, initially upto 20 nodes in all mobility models delay is minimum.
Link-and Node-Disjoint Evaluation of the Ad Hoc on Demand Multi-path Distance...Eswar Publications
This work illustrates the AOMDV routing protocol. Its ancestor, the AODV routing protocol is also described. This tutorial demonstrates how forward and reverse paths are created by the AOMDV routing protocol. Loop free paths formulation is described, together with node and link disjoint paths. Finally, the performance of the AOMDV routing protocol is investigated along link and node disjoint paths. The WSN with the AOMDV routing protocol using link disjoint paths is better than the WSN with the AOMDV routing protocol using node disjoint paths for energy consumption.
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.
Multiprotocol Label Switching (MPLS) fasten the speed of packet forwarding by forwarding the packets based on labels and reduces the use of routing table look up from all routers to label edge routers(LER) , where as the label switch routers (LSRs) uses Label Distribution Protocol (LDP) or RSVP (Resource reservation Protocol) for label allocation and Label table for packet forwarding . Dynamic protocol is implemented which carries a Updates packets for the details of Label Switch Paths, along with this feedback mechanism is also introduced which find the shortest path among MPLS network and also feedback is provided which also help to overcome congestion, this feedback mechanism is on a
hop by hop basis rather than end to end thus providing a more reliable and much faster and congestion
free path for the packets .
Performance evaluation of MANET routing protocols based on QoS and energy p...IJECEIAES
Routing selection and supporting Quality of Service (QoS) are fundamental problems in Mobile Ad Hoc Network (MANET). Many different protocols have been proposed in the literature and some performance simulations are made to address this challenging task. This paper discusses the performance evaluation and comparison of two typical routing protocols; Ad Hoc On-Demand Distance Vector (AODV) and Destination-Sequenced DistanceVector (DSDV) based on measuring the power consumption in network with varing of the QoS parameters. In this paper, we have studied and analyzed the impact of variations in QoS parameter combined with the choice of routing protocol, on network performance. The network performance is measured in terms of average throughput, packet delivery ratio (PDR), average jitter and energy consumption. The simulations are carried out in NS-3. The simulation results show that DSDV and AODV routing protocols are less energy efficient. The main aim of this paper is to highlight the directions for the future design of routing protocol which would be better than the existing ones in terms of energy utilization and delivery ratio.
Routing in All-Optical Networks Using Recursive State Space Techniquesipij
In this papr, we have minimized the effects of failures on network performace, by using suitable Routing
and Wavelenghth Assignment(RWA) method without disturbing other performance criteria such as blocking
probability(BP) and network management(NM). The computation complexity is reduced by using Kalaman
Filter(KF) techniques. The minimum reconfiguration probability routing (MRPR) algorithm must be
able to select most reliable routes and assign wavelengths to connections in a manner that utilizes the light
path(LP) established efficiently considering all possible requests.
Authentication of Secure Data Transmission In Wireless RoutingIJERA Editor
The major objective of our work is to explore a security enhanced dynamic routing algorithm based on distributed routing information widely supported in existing wired and wireless networks. The message authentication is the main area to be considered in WSN’s. Most of the wireless networks are attacked for detecting the data’s that are transmitted in between the users. We aim at the randomization of delivery paths for data transmission to provide considerably small path similarity (i.e., the number of common links between two delivery paths) of two consecutive transmitted packets. The proposed algorithm should be easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP) for wired networks and Destination-Sequenced Distance Vector (DSDV) protocol for wireless networks over existing infrastructures. These protocols shall not increase the number of control messages if the proposed algorithm is adopted. An analytic study will be presented for the proposed routing algorithm, and a series of simulation study will be conducted to verify the analytic results and to show the capability of the proposed algorithm.
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.
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.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Delay Sensitive Packet Scheduling Algorithm for MANETs by Cross LayerAM Publications
The delay sensitive packet scheduling and routing algorithm to effectively deliver delay sensitive data’s over a multihop
networks. First packet urgency, node urgency, route urgency are calculated on the basis of end-to-end delay requirements.
Based on these urgency metrics, the proposed packet scheduling algorithm determines the transmission order of each packet to
minimize the node urgency without unnecessary packet drop, and the proposed routing algorithm establishes a route to minimize
the derivatives of route urgency in order to maximize the number of packets delivered within the required end-to-end delay.
Finally experimental results are presented to evaluate the performance of the proposed joint working algorithms.
Solving QoS multicast routing problem using ACO algorithmAbdullaziz Tagawy
Many Internet multicast applications have stringent Quality-of-Service (QoS) requirements that include delay, loss rate, bandwidth, and delay jitter. In this paper, we present a Swarm intelligence based on Ant Colony Optimization (ACO) technique to optimize the multicast tree
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 Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
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
Ad hoc networks are mobile wireless networks where each node is acting as a router. The existing routing protocols such as Destination sequences distance vector (DSDV), Optimized list state routing protocols (OLSR), Ad hoc on demand routing protocol (AODV), dynamic source routing (DSR) are optimized versions of distance vector or link state routing protocols. Reinforcement Learning is new method evolved recently which is learning from interaction with an environment. Q Learning which is based on reinforcement learning that learns from the delayed reinforcements and becomes more popular in areas of networking. Q Learning is applied to the routing algorithms where the routing tables in the distance vector algorithms are replaced by the estimation tables called as Q values. These Q values are based on the link delay. In this paper, various optimization techniques over Q routing are described in detail with their algorithms.
Effect of node mobility onaomdv protocol in manetijwmn
In this paper, we have analyzed the effect of node mobility on theperformance of AOMDV multipath routing
protocol. This routing protocol in ad hoc network has been analyzed with random way point mobility model
only. This is not sufficient to evaluate the behavior of a routing protocol. Therefore, in this paper, we
have considered Random waypoint, Random Direction and Probabilistic Random Walk mobility Model for
performance analysis of AOMDV protocol. The result reveals that packet delivery ratio decreases with the
increasing node mobility forall mobility models. Also, average end-to-end delay is also vary with varying
node speed, initially upto 20 nodes in all mobility models delay is minimum.
Link-and Node-Disjoint Evaluation of the Ad Hoc on Demand Multi-path Distance...Eswar Publications
This work illustrates the AOMDV routing protocol. Its ancestor, the AODV routing protocol is also described. This tutorial demonstrates how forward and reverse paths are created by the AOMDV routing protocol. Loop free paths formulation is described, together with node and link disjoint paths. Finally, the performance of the AOMDV routing protocol is investigated along link and node disjoint paths. The WSN with the AOMDV routing protocol using link disjoint paths is better than the WSN with the AOMDV routing protocol using node disjoint paths for energy consumption.
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.
Multiprotocol Label Switching (MPLS) fasten the speed of packet forwarding by forwarding the packets based on labels and reduces the use of routing table look up from all routers to label edge routers(LER) , where as the label switch routers (LSRs) uses Label Distribution Protocol (LDP) or RSVP (Resource reservation Protocol) for label allocation and Label table for packet forwarding . Dynamic protocol is implemented which carries a Updates packets for the details of Label Switch Paths, along with this feedback mechanism is also introduced which find the shortest path among MPLS network and also feedback is provided which also help to overcome congestion, this feedback mechanism is on a
hop by hop basis rather than end to end thus providing a more reliable and much faster and congestion
free path for the packets .
Performance evaluation of MANET routing protocols based on QoS and energy p...IJECEIAES
Routing selection and supporting Quality of Service (QoS) are fundamental problems in Mobile Ad Hoc Network (MANET). Many different protocols have been proposed in the literature and some performance simulations are made to address this challenging task. This paper discusses the performance evaluation and comparison of two typical routing protocols; Ad Hoc On-Demand Distance Vector (AODV) and Destination-Sequenced DistanceVector (DSDV) based on measuring the power consumption in network with varing of the QoS parameters. In this paper, we have studied and analyzed the impact of variations in QoS parameter combined with the choice of routing protocol, on network performance. The network performance is measured in terms of average throughput, packet delivery ratio (PDR), average jitter and energy consumption. The simulations are carried out in NS-3. The simulation results show that DSDV and AODV routing protocols are less energy efficient. The main aim of this paper is to highlight the directions for the future design of routing protocol which would be better than the existing ones in terms of energy utilization and delivery ratio.
Routing in All-Optical Networks Using Recursive State Space Techniquesipij
In this papr, we have minimized the effects of failures on network performace, by using suitable Routing
and Wavelenghth Assignment(RWA) method without disturbing other performance criteria such as blocking
probability(BP) and network management(NM). The computation complexity is reduced by using Kalaman
Filter(KF) techniques. The minimum reconfiguration probability routing (MRPR) algorithm must be
able to select most reliable routes and assign wavelengths to connections in a manner that utilizes the light
path(LP) established efficiently considering all possible requests.
Authentication of Secure Data Transmission In Wireless RoutingIJERA Editor
The major objective of our work is to explore a security enhanced dynamic routing algorithm based on distributed routing information widely supported in existing wired and wireless networks. The message authentication is the main area to be considered in WSN’s. Most of the wireless networks are attacked for detecting the data’s that are transmitted in between the users. We aim at the randomization of delivery paths for data transmission to provide considerably small path similarity (i.e., the number of common links between two delivery paths) of two consecutive transmitted packets. The proposed algorithm should be easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP) for wired networks and Destination-Sequenced Distance Vector (DSDV) protocol for wireless networks over existing infrastructures. These protocols shall not increase the number of control messages if the proposed algorithm is adopted. An analytic study will be presented for the proposed routing algorithm, and a series of simulation study will be conducted to verify the analytic results and to show the capability of the proposed algorithm.
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.
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.
Energy Efficient Multipath Routing For Mobile Ad Hoc NetworksZac Darcy
Energy consumption is a significant issue in ad hoc networks since mobile nodes are battery powered. In
order to prolong the lifetime of ad hoc networks, it is the most critical issue to minimize the energy
consumption of nodes. In this paper, we propose an energy efficient multipath routing protocol for
choosing energy efficient path. This system also considers transmission power of nodes and residual energy
as energy metrics in order to maximize the network lifetime and to reduce energy consumption of mobile
nodes. The objective of our proposed system is to find an optimal route based on two energy metrics while
choosing a route to transfer data packets. This system is implemented by using NS-2.34. Simulation results
show that the proposed routing protocol with transmission power and residual energy control mode can
extend the life-span of network and can achieve higher performance when compared to traditional ad-hoc
on-demand multipath distance vector (AOMDV) routing protocol.
Energy Efficient Multipath Routing For Mobile Ad Hoc NetworksZac Darcy
Energy consumption is a significant issue in ad hoc networks since mobile nodes are battery powered. In
order to prolong the lifetime of ad hoc networks, it is the most critical issue to minimize the energy
consumption of nodes. In this paper, we propose an energy efficient multipath routing protocol for
choosing energy efficient path. This system also considers transmission power of nodes and residual energy
as energy metrics in order to maximize the network lifetime and to reduce energy consumption of mobile
nodes. The objective of our proposed system is to find an optimal route based on two energy metrics while
choosing a route to transfer data packets. This system is implemented by using NS-2.34. Simulation results
show that the proposed routing protocol with transmission power and residual energy control mode can
extend the life-span of network and can achieve higher performance when compared to traditional ad-hoc
on-demand multipath distance vector (AOMDV) routing protocol.
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (2
2n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Throughput and Delay Analysis of Next-HOP Forwarding Method for Non-Linear Eh...pijans
Position based routing plays a significant role in multi-hop Vehicular Ad hoc Networks (VANETs), due to
high mobility of nodes. Selection of next-hop node is crucial to improve the performance of routing. In this
paper, we have proposed a method for selecting next-hop forwarding node based on the distance between
the source and next-hop node and link quality. Next-hop node is selected based on Expected Progress
Distance (EPD) criteria. The EPD is estimated in terms of expected distance between the source and nexthop node. The expected delay (ED) and throughput (Th) are also estimated for the proposed method. The
mathematical model derived for calculating EPD, delay, and throughput are simulated in MATLAB and
evaluated the performance of the proposed method.
MPC-EAR : Maximal Power Conserved And Energy Aware Routing in Ad hoc Networksijsrd.com
Power preservation in wireless ad hoc networks is a decisive factor as energy resources are inadequate at the electronic devices in use. Power-aware routing strategies are fundamentally route selection strategies built on accessible ad hoc routing protocols. This paper proposed a new Maximal Power Conserved And Energy Aware Routing (MPC-EAR ) topology for mobile ad hoc networks that enhances the network life span. Simulation results prove that the projected protocol has a higher performance other minimal energy usage, energy level aware and energy conserving routing protocols such as MTPR, MMECR and CMMECR.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
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/
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
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
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.
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.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
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.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
2. 390 Computer Science & Information Technology (CS & IT)
supervision is required. It also provides parallelism, i.e. agents operate in parallel. However,
besides these advantages, one of the biggest difficulties with ant colony algorithms applied in
network routing area is that multiple constraints often make the routing problem intractable [6].
The proposed algorithm is a QoS aware multipath on-demand routing algorithm. The advantage
of AMTR is that, it supports energy efficient multipath routing and as well as takes care of the
QoS constraints-delay, bandwidth, energy and drain rate which is very essential for real time and
multimedia applications.
The paper is organized as follows: Section 2 describes the mathematical model. In section 3 the
proposed algorithm combining the idea of ACO and TORA is illustrated. Section 4 explains the
performance analysis. Finally section 5 concludes the paper.
2. MATHEMATICAL MODEL
For mathematical analysis MANET is represented by a connected undirected graph. Let G (V, E)
represents the mobile ad hoc network. Here V denotes the set of network nodes and E denotes the
set of bidirectional links. QoS metrics with respect to each link e ∈E is delay (e) and bandwidth
(e). With respected to node n ∈V , it is delay (n), energy (n) and drain rate (n) which is the
energy dissipation rate of node ‘n’. Another QoS metric considered here is hop count. It is
important because multiple hops are used for data transmission in MANET. So, it is necessary to
find paths with minimum hops. The main motivation of this proposed algorithm is to find path
from source to destination which will satisfy the QoS requirements such as delay, bandwidth,
energy, drain rate and hop count.
Let, path (i, j) or R is entire path from node i to j where QoS constraints have to satisfied.
From an arbitrary node i to an arbitrary node j, delay, bandwidth, energy, drain rate and hop count
is calculated as-
delay (path (i, j )) or D (R) = ∑ ∈ ),(
)(jiPe
edelay + ∑ ∈ ),(
)(jiPn
ndelay
where, delay (path (i,j )) is the transmission and propagation delay of the path(i,j) and delay (n) is
the processing and queuing delay of node ‘n’ on path(i, j).
bandwidth(path(i,j)) or B(R)= ),(min jiPe∈ {bandwidth(e)}
where, bandwidth (e) is the available bandwidth of that link on path(i, j).
energy (path (i, j)) or E (R) = ),(min jiPn∈ { energy (n)}
where, energy (n) is the residual energy of node ‘n’ on path(i, j).
drain rate (path (i, j)) or DR (R) = ),(max jiPn∈ { drain rate(n)}
where, drain rate (n) is the rate of energy dissipation of node ‘n’ on path(i, j).
hop count (path (i, j)) or HC (R) = Number of nodes in the path.
2.1 CALCULATION OF PHEROMONE
Ant deposits pheromone during traversal of the link for finding a route. The quantity of
pheromone it deposited on each link (i, j) along the route R is noted by ji,τ∆ and it is a function
of global quality of route R. It is expressed by the following equation-
ji,τ∆ =
DRHCD
EB
λλλ
λλ
DR(R)HC(R)D(R)
E(R)B(R)
++
+
(1)
3. Computer Science & Information Technology (CS & IT) 391
Here λB, λE, λD, λHC and λDR are the weight factors which indicate the relative significance of the
QoS parameters during pheromone update on path (i, j). The quantity of the deposited
pheromone is defined only after finding the route.
The pheromone quantity of the link (i, j) is updated according to the following equation:
τi,j = σ.τi,j + ∆τ i,j (2)
2.2 CALCULATION OF PATH PREFERENCE PROBABILITY
Path Preference Probability is calculated in each intermediate node as well as source node upon
receiving of QRY Reply_Ant.
Suppose current node i receives QRY Reply_Ant from node j for destination d, then the Path
Preference Probability is calculated as-
∑∈
=
iNk
α6
ijd
α5
ikd
α4
ikd
α3
ikd
α2
ikd
α1
ik
α6
ijd
α5
ijd
α4
ijd
α3
ijd
α2
ijd
α1
ij
ijd
][DR].[E].[B].[η].[D][τ
][DR].[E].[B].[η].[D][τ
P (3)
Here α1, α2, α3, α4, α5 and α6 are the tunable parameters which control the relative weights of
pheromone trails, hop count, bandwidth, energy and drain rate respectively.
Ni is the set of neighbors of i and k is the neighbor node of i through which a path to destination is
known.
The relative metrics are calculated from source i to destination d via j as-
Dijd
d))(i,delay(path
1
=
ijdη
d))ath(i,hopcount(p
1
=
Bijd= bandwidth (path(i,d))
Eijd = energy (path (i,d))
ijdDR
d))i,rate(path(drain
1
=
Now, source as well as neighbors has multiple paths from source to destination. The path with
higher Path Preference Probability is selected for the data transmission.
3. PROPOSED ALGORITHM
The proposed algorithm is a multipath on-demand routing algorithm. Here QoS constraints-delay,
bandwidth, energy and drain rate are considered which are very essential for multimedia
applications.
This algorithm has three phases namely route discovery phase, route maintenance phase and
route erasure phase. In route discovery phase, multiple paths which satisfy the required QoS
constraints are created and stored in the cache. The route with higher path preference probability
is selected for the routing. In route maintenance phase, when a node fails to transmit packets, it
will check for the alternate route to the desired destination with better path preference probability.
If such path exists, it is chosen for the routing. In the next case, if the failure node has no
outbound link to other nodes in the network, then it will send an error message to the source and
4. 392 Computer Science & Information Technology (CS & IT)
immediately start local link maintenance. All routes going through the failure node are deleted
from the cache. In the next step, when source finds the error message, it will check for other
alternate route in the cache with next better path preference probability. If it exits, that route gets
selected for routing. Otherwise, a new route discovery phase is started. If network partition is
detected during route maintenance phase, then route erasure phase is invoked and all invalid
routes are deleted from cache.
Each node k∈ N has a height represented by as a quintuple: Hi= ( kτ ,oidk, rk , kδ , k ), where i) kτ :
A time tag indicating the time of link failure represents the reference level. ii) oidk: Originator-id,
id of node that defined the reference level. iii) rk: 1 bit used to divide each reference level into 2
sub-levels. iv) kδ : Integer used to order nodes with respect to a unique reference level and v) k:
Unique identifier of the node. Each node k (other than the destination) maintains a link-state array
with an entry LSk.j for each link (k, j) ∈ L, where j is a neighbor of k, L is total number of links.
The height of node k, Hk and that of its neighbor j, HNk,j determines the direction of the links, and
is directed from the higher node to the lower node. RRk is route-required flag of node k.
3.1. ROUTE DISCOVERY PHASE
Algorithm 1: Route Discovery
BEGIN
Step 1: Let, Source(S) wants to communicate with the destination (D) with the QoS constraints
bandwidth, delay, drain rate, energy. No path exists in the cache previously.
Step 2: S sets its height as NULL initially i.e (-,-,-,-, S).
Step 3: S sends a QRY Request_Ant packet to its neighbors and if the destination is not one hop
away from the intermediate node then node also sets its height as NULL and broadcasts the
packet.
Step 4: The QRY Request_Ant packet collects the information about bandwidth, delay, energy
and drain rate during traversal.
Step 5: When an intermediate node k receives a QRY Request_Ant, it has four options:
5.1.If node k has no downstream links and RRk is unset, it rebroadcasts the QRY
Request_Ant packet and sets RRk.
5.2.If node k has no downstream links and RRk is set, it discards the QRY Request_Ant
packet.
5.3.If node k has at least one downstream link and its height is NULL, it sets its height to Hk
= min {Hj | j∈Nk} + {0, 0, 0, 1, 0} and broadcasts a QRY Reply_Ant packet.
5.4.If node k has at least one downstream link and its height is non-NULL, and if a QRY
Reply_Ant packet has been broadcast since the link over which the QRY Request_Ant
packet was received became active, it discards the QRY Request_Ant packet. Otherwise
it broadcasts a QRY Reply_Ant packet. Also, if RRk is set when a link becomes active, it
broadcasts a QRY Request_Ant packet.
5. Computer Science & Information Technology (CS & IT) 393
Step 6: QRY Reply_Ant follows the route corresponding to the QRY Request_Ant but in reverse
order.
Step 7: When intermediate or source node k receives an QRY Reply_Ant from a neighbor j, k
updates HNk,j to reflect the height of node j received in the QRY Reply_Ant and performs one
activity from the two options:
7.1.If RRk is set (implying the height of node k is NULL), node k sets Hk = min {Hj | j∈Nk} +
{0, 0, 0, 1, 0}, updates the link LSk, unsets RRk and broadcasts a QRY Reply_Ant packet
with the new information.
7.2.If RRk is unset, node k updates the links in LSk.
Intermediate nodes also update the pheromone table according to equation (2) and
calculate the path preference probability according to equation (3) and also update the
probability table, and set the lower level node as downstream node.
Step 8: Source also calculates the Path Preference probability.
Step 9: If the calculated path preference probability is better than the requirements then the path
is accepted and stored in the cache.
Step 10: The path with the better Path Preference Probability is selected for data transmission.
END
3.2. ROUTE MAINTENANCE PHASE
Algorithm 2: Route Maintenance
BEGIN
Here 2 cases can occur:
Case 1:When an intermediate node k detects the route failure, if it has an outbound link
(Hk> HNk,j) i.e. another unexpired route exists in the cache, the route with better Path Preference
Probability is selected for routing.
Case 2:When an intermediate node detects the route failure, if it has no outbound link the
following sequence of steps are performed:
Step 1: The node generates an Error packet and sends to the source node and all intermediate
nodes delete routes from their cache which contains that node.
Step 2: As soon as source receives the error packet, it deletes routes from the cache which
contain the node and if an unexpired route exists in the cache, the route with next better
Path Preference Probability is selected for routing.
Step 3: After sending the Error packet, the node where link failure occur, starts local link
maintenance according to the following conditions:
a. Generate: Node k has no downstream links due to link failure.
( kτ ,oidk, rk) = (t, k, 0), where t is the time of failure.
6. 394 Computer Science & Information Technology (CS & IT)
( kδ , k) = (0, k).
Node k defines a new reference level, if k has no upstream neighbors, it sets Hk = NULL.
b. Propagate: Node k has no downstream links due to link reversal follow-
ing receipt of an UPD and the ordered sets ( kτ ,oidk, rk) are not equal for all j ∈ Nk.
( kτ ,oidk, rk) = max {( kτ ,oidk, rk) | j∈Nk}
( kδ ,k) = {min { jδ | j∈Nk with ( jτ ,oidj, rj) = max {( jτ ,oidj, rj) } - 1, k}.
Node k propagates the reference level of its highest neighbors and chooses a reference
lower than all neighbors of that reference level.
c. Reflect: Node k have no downstream links due to link reversal following
receipt of an UPD packet and the sets ( jτ ,oidj, rj) are equal with rj =0 for all j∈Nk.
( kτ ,oidk, rk) = ( jτ ,oidj, 1)
( kδ , k) = (0, k).
Node k reflects back the reference level by setting the r bit.
d. Detect: Node i has no downstream links due to link reversal following re- ceipt
of an UPD packet and the sets ( jτ ,oidj, rj) are equal with rj=1 for all j∈Nk and oidk=k.
( kτ ,oidk, rk) = (_, _, _)
( kδ , k) = (_, k).
Node k has detected a partition and route erasure phase invoked (described below).
e. Generate: Node k has no downstream links due to link reversal following
receipt of an UPD packet and the sets ( jτ ,oidj, rj) are equal with rj=1 for all j ∈Nk and
oidj∈k.
( kτ ,oidk, rk) = (t, k, 0), where t is the time of failure.
( kδ , k) = (0, k).
Node k experienced a link failure between the time it propagated a reference level and the
reflected higher sub-level returned from all neighbors. This link failure required no
reaction.
Step 4: Finally, after performing step 2, step 3, if the cache contains no unexpired routes, again a
new route discovery phase is started.
END
3.3 ROUTE ERASURE PHASE
Route erasure is initiated upon the detection of a partition. Node k sets its height and the height
entry for each j ∈Nk to NULL. However, if the destination is a neighbor, the corresponding height
array is set to ZERO. Node k then updates its link-state array LS, and broadcasts a CLR packet
that consists of a destination id, did and the reflected sub-level of node k, ( kτ ,oidk, 1). When a
node k receives a CLR packet from a neighbor j∈Nk, it reacts according to the following steps of
Algorithm 3:
7. Computer Science & Information Technology (CS & IT) 395
Algorithm 3: Route Erasure
BEGIN
Step 1: If the reference level in the CLR packet matches that of node k, it sets its height and the
height entry for each neighbor j∈Nk to NULL (unless the destination is a neighbor, in which
case the corresponding height array is set to ZERO), updates all the entries in its link-state
array LS, and broadcasts a CLR packet.
Step 2: If the reference level in the CLR packet does not match that of node k, it sets the height
entry for each neighbor j ∈Nk (with the same reference level in the CLR packet) to NULL and
updates the corresponding link-state array entries.
Step 3: Lastly, the hop in error is removed from the node's route cache and all routes containing
the hop are eliminated.
END
4. PERFORMANCE ANALYSIS
AMTR is an adaptive routing algorithm. So, it is suitable for the network where node mobility is
higher and no centralized control exists. It takes the advantages of both TORA and Ant Colony
Optimization technique.
This algorithm finds multiple paths between the source and the destination. Again, ACO always
does not find the shortest path. Rather at the time of path set up, it also takes care of the QoS
requirements and for this, link quality is improved. Besides this, if multiple paths exist and as ants
store paths, which satisfies the QoS requirements, losing any one path cannot affect the
communication. This is extremely necessary for the real time and multimedia communication.
Use of multi path routing also increases the packet delivery ratio, decreases the packet loss rate. It
also utilizes the bandwidth properly and for this, throughput and network stability or lifetime
increase.
AMTR’s design is aimed at minimizing the aggregate bandwidth by minimizing the control
packets. It also minimizes the communication overhead by localizing algorithmic reaction to
topological changes. Especially in case of link failure, the number of nodes that must participate
in the reaction is minimized in comparison with the other routing algorithms. In the first phase of
route maintenance of AMTR, if link failure occurs and at that time a downstream link exists then
only the route with valid QoS requirements is selected for routing. Thus, it minimizes the number
of control packets and consequently, the available bandwidth utilized properly.
5. CONCLUSION
An ant based QoS aware multipath routing algorithm AMTR is proposed in this paper which
supports real time and multimedia applications. It is more adaptive and provides energy efficient
routing by considering node’s remaining energy as well as drain rate (i.e. energy dissipation rate)
as one of the QoS parameters. In high mobility cases it is very efficient in terms of quick route
maintenance. This algorithm takes care of end to end delay, available bandwidth, and hop count
as QoS parameters which increase the network throughput. It is a multipath routing which
increases network stability. AMTR reduces the number of control packets and utilizes the
bandwidth properly which is also very efficient especially in case of dense networks.
8. 396 Computer Science & Information Technology (CS & IT)
ACKNOWLEDGEMENTS
The authors would like to thank West Bengal University Technology, Kolkata, India for the
supports and facilities provided to carry out this research. The authors also thank the reviewers
for their constructive and helpful comments.
REFERENCES
[1] P., Deepalakshmi, S., Radhakrishnan, (2009), “Ant Colony Based QoS Routing Algorithm for Mobile
Ad Hoc Networks”, International Journal of Recent Trends in Engineering, Vol. 1, No. 1, pp. 459-
462.
[2] S. B., Wankhade, M. S., Ali, (2011), “Route Failure Management Technique for Ant Based Routing
in MANET”, International Journal of Scientific & Engineering Research, Vol. 2, No. 9.
[3] R., Asokan, A. M., Natarajan, C., Venkatesh, (2008),“Ant Based Dynamic Source Routing Protocol to
Support Multiple Quality of Service (QoS) Metrics in Mobile Ad Hoc Networks”, International
Journal of Computer Science and Security, Vol. 2, No. 3.
[4] S., Kannan, T., Kalaikumaran, S., Karthik, V. P., Arunachalam, (2010), “Ant Colony Optimization for
Routing in Mobile Ad-Hoc Networks”, International Journal of Soft Computing, Vol. 5, No. 6, pp.
223-228.
[5] I., Kassabalidis, M. A., El-Sharkawi, R. J., Marks, P., Arabshahi, A. A., Gray, (2002), “Swarm
Intelligence for Routing in Communication Networks”, IEEE Globecom.
[6] S. J., Mirabedini, M., Teshnehlab, M. H, Shenasa, A., Movaghar, A. M., Rahmani, (2008), “AFAR:
Adaptive fuzzy ant based routing for communication networks”, Journal of Zhejiang University
Science A, Vol. 9, No. 12, pp. 1666-1675.
[7] D., Sensarma, K., Majumder, (2012), “A Comparative Analysis of the Ant Based Systems for QoS
Routing in MANET,” Recent Trends in Computer Networks and Distributed Systems
Security,Communications in Computer and Information Science, Volume 335, pp 485-496.
Authors
Debaji Sensarma has received his B.Sc degree in Computer Science in the year 2009
from university of Calcutta, Kolkata, India and M.Sc degree in computer Science in
the year 2011 from West Bengal State University, Kolkata, India. He obtained his
M.Tech. degree in Computer Science and engineering from West He is now pursuing
PhD from the department of Computer Science and Engineering, University of
Calcutta, Kolkata. He has published several papers in International journals and
conferences.
Koushik Majumder has received his B.Tech and M.Tech degrees in Computer
Science and Engineering and Information Technology in the year 2003 and 2005
respectively from University of Calcutta, Kolkata, India. He obtained his PhD degree
in the field of Mobile Ad Hoc Networking in 2012 from Jadavpur University,
Kolkata, India. Before coming to the teaching profession he has worked in reputed
international software organizations like Tata Consultancy Services and Cognizant
Technology Solutions. He is presently working as an Assistant Professor in the Dept.
of Computer Science & Engineering in West Bengal University of Technology,
Kolkata, India He has published several papers in International and National level journals and conferences.
He is a Senior Member, IEEE.