The document provides an overview of routing protocols for mobile ad hoc networks (MANETs). It discusses the characteristics of MANETs and challenges in routing. It classifies routing protocols into three categories: proactive, reactive, and hybrid. Proactive protocols continuously maintain up-to-date routing information through periodic updates. Reactive protocols find routes on demand via route discovery. Hybrid protocols incorporate aspects of both proactive and reactive routing. Examples of protocols from each category are described and compared, including DSDV, AODV, DSR, ZRP, and CEDAR. The document concludes routing in MANET is an active area of research with the goal of protocols responding rapidly to topological changes.
Study of Attacks and Routing Protocol in Wireless Networkijsrd.com
Wireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (1) proactive, (2) reactive, and (3) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in WMN is mobile but it can fluctuate between being mobile. Wireless mesh networks is an emergent research area, which is becoming important due to the growing amount of nodes in a network.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP...ijasuc
This document analyzes the performance of two reactive MANET routing protocols, DSR and DSDV, under TCP Vegas and TCP Newreno variants through simulations. The simulations measured packet delivery ratio, average end-to-end delay, and total packets dropped. The results showed that DSDV generally had a higher packet delivery ratio but also higher end-to-end delay and more packet drops compared to DSR. DSR performed better in terms of delay and drops due to its on-demand route discovery, while DSDV maintained more consistent routes leading to better packet delivery.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
This document analyzes and compares different routing protocols for mobile ad hoc networks (MANETs). It begins with background on MANETs and their characteristics, such as dynamic topology and limited resources. It then classifies routing protocols as either proactive (table-driven) or reactive (on-demand) and describes several examples of each type. Proactive protocols maintain up-to-date routing tables through periodic updates but incur more overhead. Reactive protocols discover routes on demand but add latency. The document provides details on popular protocols like DSDV, AODV, DSR and TORA, explaining their route discovery, maintenance and metrics.
Survey of Reactive Routing Protocols for MANETIOSR Journals
A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any
network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes
are free to move about and organize themselves into a network. These nodes change position frequently. The
main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy
is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides
a scalable solution to relatively large network topologies. The design follows the idea that each node tries to
reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV
are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is
needed. The performance differentials are analyzed using varying performance metrics. These simulations are
carried out using the ns-2 network simulator
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.
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.
Study of Attacks and Routing Protocol in Wireless Networkijsrd.com
Wireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (1) proactive, (2) reactive, and (3) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in WMN is mobile but it can fluctuate between being mobile. Wireless mesh networks is an emergent research area, which is becoming important due to the growing amount of nodes in a network.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP...ijasuc
This document analyzes the performance of two reactive MANET routing protocols, DSR and DSDV, under TCP Vegas and TCP Newreno variants through simulations. The simulations measured packet delivery ratio, average end-to-end delay, and total packets dropped. The results showed that DSDV generally had a higher packet delivery ratio but also higher end-to-end delay and more packet drops compared to DSR. DSR performed better in terms of delay and drops due to its on-demand route discovery, while DSDV maintained more consistent routes leading to better packet delivery.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
This document analyzes and compares different routing protocols for mobile ad hoc networks (MANETs). It begins with background on MANETs and their characteristics, such as dynamic topology and limited resources. It then classifies routing protocols as either proactive (table-driven) or reactive (on-demand) and describes several examples of each type. Proactive protocols maintain up-to-date routing tables through periodic updates but incur more overhead. Reactive protocols discover routes on demand but add latency. The document provides details on popular protocols like DSDV, AODV, DSR and TORA, explaining their route discovery, maintenance and metrics.
Survey of Reactive Routing Protocols for MANETIOSR Journals
A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any
network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes
are free to move about and organize themselves into a network. These nodes change position frequently. The
main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy
is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides
a scalable solution to relatively large network topologies. The design follows the idea that each node tries to
reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV
are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is
needed. The performance differentials are analyzed using varying performance metrics. These simulations are
carried out using the ns-2 network simulator
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.
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.
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.
A Performance Review of Intra and Inter-Group MANET Routing Protocols under V...IJECEIAES
Mobile Ad-hoc Networks (MANETs) are a cluster of self-organizing and self-governing wireless nodes without any backbone infrastructure and centralized administration. The various nodes in MANET move randomly, and this node mobility may pose challenges on the performance of routing protocols. In this paper, an Intra and intergroup performance review of various MANET routing protocols are performed under varying speed of nodes. The routing protocols included in this study are reactive, proactive, and hybrid protocols. This performance review is done using the NS2 simulator and random waypoint model. The routing protocols performance is assessed through standard performance measure metrics including packet delivery ratio, throughput, routing overhead and end to end delivery with varying speed of nodes. The simulations result shows that there is no significant impact of varying speed of nodes on standard performance evaluation metrics.
This document provides a summary of routing protocols in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and their characteristics. It then discusses why traditional routing protocols are not suitable for MANETs and describes some common MANET routing protocols, classifying them as proactive (table-driven) or reactive (on-demand). Specifically, it provides detailed descriptions of the reactive protocols DSR and AODV, covering topics like route discovery, maintenance, and deletion. Finally, it compares these protocols and discusses which may be better suited under different network conditions.
This document provides an overview of mobile ad hoc networks (MANETs) and several routing protocols used in MANETs. It defines MANETs and their characteristics. It then describes several representative routing protocols, including reactive (AODV, DSR), proactive (DSDV, TBRPF) protocols. It compares these protocols through simulations on metrics like packet delivery ratio, end-to-end delay, routing overhead under different traffic loads and node mobility. It finds that no single protocol performs best under all conditions and that fundamental open questions around scalability, energy efficiency and security remain.
This document provides an overview of mobile ad hoc networks (MANETs). It defines MANETs as wireless networks without fixed infrastructure where nodes are free to move and dynamically self-organize. Key points:
- MANETs are formed spontaneously as nodes connect via wireless links without centralized administration.
- Each node acts as a router, forwarding data for other nodes. Network topology changes frequently as nodes move.
- Examples of MANET applications include military operations, emergency response, classroom environments, and home/office networks.
- Challenges for MANET routing protocols include dynamic topology, limited resources, and network security. Common routing approaches include proactive, reactive, and geographic routing.
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
Survey comparison estimation of various routing protocols in mobile ad hoc ne...ijdpsjournal
MANET is
an autonomous system of mobile nodes attached by wireless links. It represents
a complex and
dynamic distributed systems that consist of mobile wireless nodes that can freely self organize into
an ad
-
hoc network topology. The devices in the network may hav
e limited transmission
range therefore multiple
hops may be needed by one node to transfer data to another node in network. This leads to the need f
or an
effective routing protocol. In this paper we study various classifications of routing protocols and
th
eir types
for wireless mobile ad
-
hoc networks like DSDV, GSR, AODV, DSR, ZRP, FSR, CGSR, LAR, and Geocast
Protocols. In this paper we also compare different routing proto
cols on based on a given set of
parameters
Scalability, Latency, Bandwidth, Control
-
ov
erhead, Mobility impact
The document provides an overview of routing protocols in mobile ad-hoc networks (MANETs) and enhancements to reactive protocols. It discusses the key features of MANETs and challenges like security. It describes different routing strategies including proactive, reactive, and hybrid protocols. It provides details on reactive protocols like DSR and AODV. It focuses on enhancements to DSR including the watchdog and pathrater mechanisms to detect misbehaving nodes and select more reliable routes. The document is a technical paper that evaluates routing protocols and security issues in MANETs.
This document discusses various routing protocols for vehicular ad hoc networks (VANETs). It begins by introducing VANETs and their applications. It then categorizes and describes five main types of routing protocols for VANETs: topology based, position based, geo cast, broadcast, and cluster based. It focuses on describing different types of broadcast routing protocols, outlining nine specific protocols (such as BROADCOMM, UMB, V-TRADE, DV-CAST). The document concludes that designing an efficient routing protocol for all VANET applications is challenging and that surveying different protocols is important to develop new proposals.
This document discusses various routing protocols for vehicular ad hoc networks (VANETs). It describes five main categories of routing protocols for VANETs: topology based, position based, geo-cast, broadcast, and cluster based. It focuses on broadcast routing protocols, giving examples like BROADCOMM, UMB, V-TRADE, and DV-CAST. Broadcast protocols are important for disseminating traffic, weather, and emergency information between vehicles. The document provides an overview of the advantages and disadvantages of different routing approaches for supporting intelligent transportation systems.
This document analyzes and compares the scalability of three mobile ad hoc network (MANET) routing protocols - AODV, TORA, and OLSR - by simulating them using varying numbers of nodes. The key findings are:
1) In terms of end-to-end delay, OLSR consistently performs better than AODV and TORA as the number of nodes increases from 25 to 75.
2) For throughput, OLSR outperforms AODV and TORA across all network sizes tested.
3) The study concludes that OLSR demonstrates better scalability than AODV and TORA based on its performance with increasing numbers of nodes in terms of
T HE I MPACT OF TCP C ONGESTION W INDOW S IZE ON THE P ERFORMANCE E VA...ijwmn
A mobile ad hoc network (MANET) is a temporary coll
ection of mobile nodes randomly moved within a
limited terrain area. The nodes are connected to fo
rm a wireless network without use any communication
infrastructure. Because of the limiting resources o
f MANET nodes, multiple hops
scheme is proposed for
data exchange
across the network. Varieties of mobile ad hoc rout
ing protocols have been developed to
support the multi-hop scheme of ad hoc networks. A
popular Transmission Control Protocol (TCP)
provides a reliable connection in a computer networ
k environment; it sets its congestion window size i
n
response to the behavior of the network to achieve
the best performance. This work aims to investigate
and
compare the MANET protocol
performance, such as DSDV, AODV and DSR in terms of
network
throughput, average routing load, the packet delive
ry ratio (PDR), and average end-to-end delay by
varying the maximum congestion window size. Our si
mulation has been implemented using a well-known
NS-2.35 network simulator. The simulated results sh
ow that the demonstrates of the concepts of MANET
routing protocols with respect to TCP congestion wi
ndow size in MANET environment
Manet review characteristics, routing protocols, attacks and performance metricsIJARIIT
This document provides an overview of mobile ad hoc networks (MANETs), including their characteristics, applications, routing protocols, attacks, and performance metrics. Some key points:
- MANETs are temporary networks formed without centralized administration between mobile nodes. Routing is challenging due to frequent topology changes from node mobility.
- Common routing protocols include proactive (table-driven), reactive (on-demand), and hybrid. Proactive maintains routing tables even without need, while reactive establishes routes on demand.
- Attacks on MANETs include location disclosure, black holes, replays, wormholes, and denial of service. Performance is evaluated using metrics like throughput, packet delivery ratio, and end-to
Performance Comparison of IAODV and OLSR Protocols under Black Hole Attackijsrd.com
A wireless ad-hoc network is a collection of mobile/semi-mobile nodes with no pre-established infrastructure, forming a temporary network.. MANET is a self organized and self configurable network where the mobile nodes move arbitrarily. The mobile nodes can receive and forward packets as a router. Each of the nodes has a wireless interface and communicates with each other over either radio or infrared. Laptop computers and personal digital assistants that communicate directly with each other are some examples of nodes in an ad-hoc network [4]. Nodes in the adhoc network are often mobile, but can also consist of stationary nodes, such as access points to the Internet. Semi mobile nodes can be used to deploy relay points in areas where relay points might be needed temporarily. Routing is a critical issue in MANET and hence the focus of this thesis along with the performance analysis of routing protocols. We compared two routing protocols i.e. IAODV and OLSR. Our simulation tool will be Network stimulator 2. The performance of these routing protocols is analyzed by three metrics: End to End delay, Packet delivery fraction and throughput.
International Journal of Research in Engineering and Science is an open access peer-reviewed international forum for scientists involved in research to publish quality and refereed papers. Papers reporting original research or experimentally proved review work are welcome. Papers for publication are selected through peer review to ensure originality, relevance, and readability.
Change is the only thing which is constant in this
today’s era. Constant technology updates demand building up
and falling down of infrastructure along with cost involvement.
Today there is a need of adaptive infrastructure called Ad hoc
network.
Ad hoc network is a collection of two or more nodes with
wireless communication having network capability that they can
communicate without centralized manner. So, at any time host
devices may act as a router or as a node. Ad hoc networks can be
erected as wireless technology, comprising of Radio Frequency
(RF) and infrared frequency.
Wireless Ad hoc network is Temporary, Infrastructure less,
Decentralized, self-organized packet switched network. In this
network topology changes dynamically which can results change
in link failure or broken. In this paper we evaluate the
performance parameters like Throughput, End-to-End Delay and
Packet Delivery Ratio of AODV (ad hoc on Demand Vector) and
DSDV (Destination Sequential Distance Vector) protocol. The
simulation tool used is Network Simulator 2 -2.35
This document summarizes a research paper on load balancing protocols in mobile ad hoc networks (MANETs). It begins with an abstract of the paper and introduces MANETs and the importance of load balancing in them given nodes' limited resources. It then discusses various load metrics and load balancing routing protocols. Specific protocols covered include Ad Hoc On-Demand Distance Vector (AODV), Ad hoc On-Demand Multipath Distance Vector (AOMDV), and Scalable Multipath On-Demand Routing (SMORT). AOMDV and SMORT aim to compute multiple loop-free paths during route discovery to help balance traffic load across multiple paths. The document concludes that load balanced routing protocols use different metrics to select routes
The document discusses a system for integrating structured and unstructured data from heterogeneous environments. The system uses OGSA-DAI services and the Globus Toolkit to provide an abstraction layer that allows database operations on both structured data from databases and unstructured file-based data. It generates metadata from unstructured data and configures the abstraction layer to query across the different data sources. This provides users an integrated view of both structured and unstructured data through a single interface.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
The document discusses using machine learning algorithms like Random Forest and k-Nearest Neighbors for intrusion detection. It analyzes the KDD Cup 1999 intrusion detection dataset to classify network traffic as normal or different types of attacks. The proposed model uses Random Forest for feature selection and k-Nearest Neighbors for classification to more accurately detect known and unknown attacks. Experimental results show the combined approach achieves better detection rates than other algorithms alone, especially for novel attacks not present in training data. Further combining the algorithms into a two-stage process may yield even higher accuracy.
This document summarizes research on palmprint identification. It begins by introducing palmprint biometrics and principal line features. It then summarizes several existing approaches that extract principal lines using techniques like finite radon transform, gradient images, and morphological operators. The proposed approach is described which uses Canny edge detection to extract principal lines based on edge direction. It preprocesses images, applies Canny edge detection, divides the output into blocks to generate templates, and performs matching. Experimental results on a public database achieve an accuracy of 86% for personal identification.
Intergraph has expanded its Global Professional Services Consultancy and Delivery Organization in Asia-Pacific with new leadership to provide consistent project delivery results across the region. The company's improved Global Professional Services Methodology provides a structured approach using best practices and processes to standardize reporting and enhance project execution. This proven methodology is scalable based on complexity and aims to streamline project governance, quality control, and risk mitigation to reduce costs and delays. Intergraph was ranked the number one provider of engineering design solutions worldwide by industry analyst ARC Advisory Group.
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.
A Performance Review of Intra and Inter-Group MANET Routing Protocols under V...IJECEIAES
Mobile Ad-hoc Networks (MANETs) are a cluster of self-organizing and self-governing wireless nodes without any backbone infrastructure and centralized administration. The various nodes in MANET move randomly, and this node mobility may pose challenges on the performance of routing protocols. In this paper, an Intra and intergroup performance review of various MANET routing protocols are performed under varying speed of nodes. The routing protocols included in this study are reactive, proactive, and hybrid protocols. This performance review is done using the NS2 simulator and random waypoint model. The routing protocols performance is assessed through standard performance measure metrics including packet delivery ratio, throughput, routing overhead and end to end delivery with varying speed of nodes. The simulations result shows that there is no significant impact of varying speed of nodes on standard performance evaluation metrics.
This document provides a summary of routing protocols in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and their characteristics. It then discusses why traditional routing protocols are not suitable for MANETs and describes some common MANET routing protocols, classifying them as proactive (table-driven) or reactive (on-demand). Specifically, it provides detailed descriptions of the reactive protocols DSR and AODV, covering topics like route discovery, maintenance, and deletion. Finally, it compares these protocols and discusses which may be better suited under different network conditions.
This document provides an overview of mobile ad hoc networks (MANETs) and several routing protocols used in MANETs. It defines MANETs and their characteristics. It then describes several representative routing protocols, including reactive (AODV, DSR), proactive (DSDV, TBRPF) protocols. It compares these protocols through simulations on metrics like packet delivery ratio, end-to-end delay, routing overhead under different traffic loads and node mobility. It finds that no single protocol performs best under all conditions and that fundamental open questions around scalability, energy efficiency and security remain.
This document provides an overview of mobile ad hoc networks (MANETs). It defines MANETs as wireless networks without fixed infrastructure where nodes are free to move and dynamically self-organize. Key points:
- MANETs are formed spontaneously as nodes connect via wireless links without centralized administration.
- Each node acts as a router, forwarding data for other nodes. Network topology changes frequently as nodes move.
- Examples of MANET applications include military operations, emergency response, classroom environments, and home/office networks.
- Challenges for MANET routing protocols include dynamic topology, limited resources, and network security. Common routing approaches include proactive, reactive, and geographic routing.
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
Survey comparison estimation of various routing protocols in mobile ad hoc ne...ijdpsjournal
MANET is
an autonomous system of mobile nodes attached by wireless links. It represents
a complex and
dynamic distributed systems that consist of mobile wireless nodes that can freely self organize into
an ad
-
hoc network topology. The devices in the network may hav
e limited transmission
range therefore multiple
hops may be needed by one node to transfer data to another node in network. This leads to the need f
or an
effective routing protocol. In this paper we study various classifications of routing protocols and
th
eir types
for wireless mobile ad
-
hoc networks like DSDV, GSR, AODV, DSR, ZRP, FSR, CGSR, LAR, and Geocast
Protocols. In this paper we also compare different routing proto
cols on based on a given set of
parameters
Scalability, Latency, Bandwidth, Control
-
ov
erhead, Mobility impact
The document provides an overview of routing protocols in mobile ad-hoc networks (MANETs) and enhancements to reactive protocols. It discusses the key features of MANETs and challenges like security. It describes different routing strategies including proactive, reactive, and hybrid protocols. It provides details on reactive protocols like DSR and AODV. It focuses on enhancements to DSR including the watchdog and pathrater mechanisms to detect misbehaving nodes and select more reliable routes. The document is a technical paper that evaluates routing protocols and security issues in MANETs.
This document discusses various routing protocols for vehicular ad hoc networks (VANETs). It begins by introducing VANETs and their applications. It then categorizes and describes five main types of routing protocols for VANETs: topology based, position based, geo cast, broadcast, and cluster based. It focuses on describing different types of broadcast routing protocols, outlining nine specific protocols (such as BROADCOMM, UMB, V-TRADE, DV-CAST). The document concludes that designing an efficient routing protocol for all VANET applications is challenging and that surveying different protocols is important to develop new proposals.
This document discusses various routing protocols for vehicular ad hoc networks (VANETs). It describes five main categories of routing protocols for VANETs: topology based, position based, geo-cast, broadcast, and cluster based. It focuses on broadcast routing protocols, giving examples like BROADCOMM, UMB, V-TRADE, and DV-CAST. Broadcast protocols are important for disseminating traffic, weather, and emergency information between vehicles. The document provides an overview of the advantages and disadvantages of different routing approaches for supporting intelligent transportation systems.
This document analyzes and compares the scalability of three mobile ad hoc network (MANET) routing protocols - AODV, TORA, and OLSR - by simulating them using varying numbers of nodes. The key findings are:
1) In terms of end-to-end delay, OLSR consistently performs better than AODV and TORA as the number of nodes increases from 25 to 75.
2) For throughput, OLSR outperforms AODV and TORA across all network sizes tested.
3) The study concludes that OLSR demonstrates better scalability than AODV and TORA based on its performance with increasing numbers of nodes in terms of
T HE I MPACT OF TCP C ONGESTION W INDOW S IZE ON THE P ERFORMANCE E VA...ijwmn
A mobile ad hoc network (MANET) is a temporary coll
ection of mobile nodes randomly moved within a
limited terrain area. The nodes are connected to fo
rm a wireless network without use any communication
infrastructure. Because of the limiting resources o
f MANET nodes, multiple hops
scheme is proposed for
data exchange
across the network. Varieties of mobile ad hoc rout
ing protocols have been developed to
support the multi-hop scheme of ad hoc networks. A
popular Transmission Control Protocol (TCP)
provides a reliable connection in a computer networ
k environment; it sets its congestion window size i
n
response to the behavior of the network to achieve
the best performance. This work aims to investigate
and
compare the MANET protocol
performance, such as DSDV, AODV and DSR in terms of
network
throughput, average routing load, the packet delive
ry ratio (PDR), and average end-to-end delay by
varying the maximum congestion window size. Our si
mulation has been implemented using a well-known
NS-2.35 network simulator. The simulated results sh
ow that the demonstrates of the concepts of MANET
routing protocols with respect to TCP congestion wi
ndow size in MANET environment
Manet review characteristics, routing protocols, attacks and performance metricsIJARIIT
This document provides an overview of mobile ad hoc networks (MANETs), including their characteristics, applications, routing protocols, attacks, and performance metrics. Some key points:
- MANETs are temporary networks formed without centralized administration between mobile nodes. Routing is challenging due to frequent topology changes from node mobility.
- Common routing protocols include proactive (table-driven), reactive (on-demand), and hybrid. Proactive maintains routing tables even without need, while reactive establishes routes on demand.
- Attacks on MANETs include location disclosure, black holes, replays, wormholes, and denial of service. Performance is evaluated using metrics like throughput, packet delivery ratio, and end-to
Performance Comparison of IAODV and OLSR Protocols under Black Hole Attackijsrd.com
A wireless ad-hoc network is a collection of mobile/semi-mobile nodes with no pre-established infrastructure, forming a temporary network.. MANET is a self organized and self configurable network where the mobile nodes move arbitrarily. The mobile nodes can receive and forward packets as a router. Each of the nodes has a wireless interface and communicates with each other over either radio or infrared. Laptop computers and personal digital assistants that communicate directly with each other are some examples of nodes in an ad-hoc network [4]. Nodes in the adhoc network are often mobile, but can also consist of stationary nodes, such as access points to the Internet. Semi mobile nodes can be used to deploy relay points in areas where relay points might be needed temporarily. Routing is a critical issue in MANET and hence the focus of this thesis along with the performance analysis of routing protocols. We compared two routing protocols i.e. IAODV and OLSR. Our simulation tool will be Network stimulator 2. The performance of these routing protocols is analyzed by three metrics: End to End delay, Packet delivery fraction and throughput.
International Journal of Research in Engineering and Science is an open access peer-reviewed international forum for scientists involved in research to publish quality and refereed papers. Papers reporting original research or experimentally proved review work are welcome. Papers for publication are selected through peer review to ensure originality, relevance, and readability.
Change is the only thing which is constant in this
today’s era. Constant technology updates demand building up
and falling down of infrastructure along with cost involvement.
Today there is a need of adaptive infrastructure called Ad hoc
network.
Ad hoc network is a collection of two or more nodes with
wireless communication having network capability that they can
communicate without centralized manner. So, at any time host
devices may act as a router or as a node. Ad hoc networks can be
erected as wireless technology, comprising of Radio Frequency
(RF) and infrared frequency.
Wireless Ad hoc network is Temporary, Infrastructure less,
Decentralized, self-organized packet switched network. In this
network topology changes dynamically which can results change
in link failure or broken. In this paper we evaluate the
performance parameters like Throughput, End-to-End Delay and
Packet Delivery Ratio of AODV (ad hoc on Demand Vector) and
DSDV (Destination Sequential Distance Vector) protocol. The
simulation tool used is Network Simulator 2 -2.35
This document summarizes a research paper on load balancing protocols in mobile ad hoc networks (MANETs). It begins with an abstract of the paper and introduces MANETs and the importance of load balancing in them given nodes' limited resources. It then discusses various load metrics and load balancing routing protocols. Specific protocols covered include Ad Hoc On-Demand Distance Vector (AODV), Ad hoc On-Demand Multipath Distance Vector (AOMDV), and Scalable Multipath On-Demand Routing (SMORT). AOMDV and SMORT aim to compute multiple loop-free paths during route discovery to help balance traffic load across multiple paths. The document concludes that load balanced routing protocols use different metrics to select routes
The document discusses a system for integrating structured and unstructured data from heterogeneous environments. The system uses OGSA-DAI services and the Globus Toolkit to provide an abstraction layer that allows database operations on both structured data from databases and unstructured file-based data. It generates metadata from unstructured data and configures the abstraction layer to query across the different data sources. This provides users an integrated view of both structured and unstructured data through a single interface.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
The document discusses using machine learning algorithms like Random Forest and k-Nearest Neighbors for intrusion detection. It analyzes the KDD Cup 1999 intrusion detection dataset to classify network traffic as normal or different types of attacks. The proposed model uses Random Forest for feature selection and k-Nearest Neighbors for classification to more accurately detect known and unknown attacks. Experimental results show the combined approach achieves better detection rates than other algorithms alone, especially for novel attacks not present in training data. Further combining the algorithms into a two-stage process may yield even higher accuracy.
This document summarizes research on palmprint identification. It begins by introducing palmprint biometrics and principal line features. It then summarizes several existing approaches that extract principal lines using techniques like finite radon transform, gradient images, and morphological operators. The proposed approach is described which uses Canny edge detection to extract principal lines based on edge direction. It preprocesses images, applies Canny edge detection, divides the output into blocks to generate templates, and performs matching. Experimental results on a public database achieve an accuracy of 86% for personal identification.
Intergraph has expanded its Global Professional Services Consultancy and Delivery Organization in Asia-Pacific with new leadership to provide consistent project delivery results across the region. The company's improved Global Professional Services Methodology provides a structured approach using best practices and processes to standardize reporting and enhance project execution. This proven methodology is scalable based on complexity and aims to streamline project governance, quality control, and risk mitigation to reduce costs and delays. Intergraph was ranked the number one provider of engineering design solutions worldwide by industry analyst ARC Advisory Group.
Компания ООО «МЕТТЭМ-Строительные технологии» является разработчиком многослойной стеновой панели и технологии ее использования в качестве наружных ограждающих конструкций в многоэтажном строительстве. В настоящее время в портфеле компании имеется опыт внедрения данной технологии в 10 регионах РФ (в том числе и Московской области) в объекты строительства жилых зданий от 3 до 17 этажей. Технология может быть применена для монолитных и сборно-железобетонных способах возведения каркаса здания. Замена традиционных стен из кирпича и пенобетон возможна на любом этапе проектирования и даже на начальном этапе строительства, так как не требует повторного прохождения экспертизы - достаточно изменения раздела проекта наружных стен.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Mr. Hakim Ali is a 40-year-old poor farmer from Village Dur Mohammad Chachar who lost his home in the 2012 floods. He lives with his wife and 4 young children in a simple mud and straw shelter. After the floods, he could not afford to rebuild. When the CRDO-IOM team met him, they prioritized building him a one-room lime-stabilized shelter. Mr. Hakim showed great interest in learning disaster-resistant construction techniques and participated fully in building trials, trainings, and constructing his new shelter. He is now happily living in his improved disaster-resistant home with his family.
This document describes the design and implementation of a low power 16-bit arithmetic logic unit (ALU) using a clock gating technique. A carry skip adder with variable block length is used in the arithmetic unit to reduce power consumption and improve performance. Clock gating is implemented to selectively clock only the active modules of the ALU. Simulation results show the clock gated ALU achieves over 66.7% reduction in dynamic power compared to a conventional ALU design. The ALU is synthesized and implemented on a Xilinx Spartan 3E FPGA, achieving a maximum frequency of 65.19MHz and dynamic power dissipation of 1.98mW at 15MHz clock frequency.
This document reviews energy efficient modulation and coding techniques for wireless sensor networks. It summarizes various modulation schemes (BPSK, QPSK, 16QAM, 64QAM) and error control codes (RS, BCH, convolutional) that have been studied. The document analyzes how these techniques can improve energy efficiency, bandwidth efficiency, and lifetime when applied to different channel conditions. Several research papers are summarized that evaluate the performance of these techniques in simulations and analysis. The conclusion is that optimal modulation and coding selection based on channel characteristics can improve energy consumption at sensor node transceivers.
Pravin Kumar is a senior sales officer currently working for Honeywell International in Mumbai, India. He has over 10 years of experience in sales and marketing roles in various industries such as electrical products, paint, tires, and more. Pravin holds an MBA in marketing and human resources and is pursuing additional certifications to strengthen his professional skills. He aims to contribute to an organization that offers professional growth opportunities where he can perform to his potential.
Regulavalasa S S Sriharsha is seeking a position as a software developer. He has a B.Tech in computer science and experience testing software at NHS ESR and TD Bank. His technical skills include Java, C#, .NET, HTML, and SQL. He has worked on projects like a campus selection system using Visual Studio and an online travel sharing application using PHP and MySQL. Sriharsha aims to enhance his knowledge and grow with an organization.
International Journal of Engineering Research and DevelopmentIJERD Editor
This document analyzes and compares different routing protocols for mobile ad hoc networks (MANETs). It begins with background on MANETs and their characteristics. It then classifies routing protocols into proactive (table-driven) and reactive (on-demand) categories. For each category, several representative protocols are described in detail, including DSDV, WRP, CGSR, DSR, AODV, ABR, SSA, and TORA. Their routing mechanisms and approaches to route discovery and maintenance are outlined. The document aims to provide an overview of major MANET routing protocols to help determine the most suitable ones for different network conditions.
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETspijans
This document summarizes and surveys several enhanced routing protocols that have been developed for mobile ad hoc networks (MANETs). It begins by providing background on routing challenges in MANETs and classifications of routing protocols. It then describes several traditional and widely used routing protocols, including DSDV, OLSR, TORA, DSR, and AODV. The document focuses on summarizing several new routing protocols that have been proposed to improve upon existing protocols. It discusses protocols such as BAWB-DSR, CCSR, RAMP, AODV-SBA, CBRP-R, and CBTRP - noting techniques, advantages, and disadvantages of each. The overall purpose is to review
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.
This document summarizes a research paper that examines the performance of three mobile ad hoc network (MANET) routing protocols: AODV, DSR, and DSDV. Through network simulations varying the number of nodes and connections, the paper evaluates the routing protocols based on average end-to-end delay, normalized routing load, packet delivery fraction, and throughput. The simulation results show that AODV generally has better performance than DSR and DSDV in terms of lower delay, higher packet delivery, and better throughput, especially as the network size increases. However, DSDV maintains more consistent performance than the reactive protocols as network conditions change.
This document analyzes the effect of node density on different routing protocols under FTP and HTTP applications. It simulates scenarios with varying node densities (20-130 nodes) using routing protocols AODV, DSR, GRP and OLSR. Key quality of service (QoS) metrics - throughput, delay, network load and packet delivery ratio - are evaluated and compared. The results show that OLSR generally performs best in terms of throughput and delay for both FTP and HTTP applications. GRP performs best for network load, while AODV has the highest packet delivery ratio for FTP. In conclusion, OLSR is the best overall routing protocol for supporting FTP and HTTP applications in mobile ad-hoc networks according to
Comparison of Various Unicast-Multicast Routing Protocols for Mobile Ad-Hoc N...Editor IJMTER
A Mobile Ad-hoc Network (MANET) is a self configuring network which consists of
mobile nodes with no permanent infrastructure. In a MANETs, there is no difference between a host
node and a router so that all nodes can be source plus forwarders of traffic. The task of finding routes
in Mobile Ad-hoc Network (MANET) is an important factor in determining the efficiency of any
MANET routing protocols. This paper describes about the basic idea of different routing protocols
and its efficient use in MANET. There are several routing protocols based on UNICAST and
MULTICAST. This paper will conclude the main characteristics of these protocols with comparison
and suggest the best suited protocol for particular topology or network.
Survey comparison estimation of various routing protocols in mobile ad hoc ne...ijdpsjournal
This document summarizes and compares various routing protocols for mobile ad-hoc networks (MANETs). It first describes the characteristics and challenges of MANETs. It then classifies routing protocols for MANETs into three main categories: table-driven (proactive), on-demand (reactive), and hybrid protocols. Examples of protocols from each category are described in detail, including DSDV, AODV, DSR, and ZRP. Key features such as route discovery, table maintenance, and use of proactive and reactive approaches are discussed for each example protocol. Finally, the document compares different protocols based on parameters like scalability, latency, bandwidth overhead, and mobility impact.
Survey of Reactive Routing Protocols for MANETIOSR Journals
Abstract : A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. The main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides a scalable solution to relatively large network topologies. The design follows the idea that each node tries to reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is needed. The performance differentials are analyzed using varying performance metrics. These simulations are carried out using the ns-2 network simulator. Keywords – AODV, DSR, MANET, NS-2, Reactive routing protocols, Survey.
A study and comparison of olsr, aodv and zrp routing protocols in ad hoc netw...eSAT Journals
Abstract A mobile ad hoc networks (MANET) is characterized by multihop wireless connectivity consisting of independent nodes which move dynamically by changing its network connectivity without the uses of any pre-existent infrastructure. MANET offers[1, 2] such flexibility which helps the network to form anywhere, at any time, as long as two or more nodes are connected and communicate with each other either directly when they are in radio range or via intermediate mobile nodes. Routing is a significant issue and challenge in ad hoc networks and many routing protocols have been proposed like OLSR, AODV, DSDV,DSR, ZRP, and TORA, LAR so far to improve the routing performance and reliability. This research paper describes the characteristics of ad hoc routing protocols OLSR, AODV and ZRP based on the performance metrics like packet delivery ratio, end–to–end delay, throughput and jitter by increasing number of nodes in the network. This comparative study proves that OLSR, ZRP performs well in dense networks in terms of low mobility and low traffic but in high mobility and high traffic environment ZRP performs well than OLSR and AODV. Keywords: MANET, AODV, OLSR, ZRP, routing
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.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
This document summarizes a research paper that evaluates the performance of two routing protocols (AODV and DSDV) under different traffic patterns (TCP and CBR) in a mobile ad hoc network (MANET) simulation. The paper describes MANET characteristics and challenges for routing. It provides an overview of reactive (AODV), proactive (DSDV), and hybrid routing protocols. It also defines TCP and CBR traffic patterns. The research aims to analyze and compare the packet delivery ratio and end-to-end delay of AODV and DSDV under different traffic loads using the NS-2 simulator. Preliminary results show that reactive protocols perform better in terms of these metrics.
Extension of Optimized Linked State Routing Protocol For Energy Efficient App...pijans
Mobile Ad-hoc network (MANET) is infrastructure less network in which nodes are mobile, self
reconfigurable, battery powered. As nodes in MANET are battery powered, energy saving is an important
issue. We are using routing protocol to save energy so as to extend network lifetime. We have extended
original Optimized Linked State Routing (OLSR) protocol by using two algorithms and named it as
Enhancement in OLSR using Residual Energy approach (EOLSR-RE) and Enhancement in OLSR using
Energy Consumption approach (EOLSR-EC). To analyze relative performance of modified protocol
EOLSR-RE and EOLSR-EC over OLSR, we performed various trials using Qualnet simulator. The
performance of these routing protocols is analyzed in terms of energy consumption, control overheads, end
to end delay, packet delivery ratio. The modified OLSR protocol improves energy efficiency of network by
reducing 20 % energy consumption and 50% control overheads.
This document summarizes a review article about energy efficient routing protocols in mobile ad hoc networks (MANETs). It discusses how MANETs use multi-hop wireless connections between mobile nodes without a fixed infrastructure. It then reviews several prominent routing protocols for MANETs, including reactive protocols like AODV and DSR, proactive protocols like DSDV and OLSR, and a hybrid protocol. Finally, it proposes a new energy-efficient clustering-based routing algorithm that selects cluster heads based on node mobility and battery power to improve path efficiency and stability in MANETs.
Performance Evaluation of DSDV and MDSDV Routing Protocol with Varying Node D...IJERA Editor
Mobile Ad Hoc Networks (MANET) is an important and challenging research area. The routing protocol should detect and maintain a good route between source and destination nodes in these dynamic networks. Many routing protocols have been proposed for mobile ad hoc networks, and none can be considered as the best under all conditions. This thesis work consist a systematic comparative evaluation of a new multipath routing protocol for MANETS. The new protocol, called Multipath Destination Sequenced Distance Vector (MDSDV) is based on the well known single path Destination Sequenced Distance Vector (DSDV) is compared with known protocol DSDV. This work containing evaluates the protocols on a range of MANETS with between 50, 75 and 100 nodes, which are static nodes. The protocol comparison metrics are Throughput and Residual Energy.
This document summarizes a research paper that analyzes the performance of the Dynamic Source Routing (DSR) protocol for mobile ad hoc networks (MANETs) in terms of energy consumption. It proposes an Energy Secure DSR (ESDSR) protocol that modifies DSR to optimize energy consumption by not including nodes with low energy in route selection. Simulations using the NS-3 network simulator show that ESDSR has better performance than DSR in terms of energy consumption, delay, throughput, and packet delivery ratio.
Performance Analysis of Mobile Adhoc Network Routing Protocols Over Tcppijans
In order to reduce the communication cost and time we are looking forward for successful implementation
of an infrastructure less network like Mobile Ad Hoc Network in all arena of wireless mobile
communication. But still it is a challenge to decide a most appropriate routing protocol for MANET. In
MANET there is no fixed topology due to the mobility of nodes, interference, multipath propagation and
path loss. Since MANET does not use fixed infrastructure rather it always have to find suitable router and
routing path for each communication, existing established routing protocol is not suitable for MANET to
function properly. Different Routing protocols have been proposed to meet the challenges with MANETs.
This paper evaluates the performances of four MANET routing protocols which are DSDV, AODV, DSR
and TORA over TCP, a Transport Layer Protocol. The performance metrics which are considered in this
paper are packet delivery fractions, normalized routing overload, end to end delay and throughput. DSDV
is a proactive protocol and the others are reactive protocols.
A detailed study of routing protocols for mobile ad hoc networks usingIAEME Publication
This document discusses routing protocols for mobile ad hoc networks. It analyzes the performance of several routing protocols including OLSR, DSR, AODV, ZRP and LAR using Qualnet simulator 6.1. The protocols are classified as proactive, reactive or hybrid. Proactive protocols maintain up-to-date routing tables while reactive protocols discover routes on demand. The paper evaluates and compares the protocols based on metrics like average jitter, end-to-end delay, and throughput under different numbers of stationary and mobile nodes.
A detailed study of routing protocols for mobile ad hoc networks usingIAEME Publication
This document discusses and compares several routing protocols for mobile ad hoc networks (MANETs). It evaluates the performance of the Optimized Link State Routing protocol (OLSR), Dynamic Source Routing (DSR), Ad-hoc On-demand Distance Vector routing (AODV), Location Aided Routing (LAR) and Zone Routing Protocol (ZRP) using the Qualnet simulator. The performance is evaluated based on average end-to-end delay, average jitter, and throughput under scenarios with 45 stationary and mobile nodes. The results show that protocols perform differently depending on node mobility, with OLSR and AODV generally having better performance than DSR, LAR and ZRP in terms of lower delay and
Electrically small antennas: The art of miniaturizationEditor IJARCET
We are living in the technological era, were we preferred to have the portable devices rather than unmovable devices. We are isolating our self rom the wires and we are becoming the habitual of wireless world what makes the device portable? I guess physical dimensions (mechanical) of that particular device, but along with this the electrical dimension is of the device is also of great importance. Reducing the physical dimension of the antenna would result in the small antenna but not electrically small antenna. We have different definition for the electrically small antenna but the one which is most appropriate is, where k is the wave number and is equal to and a is the radius of the imaginary sphere circumscribing the maximum dimension of the antenna. As the present day electronic devices progress to diminish in size, technocrats have become increasingly concentrated on electrically small antenna (ESA) designs to reduce the size of the antenna in the overall electronics system. Researchers in many fields, including RF and Microwave, biomedical technology and national intelligence, can benefit from electrically small antennas as long as the performance of the designed ESA meets the system requirement.
This document provides a comparative study of two-way finite automata and Turing machines. Some key points:
- Two-way finite automata are similar to read-only Turing machines in that they have a finite tape that can be read in both directions, but cannot write to the tape.
- Turing machines have an infinite tape that can be read from and written to, allowing them to recognize recursively enumerable languages.
- Both models are examined in their ability to accept the regular language L={anbm|m,n>0}.
- The time complexity of a two-way finite automaton for this language is O(n2) due to making two passes over the
This document analyzes and compares the performance of the AODV and DSDV routing protocols in a vehicular ad hoc network (VANET) simulation. Simulations were conducted using NS-2, SUMO, and MOVE simulators for a grid map scenario with varying numbers of nodes. The results show that AODV performed better than DSDV in terms of throughput and packet delivery fraction, while DSDV had lower end-to-end delays. However, neither protocol was found to be fully suitable for the highly dynamic VANET environment. The document concludes that further work is needed to develop improved routing protocols optimized for VANETs.
This document discusses the digital circuit layout problem and approaches to solving it using graph partitioning techniques. It begins by introducing the digital circuit layout problem and how it has become more complex with increasing circuit sizes. It then discusses how the problem can be decomposed into subproblems using graph partitioning to assign geometric coordinates to circuit components. The document reviews several traditional approaches to solve the problem, such as the Kernighan-Lin algorithm, and discusses their limitations for larger circuit sizes. It also discusses more recent approaches using evolutionary algorithms and concludes by analyzing the contributions of various approaches.
This document summarizes various data mining techniques that have been used for intrusion detection systems. It first describes the architecture of a data mining-based IDS, including sensors to collect data, detectors to evaluate the data using detection models, a data warehouse for storage, and a model generator. It then discusses supervised and unsupervised learning approaches that have been applied, including neural networks, support vector machines, K-means clustering, and self-organizing maps. Finally, it reviews several related works applying these techniques and compares their results, finding that combinations of approaches can improve detection rates while reducing false alarms.
This document provides an overview of speech recognition systems and recent progress in the field. It discusses different types of speech recognition including isolated word, connected word, continuous speech, and spontaneous speech. Various techniques used in speech recognition are also summarized, such as simulated evolutionary computation, artificial neural networks, fuzzy logic, Kalman filters, and Hidden Markov Models. The document reviews several papers published between 2004-2012 that studied speech recognition methods including using dynamic spectral subband centroids, Kalman filters, biomimetic computing techniques, noise estimation, and modulation filtering. It concludes that Hidden Markov Models combined with MFCC features provide good recognition results for large vocabulary, speaker-independent, continuous speech recognition.
This document discusses integrating two assembly lines, Line A and Line B, based on lean line design concepts to reduce space and operators. It analyzes the current state of the lines using tools like takt time analysis and MTM/UAS studies. Improvements are identified to eliminate waste, including methods improvements, workplace rearrangement, ergonomic changes, and outsourcing. Paper kaizen is conducted and work elements are retimed. The goal is to integrate the lines to better utilize space and manpower while meeting manufacturing standards.
This document summarizes research on the exposure of microwaves from cellular networks. It describes how microwaves interact with biological systems and discusses measurement techniques and safety standards regarding microwave exposure. While some studies have alleged health hazards from microwaves, independent reviews by health organizations have found no evidence that exposure to microwaves below international safety limits causes harm. The document concludes that with precautions like limiting exposure time and using phones with lower SAR ratings, microwaves from cell phones pose minimal health risks.
This document summarizes a research paper that examines the effect of feature reduction in sentiment analysis of online reviews. It uses principle component analysis to reduce the number of features (product attributes) from a dataset of 500 camera reviews labeled as positive or negative. Two models are developed - one using the original set of 95 product attributes, and one using the reduced set. Support vector machines and naive Bayes classifiers are applied to both models and their performance is evaluated to determine if classification accuracy can be maintained while using fewer features. The results show it is possible to achieve similar accuracy levels with less features, improving computational efficiency.
This document provides a review of multispectral palm image fusion techniques. It begins with an introduction to biometrics and palm print identification. Different palm print images capture different spectral information about the palm. The document then reviews several pixel-level fusion methods for combining multispectral palm images, finding that Curvelet transform performs best at preserving discriminative patterns. It also discusses hardware for capturing multispectral palm images and the process of region of interest extraction and localization. Common fusion methods like wavelet transform and Curvelet transform are also summarized.
This document describes a vehicle theft detection system that uses radio frequency identification (RFID) technology. The system involves embedding an RFID chip in each vehicle that continuously transmits a unique identification signal. When a vehicle is stolen, the owner reports it to the police, who upload the vehicle's information to a central database. Police vehicles are equipped with RFID receivers. If a stolen vehicle passes within range of a receiver, the receiver detects the vehicle's ID signal and displays its details on a tablet. This allows police to quickly identify and recover stolen vehicles. The system aims to make it difficult for thieves to hide a vehicle's identity and allows vehicles to be tracked globally wherever the detection system is implemented.
This document discusses and compares two techniques for image denoising using wavelet transforms: Dual-Tree Complex DWT and Double-Density Dual-Tree Complex DWT. Both techniques decompose an image corrupted by noise using filter banks, apply thresholding to the wavelet coefficients, and reconstruct the image. The Double-Density Dual-Tree Complex DWT yields better denoising results than the Dual-Tree Complex DWT as it produces more directional wavelets and is less sensitive to shifts and noise variance. Experimental results on test images demonstrate that the Double-Density method achieves higher peak signal-to-noise ratios, especially at higher noise levels.
This document compares the k-means and grid density clustering algorithms. It summarizes that grid density clustering determines dense grids based on the densities of neighboring grids, and is able to handle different shaped clusters in multi-density environments. The grid density algorithm does not require distance computation and is not dependent on the number of clusters being known in advance like k-means. The document concludes that grid density clustering is better than k-means clustering as it can handle noise and outliers, find arbitrary shaped clusters, and has lower time complexity.
This document proposes a method for detecting, localizing, and extracting text from videos with complex backgrounds. It involves three main steps:
1. Text detection uses corner metric and Laplacian filtering techniques independently to detect text regions. Corner metric identifies regions with high curvature, while Laplacian filtering highlights intensity discontinuities. The results are combined through multiplication to reduce noise.
2. Text localization then determines the accurate boundaries of detected text strings.
3. Text binarization filters background pixels to extract text pixels for recognition. Thresholding techniques are used to convert localized text regions to binary images.
The method exploits different text properties to detect text using corner metric and Laplacian filtering. Combining the results improves
This document describes the design and implementation of a low power 16-bit arithmetic logic unit (ALU) using clock gating techniques. A variable block length carry skip adder is used in the arithmetic unit to reduce power consumption and improve performance. The ALU uses a clock gating circuit to selectively clock only the active arithmetic or logic unit, reducing dynamic power dissipation from unnecessary clock charging/discharging. The ALU was simulated in VHDL and synthesized for a Xilinx Spartan 3E FPGA, achieving a maximum frequency of 65.19MHz at 1.98mW power dissipation, demonstrating improved performance over a conventional ALU design.
This document describes using particle swarm optimization (PSO) and genetic algorithms (GA) to tune the parameters of a proportional-integral-derivative (PID) controller for an automatic voltage regulator (AVR) system. PSO and GA are used to minimize the objective function by adjusting the PID parameters to achieve optimal step response with minimal overshoot, settling time, and rise time. The results show that PSO provides high-quality solutions within a shorter calculation time than other stochastic methods.
This document discusses implementing trust negotiations in multisession transactions. It proposes a framework that supports voluntary and unexpected interruptions, allowing negotiating parties to complete negotiations despite temporary unavailability of resources. The Trust-x protocol addresses issues related to validity, temporary loss of data, and extended unavailability of one negotiator. It allows a peer to suspend an ongoing negotiation and resume it with another authenticated peer. Negotiation portions and intermediate states can be safely and privately passed among peers to guarantee stability for continued suspended negotiations. An ontology is also proposed to provide formal specification of concepts and relationships, which is essential in complex web service environments for sharing credential information needed to establish trust.
This document discusses and compares various nature-inspired optimization algorithms for resolving the mixed pixel problem in remote sensing imagery, including Biogeography-Based Optimization (BBO), Genetic Algorithm (GA), and Particle Swarm Optimization (PSO). It provides an overview of each algorithm, explaining key concepts like migration and mutation in BBO. The document aims to prove that BBO is the best algorithm for resolving the mixed pixel problem by comparing it to other evolutionary algorithms. It also includes figures illustrating concepts like the species model and habitat in BBO.
This document discusses principal component analysis (PCA) for face recognition. It begins with an introduction to face recognition and PCA. PCA works by calculating eigenvectors from a set of face images, which represent the principal components that account for the most variance in the image data. These eigenvectors are called "eigenfaces" and can be used to reconstruct the face images. The document then discusses how the system is implemented, including preparing a face database, normalizing the training images, calculating the eigenfaces/principal components, projecting the face images into this reduced space, and recognizing faces by calculating distances between projected test images and training images.
This document summarizes research on using wireless sensor networks to detect mobile targets. It discusses two optimization problems: 1) maximizing the exposure of the least exposed path within a sensor budget, and 2) minimizing sensor installation costs while ensuring all paths have exposure above a threshold. It proposes using tabu search heuristics to provide near-optimal solutions. The research also addresses extending the models to consider wireless connectivity, heterogeneous sensors, and intrusion detection using a game theory approach. Experimental results show the proposed mobile replica detection scheme can rapidly detect replicas with no false positives or negatives.
Building Production Ready Search Pipelines with Spark and MilvusZilliz
Spark is the widely used ETL tool for processing, indexing and ingesting data to serving stack for search. Milvus is the production-ready open-source vector database. In this talk we will show how to use Spark to process unstructured data to extract vector representations, and push the vectors to Milvus vector database for search serving.
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?Speck&Tech
ABSTRACT: A prima vista, un mattoncino Lego e la backdoor XZ potrebbero avere in comune il fatto di essere entrambi blocchi di costruzione, o dipendenze di progetti creativi e software. La realtà è che un mattoncino Lego e il caso della backdoor XZ hanno molto di più di tutto ciò in comune.
Partecipate alla presentazione per immergervi in una storia di interoperabilità, standard e formati aperti, per poi discutere del ruolo importante che i contributori hanno in una comunità open source sostenibile.
BIO: Sostenitrice del software libero e dei formati standard e aperti. È stata un membro attivo dei progetti Fedora e openSUSE e ha co-fondato l'Associazione LibreItalia dove è stata coinvolta in diversi eventi, migrazioni e formazione relativi a LibreOffice. In precedenza ha lavorato a migrazioni e corsi di formazione su LibreOffice per diverse amministrazioni pubbliche e privati. Da gennaio 2020 lavora in SUSE come Software Release Engineer per Uyuni e SUSE Manager e quando non segue la sua passione per i computer e per Geeko coltiva la sua curiosità per l'astronomia (da cui deriva il suo nickname deneb_alpha).
Have you ever been confused by the myriad of choices offered by AWS for hosting a website or an API?
Lambda, Elastic Beanstalk, Lightsail, Amplify, S3 (and more!) can each host websites + APIs. But which one should we choose?
Which one is cheapest? Which one is fastest? Which one will scale to meet our needs?
Join me in this session as we dive into each AWS hosting service to determine which one is best for your scenario and explain why!
AI 101: An Introduction to the Basics and Impact of Artificial IntelligenceIndexBug
Imagine a world where machines not only perform tasks but also learn, adapt, and make decisions. This is the promise of Artificial Intelligence (AI), a technology that's not just enhancing our lives but revolutionizing entire industries.
Generating privacy-protected synthetic data using Secludy and MilvusZilliz
During this demo, the founders of Secludy will demonstrate how their system utilizes Milvus to store and manipulate embeddings for generating privacy-protected synthetic data. Their approach not only maintains the confidentiality of the original data but also enhances the utility and scalability of LLMs under privacy constraints. Attendees, including machine learning engineers, data scientists, and data managers, will witness first-hand how Secludy's integration with Milvus empowers organizations to harness the power of LLMs securely and efficiently.
GraphRAG for Life Science to increase LLM accuracyTomaz Bratanic
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers
TrustArc Webinar - 2024 Global Privacy SurveyTrustArc
How does your privacy program stack up against your peers? What challenges are privacy teams tackling and prioritizing in 2024?
In the fifth annual Global Privacy Benchmarks Survey, we asked over 1,800 global privacy professionals and business executives to share their perspectives on the current state of privacy inside and outside of their organizations. This year’s report focused on emerging areas of importance for privacy and compliance professionals, including considerations and implications of Artificial Intelligence (AI) technologies, building brand trust, and different approaches for achieving higher privacy competence scores.
See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe.
This webinar will review:
- The top 10 privacy insights from the fifth annual Global Privacy Benchmarks Survey
- The top challenges for privacy leaders, practitioners, and organizations in 2024
- Key themes to consider in developing and maintaining your privacy program
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
Digital Marketing Trends in 2024 | Guide for Staying AheadWask
https://www.wask.co/ebooks/digital-marketing-trends-in-2024
Feeling lost in the digital marketing whirlwind of 2024? Technology is changing, consumer habits are evolving, and staying ahead of the curve feels like a never-ending pursuit. This e-book is your compass. Dive into actionable insights to handle the complexities of modern marketing. From hyper-personalization to the power of user-generated content, learn how to build long-term relationships with your audience and unlock the secrets to success in the ever-shifting digital landscape.
Programming Foundation Models with DSPy - Meetup SlidesZilliz
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
Webinar: Designing a schema for a Data WarehouseFederico Razzoli
Are you new to data warehouses (DWH)? Do you need to check whether your data warehouse follows the best practices for a good design? In both cases, this webinar is for you.
A data warehouse is a central relational database that contains all measurements about a business or an organisation. This data comes from a variety of heterogeneous data sources, which includes databases of any type that back the applications used by the company, data files exported by some applications, or APIs provided by internal or external services.
But designing a data warehouse correctly is a hard task, which requires gathering information about the business processes that need to be analysed in the first place. These processes must be translated into so-called star schemas, which means, denormalised databases where each table represents a dimension or facts.
We will discuss these topics:
- How to gather information about a business;
- Understanding dictionaries and how to identify business entities;
- Dimensions and facts;
- Setting a table granularity;
- Types of facts;
- Types of dimensions;
- Snowflakes and how to avoid them;
- Expanding existing dimensions and facts.
Project Management Semester Long Project - Acuityjpupo2018
Acuity is an innovative learning app designed to transform the way you engage with knowledge. Powered by AI technology, Acuity takes complex topics and distills them into concise, interactive summaries that are easy to read & understand. Whether you're exploring the depths of quantum mechanics or seeking insight into historical events, Acuity provides the key information you need without the burden of lengthy texts.
5th LF Energy Power Grid Model Meet-up SlidesDanBrown980551
5th Power Grid Model Meet-up
It is with great pleasure that we extend to you an invitation to the 5th Power Grid Model Meet-up, scheduled for 6th June 2024. This event will adopt a hybrid format, allowing participants to join us either through an online Mircosoft Teams session or in person at TU/e located at Den Dolech 2, Eindhoven, Netherlands. The meet-up will be hosted by Eindhoven University of Technology (TU/e), a research university specializing in engineering science & technology.
Power Grid Model
The global energy transition is placing new and unprecedented demands on Distribution System Operators (DSOs). Alongside upgrades to grid capacity, processes such as digitization, capacity optimization, and congestion management are becoming vital for delivering reliable services.
Power Grid Model is an open source project from Linux Foundation Energy and provides a calculation engine that is increasingly essential for DSOs. It offers a standards-based foundation enabling real-time power systems analysis, simulations of electrical power grids, and sophisticated what-if analysis. In addition, it enables in-depth studies and analysis of the electrical power grid’s behavior and performance. This comprehensive model incorporates essential factors such as power generation capacity, electrical losses, voltage levels, power flows, and system stability.
Power Grid Model is currently being applied in a wide variety of use cases, including grid planning, expansion, reliability, and congestion studies. It can also help in analyzing the impact of renewable energy integration, assessing the effects of disturbances or faults, and developing strategies for grid control and optimization.
What to expect
For the upcoming meetup we are organizing, we have an exciting lineup of activities planned:
-Insightful presentations covering two practical applications of the Power Grid Model.
-An update on the latest advancements in Power Grid -Model technology during the first and second quarters of 2024.
-An interactive brainstorming session to discuss and propose new feature requests.
-An opportunity to connect with fellow Power Grid Model enthusiasts and users.
Fueling AI with Great Data with Airbyte WebinarZilliz
This talk will focus on how to collect data from a variety of sources, leveraging this data for RAG and other GenAI use cases, and finally charting your course to productionalization.
1. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2281
www.ijarcet.org
REVIEW ON ROUTING PROTOCOLS
FOR MOBILE AD HOC NETWORKS
G. Poornima1
, Mr. M. Rajasenathipathi2
,
1
Research Scholar, Department of Computer Science, NGM College, Pollachi
2
Assistant Professor, Department of Computer Science, NGM College, Pollachi
Abstract - A Mobile Ad hoc network (MANET) is
a collection of mobile nodes that is connected
through a wireless medium forming a dynamic
network. An Ad hoc network doesn’t have any
centralized arbitrator or server. In ad hoc
networks nodes move arbitrarily and network
may experience rapid and unpredictable topology
changes. Because nodes in MANET normally have
limited transmission ranges, some nodes cannot
communicate directly with each other. Hence
routing paths in mobile ad hoc networks
potentially contains multiple hops and every node
in a network has the responsibility to act as a
router. In this paper we provide an overview of
routing protocols by presenting their
characteristics and functionality and also provide
a comparison between protocols to analyze
performance.
Key words: MANET, Proactive and Reactive routing
protocols
I. INTRODUCTION
A mobile ad hoc network (MANET) is a self
configuring dynamic network comprising of mobile
nodes, where each and every Participation node
voluntarily transmit the packets destined to some
remote node using wireless transmission. An ad hoc
network doesn’t have any centralized arbitrator or
server. In MANET each and every mobile node is
assumed to be moving with more or less relative
speed in arbitrary direction. Because of that there is
no long term guaranteed path from any one node to
other node. Every node in the MANET can assist in
routing of packets in the network. MANET posses
certain characteristics like Bandwidth-Constrained,
Variable capacity links, Energy constrained
operation, Limited physical security, dynamic
network topology, Frequent routing updates.
MANET very have enterprising use in emergency
scenarios like military operations and disaster relief
operation where there is a need of communication
network immediately following some major event or
some temporary requirement like conference and
seminar at a new place without the existence of
network infrastructure.
The rest of the paper is organized as follows:
Section II presents a Routing in MANET. Section III
presents a Classification of various routing protocols.
Section IV, V, VI presents the detailed analysis of all
the three categories ad hoc routing protocols. Finally
Section VII concludes the paper.
II. ROUTING IN MANET
“Routing is the process of information exchange
from one host to the other host in a network.”[1].
Routing is the mechanism of forwarding packets
towards its destination using most efficient path.
Efficiency of the path is measured in various metrics
like Number of hops, traffic, security, etc., In Ad hoc
network each host act as specialized router itself . A
mobile Ad hoc network or spontaneous network is an
infra structure less, self organized and multi hop
network with rapidly changing topology causing
wireless links to be broken and re-established. A key
issue is the necessity of the routing protocols must be
able to respond rapidly to the topological changes in
the network. In these networks, each node must be
capable of acting as a router. As a result of limited
bandwidth of nodes, the source and the destination
have to communicate via intermediate nodes [2].
Major problems in routing are Asymmetric links,
Routing Over head, Interference and dynamic
topology.
2. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2282
www.ijarcet.org
Routing in MANET has been an active area of
research and number of routing protocols has been
introduced for addressing the problems of routing. In
Section III classifies the routing protocols for
MANET. Section IV, V, VI presents the detailed
analysis of routing protocols in MANET.
III. CLASSIFICATION OF ROUTING
PROTOCOLS
The routing protocols for ad hoc wireless networks
can be divided into three categories based on the
routing information update mechanism namely Pro
active (Table driven), Re active (on demand), Hybrid
routing.
PROACTIVE ROUTING PROTOCOLS:
Proactive protocols continuously learn the topology
of the network by exchanging topological
information among the network nodes. Thus when
there is a need for a route to a destination such route
information is available immediately. If the network
topology changes too frequently, the cost of
maintaining the network might be very high. If the
network activity is low, the information about actual
is not used.
REACTIVE ROUTING PROTOCOLS:
The reactive routing protocols are based on some sort
of query-reply dialog. Reactive protocols proceed for
establishing routes to the destination only when the
need arises. They do not need periodic transmission
of topological information of the network.
HYBRID ROUTING PROTOCOLS:
The hybrid routing protocols are based on the
combination of proactive and reactive routing
protocols. There exists a number of routing protocols
of globally reactive and locally proactive states.
IV. PROACTIVE PROTOCOLS
The proactive protocols always maintain up-to-date
information about the routes from each node to every
other node in the network. The proactive protocols
continuously learn the topology of the network by
exchanging topological information among the
network nodes. Thus when there is a need for a route
to a destination, such route information is available
immediately [3]. These protocols require each node
to maintain one or more tables to store up to date
routing information and to propagate updates
throughout the network. These protocols are often
referred to as Table-driven routing protocols. These
protocols maintain all valid routes to all
communication mobile nodes at all the time, which
means before a route is needed. Periodic route
updates are exchanged in order to synchronize the
tables. Some examples of table driven routing
protocols includes: Dynamic Destination Sequenced
Distance-vector Routing Protocol (DSDV),
Optimized Link State Routing Protocol (OLSR),
Wireless Routing Protocol (WRP).
DYNAMIC DESTINATION SEQUENCED
DISTANCE-VECTOR ROUTING PROTOCOL
(DSDV):
DSDV [4] is developed on the basis of Bellman-Ford
routing algorithm [5] with some modifications. In
this routing protocol each mobile node in the network
keeps a routing table. Each of the routing table
contains the list of all available destinations and the
number of hops to each. Each table entry is tagged
with a sequence number, which is originated by the
destination node. Periodic transmission of updates of
the routing table helps maintaining the topology
information about the network. If there is a change in
the routing information, the updates are transmitted
immediately. So, the routing information updates
might be periodic or event-Driven. DSDV protocol
requires each mobile node in the network to advertise
its own routing table to its current neighbors. The
advertisement is done either by broadcasting or
multicasting. By the advertisements neighboring
nodes can know about any change that has occurred
in the network due to movement of nodes. The
routing updates may be sent in two ways: Full Dump:
The entire routing table is sent to the neighbors.
Incremental Dump: Only the entries that require
changes are sent.
WIRELESS ROUTING PROTOCOL (WRP):
WRP [6] is a table based protocol is similar to
DSDV that inherits the properties of Bellman Ford
algorithm. The main goal is to maintain the routing
information among all the nodes in the network
3. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2283
www.ijarcet.org
regarding the shortest distance to every destination.
WRP belongs to general class of path finding
algorithms defined as the set of distributed shortest
path algorithms. It calculates the path using
information regarding the length and second-hop the
shortest path to each destination. WRP reduces the
temporary routing loop which occurs. Each node in
the network maintains a set of four tables to provide
accurate information: Distance Table (DT), Routing
Table (RT), Link-cost table (LCT), Message
Retransmission list (MRL). WRP uses periodic
update message transmission to the neighbors of a
node. The nodes in the response list of update
message should send acknowledgements. If there is
no change in the last update the nodes in the response
list should send a Hello Messages to ensure
connectivity. A node can decide to update routing
table after receiving an update message from a
neighbor and always look for better path using new
information. If node gets better path, it relays back
that information to the original nodes. So it can
update their tables. After receiving the
acknowledgement, original node update their MRL.
Thus each time the consistency of the routing
information is checked and it eliminates looping and
enable faster route Convergence when a link failure
occurs.
CLUSTER GATEWAY SWITCH ROUTING
PROTOCOL (CGSR)
CGSR [7] consider a clustered mobile wireless
network is a hierarchical instead of flat network. For
structuring the network into separate interrelated
groups, cluster heads are elected using a cluster head
selection algorithm. By forming several clusters this
protocol achieves a distributed processing mechanism
in the network. One disadvantage of using this
protocol is that, frequent change or selection of
cluster head might be resource hungry and it may
affect the routing performance. CGSR uses DSDV as
a underlying scheme. It modifies DSDV by using
hierarchical Cluster head Gateway routing approach
to route traffic from source to destination. A packet
sent by a node is first sent to the cluster head and
then it sends to gateway to another cluster head and
so on until it reaches from cluster head to the
destination. The following table shows a comparison
of proactive protocols.
Table: I Comparison of Proactive Protocols
Parameters DSDV CGSR WRP
Loop free Yes Yes Yes
Required routing
table
Two Two Four
Critical nodes No Yes No
Utilizes Hello
Messages
Yes No Yes
Routing
Philosophy
Flat Hierarchical Flat
V. REACTIVE PROTOCOLS
The reactive or on demand routing protocols are
based on Query-Reply. In this topology need not to
maintain up-to-date of the network. When a route is
desired, a procedure is invoked to find a route to a
destination. The major goal of this protocol is to
minimize the network traffic overhead. When a need
arises, a reactive protocol invokes a procedure to find
a route to the destination such procedure involves
flooding the network with the route query. In reactive
the mechanism for discovering routes. The source
node emits a request message requesting route to a
destination. The message is flooded and sent to all
the nodes in the network until it reaches the
destination. The path followed by the request
message is recorded in the message and returned to
the sender by the destination or intermediate nodes as
reply messages. When multiple reply messages result
it gets multiple paths from that can choose shortest
path. Some examples of On-Demand Routing
Protocols include: Dynamic Source Routing (DSR),
Ad hoc On-Demand Distance Vector Routing
(AODV), and Temporarily Ordered Routing
Algorithm (TORA).
DYNAMIC SOURCE ROUTING:
DSR [8] allows nodes in the MANET to dynamically
discover a route across multiple network hops to any
destination. DSR is a reactive protocol i.e. it doesn’t
use periodic updates. It computes the route when
necessary and maintains them. In this protocol
4. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2284
www.ijarcet.org
mobile nodes are required to maintain a route caches.
Route cache is updated when any new route is known
for a entry in the route cache. Routing in DSR is done
in two phases: Route Discovery and Route
Maintenance. When source node wants to send a
packet to the destination, it first checks in route cache
if already there is an entry then source uses that and
it sends packet to the destination. If the entry is not in
route cache it first broadcast a route request message
to all the nodes in the network. The Route Request
includes destination address, source address and
unique identification number. If the intermediate
nodes don’t know about the destination it again
forwards the packet and finally it reaches the
destination. A route reply is generated by the
destination or intermediate when it knows about how
to reach the destination.
AD-HOC ON-DEMAND DISTANCE VECTOR
ROUTING:
AODV [9] is basically an improvement of DSDV.
But AODV is a reactive routing protocol instead of
proactive. It minimizes the number of broadcasts by
creating routes based on demand. When any source
node wants to send a packet to a destination, it
broadcasts a RREQ packet. The neighboring nodes in
turn broadcast to their neighbors and the process
continues until it reaches the destination. During the
process of forwarding the RREQ, intermediate nodes
records the address of the neighbor from which
packets received while broadcasting. This route
information is stored in route tables, which helps for
establishing Reverse Path. If additional copies of
same RREQ are received later it simply discards it.
Then reply is sent using Reverse Path. For Route
Maintenance, when a source node moves, it can re-
initiate a route discovery process. If any
intermediate node moves with in a particular route,
the neighbor of the drifted node can detect the link
failure and sends a link failure notification to its
upstream neighbor. This process continues until the
failure notification reaches the source node. After
receiving the failure notification source again re-
initiate a discovery phase.
TEMPORARILY ORDERED ROUTING
ALGORITHM
TORA [10] is a reactive routing protocol. In this a
link between nodes is established creating a Directed
Acyclic Graph (DAG) of the route from source to
destination. This protocol uses a “link reversal” for
route discovery. A route discovery query is
broadcasted to the entire network until it reaches the
destination or a node that has information about the
destination. Main feature of this protocol is
propagation of control messages only around the
point of failure or link failure occurs. In comparison,
all other protocols need to re-initiate a route
discovery when a link fails but TORA would be able
to patch itself around the point of failure. TORA
involves four major functions: Creating, maintaining,
erasing and optimizing routes. Since every node must
have a height, any node which doesn’t have a height
is considered as a erased node. Sometimes the nodes
are given new heights to improve the linking
structure. This function is called optimization of
routes.
Table: II Comparisons of Reactive Protocols
Parameters AODV DSR TORA
Route creation By
source
By
source
Locally
Routes
maintained in
Route
Table
Route
Cache
Route
Table
Route
Reconfiguration
Methodology
Erase
route,
notify
source
Erase
route,
notify
source
Link
reversal,
Route
repair
Routing
Philosophy
Flat Flat Flat
Multiple Route
possibilities
No Yes Yes
5. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2285
www.ijarcet.org
VI. HYBRID ROUTING PROTOCOLS
This protocol is a combination of proactive and
reactive routing protocols. It is used to provide
hierarchical routing. The common disadvantage
of hybrid routing protocol is that the nodes that
have high level topological information
maintains more routing information, which leads
to more memory and power consumption.
Hybrid protocol includes: Zone Routing Protocol
(ZRP), Core Extraction Distributed Ad hoc
Routing (CEDAR).
ZONE ROUTING PROTOCOL (ZRP):
ZRP [11] is a hybrid routing protocol for
MANET which localizes the nodes into sub-
networks (Zones). With each zone, proactive
routing is adapted to speed up communication
among neighbors. The inter-zone communication
uses on-demand routing to reduce unnecessary
communication. The network is divided into
zones according to distance between nodes.
Given a hop distance d and a node N, all nodes
with in a hop distance at most d from N belongs
to the routing zone of N. The issue of zone
routing is to determine the size of the zone.
Every node periodically needs to update the
routing information inside the zone. Some local
route optimization is performed at each node,
which includes the following actions: removal of
redundant routes, shortening of routes, detecting
of link failures.
CORE EXTRACTION DISTRIBUTED AD HOC
ROUTING (CEDAR):
CEDAR is a partitioning protocol, integrates
routing with QoS support. Each partition
includes a core node called dominator node. A
dominator set (DS) of a graph is defined as a set
of nodes in the graph such that every node is
either present in DS. The core node uses a
reactive source routing protocol to outline a
source from destination. It has three phases:
1. Establishment and maintenance of self
organizing routing infrastructure to
perform route computations.
2. Propagation of link-states of high-
bandwidth and stable links in the core.
3. A QoS route computation algorithm that
is executed at the core nodes using only
local available states.
Table III: Comparison between three categories of
Routing Protocols
Parameters Proactive Reactive Hybrid
Route
Availability
Always Only
when
needed
Depends on
location of
destination
Routing
Philosophy
Flat Flat Hierarchial
Scalability 100
nodes
>100
nodes
1000 nodes
VII.CONCLUSION
This paper presents a number of routing protocols for
MANET, which are broadly classified as proactive,
reactive and hybrid. Proactive routing protocols tend
to provide lower latency than that of On-demand
protocols, because they try to maintain routes to all
the nodes in the network all the time. Each routing
protocol has unique features. On the other hand,
reactive protocols discover routes only when they are
needed, and still generate amount of traffic when
network changes frequently. Depending on the
network traffic and number of flows, the routing
protocol is chosen.There is congestion in the network
because of traffic reactive protocol is preferable. For
example: AODV, DSR, and OLSR these protocols
are suitable for smaller networks. TORA, ZRP are
suitable for larger networks. When network is static,
proactive routing protocol can be used. Mobility of
nodes in the network increases, reactive protocols
performs better. Often it is more appropriate to apply
a hybrid protocol rather than proactive or reactive as
hybrid protocols often posses the advantages of both
types of protocols.
6. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2286
www.ijarcet.org
REFERENCES
[1] K. Gupta and H. Sadwarti , ” Secure Routing techniques for
MANETs,” “International journal of Computer Theory and
Engineering”, vol.1 no.4,pp.456-460, October 2009.
[2] C. E. Perkins, “Ad hoc Networking”, Pearson
Publication
[3] Boukerche, B. Turgut, N. Aydin, M. Z. Ahmad, L. Bölöni, and
D.Turgut, “Routing protocols in ad hoc networks: A survey,”
“Elsevier Computer Networks”, 55 (2011) 3032–3080.
[4] Perkins CE, Bhagwat P, “Highly Dynamic Destination –
Sequenced Distance Vector Routing (DSDV) for Mobile
Computers “,Proceedings of ACM SIGCOMM 1994:234-260
[5] Cheng C , Riley R, Kumar SPR, Garcia-Luna-Aceves JJ , “ A
Loop Free Extended Bellman-Ford Routing Protocol Without
Bouncing Effect”, ACM SIGCOMM Computer Communications
Review, Volume 19, Issue 4:224-236
[6] S. Murthy 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.
[7] Chiang C-C , Wu H-K , Gerla M, “Routing in Clustered
Multihop”, Mobile Wireless Networks with fading Channel,
Proceedings of IEEE SICON 197-211.
[8] Broch J.Jhonson DB, Maltz DA , “ The Dynamic Source
Routing protocol for mobile Ad Hoc Networks”, IETF
Draft,October,2003.
[9] Perkins CE, Royer EM , Chankeres ID, “Ad Hoc On Demand
Distance Vector Routing “, IETF Draft, October,2003.
[10] A. K. Gupta, H. Sadawarti, and A. K. Verma, “Performance
analysis
of AODV, DSR & TORA Routing Protocols,” “IACSIT
International Journal of Engineering and Technology”, vol.2, vo.2,
April 2010.
[11] Z. J. Haas and M. R. Pearlman, .ZRP: a hybrid framework
for routing in ad hoc networks, pp. 221.253, 2001.
Authors:
G.Poornima – G.Poornima received M.Sc degree in Computer
Technology from Anna University, Coimbatore. Currently she is
doing M.Phil degree in Computer Science at Bharathiar University,
Coimbatore, and her research interest lies in the area of Wireless
networks and Ad hoc networks.
M. Rajasenathipathi – Mr. M. Rajasenathipathi received his
Master degree in Computer Applications and M.Phil degree in
Computer Science from M.K University. He is also working as an
Assistant Professor of Computer Science at N.G.M College,
Pollachi, India. He has been an active developer of systems for
people with disabilities for the past 10 years.