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.
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
Experiment of Routing Protocol AODV (AdHoc On-demand Distance Vector)IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity
The Effects of Speed on the Performance of Routing Protocols in Mobile Ad-hoc...Narendra Singh Yadav
Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. Researchers have conducted many simulations comparing the performance of these routing protocols under various conditions and constraints. One question that arises is whether speed of nodes affects the relative performance of routing protocols being studied. This paper addresses the question by simulating two routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and speed.
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
Experiment of Routing Protocol AODV (AdHoc On-demand Distance Vector)IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity
The Effects of Speed on the Performance of Routing Protocols in Mobile Ad-hoc...Narendra Singh Yadav
Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. Researchers have conducted many simulations comparing the performance of these routing protocols under various conditions and constraints. One question that arises is whether speed of nodes affects the relative performance of routing protocols being studied. This paper addresses the question by simulating two routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and speed.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
IMPROVED NETWORK CONNECTIVITY IN MANETSIJCNCJournal
The growth in wireless communication technologies has resulted in a considerable amount of
attention given to mobile adhoc networks. All mobile hosts in an adhoc network are embedded with
packet forwarding capabilities. It is decentralized and is independent of infrastructure. Since mobile
hosts in an adhoc network usually move freely, the topology of the network changes dynamically and
disconnection occurs frequently. These characteristics require the routing protocols to find an
alternative path towards the destination for data transfer. The existing on-demand routing protocols
does the alternative path establishment only after the disconnection of links in the existing path. The
data sent by the source during alternate path establishment period will be lost leading to incomplete
data transfer. The network traffic will therefore increase considerably. This problem can be overcome
by establishing an alternative path when the existing path is more likely to be broken, by sending a
warning message to the source indicating the likelihood of disconnection. In this paper an attempt has
been made to analyze a protocol that improves the network connectivity by preempting the alternative
path before the existing link gets failed by monitoring the signal strength and ‘age of the path’.
Mobile Ad hoc Networks (MANETs) are characterized by open structure, lack of standard infrastructure
and un-accessibility to the trusted servers. The performance of various MANET routing protocols is
significantly affected due to frequently changing network topology, confined network resources and
security of data packets. In this paper, a simulation based performance comparison of one of the most
commonly used on-demand application oriented routing protocols, AODV (Ad hoc on-demand Distance
Vector) and its optimized versions R-AODV (Reverse AODV) and PHR-AODV (Path hopping based
Reverse AODV) has been presented. Basically the paper evaluates these protocols based on a wide set of
performance metrics by varying both the number of nodes and the nodes maximum speed. A NS-2 based
simulation study shows that, as compared to AODV and PHR-AODV, R-AODV enhances the packet
delivery fraction by 15-20% and reduces the latency approximately by 50%. R-AODV requires lesser node
energy for data transmission.
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
MANET is a cooperative wireless network in which mobile nodes are responsible for routing and
forwarding packets from and to other nodes. Noncooperation is a challenge that definitely degrades the
performance of MANET. A misbehaving or selfish node may make use of other nodes in the network, but
decline to share its own resources with them. These selfish nodes may severely affect the performance of
routing protocols in MANET.
In this paper, we compare the performance of four routing protocols under security attack of node
misbehavior in MANET. We investigate AODV and DSR reactive routing protocols and OLSR and GRP
proactive routing protocols using Riverbed Modeler simulator. The performance comparison is carried out
using two types of misbehaving nodes. The metrics used are End-to-End delay, Packet Delivery Ratio, Data
dropped and the Load. The experimental results show that AODV routing protocol performs better than the
other routing protocols with higher packet delivery ratio. Further, OLSR routing protocol outperforms the
other routing protocols with minimum End-to-End delay.
A Study on Ad Hoc on Demand Distance Vector AODV Protocolijtsrd
Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd24006.pdf
Paper URL: https://www.ijtsrd.com/computer-science/computer-network/24006/a-study-on-ad-hoc-on-demand-distance-vector-aodv-protocol/dr-r-madhanmohan
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Narendra Singh Yadav
An ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple “hops” may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. This paper presents performance comparison of the three routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and pause time. Simulation revealed that although DSDV perfectly scales to small networks with low node speeds, AODV is preferred due to its more efficient use of bandwidth.
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksIJCNCJournal
A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.
A Mobile Ad-hoc network is a set of mobile terminals moving in different directions at different
speed being wirelessly connected to each-other. In this paper we study the proactive Link State Routing
Protocol – OLSR, which uses hello and topology control (TC) messages to find then distribute link state
data throughout the mobile ad hoc network. Individual nodes use this topology data to calculate next hop
destinations for all nodes within the network using shortest hop forwarding paths. We then suggest ways
by which the existing algorithm can be optimized in terms of delay, throughput, power consumption, jitter
etc. Finally we summarize the applications of OLSR.
Research Inventy : International Journal of Engineering and Scienceresearchinventy
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.
Research Inventy : International Journal of Engineering and Scienceresearchinventy
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.
IMPROVED NETWORK CONNECTIVITY IN MANETSIJCNCJournal
The growth in wireless communication technologies has resulted in a considerable amount of
attention given to mobile adhoc networks. All mobile hosts in an adhoc network are embedded with
packet forwarding capabilities. It is decentralized and is independent of infrastructure. Since mobile
hosts in an adhoc network usually move freely, the topology of the network changes dynamically and
disconnection occurs frequently. These characteristics require the routing protocols to find an
alternative path towards the destination for data transfer. The existing on-demand routing protocols
does the alternative path establishment only after the disconnection of links in the existing path. The
data sent by the source during alternate path establishment period will be lost leading to incomplete
data transfer. The network traffic will therefore increase considerably. This problem can be overcome
by establishing an alternative path when the existing path is more likely to be broken, by sending a
warning message to the source indicating the likelihood of disconnection. In this paper an attempt has
been made to analyze a protocol that improves the network connectivity by preempting the alternative
path before the existing link gets failed by monitoring the signal strength and ‘age of the path’.
Mobile Ad hoc Networks (MANETs) are characterized by open structure, lack of standard infrastructure
and un-accessibility to the trusted servers. The performance of various MANET routing protocols is
significantly affected due to frequently changing network topology, confined network resources and
security of data packets. In this paper, a simulation based performance comparison of one of the most
commonly used on-demand application oriented routing protocols, AODV (Ad hoc on-demand Distance
Vector) and its optimized versions R-AODV (Reverse AODV) and PHR-AODV (Path hopping based
Reverse AODV) has been presented. Basically the paper evaluates these protocols based on a wide set of
performance metrics by varying both the number of nodes and the nodes maximum speed. A NS-2 based
simulation study shows that, as compared to AODV and PHR-AODV, R-AODV enhances the packet
delivery fraction by 15-20% and reduces the latency approximately by 50%. R-AODV requires lesser node
energy for data transmission.
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
MANET is a cooperative wireless network in which mobile nodes are responsible for routing and
forwarding packets from and to other nodes. Noncooperation is a challenge that definitely degrades the
performance of MANET. A misbehaving or selfish node may make use of other nodes in the network, but
decline to share its own resources with them. These selfish nodes may severely affect the performance of
routing protocols in MANET.
In this paper, we compare the performance of four routing protocols under security attack of node
misbehavior in MANET. We investigate AODV and DSR reactive routing protocols and OLSR and GRP
proactive routing protocols using Riverbed Modeler simulator. The performance comparison is carried out
using two types of misbehaving nodes. The metrics used are End-to-End delay, Packet Delivery Ratio, Data
dropped and the Load. The experimental results show that AODV routing protocol performs better than the
other routing protocols with higher packet delivery ratio. Further, OLSR routing protocol outperforms the
other routing protocols with minimum End-to-End delay.
A Study on Ad Hoc on Demand Distance Vector AODV Protocolijtsrd
Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd24006.pdf
Paper URL: https://www.ijtsrd.com/computer-science/computer-network/24006/a-study-on-ad-hoc-on-demand-distance-vector-aodv-protocol/dr-r-madhanmohan
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Narendra Singh Yadav
An ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple “hops” may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. This paper presents performance comparison of the three routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and pause time. Simulation revealed that although DSDV perfectly scales to small networks with low node speeds, AODV is preferred due to its more efficient use of bandwidth.
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksIJCNCJournal
A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.
A Mobile Ad-hoc network is a set of mobile terminals moving in different directions at different
speed being wirelessly connected to each-other. In this paper we study the proactive Link State Routing
Protocol – OLSR, which uses hello and topology control (TC) messages to find then distribute link state
data throughout the mobile ad hoc network. Individual nodes use this topology data to calculate next hop
destinations for all nodes within the network using shortest hop forwarding paths. We then suggest ways
by which the existing algorithm can be optimized in terms of delay, throughput, power consumption, jitter
etc. Finally we summarize the applications of OLSR.
Research Inventy : International Journal of Engineering and Scienceresearchinventy
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.
Research Inventy : International Journal of Engineering and Scienceresearchinventy
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.
Research Inventy : International Journal of Engineering and Scienceresearchinventy
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.
Research Inventy : International Journal of Engineering and Scienceresearchinventy
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.
Research Inventy : International Journal of Engineering and Scienceresearchinventy
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.
Survey of Modified Routing Protocols for Mobile Ad-hoc Networkijsrd.com
In last few years extensive research work has been done in the field of routing protocols for Ad-hoc Network. Various routing protocols have been evaluated in different network conditions using different performance metrics. A lot of research has been done how to modify standard routing protocol in ad-hoc network to improve its performance. The hop count is not only metric that gives efficient routing path. There are various modified protocols which make the use of other parameters along with hop count to select the best routing path to the destination. In standard Ad-hoc On-demand Distance Vector (AODV) routing protocol only hop count is used for selecting the routing path. In this paper we have studied variants of AODV protocols with modified routing metric.
AODV Improvement by Modification at Source Node and Securing It from Black Ho...IJERA Editor
MANETS suffer from constraints in power, storage and computational resources ,as a result, they are more
vulnerable to various communications security related attacks. therefore we attempt to focus on analyzing and
improving the security of routing protocol for MANETS viz. the Ad hoc On Demand Distance Vector
(AODV)routing protocol. We propose modifications to the AODV we propose an algorithm to counter the
Black hole attack on the routing protocols in MANETs. All the routes has unique sequence number and the
malicious node has the highest Destination Sequence number and it is the first RREP to arrive. So the
comparison is made only to the first entry in the table without checking other entries in the table
An Effective and Scalable AODV for Wireless Ad hoc Sensor Networksijcnes
Appropriate routing protocol in data transfer is a challenging problem of network in terms of lower end-to-end delay in delivery of data packets with improving packet delivery ratio and lower overhead as well. In this paper we explain an effective and scalable AODV (called as AODV-ES) for Wireless Ad hoc Sensor Networks (WASN) by using third party reply model, n-hop local ring and time-to-live based local recovery. Our goal is to reduce time delay for delivery of the data packets, routing overhead and improve the data packet delivery ratio. The resulting algorithm AODV-ES is then simulated by NS-2 under Linux operating system. The performance of routing protocol is evaluated under various mobility rates and found that the proposed routing protocol is better than AODV.
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.
Analysis of Blackhole Attack in AODV and DSR IJECEIAES
Mobile Ad-Hoc Networks (MANETs) are supreme ruler and demoralization wireless scheme. MANETs are infrastructure less i.e. their structure is not fixed, and the nodes be able to move about and can leave the network whenever they want. The nodes are to perform as more over router and host. In MANETs, the node can be in contact with every node as their configuration is not fixed and the nodes starts transmitting the packets to each other for the establishment of the connection. To hitch the link, the nodes make use of some routing protocols like Ad-Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and DestinationSequenced Distance Vector (DSDV). Security in MANET is the key matter meant for the fundamental utility of network. There are many attacks caused in MANET. Blackhole attack is one that occurs in MANET. A Black hole attack is an attack where the node, which is malicious advertise itself as having the optimal route to the destination and drops all the packets instead of forwarding further t o the destination. Here, we have shown the blackhole attack in AODV and DSR. Through simulation we evaluate the performance of the two above protocols under blackhole attack.
Performance Observation of Proactive and Reactive Routing Protocols with Incr...Computer Science Journals
Mobile Ad-hoc network (MANET) is type of wireless network in which group of mobile nodes co-operate to forward the data packets to their neighbours without using centralized authority or any physical medium like cables or base station.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Performance Improvement of Multiple Connections in AODV with the Concern of N...pijans
Mobile Ad-hoc Networks (MANETS) consists of a collection of mobile nodes without having a central
coordination. In MANET, node mobility and dynamic topology play an important role in the performance.
MANET provide a solution for network connection at anywhere and at any time. The major features of
MANET are quick set up, self organization and self maintenance. Routing is a major challenge in MANET
due to it’s dynamic topology and high mobility. Several routing algorithms have been developed for
routing. This paper studies the AODV protocol and how AODV is performed under multiple connections in
the network. Several issues have been identified. The bandwidth is recognized as the prominent factor
reducing the performance of the network. This paper gives an improvement of normal AODV for
simultaneous multiple connections under the consideration of bandwidth of node.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
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
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
Similar to Research Inventy : International Journal of Engineering and Science (20)
IJCER (www.ijceronline.com) International Journal of computational Engineeri...
Research Inventy : International Journal of Engineering and Science
1. Research Inventy: International Journal Of Engineering And Science
Issn: 2278-4721, Vol. 2, Issue 3 (February 2013), Pp 27-29
Www.Researchinventy.Com
Adhoc on Demand Distance Vector Routing Protocol: A Review
Study
1,
Dr.A.A.Gurjar, 2, Mr.A.A.Dande
1,
Department Of Electronics & Telecommunication Sipna’s C.O.E.T, Amravati
2,
Second Year (M.E.), Computer Engineering Sipna’s C.O.E.T, Amravati
Abstract: AODV Is Source Initiated A Routing Protocol. AODV Protocols Are Different From Traditional
Proactive Protocols Since In Proactive The Routing Mechanism Is Based On Periodic Updates This Leads To
High Routing Overhead. The Key Goal In Designing This Protocol Is To Reduce Overhead. Routing Messages
In AODV Can Be Divided Into Path Discovery And Path Maintenance Messages. Path Discovery Includes The
Route Request (RREQ) And The Route Reply (RREP), While The Latter Includes Route Error (RERR) And Hello
Message. In AODV No Routing Structure Is Created Prior.
Key Words: Adhoc Network, Routing protocol, Flooding, Broadcasting, Active Route
I Introduction
The route discovery process of AODV consists of two key methods. First one it is source routing.
Second one is backward learning. Since this protocol uses the concept of periodic updates it is adapted to
network dynamics. Source initiated means source floods the network with a route request packet when a route is
required for a destination. The flooding is propagated outwards from the source. The flooding transmits the
request only once. On receiving the request from the source node the destination replies to the request if it has
the valid path. Reply from destination uses reversed the path of the route request. Since the route reply is
forwarded via the reverse path which forms a forward path. Thus it uses forward paths to route data packets.
AODV protocol uses hop-by-hop routing. That is each node forwards the request only once. In the meanwhile
unused paths expire based on timer. AODV uses the concept of optimization that is any intermediate nodes can
reply to route request if it has valid path which makes the protocol to work faster. But the major problem with
optimization causes loops in the presence of link failure. Each node maintains sequence number. It acts as a
timestamp. The most interesting feature of the sequence number is, it signifies the freshness of the route.
II Working Of AODV Protocol In Detail.
Whenever a source node wants to communicate, it broadcasts a Route Request (RREQ) message for the
specified destination. Intermediate nodes forwards message towards the destination. For example in following
Figure the source node S floods the RREQ (Route request) in the network. Each node in the network checks its
own routing table and checks whether it is the destination or it has a route to the destination.
Figure: AODV route discovery using RREQ packet.
27
2. Adhoc On Demand Distance Vector Routing Protocol: A Review Study
Simultaneously reverse path is set up along the way which it forwards the packets. RREQ message contains
broadcast id; destination IP address; destination sequence number; source IP address; source sequence number;
hop count. If it is not the destination node the nodes forward the packets. In above figure node A is not
destination node, so node A again broadcasts the packets in the network. Finally when the node D receives the
broadcasted message it confirms that it is the destination node and uses the reverse route to reply node D. The
simple idea behind this routing is flooding done with the nodes in the network. Not only that each node forwards
the request only once. Each node in the communication path maintains a sequence number which also act as a
timestamp. The timestamp gets incremented whenever it starts sending any message or participates in the
communication. Each route from source S also has a sequence number associated with it. Sequence number
signifies the freshness of the route. The node which has highest sequence number specifies up-to-date
information about routing. Intermediate node reply only when it has the highest sequence number instead of
forwarding the message.
The following Figure illustrates the route reply (RREP) concept in detail.
Figure: Route Discovery using RREP packet.
When node D receives a RREQ packet and it confirms that it has a current route to the target source S using
routing table. After this process the node D unicasts a route reply (RREP) packet to the reverse path which it
received the RREQ packet early. The unused path expires based on the timer. Thus the destination node D starts
forwarding and receiving packets with source node S using the reverse path in the networks.
III Hello Messages And Route Table Information.
A node may offer connectivity information by broadcasting local Hellos messages. A node should only
use hello messages if it is part of an active route. In every hello message interval, the node checks whether is has
sent a broadcast within last hello message interval. If it has not, it may broadcast a RREP with TTL field equal
to 1 called a Hello message. In addition to the source and destination sequence numbers, other useful
information is also stored in the route table entries. Associated with reverse path routing entries is a timer, called
the route request expiration timer. The purpose of this timer is to purge reverse path routing entries from those
nodes that do not lie on the path from the source to the destination. The expiration time depends upon the size of
the ad hoc network. Another important parameter associated with routing entries is the route caching timeout, or
the time after which the route is considered to be invalid. In each routing table entry, the address of active
neighbors through which packets for the given destination are received is also maintained. A neighbor is
considered active for particular destination if it originates or relays at least one packet for that destination within
the most recent active timeout period. This information is maintained so that all active source nodes can be
notified when a link along a path to the destination breaks. A route entry is considered active if it is in use by
any active neighbors. The path from a source to a destination, which is followed by packets along active route
entries, is called an active path. A mobile node maintains a route table entry for each destination of interest.
Each route table entry contains the information such as Destination IP Address, Destination Sequence Number,
Valid Destination Sequence Number flag, Other state and routing flags, Network interface, Hop Count.
28
3. Adhoc On Demand Distance Vector Routing Protocol: A Review Study
IV Route Error Messages And Route Expiration
When a link break in an active route is detected, a RERR message is used to notify other nodes that the
loss of that link has occurred. The RERR message indicates those destinations which are no longer reachable by
way of the broken link. In order to enable this reporting mechanism, each node keeps a “precursor list”,
containing the IP address for each its neighbors that are likely to user it as a next hop towards each destination.
The information the precursor lists is most easily acquired during the processing for generation of a RREP
message, which by definition has to be sent to anode in a precursor list. Generally, route error and link breakage
processing requires the following steps such as Invalidating existing routes, Listing affected destinations,
Determination which, if any, neighbors may be affected, Delivering an appropriate RERR to such neighbors.A
Route error (RERR) message may be broadcast, unicast, or iteratively unicast to all precursors. Even when the
RERR message is iteratively unicast to several precursors, it is considered to be single control message for the
purposes of the description in the text that follows. With that understanding, a node should not generate more
that a RERR rate limit message per unit time. The RERR message format has been shown in the following
figure.
Figure: AODV routing protocol with route error message.
Within the limits imposed by worst-case route establishment latency as determined by the network diameter,
AODV is an excellent choice for ad-hoc network establishment. It is useful in applications for emergency
services, conferencing, battlefield communications, and community-based networking.
V Conclusion
AODV reduces memory requirements and needless duplications of packets to be transmitted in
MANETs to a very considerable extent. It also has quick response to link breakage in active routes so it is
effective and highly preferable. The most important feature that, it has loop-free routes maintained by the use of
destination sequence numbers and can be scaled to large population of nodes in the network.
VI References
[1] C.M barushimana, A.Shahrabi, “Comparative Study of Reactive and Proactive Routing Protocols Performance in Mobile Ad-Hoc
Networks,” Workshop on Advance Information Networking and Application, Vol. 2, pp. 679-684, May, 2003.
[2] M.Abolhasan, T.Wysocki, E.Dutkiewicz, “A Review of Routing Protocols for Mobile Ad-Hoc Networks,” Telecommunication and
Infromation Research Institute University of Wollongong, Australia, June, 2003.
[3] S. Lu, L. Li, K.Y. Lam, L. Jia, “SAODV: A MANET Routing Protocol that can Withstand Black Hole Attack.,” International
Conference on Computational Intelligence and Security, 2009.
[4] S. Kurosawa et al., “Detecting Blackhole Attack on AODV-Based Mobile Ad-Hoc Networks”
[5] M. Al-Shurman, S-M. Yoo, and S. Park, “Black Hole Attack in Mobile Ad-Hoc Networks,” ACM Southeast Regional Conf. 2004.”
[6] Akanksha Saini, and Harish Kumar, “Effect of Black Hole Attack on AODV Routing Protocol in MANET”, International Journal of
Computer Science and Technology, Vol.1, issue 2, Dec 2010
[7] Shree Murthy and J. J. Garcia-Luna-Aceves. “An Efficient Routing Protocol for Wireless Networks”. Mobile Networks and
Applications, 1(2):183–197, 1996.
[8] C. E. Perkins and E. M. Royer, “The Ad Hoc On-Demand Distance Vector Protocol”, Ad hoc Networking, Addison-Wesley, 2000, pp.
173-219.
[9] Elizabeth M. Royer, C-K Toh, “A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks”.
29