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.t
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.
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
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.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
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.
ECA MODEL BASED QOS AODV ROUTING FOR MANETSIJCNCJournal
Applications like banking, interactive multimedia, movie on demand, VOIP, etc., are delay sensitive by
nature. The QoS given to users will be affected by network delay, which can be mitigated by employing
QoS routing and efficient data transfer. To build routing table, normal AODV routing uses flooding
technique, which will not consider QoS requirements. Hence QoS based routing which is stable for the
entire application is essential, which understands the dynamic nature of the MANET and establishes the
required route, in minimum possible time. We have proposed an intelligent routing protocol based ECA
model and AODV for establishing QoS route.
The simulation results shows that the ECA model gives better results, while considering the local
connectivity time, source to destination connectivity time, number of data packets successfully delivered to
the destination, local and global error correction time, compared to AODV.
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.
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
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.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
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.
ECA MODEL BASED QOS AODV ROUTING FOR MANETSIJCNCJournal
Applications like banking, interactive multimedia, movie on demand, VOIP, etc., are delay sensitive by
nature. The QoS given to users will be affected by network delay, which can be mitigated by employing
QoS routing and efficient data transfer. To build routing table, normal AODV routing uses flooding
technique, which will not consider QoS requirements. Hence QoS based routing which is stable for the
entire application is essential, which understands the dynamic nature of the MANET and establishes the
required route, in minimum possible time. We have proposed an intelligent routing protocol based ECA
model and AODV for establishing QoS route.
The simulation results shows that the ECA model gives better results, while considering the local
connectivity time, source to destination connectivity time, number of data packets successfully delivered to
the destination, local and global error correction time, compared to AODV.
Rsaodv a route stability based ad hoc on demand distance vector routing prot...ijwmn
High mobility of mobile nodes is one of the major reasons for link failures in mobile ad hoc network (MANET). The present paper aims at proposing modification of well known Ad hoc On demand Distance Vector (AODV) routing protocol for MANET seeking stable route for data transmission and incorporating link break avoidance scheme for such networks. The performance of the proposed routing protocol, named as Route Stability based Ad hoc On demand Distance Vector (RSAODV), is evaluated considering some major performance metrics which include average route life time, throughput, packet delivery fraction, normalized routing load and end–to-end delay. The study is based on simulation runs adopting CBR traffic pattern taking care of node failure scenarios. The performance of RAODV is compared with AODV routing protocol. The simulation runs exhibit significant increase in average route life time, packet delivery fraction and throughput for RSAODV, on the other hand, the normalized routing load and end–to-end delay are reduced for this routing protocol as compared to AODV routing protocol.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
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.
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).
Link Prediction And Link Establishment Based On Network Nodes Life Time In Mo...inventionjournals
In this paper we propose a new modified adhoc routing algorithm for adhoc network that locally repairs a link failure and also conflicts the noise and link modification simultaneously. Due to topology changes caused by nodes’ mobility in adhoc network, the link routes get disconnected frequently. Our proposed scheme does a local repair of link failure and also takes care of malicious nodes with the help of a reliability measure while performing route discovery using link-prediction routing algorithm(LPRA). These two performance metrics are integrated by Route link-prediction algorithm. This algorithm is carried out as follows, Select the least dynamic route link with the longest lifetime for persistent data forwarding. Node Lifetime and link lifetime prediction methods. The receiver can measure the signal strength when it receives the packets from sender in same power level and then it calculates the distance between two nodes by applying the radio propagation model in LPRA using adhoc network. Simulation results show that our proposed schemeperforms better in comparison to a popular existing technique
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.
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Cross layer design for power control and linkIJCNCJournal
Frequent changes in network topology due to mobility and limited battery power of the mobile devices are the key challenges in the adhoc networks. The depletion of power source may cause early unavailability of nodes and thus links in the network. The mobility of nodes causes frequent routes breaks and adversely affects the required performance of the applications. We propose a cross layer design for the dynamic power control protocol and link prediction (DPCPLP) that provides a combined solution for power conservation as well as link availability. This combines the effect of optimum transmit power and received signal strength based link availability estimation with AODV routing protocol using cross layer approach.
This method proposes to use optimum transmit power for transmitting the packets to a neighboring node to
increase the battery life of adhoc nodes and received signal strength based link prediction to increase the
availability of the links. In this paper, the transmit power and received signal strength of the packets are
cross-layer interaction parameters to provide the combined solution for power conservation and reliable
route formation with increased availability of links and thus the routes amongst sources and destinations. Further, this increases network and nodes’ lifetime and capacity. It improves throughput and packet delivery ratio by spatial reuse, prior prediction of link breaks and initiating the route repair. It also reduces
end-to-end delay and power consumption by use of optimum transmit power. Through simulations, we have
shown that our proposed protocol shows better performance.
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.
Tony O'Connor: Integrating Marketing Data into Decision Making, 30 June 2014Nuffield Trust
In this slideshow, Tony O’Connor, National Director for Patients and Information, Department of Health discusses integrating marketing data into decision making.
Tony O’Connor spoke at the Nuffield Trust event: The future of the hospital, in June 2014.
Rsaodv a route stability based ad hoc on demand distance vector routing prot...ijwmn
High mobility of mobile nodes is one of the major reasons for link failures in mobile ad hoc network (MANET). The present paper aims at proposing modification of well known Ad hoc On demand Distance Vector (AODV) routing protocol for MANET seeking stable route for data transmission and incorporating link break avoidance scheme for such networks. The performance of the proposed routing protocol, named as Route Stability based Ad hoc On demand Distance Vector (RSAODV), is evaluated considering some major performance metrics which include average route life time, throughput, packet delivery fraction, normalized routing load and end–to-end delay. The study is based on simulation runs adopting CBR traffic pattern taking care of node failure scenarios. The performance of RAODV is compared with AODV routing protocol. The simulation runs exhibit significant increase in average route life time, packet delivery fraction and throughput for RSAODV, on the other hand, the normalized routing load and end–to-end delay are reduced for this routing protocol as compared to AODV routing protocol.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
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.
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).
Link Prediction And Link Establishment Based On Network Nodes Life Time In Mo...inventionjournals
In this paper we propose a new modified adhoc routing algorithm for adhoc network that locally repairs a link failure and also conflicts the noise and link modification simultaneously. Due to topology changes caused by nodes’ mobility in adhoc network, the link routes get disconnected frequently. Our proposed scheme does a local repair of link failure and also takes care of malicious nodes with the help of a reliability measure while performing route discovery using link-prediction routing algorithm(LPRA). These two performance metrics are integrated by Route link-prediction algorithm. This algorithm is carried out as follows, Select the least dynamic route link with the longest lifetime for persistent data forwarding. Node Lifetime and link lifetime prediction methods. The receiver can measure the signal strength when it receives the packets from sender in same power level and then it calculates the distance between two nodes by applying the radio propagation model in LPRA using adhoc network. Simulation results show that our proposed schemeperforms better in comparison to a popular existing technique
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.
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Cross layer design for power control and linkIJCNCJournal
Frequent changes in network topology due to mobility and limited battery power of the mobile devices are the key challenges in the adhoc networks. The depletion of power source may cause early unavailability of nodes and thus links in the network. The mobility of nodes causes frequent routes breaks and adversely affects the required performance of the applications. We propose a cross layer design for the dynamic power control protocol and link prediction (DPCPLP) that provides a combined solution for power conservation as well as link availability. This combines the effect of optimum transmit power and received signal strength based link availability estimation with AODV routing protocol using cross layer approach.
This method proposes to use optimum transmit power for transmitting the packets to a neighboring node to
increase the battery life of adhoc nodes and received signal strength based link prediction to increase the
availability of the links. In this paper, the transmit power and received signal strength of the packets are
cross-layer interaction parameters to provide the combined solution for power conservation and reliable
route formation with increased availability of links and thus the routes amongst sources and destinations. Further, this increases network and nodes’ lifetime and capacity. It improves throughput and packet delivery ratio by spatial reuse, prior prediction of link breaks and initiating the route repair. It also reduces
end-to-end delay and power consumption by use of optimum transmit power. Through simulations, we have
shown that our proposed protocol shows better performance.
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.
Tony O'Connor: Integrating Marketing Data into Decision Making, 30 June 2014Nuffield Trust
In this slideshow, Tony O’Connor, National Director for Patients and Information, Department of Health discusses integrating marketing data into decision making.
Tony O’Connor spoke at the Nuffield Trust event: The future of the hospital, in June 2014.
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.
Regione Lazio: costruire un Lazio 'creativo'RegioneLazio
L’industria creativa rappresenta una grande opportunità di sviluppo per la nostra regione in molti campi, come la moda e il design. Nel nostro territorio ci sono tanti giovani che hanno idee innovative ma non possono contare su qualcuno che li aiuti a realizzarle.
La creatività al centro del nostro modello di sviluppo. In particolare vogliamo raggiungere tre obiettivi fondamentali: rafforzare la classe creativa del Lazio, sostenere e incentivare l’impresa creativa e costruire spazi di accoglienza e promozione della creatività.
www.regione.lazio.it/lazio-creativo
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.
Estudo de caso sobre retrospectivas ágeis no indt i nd-tagileembassy
Apresentação feita por Soraya Ploia e Júlia Hipólito no último Regional Scrum Gathering no Rio de Janeiro, em setembro 2014.
Elas expuseram um estudo de caso sobre retrospectivas ágeis no INdT.
----------------------------------------
Presentation made by Soraya Ploia and Júlia Hipólito at Rio Regional Scrum Gathering, on September/2014.
They talked about agile retrospectives - a case study at INdT project teams.
IJCER (www.ijceronline.com) International Journal of computational Engineeri...ijceronline
Call for paper 2012, hard copy of Certificate, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJCER, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, research and review articles, IJCER Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathematics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer review journal, indexed journal, research and review articles, engineering journal, www.ijceronline.com, research journals,
yahoo journals, bing journals, International Journal of Computational Engineering Research, Google journals, hard copy of Certificate,
journal of engineering, online Submission
Quality of Service Routing in Mobile Ad Hoc Networks Using Location and Energ...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multipath protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
QUALITY OF SERVICE ROUTING IN MOBILE AD HOC NETWORKS USING LOCATION AND ENERG...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multi path protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
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
Quality of service Routing Using Stable Nodes in Mobile Ad hoc Networksijceronline
An efficient and secured routing protocol design is the vital concern for mobile ad hoc networks in view of major problems raising on security issues and loss of the network resources is due to changes within the connections of the network like Node failures, link breakages in the network. Our proposed scheme enhances the secured and reliable transmission of data, which also improves the network constancy, efficient packet delivery ratio and network life time by integrating through the AODV Routing protocol. It unites the authentication, stable routes and signal strength of the nodes to attain the secure and reliable transmission of data through nodes.
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.
Detecting Good Neighbor Nodes and Finding Reliable Routing Path Based on AODV...IOSR Journals
Wireless operations allow services, such as long-range communications, that are impossible or
impractical to implement with the use of wires. It is supported by well-liked technique known as Adhoc Protocol
[1]. The term is commonly used in the telecommunications industry to refer to telecommunications systems e.g.
radio transmitters and receivers, remote controls etc. which use some form of energy e.g. radio waves, acoustic
energy, etc. to transfer information without the use of wires.[1] Information is transferred in this manner over
both short and long distances.In this, routes may be detached due to lively movement of nodes. So route
assortment and topology grouping is not easy and demanding issue. This type of networks is more vulnerable to
both internal and external attacks due to presence of wicked neighbour nodes[1][2s. Paper see the sights new
method using AODV protocol to find out good neighbour node and finding reliable path according to their
signal strength, flow capacity relative position of node in network.
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.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...ijngnjournal
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any fixed network infrastructure or centralized administration. In order to enable communication within the network, a routing protocol is needed to discover routes between nodes. The primary goal of ad hoc network routing protocols is to establish routes between node pairs so that messages may be delivered reliably and in a timely manner. The objective of any routing protocol is to have packet delivered with least possible cost in terms of receiving power, transmission power, battery energy consumption and distance. All these factors basically effect the establishment of link between the mobile nodes and liability and stability of these links. In this paper, we implement a data link quality scheme on two protocols ODMRP and ADMR and compare them on the bases link quality and link stability.
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.
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.
Link Stability and Energy Aware routing Protocol for Mobile Adhoc NetworkIOSR Journals
Abstract: MOBILE ad hoc networks (MANETs) have more popularity among mobile network devices and
wireless communication technologies. A MANET is multihop mobile wireless network that have neither a fixed
infrastructure nor a central server. Every node in a MANET will act as a router, and also communicates with
each other. The mobility constraints in mobile nodes will lead to problems in link stability. Energy saving, path
duration and stability will be two major efforts and to satisfy them can be difficult task. A self node which is
present in the network may also consume little energy during the transmission. This proposed approach tries to
account for link stability and for minimum drain rate energy consumption. In order to verify the correctness of
the proposed solution a objective optimization formulation has been designed and a novel routing protocol
called Link-Stability and Energy aware Routing protocols is proposed. This novel routing scheme has been
compared with other two protocols: PERRA and GPSR. The protocol performance has been evaluated in terms
of Data Packet Delivery Ratio, Normalized Control Overhead, Link duration, Nodes lifetime, and Average
energy consumption.
Keywords-component; Energy Consumption, Link Stability, Routing, Self node
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.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
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.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
"Impact of front-end architecture on development cost", Viktor TurskyiFwdays
I have heard many times that architecture is not important for the front-end. Also, many times I have seen how developers implement features on the front-end just following the standard rules for a framework and think that this is enough to successfully launch the project, and then the project fails. How to prevent this and what approach to choose? I have launched dozens of complex projects and during the talk we will analyze which approaches have worked for me and which have not.
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.
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
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
PHP Frameworks: I want to break free (IPC Berlin 2024)
R045059297
1. Gaurav J. Bhatt et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 5( Version 5), May 2014, pp.92-97
www.ijera.com 92 | P a g e
Enhancing Route Maintenance in RS-AODV
Gaurav J. Bhatt*, Amit M. Lathigara**
*(CE Department, School of Engineering, RK University, Bhavnagar Road, Rajkot 360002, India
** (HOD CE Department, School of Engineering, RK University, Bhavnagar Road, Rajkot 360002, India
ABSTRACT
Mobile Ad hoc Networks (MANETs) are temporary formed, infrastructure-less networks. The performance
metrics degrades due to the unstable channel conditions, network connectivity, and mobility and resource
limitations. To improve different performance metrics, various cross-layering techniques are used where
different layers from protocol stack communications with each other via exchange of information. Ad hoc on
demand Routing Protocol (AODV) is a well reactive ad hoc routing protocol. We proposed RS-AODV (Route
Stability based AODV), a modified version of AODV routing protocol, based on route discovery by utilizing
Physical Layer information instead of the minimum hop count approach of the default distance vector algorithm.
Our research will also elaborate how the proposed model uses the received Signal Strength (RSSI) to find its
route. We will focus on parameters like traffic throughput, response, time, packet loss, delay, link stability,
optimal usage of battery resource to increase overall lifetime of a network. And also use novel approach “make
before break” that starts finding alternate route when it seems link failure due to mobility of node. Simulation
results show that RS-AODV has performance better that AODV routing protocol in terms of the metrics: End-
to-End delay, Packet Delivery Ratio, Network Routing Load and number of route repairs.
Keywords - AODV, Link Failure, MANET, NS2, Route Stability, RSSI.
I. Introduction
A mobile ad-hoc network (MANET) [1] is
composed of mobile nodes that form distributed
systems without any fixed infrastructure or
centralized administration. In these systems, nodes
can be freely and dynamically self organized into
arbitrary and temporary, “ad-hoc” network
topologies, nodes communicate with each other
directly or via intermediate nodes. Packets are
transferred to neighboring nodes along with the path
from the source node to the destination node is done
by intermediate nodes. In MANET each node works
as a router and autonomously performs mobile
functionality. The link connectivity changes
continuously due to mobility, to reflect this routing
information also needs to get changed continuously.
The performance of MANETs is related to efficiency
of routing protocols and efficiency depends on
several factors like convergence time after topology
changes, bandwidth overhead to enable proper
routing, power consumption. Efficient routing
protocols are needed for the network as the link
failure is high due to the dynamic network topology
and the packet drops as it travels through multiple
hops. Routing protocols for static network are not
suitable for MANET. Most of these protocols use
min-hop as the route selection metric. It is found that
shortest path route has short lifetime, especially in
highly dense ad hoc networks even with low
mobility; due to edge effect they do not address the
issue of reducing the path breakage during data
transmission. In most of the on-demand routing
algorithms it will take some time to detect the link
failure after which, route recovery procedures are
initiated. These procedures consumes substantial
amount of resources like bandwidth, power,
processing capacity at nodes and also introduce extra
delay. The efficiency of networks is greatly reduced
due to re-route discoveries.
Link stability is a measure of how stable the
link is. Stability based routing protocols tends to
select paths that will last longer. Signal strength, pilot
signals, relative speed between nodes are the
parameters used for the computation of link stability.
RS-AODV is an extension of AODV that integrates
route stability into route discovery. It ensures the
selected path to be valid for sufficiently longer period
and also extends the lifetime of the network. In this
work, we propose a novel "make-before-break"
mechanism, to enhance the route maintenance in RS-
AODV. This mechanism find an alternate route for
data transfer, when there seems any possibility for
link break due to mobility through cross layer
approach. Performance results show that RS-AODV
with route maintenance outperforms AODV in high
load and highly dynamic environment.
This paper is organized as follows. Section
II represents the related work on various stability
based routing and route maintenance approaches. In
section III, we describe the proposed RS-AODV with
"make before break" mechanism in detail. Section IV
depicts performance evaluation and comparison
results with similar protocols. Section V concludes
the proposed work and future work.
RESEARCH ARTICLE OPEN ACCESS
2. Gaurav J. Bhatt et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 5( Version 5), May 2014, pp.92-97
www.ijera.com 93 | P a g e
II. Related Work
We expose relevant research work related to
stability based routing and route maintenance
approaches.
SQ-AODV [2] - authors proposed Stability-
based QoS-capable Ad-hoc On-demand Distance
Vector protocol, is an enhancement AODV protocol
in which residual node energy is used for route
selection and maintenance. It also proposed a novel
make- before-break mechanism that finds an alternate
route when energy of node goes below threshold. It
provides stable routes by accounting for the residual
life-time calculated using the current Average-
Energy-Drain-Rate (AEDR)) at intermediate nodes
and the duration of the session at the route selection
stage. This minimizes packet loss and session
disruptions. SQ-AODV proactively re-routes
sessions, without losing any packets, this provides
near-zero packet loss and superior QoS performance.
In [3] node measure the signal strength of
the link and send Route Request to other node, after
that intermediate node accept that packet compare the
signal strength value of the link with Route Request
packet, if it is less than packet value then its modified
the packet value with minimum value and forwarded
to other node until it reach to the destination, with the
help of this approach weak link of the route is
calculated ,after receiving Route Request by the
destination node ,its send the Route Reply with
minimum of the route to source then source node first
select earliest established path to forward packets,
then changes to the strongest signal strength path for
long transmissions.
In this paper [4] every node maintains the
RSSI table , RSSI table contain the signal strength
value of node’s neighbour, with the help of this RSSI
table node predict that his neighbour node is moving
away from us, after predicting the link failure it
performs following steps:
i) Dropping: If the quality of link is severely
damaged or the link is already broken, then this
method drops the packet.
ii) Relaying: In this technique, a node can become a
relay node when both sender and receiver are in its
neighbour table and forward the data between source
and destination, if the link is fail between source and
destination.
iii) Selective forwarding: In this technique, the
intermediate node drops the packet if it comes from
bad links.
LAER [5] – in this paper authors proposed
A link stability and energy aware routing (LAER)
protocol, which consider joint metric of link stability
and energy drain rate into route discovery, and on the
local topology knowledge, which results in reduced
control overhead and balanced traffic load. It
increases the link stability of the transmission. To
account the energy consumption and link stability of
mobile nodes, a bi-objective integer programming
(BIP) mode was formulated.
In [6] proposed model predict the lifetime of
a routing path, based on mobility and prediction
technique. It considers a probability model derived
through the subdivision into cells of the area where
mobile nodes move and on the observations of node
movements in these cells. Each connection between
a mobile node in a cell and the other mobile nodes
among its neighbour cells is considered as the state of
the wireless link. In this way, the wireless link
dynamic is determined between a mobile node and its
neighbours, permitting the calculation of the link
lifetime. After this, through the assumption of
independent link failure, the route breakage
probability is derived. More details can be found in.
Link life based routing protocol (LBR) [7] is
stability-based routing protocol. It converts signal
strength into distance using a free space propagation
model assumption. LBR estimates link lifetime based
on estimated distance and speed of nodes. When the
source node initiates a route request, each
intermediate node attaches its estimated link lifetime
to the route request message. When the destination
receives it, it starts calculating the path lifetime for
that path. So, the destination can select a path that is
expected to have the longest lifetime. In order to
react to path breakage, proactive and reactive
maintenance is proposed in LBR. In reactive
maintenance, the source node needs to reinitiate a
route request to the destination, which results in
increased delay and control overhead. In proactive
maintenance, a backup path is found prior to path
breakage. However, the estimated path lifetime is not
valid when a path is broken. Therefore, the backup
path may be unstable. The purpose of stable routing
should be not only reducing routing overhead but
also increasing packet delivery ratio.
We propose EBL (A Routing Protocol for
Extend network life time through the Residual
Battery and Link Stability in MANET) [8]. The EBL
considers distance among neighbour nodes, Residual
Battery Capacity and Link Stability. EBL considers
distance among neighbour nodes, Residual Battery
Capacity and Link Stability. EBL is able to increase
the Lifetime of Network through minimizing the
whole energy consumption and distribute the traffic
load. A route is selected in consideration of Residual
Battery Capacity, Link Stability and distance vector
to prevent unbalanced energy consumption of nodes.
In [9] Li et al. have proposed the link
prediction in the AODV routing protocol by
establishing a signal intensity threshold which is Pr-
THRESHOLD. If the received signal intensity is
lower than the threshold, the upstream node will
calculate the distance between it and the sending
node through the intensity of the received packet
signal, and estimate the relative velocity between it
3. Gaurav J. Bhatt et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 5( Version 5), May 2014, pp.92-97
www.ijera.com 94 | P a g e
and the sending node through the time difference of
the neighbouring received data and the intensity of
the packet signal. Then, according to the relative
position and the relative velocity with the sending
node, a node can estimate when to send a RRER to
the sending node to warning it about a link failure.
When the source node received this RRER message,
it will start its restored process searching its routing
table and find another route to the destination.
In [10] Qin & Kunz have dealt with the
problem of link failure prediction by proposing an
equation to calculate the exact time that a link
breakage can occur. They named their method the
link breakage prediction algorithm. In their idea, each
node maintains a table that contains the previous hop
node address, the value of the received packet signal
power, and the time which this data packet has been
received. After receiving three data packets, a node
will calculate the link breakage time and compare it
with a fixed threshold. If the node predicted that the
link with its previous neighbour will have a link
breakage soon, it will send a warning message to the
source node of the active route to warn it about the
link breakage probability. If the source still needs the
route it will perform a route discovery process to
establish a new route to the destination. Their idea
has been implemented using DSR routing protocol.
In [11] Choi et al. has dealt with the problem
of link breakage prediction in vehicular ad hoc
network. They proposed an algorithm to predict a
link breakage possibility using the value of the RSSI
(Received Signal Strength Indicator). Each vehicle in
the network periodically scans the received signals
from its neighbours and uses the collected value to
calculate the distance, the velocity, and the
acceleration of its next hop which it receives data
packets from. By calculating these three values, the
node can predict if a link breakage will occur, and
can determine if the effected link can be maintained
or a new link is needed to be constructed. If the
effected vehicle found that a link breakage in the link
with its next hop will occur, it will use one of its
neighbours which has the highest value of RSSI with
(that means the one which is the nearest to it) to build
a new link with before the previous link with its other
neighbour becomes broken.
In [12] authors have proposed a stable,
weight-based, on-demand routing protocol. The
“weight” carried in the protocol messages used to
select stable routes is based on three components:
Route Expiration Time (RET), which is the predicted
time of link breakage between two nodes due to
mobility, Error Count (EC), which captures the
number of link failures due to mobility, and Hop
Count (HC). The authors have assumed that all nodes
are synchronized via a Global Positioning System
(GPS), so that two adjacent nodes may predict the
RET. While the proposed scheme may combat
against link breaks due to mobility, link breaks due to
the draining node energy is a factor that also must be
accounted for when computing weights for stable
routing.
In [13] the authors have proposed a stable
route selection scheme based on Link Expiration
Time Threshold (LETth). The Link Expiration Time
(LET) is computed based on a prediction of
neighbour mobility. LET computation needs to know
the position of the neighbours, and hence requires
periodic topology updates.
[14] Paper proposed a novel scheme to
enhance the route maintenance process in Route
Stability and Energy Aware Routing (RSEA-AODV)
protocol that keep track of stability and energy
metrics during route discovery, through cross layer
approach. In this work, we propose a novel "make-
before-break" mechanism, to enhance the route
maintenance in RSEAAODV. This mechanism finds
an alternate route for data transfer, when there seems
any possibility for link break due to mobility, energy
drain and congestion, through cross layer approach.
At some fixed interval it continuously check the
status of established route, if any node is in critical
battery state or receiving weaker signal or interface
queue length increases beyond the threshold then it
starts finding alternate route before it actually breaks.
This mechanism increases packet delivery ratio and
reduces the number of packet drops and delay
incurred.
In this paper [15] authors proposed a method
which measures signal strength between nodes and
compare with RSSI threshold values. If RSSI is
greater than threshold value then it is accepted for
further processing otherwise it is discarded. It
increases the lifetime of the network by selecting a
strong route to the destination can. Stable route in
MANETs is a route that is established for an
acceptable period for transmission.
III. Proposed Work
In the MANET, one of the major constraints
is unpredictable link failure. Major challenge of
routing protocol is to reduce the link failure due to
the mobility of node in the network. To achieve this,
stable route is required which is more flexible in
mobile networks. Stable route in MANETs is a route
that is established for an acceptable period for
transmission. So we propose a new model for routing
protocol that created routes have more stability, to
implement it we used received signal strength
indicator (RSSI) metric to find stable route from
source to destination. The following cases are used to
forward the data over the network.
3.1 Route Discovery
When a node needs to send packets to some
destination, it searches for route in its route cache. If
4. Gaurav J. Bhatt et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 5( Version 5), May 2014, pp.92-97
www.ijera.com 95 | P a g e
route to the destination is not available, the source
will broadcast route request RREQ to its neighbors.
On receiving a RREQ packet, intermediate nodes
measure the strength at which it received the packet.
If the signal strength (RSSI) is above the threshold
value, it stores RSSI value into cache, and if RSSI is
less than threshold value then it drops the route
request.
Algorithm 1: Implemented in Intermediate Node
If (Node listen a RREQ) {
If (same as forwarded in near past) {
Discard;
}
Else //This is a new RREQ {
Calculate RSSI
If (RSSI < RSSI_Thr1) then
Drop packet P
Return
End If
Else
Entry for Reverse Route // (Route from node to
originator of this RREQ message) {
// update the sequence no. ,
// Set the valid flag for route,
// Change the life time for route to
originator.
Update the routing table entries for originator IP
address;
Increase the hop count by one in RREQ packet;
}
IF (TTL > 1) {
Decrease the TTL field by one;
If [(Node is Destination for this RREQ) OR
(Node has route to destination)] {
Send RREP;
Discard RREQ;
}
Else {
Broadcast RREQ;
}
}
}
}
3.2 Route Maintenance
After establishing route between source and
destination, each intermediate node continuously
monitors the established link status. On receiving
data packets, each intermediate node calculates RSSI
value from received packet at MAC layer and passes
it to the network layer. At network layer routing
protocol compare RSSI with RSSI Threshold
(RSSI_Thr2) value, if it is below Threshold then it
queued the received packet and send route error
message to the source and also intimate source to find
alternate route in order to continue communication.
Algorithm 3: Route Maintenance by Make-Before-
Break Mechanism
Input: A Data Packet P from neighbor node
Calculate RSSI
If (RSSI < RSSI_Thr2)
Queue packet into cache
Send RERR
Send Route Request to Source
Return
End if
IV. Simulation And Performance
evaluation
In this section, the performance of AODV
and RS-AODV are evaluated using NS2.
4.1 Calculation of RSSI value
The RSSI value is calculated with the help
of two ray ground model
(1)
Pr: Power received at distance d
Pt: Transmitted signal power
Gt: Transmitter gain (1.0 for all antennas)
Gr: Receiver gain (1.0 for all antennas)
ht: Transmitter antenna height (1.5 m for all antennas)
hr: Receiver antenna height (1.5 m for all antennas)
d: Distance from the transmitter
L: Path loss (1.0 for all antennas)
4.2 Performance Metrics
Packet Delivery Ratio: Packet Delivery
Ratio (PDR) is the ratio between the number of
packets transmitted by a traffic source and the
number of packets received by a traffic sink.
Normalized Control Overhead: It is the ratio of
control packets sent and the number of packets
delivered at the destinations.
End-End Delay: It is a measure of the
average time a data packet has taken to reach its
destination.
No. of Route Repairs: total number of local
route repairs.
4.3 Simulation Parameters
We have simulated it in NS 2.35. We used simulation
parameters, which are listed in the table.
Table: Simulation Parameters
Parameter
Name
Value
Topology 800×800, 1000×1000, 2450×2450
and 3500×3500 (m)
5. Gaurav J. Bhatt et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 5( Version 5), May 2014, pp.92-97
www.ijera.com 96 | P a g e
No. of Nodes 50, 100, 250 and 500
Mobility Model Two Ray ground
Simulation
Time
50 Seconds
Pause Time 5
No. of
Connections
20
Buffer length 60
MAC Protocol IEEE 802.11
Packet Size 512 Bytes
Traffic Type Cbr
Mobility Speed 5 m/s
Traffic Rate 4 Packets/Second
4.4 Simulation Results
We simulated RS-AODV along with AODV
using NS2. In this section, we present the simulation
results and compare RS-AODV with AODV.
Fig. 1 End-To-End Delay versus Number of Nodes
Fig. 1 shows graph of end to end delivery
ratio vs. number of nodes. It shows that as the
number of node increases end to end delay also
increases. In AODV end to end delay increases
rapidly as compared with RS-AODV. Reason behind
the reduction in end to end delay is because of the
selective processing of signals. Weaker signals are
discarded at the routing layer after comparing the
RSSI with Signal threshold. This makes only selected
signals entering into further processing phase thus
reducing the end to end delay.
Fig. 2 Normalized routing Load versus Number of
Nodes
Fig. 2 shows graph of normalized routing
load vs. number of nodes. In that as the number of
nodes increases routing overhead also increases, RS-
AODV avoid unreliable mobile nodes from the route,
it requires less rerouting and leads to less control
overhead. So in large network RS-AODV perform
better than AODV.
Fig. 3 Packet Delivery Ratio versus Number of
Nodes
Fig. 3 shows graph of packet delivery ratio
vs. number of nodes. RS-AODV selects the most
reliable path so number of packet drop is also low as
compare to AODV. Make before break avoids link
failure due to node mobility, so the packet delivery
ratio is also better than AODV in denser network.
Fig. 4 No. of Route Repairs versus Number of Nodes
Fig. 4 shows graph of route repairs vs.
number of nodes. As number of nodes increases
number of route repairs also increases. RS-AODV
attempts less route repairs compare to AODV
because of make before break mechanism, which
finds alternate route before route breaks.
V. Conclusion and Future Work
This paper presented new routing protocol
RS-AODV which is extension of existing AODV
routing protocol. RS-AODV incorporates route
stability using received signal strength indication
parameter in the route discovery. Make-before-Break
mechanism enhances route maintenance approach
and reduces link failure. Simulation results showed