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
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
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’.
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.
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
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’.
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.
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.
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.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field free for the
nodes to move. The most important aspect of this kind of network turns into a great disadvantage when it
comes to commercial applications, take as an example: the automotive networks that allow communication
between a groups of vehicles. The ad hoc on-demand distance vector (AODV) routing protocol, designed
for mobile ad hoc networks, has two main functions. First, it enables route establishment between a source
and a destination node by initiating a route discovery process. Second, it maintains the active routes, which
means finding alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and accurately.
In this paper, we focused in the first point to enhance the local decision of each node in the network by the
quantification of the mobility of their neighbours. Quantification is made around RSSI algorithm a well
known distance estimation method.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field
free for the nodes to move. The most important aspect of this kind of network turns into a great
disadvantage when it comes to commercial applications, take as an example: the automotive
networks that allow communication between a groups of vehicles. The ad hoc on-demand
distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main
functions. First, it enables route establishment between a source and a destination node by
initiating a route discovery process. Second, it maintains the active routes, which means finding
alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and
accurately. In this paper, we focused in the first point to enhance the local decision of each node
in the network by the quantification of the mobility of their neighbours. Quantification is made
around RSSI algorithm a well known distance estimation method.
Routing protocols for mobile ad-hoc networks have to
face the challenge of frequently changing topology, low
transmission power and asymmetric links. Both
proactive and reactive routing protocols prove to be
inefficient under these circumstances. The Zone Routing
Protocol (ZRP) combines the advantages of the proactive
and reactive approaches by maintaining an up-to-date
topological map of a zone centered on each node. Within
the zone, routes are immediately available. For
destinations outside the zone, ZRP employs a route
discovery procedure, which can benefit from the local
routing information of the zones.
Comparatively analysis of AODV and DSR in MAC layer for Ad Hoc Environmentijsrd.com
In Wireless Adhoc Network is a group of wireless mobile nodes is an autonomous system of mobile nodes connected by wireless links. Every node operates as an end system and as a router to forward packets. In this paper mainly focused on Mac layer because this layer is most important for the data communication using control the packet loss and we worked on the comparison based performance of wimax802.16 and wireless802.11 networks using Ad hoc on- demand Distance Vector Routing Protocol and Dynamic Source Routing Protocol. In this paper we used the different maximum speed for the network. And this comparison based on unicast On-demand routing procedure and our simulation for mobile ad hoc networks discover and maintain only needed the design and follows the idea that each node by sending routing packets whenever a communication is requested and compared various parameter packet delivery ratio, normalized routing load and e-e delay. These simulations are carried out using the Network simulator version-2. The results presented in this work illustrate the importance in carefully evaluating and implementing routing protocols in an ad hoc environment.
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
Performance analysis on multihop transmission using arp routing protocol in i...eSAT Journals
Abstract
Mobile Ad Hoc Network (MANET) are becoming more and more important in the modern environment. It can be used instantly to connect to the local or remote network without using the pre-existing infrastructure. The mobile or user in the network can together establish the infrastructure. In order to improve the limited range of radio transmission, multiple network ‘hops’ are needed so that the communication between the mobiles can be establish. There are varieties of protocol that had been proposed for the hopping methods but most of them suffer from high overhead. This project proposed a new method of hopping protocol for IEEE 802.11b using the existing network protocol which is Address Resolution Protocol (ARP). The ARP message is used in the network to find the MAC address of the destination. This can also be done by having multi hops where the proposed method using ARP designed will make an intermediate node act as a router in order to find the destination address and forward the data successfully. In this proposed method, the data is directly passed to the intermediate node and the intermediate node will help to find the route to the destination and passed the data to the destination node. This will reduce the transmission time. From the simulation obtained, it proved that the proposed method using the ARP protocol can works well as the existing network protocol which is Ad Hoc On-Demand Distance Vector (AODV). The simulation is composed into two types of environment which are with and without obstacles. The throughput, the packet loss and the round trip time for various distances is simulated and the results shows that the performance of the proposed method using ARP is much better compared to the AODV.
Index Terms: Address Resolution Protocol (ARP), Ad-Hoc, 802.11 Wifi, Hopping
PERFORMANCE ANALYSIS OF AODV, DSDV AND AOMDV USING WIMAX IN NS-2IAEME Publication
WiMAX (IEEE 802.16) technology empowers ubiquitous delivery of wireless broadband facility for fixed and mobile users. WiMAX standard describes numerous physical and MAC layer characteristics. Here, an attempt is made to implement some of these physical and MAC layer structures including the mobility extension 802.16e. NS2 (Network Simulator-2) is chosen as the simulator to implement these features as NS2 provides suitable library to simulate network scenario. The performance of the simulated module is analyzed by running AODV, DSDV and AOMDV routing protocols on a wired-cum-wireless WiMAX scenario. The throughput for each routing protocol is calculated for varying number of mobile nodes or subscriber stations.
Performance Evalution of MANET Routing Protocols using Reference Point Group ...ijasuc
An ad hoc network is often defined as an “infrastructureless” network, meaning a network without the
usual routing infrastructure like fixed routers and routing backbones. Typically, the ad hoc nodes are
mobile and the underlying communication medium is wireless. Each ad hoc node may be capable of acting
as a router.it’s charactrizied by multihop wireless connection and frequently changing networks.we
compare the performance of on-demand routing protocols for mobile ad-hoc networks are distributed
cache updating for the dynamic source routing protocol(DSR) and ad hoc on-demand distance vector
routing (AODV).the simulation model of the medium access control(MAC) layer is evaluting the
performance of MANET protocols.DSR and AODV protocols share similar behavours.we evalute the
both on demand protocols DSR and AODV based on packet delivery ratio , packet delivery latency,mobility
variation with total number of errors, packet and normalized routing overhead,end-to-end delay by varying
in node density.the performance and characterictics are explained by the graph models.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
ANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORKIJCSIT Journal
There are two methods to improve the performance of routing protocols in wireless mesh networks. One way is to improve the methods used for select the path. Second way is to improve the algorithms to add up the new characteristics of wireless mesh networks. We also propose a new protocol that is used for Multi Interfaces and Multiple Channels (MIMC) named as Hybrid Wireless Mesh Protocol.
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.
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.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field free for the
nodes to move. The most important aspect of this kind of network turns into a great disadvantage when it
comes to commercial applications, take as an example: the automotive networks that allow communication
between a groups of vehicles. The ad hoc on-demand distance vector (AODV) routing protocol, designed
for mobile ad hoc networks, has two main functions. First, it enables route establishment between a source
and a destination node by initiating a route discovery process. Second, it maintains the active routes, which
means finding alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and accurately.
In this paper, we focused in the first point to enhance the local decision of each node in the network by the
quantification of the mobility of their neighbours. Quantification is made around RSSI algorithm a well
known distance estimation method.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field
free for the nodes to move. The most important aspect of this kind of network turns into a great
disadvantage when it comes to commercial applications, take as an example: the automotive
networks that allow communication between a groups of vehicles. The ad hoc on-demand
distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main
functions. First, it enables route establishment between a source and a destination node by
initiating a route discovery process. Second, it maintains the active routes, which means finding
alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and
accurately. In this paper, we focused in the first point to enhance the local decision of each node
in the network by the quantification of the mobility of their neighbours. Quantification is made
around RSSI algorithm a well known distance estimation method.
Routing protocols for mobile ad-hoc networks have to
face the challenge of frequently changing topology, low
transmission power and asymmetric links. Both
proactive and reactive routing protocols prove to be
inefficient under these circumstances. The Zone Routing
Protocol (ZRP) combines the advantages of the proactive
and reactive approaches by maintaining an up-to-date
topological map of a zone centered on each node. Within
the zone, routes are immediately available. For
destinations outside the zone, ZRP employs a route
discovery procedure, which can benefit from the local
routing information of the zones.
Comparatively analysis of AODV and DSR in MAC layer for Ad Hoc Environmentijsrd.com
In Wireless Adhoc Network is a group of wireless mobile nodes is an autonomous system of mobile nodes connected by wireless links. Every node operates as an end system and as a router to forward packets. In this paper mainly focused on Mac layer because this layer is most important for the data communication using control the packet loss and we worked on the comparison based performance of wimax802.16 and wireless802.11 networks using Ad hoc on- demand Distance Vector Routing Protocol and Dynamic Source Routing Protocol. In this paper we used the different maximum speed for the network. And this comparison based on unicast On-demand routing procedure and our simulation for mobile ad hoc networks discover and maintain only needed the design and follows the idea that each node by sending routing packets whenever a communication is requested and compared various parameter packet delivery ratio, normalized routing load and e-e delay. These simulations are carried out using the Network simulator version-2. The results presented in this work illustrate the importance in carefully evaluating and implementing routing protocols in an ad hoc environment.
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
Performance analysis on multihop transmission using arp routing protocol in i...eSAT Journals
Abstract
Mobile Ad Hoc Network (MANET) are becoming more and more important in the modern environment. It can be used instantly to connect to the local or remote network without using the pre-existing infrastructure. The mobile or user in the network can together establish the infrastructure. In order to improve the limited range of radio transmission, multiple network ‘hops’ are needed so that the communication between the mobiles can be establish. There are varieties of protocol that had been proposed for the hopping methods but most of them suffer from high overhead. This project proposed a new method of hopping protocol for IEEE 802.11b using the existing network protocol which is Address Resolution Protocol (ARP). The ARP message is used in the network to find the MAC address of the destination. This can also be done by having multi hops where the proposed method using ARP designed will make an intermediate node act as a router in order to find the destination address and forward the data successfully. In this proposed method, the data is directly passed to the intermediate node and the intermediate node will help to find the route to the destination and passed the data to the destination node. This will reduce the transmission time. From the simulation obtained, it proved that the proposed method using the ARP protocol can works well as the existing network protocol which is Ad Hoc On-Demand Distance Vector (AODV). The simulation is composed into two types of environment which are with and without obstacles. The throughput, the packet loss and the round trip time for various distances is simulated and the results shows that the performance of the proposed method using ARP is much better compared to the AODV.
Index Terms: Address Resolution Protocol (ARP), Ad-Hoc, 802.11 Wifi, Hopping
PERFORMANCE ANALYSIS OF AODV, DSDV AND AOMDV USING WIMAX IN NS-2IAEME Publication
WiMAX (IEEE 802.16) technology empowers ubiquitous delivery of wireless broadband facility for fixed and mobile users. WiMAX standard describes numerous physical and MAC layer characteristics. Here, an attempt is made to implement some of these physical and MAC layer structures including the mobility extension 802.16e. NS2 (Network Simulator-2) is chosen as the simulator to implement these features as NS2 provides suitable library to simulate network scenario. The performance of the simulated module is analyzed by running AODV, DSDV and AOMDV routing protocols on a wired-cum-wireless WiMAX scenario. The throughput for each routing protocol is calculated for varying number of mobile nodes or subscriber stations.
Performance Evalution of MANET Routing Protocols using Reference Point Group ...ijasuc
An ad hoc network is often defined as an “infrastructureless” network, meaning a network without the
usual routing infrastructure like fixed routers and routing backbones. Typically, the ad hoc nodes are
mobile and the underlying communication medium is wireless. Each ad hoc node may be capable of acting
as a router.it’s charactrizied by multihop wireless connection and frequently changing networks.we
compare the performance of on-demand routing protocols for mobile ad-hoc networks are distributed
cache updating for the dynamic source routing protocol(DSR) and ad hoc on-demand distance vector
routing (AODV).the simulation model of the medium access control(MAC) layer is evaluting the
performance of MANET protocols.DSR and AODV protocols share similar behavours.we evalute the
both on demand protocols DSR and AODV based on packet delivery ratio , packet delivery latency,mobility
variation with total number of errors, packet and normalized routing overhead,end-to-end delay by varying
in node density.the performance and characterictics are explained by the graph models.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
ANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORKIJCSIT Journal
There are two methods to improve the performance of routing protocols in wireless mesh networks. One way is to improve the methods used for select the path. Second way is to improve the algorithms to add up the new characteristics of wireless mesh networks. We also propose a new protocol that is used for Multi Interfaces and Multiple Channels (MIMC) named as Hybrid Wireless Mesh Protocol.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Survey of Enhanced Routing Protocols for Manetspijans
Mobile Ad Hoc Networks (MANETs) form a class of dynamic multi-hop networks consisting of a set of
mobile nodes that intercommunicate on shared wireless channels. MANETs are self-organizing and selfconfiguring multi-hop wireless networks, where the network structure changes dynamically due to the node
mobility. There exists no fixed topology due to the mobility of nodes, interference, multipath propagation
and path loss. Hence efficient dynamic routing protocols are required for these networks to function
properly. Many routing protocols have been developed to accomplish this task. In this paper we survey
various new routing protocols that have been developed as extensions or advanced versions of previously
existing routing protocols for MANETs such as DSR, AODV, OLSR 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
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.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
The 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.
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.
Bandwidth aware on demand multipath routing in manetsijwmn
Mobile Ad-hoc Networks (MANETs) are self configuring, decentralized and dynamic nature wireless
networks which have no infrastructure. These offer a number of advantages, however the demand of high
traffic flows in MANETs increases rapidly. For these demands, limited bandwidth of wireless network is the
important parameter that restrains the development of real time multimedia applications. In this work, we
propose a solution to utilize available bandwidth of the channel for on demand multiple disjoint paths. The
approximate bandwidth of a node is used to find the available bandwidth of the path. The source chooses
the primary route for data forwarding on the basis of path bandwidth. The simulation results show that the
proposed solution reduces the frequency of broadcast and performs well in improving the end to end
throughput, packet delivery ratio, and the end to end delay.
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.
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.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Comparative study of multipath extensions of aodveSAT Journals
Abstract A mobile ad hoc network (MANET) is a multi-hop wireless network with dynamically changing topology. With the development of MANET technology, various routing protocols have been proposed over the years with minimum control overhead and network resources. AODV is the most popular routing protocol among others. It is a single path, loop free, On-demand type routing protocol and its performance is better than other routing protocols in MANET environment. However, single path abstraction is considered one of the biggest drawbacks of AODV. Also, it has more routing overhead both at the time of route discovery and route repair. In the networks with light traffic and low mobility AODV scales flawlessly to the larger networks with low bandwidth and storage overhead. But in networks with heavy traffic, a big number of routes will break resulting in repeated route discoveries and error reports in the network, which is an overhead. The mobile nodes in MANET have limited resources such as battery power, limited bandwidth which the single path protocols cannot handle efficiently. Thus routing is a vital issue in the design of a MANET. Multipath routing allows the establishment of multiple paths between a single source and single destination node. Researchers have proposed many multipath extensions of AODV protocol to establish reliable communication and ensure better load balancing than the conventional protocol. This paper reviews some multipath extensions of AODV routing protocol and a comparative study is done. There is no frontrunner of the comparison, but there are important inferences for scholars who will design new routing protocols in future. Keywords: MANET, Multipath Extensions, Routing Protocols, AODV, AODV-BR, SMORT, AOMDV and AODVM
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
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.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
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
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.
1. Tejal Arvind Sonawale, Dr Shikha Nema / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 3, May-Jun 2013, pp.259-263
259 | P a g e
Comparison of Routing Protocol in MANETs
*Tejal Arvind Sonawale, **Dr Shikha Nema
*M.E(EXTC) V.E.S.I.T,Chembur Mumbai, India
**EXTC V.E.S.I.T,Chembur Mumbai, India
Abstract
AOMDV is widely used protocol these
days. But, its permissive for link failure. It takes
the necessary action after detecting the link
failure thus holding/queuing packets till new
route is discovered after detecting failure in
existing link.. Early Link Failure Detection-
AOMDV (ELFDAOMDV) keeps on monitoring
distance between two mobile nodes. As soon
distance between two nodes crosses specified
threshold then it sends a request to source node
to start discovering new route but continues to
transfer data packets as the link is still up. In
most of the cases, new route is discovered (if some
exists) before link failure. Then using the
intelligence data packets are automatically
shifted to this newly discovered route, thus
preventing the link failure. Hence, the algorithm
is named as Early Link Failure Detection -
AOMDV.
Keywords- Ad hoc networks; Routing protocols;
AODV, DSR, AOMDV.
1. INTRODUCTION
In contrast to infrastructure based wireless
networks, in ad hoc networks all nodes are mobile
are connected dynamically in an arbitrary manner. A
collection of mobile host with wireless network
interfaces may form a temporary network without
the aid of any established infrastructure or
centralized administration.
In the case where only two hosts, within the
transmission range, are involved in the ad hoc
network, no real routing protocol or routing
decisions are necessary. But in many practical ad
hoc networks, two hosts that wish to communicate
may not be close enough within wireless
transmission range of each other. These hosts could
communicate if other nodes between them
participated willfully to forward packets to the
destination or the next hop towards the destination.
So all nodes behave as routers and take part in
discovery and maintenance of routes to other nodes
in the network. Route construction should be done
with minimum overhead and bandwidth
consumption.
1.2 AD-HOC NETWORK DESIGN ISSUES
The Ad Hoc architecture has many benefits,
such as self-reconfiguration, ease of deployment,
and so on. However, this flexibility and convenience
come at a price. Ad hoc wireless networks inherit the
traditional problems of wireless communications,
such as bandwidth optimization, power control, and
transmission quality enhancement, while, in
addition, their mobility, multi-hop nature, and the
lack of fixed infrastructure create a number of
complexities and design issues that are specific to
mobile ad hoc networks.
Infrastructure-less
Dynamically Changing Network
Topologies
Physical Layer Limitations
Limited Link Bandwidth and Quality
Variation in Link and Node Capabilities
Energy Constrained Operation
Network Robustness and Reliability
Network Security
Network Scalability
Quality of Service
2 ROUTING PROTOCOL
Many protocols have been proposed for ad
hoc networks, all fall in any of the three sets, namely
Table-Driven, Source-Initiated On-Demand, and
Zone based.
2.1Table-Driven Routing Protocols
Table-driven routing protocols attempt to
maintain consistent, up-to-date routing information
from each node to every other node in the network.
These protocols require each node to maintain one or
more tables to store routing information, and they
respond to changes in network topology by
propagating updates throughout the network in order
to maintain a consistent network view. The areas in
which they differ and the number of necessary
routing-related tables and the methods by which
changes in network structure are broadcast
2.2 Source-Initiated On-Demand Routing
A different approach from table-driven
routing is source-initiated on-demand routing. This
type of routing creates routes only when desired by
the source node. When a node requires a route to a
destination, it initiates a route discovery process
within the network. This process is completed once a
route is found or all possible route permutations
have been examined. Once a route has been
established, it is maintained by a route maintenance
2. Tejal Arvind Sonawale, Dr Shikha Nema / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 3, May-Jun 2013, pp.259-263
260 | P a g e
procedure until either the destination becomes
inaccessible along every path from the source or
until the route is no longer desired.
2.3 Zone Routing Protocol
ZRP divides its network in different zones.
That's the nodes local neighborhood. Each node may
be within multiple overlapping zones, and each zone
may be of a different size. The size of a zone is not
determined by geographical measurement. It is given
by a radius of length, where the number of hops is
the perimeter of the zone. Each node has its own
zone.
Advantage
less control overhead as in a proactive
protocol or an on demand protocol
Disadvantage
short latency for finding new routes
3 SECURITY IN AD HOC NETWORK
The security needs of Ad Hoc Network are not
different from the traditional networks
Confidentiality
Availability
Integrity
Authentication
Non-repudiation
Link Level Security
Secure Routing
Wireless technologies are unequivocally among the
most rapidly progressing technology sectors. There
is a vast range of wireless technologies, applications
and devices, which are either already a substantial
part of our daily life or could play this role in future.
Wireless ad hoc networking is one of these
applications, which can potentially enhance our
abilities to solve real life challenges.
4. ROUTING Protocol Approach
4.1. Adhoc on demand Multi-path distance
vector(AOMDV)
Adhoc On-demand Multi-path Distance
Vector (AOMDV) [12] is an extension to the
AODV. The main difference lies in the number of
routes found in each route discovery. A little
additional overhead is required for the computation
of multiple paths. This protocol does not require any
special type of control packets but makes use of
AODV control packets with a few extra fields in the
packet headers. The AOMDV protocol computes
multiple loop-free and link-disjoint paths. There are
three phases of the AOMDV protocol. The first
phase is the Route Request, second is the Route
Reply and the third phase is the Route Maintenance
phase.
Route Request:
The protocol propagates RREQ from source
towards the destination. Node S as in AODV
broadcasts multiple requests to its neighboring nodes
1 and 2. This means that request with same
sequence numbers are sent to the destination node.
They further broadcast the request to the other
neighboring nodes, which are further sent to the
destination node D.
Route Reply:
The protocol establishes multiple reverse
paths both at intermediate nodes as well as
destination. Multiple RREPs traverse these reverse
paths back to form multiple forward paths to the
destination at the source and intermediate nodes. If
the intermediate nodes have the route defined for the
destination then they send the RREP to the source
node S. The protocol is designed to keep track of
multiple routes where the routing entries for each
destination contain a list of next hops together with
the corresponding hop counts. All the hop counts
have the same sequence number then the path with
the minimum hop count is selected and all the other
paths are discarded. The protocol computes multiple
loop-free and link-disjoint paths. Loop-freedom is
guaranteed by using a notion of “advertised hop
count”. Each duplicate route advertisement received
by a node defines an alternative path to the
destination. To ensure loop freedom, a node only
accepts an alternative path to the destination if it has
a lower hop count than the advertised hop count for
that destination. The advertised hop count is
generally the maximum hop count value possible for
a node S to reach a node D. If any value that is
received by the source S is greater than the
advertised hop count value then a loop is formed so
this RREP is discarded. The multiple RREPs are
received by the source via multiple paths and a
minimum hop count route is selected, the other
routes carrying a higher hop count value are
discarded.
Destination is the node where the packet is
destined to, the sequence number to maintain the
freshness of the routes, the advertised hop count that
avoids the formation of loops. The route list consists
of Hop Count required to reach a particular
destination, Next Hop is the next hop the packet is
supposed to take to reach the required destination,
Last Hop is the last hop taken to reach the
destination. If the packet is following the same path
then this value is same as the Next Hop or else it
changes and Expiration Timeout is the time for
which the path will exist. There are multiple entries
for a single destination but the routes that contain the
lowest hop count are only recorded in the routing
table and the other routes are discarded.
3. Tejal Arvind Sonawale, Dr Shikha Nema / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 3, May-Jun 2013, pp.259-263
261 | P a g e
Route Maintenance Phase:
The third phase is the Route Maintenance
Phase. This phase works in exactly same as AODV.
If the intermediate nodes are not able to receive a
response of the HELLO message then they broadcast
a Route Error message. After receiving this message
all the nodes that use the particular route to reach the
destination make this particular route as infinity and
inform the source node to run a fresh route
discovery.
There are two types of disjoint paths, one is
the node disjoint and the other is the link disjoint.
Node-disjoint paths do not have any nodes in
common, except the source and destination. The link
disjoint paths do not have any common link.
An AODV protocol is been developed
which develops route on-demand. The biggest
drawback of AODV is with respect to its route
maintenance. If a node detects a broken link while
attempting to forward the packet to the next hop then
it generates a RERR packet that is sent to all sources
using the broken link. The source runs a new route
discovery after receiving RERR packet. The
frequent route breaks cause intermediate nodes to
drop packets because no alternate path to destination
is available. This reduces overall throughput, packet
delivery ratio and increases average end-to-end
delay if there is high mobility. The other drawback is
that multiple RREP packets are received in response
to a single RREQ packet and can lead to heavy
control overhead. The HELLO message leads to
unnecessary bandwidth consumption.
The AOMDV is an extension to the AODV
protocol for computing multiple loop-free and link-
disjoint paths. The protocol computes multiple loop-
free and link-disjoint paths. Loop-freedom is
guaranteed by using a notion of “advertised hop
count”. Each duplicate route advertisement received
by a node defines an alternative path to the
destination. To ensure loop freedom, a node only
accepts an alternative path to the destination if it has
a lower hop count than the advertised hop count for
that destination. With multiple redundant paths
available, the protocol switches routes to a different
path when an earlier path fails. Thus a new route
discovery is avoided. Route discovery is initiated
only when all paths to a specific destination fail. For
efficiency, only link disjoint paths are computed so
that the paths fail independently of each other.
In AOMDV[12] RREQs reaching the node
may not be from disjoint paths, if RREQ is from one
common node one of the RREQ is discarded, this
messages implicitly provide knowledge about the
mobility and accessibility of their sender and
originator. for example, if node A is constantly
receiving messages initiated by another node B, this
implies that node B is relatively stationary to node
A. furthermore a valid route from node A to node B
is available either directly or through other nodes.
Instead of discarding repeated RREQs messages
node can perform additional computation on
available routing data and predict accessibility of
other nodes.
Now AOMDV[8] routing make use of pre-
computed routes determined during route discovery.
These solutions, however, suffer during high
mobility because the alternate paths are not actively
maintained. Hence, precisely when needed, the
routes are often broken. To overcome this problem,
we will go for link breakage prediction. Prediction
will be done only for multiple paths that are formed
during the route discovery process. All the paths are
maintained by means of periodic update packets
unicast along each path. These update packets are
MAC frames which gives the transmitted and
received power from which distance can be
measured. This distance can be used to predict
whether the node is moving inward or outward
relative to the previous distance value that is it give
the signal strength. At any point of time, only the
path with the strongest signal strength is used for
data transmission.
4.2. Early Link Failure Detection AOMDV
(ELFD-AODV)
AODV is widely used protocol these days. But, its
permissive for link failure. It takes the necessary
action after detecting the link failure thus
holding/queuing packets till new route is discovered
after detecting failure in existing link.
ELFD-AOMDV keeps on monitoring distance
between two mobile nodes. As soon distance
between two nodes crosses specified threshold then
it sends a request to source node to start discovering
new route but continues to transfer data packets as
the link is still up. In most of the cases, new route is
discovered (if some exists) before link failure. Then
using the intelligence data packets are automatically
shifted to this newly discovered route, thus
preventing the link failure. Hence, the algorithm is
named as Early Link Failure DetectionAOMDV.
Logic to monitor the distance between two mobile
nodes-
Source mobile node cannot know the
distance till destination mobile node or co-ordinates
of destination mobile node. So, source node cannot
calculate distance from source to destination. It
follows the reverse approach. Algorithm uses the
facts that each node knows the current co-ordinates
of self. While sending packets source nodes inserts
its own co-ordinates in the header. Destination node
receives the pakcet containing the source node
identification and co-ordinates of source node.
Destination node calculates the distance between
source and self as it knows its own co-ordinates and
co-ordiantes of source node which are received in
header. If this distance crosses threshold then
destination nodes informs the source node by
4. Tejal Arvind Sonawale, Dr Shikha Nema / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 3, May-Jun 2013, pp.259-263
262 | P a g e
sending packet that link may break soon. As soon as
source node receives such packet, it starts looking
for new node.
5. Performance Metrics Comparison
Packet Delivery Ratio – The ratio of total
number of data packets successfully received by
all the destinations to the total number of data
packets generated by all the sources.
Throughput: Throughput is total packets
successfully delivered to individual destination
over total time.
SIMULATION RESULT AND ANALYSIS
Channel Type Wireless
Radio Propagation Model TwoRayGround
Network interface type
Phy/WirelessPhy
MAC type
Mac/802_11
Interface Queue Type
DropTail/PriQueue
Antenna Type OmniAntenna
Max Queue Length 50
No. Of Mobile nodes 06
Routing protocol-AOMDV/ELFDAOMDV
Mobility Random Way Point Model
Throughput: Measure how soon the receiver is
able to get a certain amount of data send by the
sender
Throughput in kbps = ((Total size of
packets transferred)/(StopTime -
StartTime)) * (8/1000)
Fig5.1 Throughput ELFD-AOMDV vs AOMDV
Average throughput of AOMDV== 99.46 kbps
Average throughtput ELFD-AOMDV
==190.52 Kbps
PACKET DELIVERY RATIO
Fig 5.2 Shows Packet Delivery Ratio of ELFD-
AOMDV and AOMDV
Packet Delivery Ratio = (No. Of Packets received
/No. Of Packets sent) * 100.
Generated Packets=2400
Received Packets=1118
PDR (AOMDV)=46.5833%
Generated Packets=2572
Received Packets=2142
PDR (ELFD-AOMDV)== 83.28%
6 CONCLUSION
In MANETS’s due to movement of the
nodes, network topology may change rapidly and
unpredictably over time. In this decentralized
network, discovering the route and delivering of data
becomes complicated. In mobility scenario already
developed routing algorithms like AOMDV gives
degraded results compared to ELFD-AOMDV
performance characteristics. ELFD-AOMDV came
up with the advantage of Increased Throughput and
Packet Delivery Ratio.
References
[1] www.ietf.org/html.charters/manet-
charter.html
[2] Murthy, S. and J.J. Garcia-Luna-Aceves,
An Efficient Routing Protocol for Wireless
Networks, ACM Mobile Networks and
App. J., Special Issue on Routing in Mobile
Communication Networks, Oct. 1996, pp.
183-97.
[3] C. E. Perkins and P. Bhagwat, “Highly
Dynamic Destination-Sequenced Distance-
Vector Routing (DSDV) for Mobile
5. Tejal Arvind Sonawale, Dr Shikha Nema / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 3, Issue 3, May-Jun 2013, pp.259-263
263 | P a g e
Computers”, in Proceedings of ACM
SIGCOMM 1994, August 1994, pp. 234-
244.
[4] G. Pei, M. Gerla and T.-W. Chen, Fisheye
State Routing in Mobile Ad Hoc Networks.
In Proceedings of the 2000 ICDCS
Workshops, Taipei, Taiwan, Apr. 2000, pp.
D71-D78
[5] B. Johnson, D.A. Maltz, Y.-C. Hu, “The
Dynamic Source Routing Protocol for
Mobile Ad Hoc Networks”, Internet-Draft,
draft-ietf-manet-dsr-10.txt, July 2004,
[6] V. Park, and S. Corson, Temporally
Ordered Routing Algorithm (TORA)
Version 1 Functional Specification.
IETF Internet draft, 1997.
[7] Y. B. Ko and N. H. Vaidya. Location Aid
Routing (LAR) in mobile ad hoc networks.
In Proc. ACM/IEEE MOBICOM, Oct.
1998.
[8] Z. J. Haas and M.R Pearlman, “The Zone
Routing Protocol (ZRP) for ad hoc
networks”, IETF Internet draft , August
1998.
[9] Navid Nikaein, Christian Bonnet and Neda
Nikaein, “HARP - Hybrid Ad Hoc Routing
Protocol”, in proceeding of IST 2001:
International Symposium on
Telecommunications, Iran/Tehran 2001.
[10] M. Joa-Ng and I-Tai Lu, “A peer-to-peer
zone-based two-level link state routing for
mobile ad hoc net-works”, IEEE on
Selected Areas in Communications, vol. 17,
no. 8, pp. 1415 1425, 1999.
[11] C. E. Perkins and E. M. Royer, “Ad Hoc
On-Demand Distance Vector Routing”,
Proceedings of IEEE Workshop on Mobile
Computing Systems and Applications 1999,
February 1999, pp. 90-100.
[12] Mahesh K. Marina and Samir R. Das,”On-
Demand Multipath Distance Vector
Routing in Ad Hoc Networks”, in IEEE
Proceedings 2001.
[13] C. E. Perkins, E. M. Royer, S. R. Das, and
M. K. Marina,”Performance comparison of
two on-demand routing protocols for ad hoc
networks”,. IEEE Personal Commun. Mag.,
vol. 8, pp. 16.28, Feb. 2001.
[14] J. Broch, D. A. Maltz, D. B. Johnson, Y.-C.
Hu, and J. Jetcheva, “A performance
comparison of multi-hop wireless ad hoc
network
[15] routing protocols”, in Proceeding. Int.
Conf. on Mobile Computing and
Networking, Oct. 1998.
[16] C. E. Perkins, ed., Ad Hoc Networking, ch.
3. Addison Wesley, 2001.
[17] Rohit Dube, Cynthia D. Rais, Kuang-Yeh
Wang, and Satish K. Tripathi, “Signal
stability based adaptive routing (SSA) for
adhoc mobile networks”, in IEEE Personal
Communication, February 1997, vol. 4.
[18] Ian D. Chakeres and Elizabeth M. Belding-
Royer, “The utility of hello messages for
determining link connectivity”, in
Proceedings of the 5th International
Symposium on Wireless Personal
Multimedia Communications (WPMC),
Honolulu, Hawaii, October 2002.
[19] T. Camp, J. Boleng, V. Davies, “A survey
of mobility for ad hoc network research”, in
Proc. WCMC, 2002, pp.483-502.
[20] Michael Bahr, “Proposed Routing for IEEE
802.11s WLAN Mesh Networks”, In Proc.
2nd Annual International Wireless Internet
Conference, 2006.
[21] P Sambasivam, A Murthy, EM Belding,”
Dynamically Adaptive Multipath Routing
based on AODV”, In Proc. 3rd Annual,
2004- Citeseer
[22] Rehman, H. Wolf, L. “Performance
enhancement in AODV with accessibility
prediction”, in mobile adhoc and sensor
system, MASS 2007 IEEE International
conference,pp 1-6
[23] http://www.isi.edu/nsnam/ns-
build.html#allinone