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.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
A Simulation Based Performance Comparison of Routing Protocols (Reactive and ...IOSR Journals
This document compares the performance of three routing protocols - AODV, DSDV, and OLSR - under the random waypoint mobility model using network simulation. Simulation results with 30 and 50 nodes found that OLSR performed better than AODV and DSDV in terms of packet receive rate and packets received with 30 nodes and a simulation time of 100 seconds. DSDV performed better than the other protocols with 50 nodes and a simulation time of 200 seconds. Overall, AODV showed the poorest performance in both scenarios. The document analyzes these routing protocols and the random waypoint mobility model to evaluate their performance under different parameters.
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.
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.
The document evaluates the performance of 5 routing protocols (AODV, DSR, TORA, OLSR, GRP) in a mobile ad hoc network (MANET) using the OPNET simulator. Simulations were run with 30, 60, and 90 nodes using email and video conferencing applications. Performance was analyzed based on throughput, delay, load, and data dropped. In general, GRP and OLSR had the lowest delay, DSR and GRP had the lowest load, and OLSR and AODV had the highest throughput, while TORA often had the worst performance based on the metrics. The evaluation provides insights into the relative performance of the routing protocols under different conditions in a MANET
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
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
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.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
A Simulation Based Performance Comparison of Routing Protocols (Reactive and ...IOSR Journals
This document compares the performance of three routing protocols - AODV, DSDV, and OLSR - under the random waypoint mobility model using network simulation. Simulation results with 30 and 50 nodes found that OLSR performed better than AODV and DSDV in terms of packet receive rate and packets received with 30 nodes and a simulation time of 100 seconds. DSDV performed better than the other protocols with 50 nodes and a simulation time of 200 seconds. Overall, AODV showed the poorest performance in both scenarios. The document analyzes these routing protocols and the random waypoint mobility model to evaluate their performance under different parameters.
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.
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.
The document evaluates the performance of 5 routing protocols (AODV, DSR, TORA, OLSR, GRP) in a mobile ad hoc network (MANET) using the OPNET simulator. Simulations were run with 30, 60, and 90 nodes using email and video conferencing applications. Performance was analyzed based on throughput, delay, load, and data dropped. In general, GRP and OLSR had the lowest delay, DSR and GRP had the lowest load, and OLSR and AODV had the highest throughput, while TORA often had the worst performance based on the metrics. The evaluation provides insights into the relative performance of the routing protocols under different conditions in a MANET
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
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
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.
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
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.
The document provides an overview of routing protocols for mobile ad hoc networks (MANETs). It discusses that MANETs are self-configuring networks without centralized control where nodes can act as routers to forward packets. The document classifies routing protocols as proactive (table-driven), reactive (on-demand), or hybrid. It describes examples of proactive routing protocols like DSDV, OLSR, and WRP that maintain up-to-date routing tables and share updates periodically or when changes occur. The document also discusses reactive protocols establish routes on demand and hybrid protocols that combine aspects of proactive and reactive approaches.
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.
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.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
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.
To improve the QoS in MANETs through analysis between reactive and proactive ...CSEIJJournal
A Mobile Ad hoc NETwork (MANET), is a self-configuring infra structure less network of mobile devices
connected by wireless links. ad hoc is Latin and means "for this purpose". Each device in a MANET is free
to move independently in any direction, and will therefore change its links to other devices frequently. Each
must forward traffic unrelated to its own use, and therefore be a router. The primary challenge in building
a MANET is equipping each device to continuously maintain the information required to properly route
traffic. QOS is defined as a set of service requirements to be met by the network while transporting a
packet stream from source to destination. Intrinsic to the notion of QOS is an agreement or a guarantee by
the network to provide a set of measurable pre-specified service attributes to the user in terms of delay,
jitter, available bandwidth, packet loss, and so on. The analysis is mainly between proactive or table-driven
protocols like OLSR (Optimized Link State Routing) viz DSDV (Destination Sequenced Distance Vector) &
CGSR (Cluster Head Gateway Switch Routing) and reactive or source initiated routing protocols viz
AODV (Ad hoc on Demand distance Vector) & DSR (Dynamic Source Routing). The QoS analysis of the
above said protocols is simulated on NS2 and results are shown thereby.
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.
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
Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Gene...IOSR Journals
This document discusses using a genetic algorithm to improve routing in mobile ad hoc networks. It begins with background on mobile ad hoc networks and common routing protocols. It then introduces genetic algorithms and how they work by simulating natural evolution. The document proposes using a genetic algorithm with the AODV routing protocol to find optimal paths between source and destination nodes. It describes implementing this approach and comparing its performance to traditional AODV routing. The results showed the genetic algorithm approach performed better in terms of quality of service and throughput.
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 summarizes an article that proposes improvements to the Ad hoc On-Demand Distance Vector (AODV) routing protocol for use in Vehicular Ad hoc Networks (VANETs). It first provides background on VANETs and discusses different types of routing protocols used in VANETs, including topology-based, position-based, and hybrid protocols. It then focuses on improvements made to the reactive AODV routing protocol, including adding link layer security checks and a method to reduce packet delay called AODV_BD. The goal of these improvements is to create more stable routes and reduce packet delay for safety communications between vehicles.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
This document compares the performance of five routing protocols (AODV, DSR, DSDV, OLSR, DYMO) in mobile ad hoc networks through simulations. It describes the key characteristics and mechanisms of each protocol. Simulations are conducted in the NS-2 simulator using the random waypoint mobility model. Performance is evaluated under varying pause times based on four metrics: packet delivery ratio, average end-to-end delay, normalized routing load, and average throughput. The results aim to determine the best operational conditions for each protocol.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
This document compares the performance of five routing protocols (AODV, DSR, DSDV, OLSR, DYMO) in mobile ad hoc networks through simulations. It summarizes each protocol and discusses the simulation setup. The protocols are categorized as reactive, proactive, or hybrid. Key performance metrics like packet delivery ratio, end-to-end delay, and routing load are evaluated under varying pause times using the NS-2 simulator. The analysis seeks to determine the best operational conditions for each protocol in mobile ad hoc networks.
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.
PERFORMANCE COMPARISION OF DSDV, AODV AND DSRFOR MOBILE AD HOC NETWORK BY VAR...Saurabh Mishra
This document compares the performance of three routing protocols - DSDV, AODV, and DSR - for mobile ad hoc networks by simulating networks of varying sizes using the Qualnet simulator. The main findings are that AODV performed most efficiently for network sizes of 30, 40, and 50 nodes, and that performance decreased for all three protocols as the number of nodes increased. For a network of 50 nodes, the three protocols exhibited different performance levels at different node counts.
Network Lifetime Analysis of Routing Protocols of Short Network in QualnetIOSR Journals
Abstract: A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with each other without using any existing infrastructure, access point or centralized administration. Mobile ad-hoc network have the attributes such as wireless connection, continuously changing topology, distributed operation and ease of deployment. In this paper we have compared the energy consumption of reactive, proactive & hybrid routing protocol AODV,DSR,RIP & ZRP by using different mobility model. We have analyzed the Network lifetime of protocols by varying pay load, mobility, pause time and type of traffic (CBR). A detailed simulation has been carried out in qualnet. The metrics used for performance analysis are energy consumed & battery consumption. It has been observed that RIP has better network lifetime than other.
A Comparitive Analysis of Wireless Security Protocols (WEP And WPA2)pijans
Wireless local area networks (WLANs) are become popular as they are fast, cost effective, flexible and easy
to use. There are some challenges of security and for IT administrators the choice of security protocol is a
critical issue. The main motive of this paper is to make the non-specialist reader knowledgeable about
threats in the wireless security and make them aware about the disadvantages of wireless security
protocols. WEP (Wired Equivalent privacy), WPA (Wi-Fi Protected Access) and RSN (Robust Security
Network) security protocols are defined and examined here. This security protocols are compared with the
common.
This paper is a comparative analysis of WEP, WPA and WPA2. We have tried to perform and check
authentication of all 3 protocols by implying the legendary attack vector scripts i.e. Air crack set of tools.
The test was conducted on Back Track operating system which is considered as dedicated pentesting
operating system. In the test result, we found out that WEP is the weakest, to which WPA was a temporary
solution and WPA2 is a very solid and long term solution.
This paper is a mixture of wireless security weaknesses and counter measures to the problems faced until
recently. After reading this paper the non specialist reader will have complete review and awareness about
the wireless security and vulnerabilities involved with it.
Performance Analysis of Routing Metrics in Manetpijans
Mobile Ad-hoc Network has become popular in recent years by many researchers. The objective of this paper is to implement the Multi Order Polynomial (MOP) in MANET. According to this paper , it is hypothesized that to work in MANET field , a novel approach can be used for computing routing metrics (like Packet Delivery Ratio, Normalized Routing Load, Average End To End Delay and many others). Although simulation is performed on number of routing protocols but in this paper only two routing protocols AODV(Ad-hoc On Demand Distance Vector) and DSR( Dynamic Source Routing) are tested through Network Simulator and results are obtained under different scenarios. The results obtained from simulation are validated using MOP( Multi order polynomial) expressions for the same and also computed some results and observed that the some expressions some facts are observed according to which order of polynomial performs better with minimum error rate, in this paper ninth order of polynomial expression generate the result, which is found to be satisfactory with maximum fitness value (1.0) for various routing metrics
More Related Content
Similar to A Survey of Enhanced Routing Protocols for Manets
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.
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
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.
The document provides an overview of routing protocols for mobile ad hoc networks (MANETs). It discusses that MANETs are self-configuring networks without centralized control where nodes can act as routers to forward packets. The document classifies routing protocols as proactive (table-driven), reactive (on-demand), or hybrid. It describes examples of proactive routing protocols like DSDV, OLSR, and WRP that maintain up-to-date routing tables and share updates periodically or when changes occur. The document also discusses reactive protocols establish routes on demand and hybrid protocols that combine aspects of proactive and reactive approaches.
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.
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.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
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.
To improve the QoS in MANETs through analysis between reactive and proactive ...CSEIJJournal
A Mobile Ad hoc NETwork (MANET), is a self-configuring infra structure less network of mobile devices
connected by wireless links. ad hoc is Latin and means "for this purpose". Each device in a MANET is free
to move independently in any direction, and will therefore change its links to other devices frequently. Each
must forward traffic unrelated to its own use, and therefore be a router. The primary challenge in building
a MANET is equipping each device to continuously maintain the information required to properly route
traffic. QOS is defined as a set of service requirements to be met by the network while transporting a
packet stream from source to destination. Intrinsic to the notion of QOS is an agreement or a guarantee by
the network to provide a set of measurable pre-specified service attributes to the user in terms of delay,
jitter, available bandwidth, packet loss, and so on. The analysis is mainly between proactive or table-driven
protocols like OLSR (Optimized Link State Routing) viz DSDV (Destination Sequenced Distance Vector) &
CGSR (Cluster Head Gateway Switch Routing) and reactive or source initiated routing protocols viz
AODV (Ad hoc on Demand distance Vector) & DSR (Dynamic Source Routing). The QoS analysis of the
above said protocols is simulated on NS2 and results are shown thereby.
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.
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
Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Gene...IOSR Journals
This document discusses using a genetic algorithm to improve routing in mobile ad hoc networks. It begins with background on mobile ad hoc networks and common routing protocols. It then introduces genetic algorithms and how they work by simulating natural evolution. The document proposes using a genetic algorithm with the AODV routing protocol to find optimal paths between source and destination nodes. It describes implementing this approach and comparing its performance to traditional AODV routing. The results showed the genetic algorithm approach performed better in terms of quality of service and throughput.
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 summarizes an article that proposes improvements to the Ad hoc On-Demand Distance Vector (AODV) routing protocol for use in Vehicular Ad hoc Networks (VANETs). It first provides background on VANETs and discusses different types of routing protocols used in VANETs, including topology-based, position-based, and hybrid protocols. It then focuses on improvements made to the reactive AODV routing protocol, including adding link layer security checks and a method to reduce packet delay called AODV_BD. The goal of these improvements is to create more stable routes and reduce packet delay for safety communications between vehicles.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that want to communicate without any pre-determined infrastructure and fixed organization of available links. Each node in MANET operates as a router, forwarding information packets for other mobile nodes. There are many routing protocols that possess different performance levels in different scenarios. The main task is to evaluate the existing routing
protocols and finding by comparing them the best one. In this article we compare AODV, DSR, DSDV, OLSR and DYMO routing protocols in mobile ad hoc networks (MANETs) to specify the best operational conditions for each MANETs protocol. We study these five MANETs routing protocols by different simulations in NS-2 simulator. We describe that pause time parameter affect their performance. This performance analysis is measured in terms of Packet Delivery Ratio, Average End-to-End Delay, Normalized Routing Load and Average Throughput.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
This document compares the performance of five routing protocols (AODV, DSR, DSDV, OLSR, DYMO) in mobile ad hoc networks through simulations. It describes the key characteristics and mechanisms of each protocol. Simulations are conducted in the NS-2 simulator using the random waypoint mobility model. Performance is evaluated under varying pause times based on four metrics: packet delivery ratio, average end-to-end delay, normalized routing load, and average throughput. The results aim to determine the best operational conditions for each protocol.
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
This document compares the performance of five routing protocols (AODV, DSR, DSDV, OLSR, DYMO) in mobile ad hoc networks through simulations. It summarizes each protocol and discusses the simulation setup. The protocols are categorized as reactive, proactive, or hybrid. Key performance metrics like packet delivery ratio, end-to-end delay, and routing load are evaluated under varying pause times using the NS-2 simulator. The analysis seeks to determine the best operational conditions for each protocol in mobile ad hoc networks.
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.
PERFORMANCE COMPARISION OF DSDV, AODV AND DSRFOR MOBILE AD HOC NETWORK BY VAR...Saurabh Mishra
This document compares the performance of three routing protocols - DSDV, AODV, and DSR - for mobile ad hoc networks by simulating networks of varying sizes using the Qualnet simulator. The main findings are that AODV performed most efficiently for network sizes of 30, 40, and 50 nodes, and that performance decreased for all three protocols as the number of nodes increased. For a network of 50 nodes, the three protocols exhibited different performance levels at different node counts.
Network Lifetime Analysis of Routing Protocols of Short Network in QualnetIOSR Journals
Abstract: A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with each other without using any existing infrastructure, access point or centralized administration. Mobile ad-hoc network have the attributes such as wireless connection, continuously changing topology, distributed operation and ease of deployment. In this paper we have compared the energy consumption of reactive, proactive & hybrid routing protocol AODV,DSR,RIP & ZRP by using different mobility model. We have analyzed the Network lifetime of protocols by varying pay load, mobility, pause time and type of traffic (CBR). A detailed simulation has been carried out in qualnet. The metrics used for performance analysis are energy consumed & battery consumption. It has been observed that RIP has better network lifetime than other.
Similar to A Survey of Enhanced Routing Protocols for Manets (20)
A Comparitive Analysis of Wireless Security Protocols (WEP And WPA2)pijans
Wireless local area networks (WLANs) are become popular as they are fast, cost effective, flexible and easy
to use. There are some challenges of security and for IT administrators the choice of security protocol is a
critical issue. The main motive of this paper is to make the non-specialist reader knowledgeable about
threats in the wireless security and make them aware about the disadvantages of wireless security
protocols. WEP (Wired Equivalent privacy), WPA (Wi-Fi Protected Access) and RSN (Robust Security
Network) security protocols are defined and examined here. This security protocols are compared with the
common.
This paper is a comparative analysis of WEP, WPA and WPA2. We have tried to perform and check
authentication of all 3 protocols by implying the legendary attack vector scripts i.e. Air crack set of tools.
The test was conducted on Back Track operating system which is considered as dedicated pentesting
operating system. In the test result, we found out that WEP is the weakest, to which WPA was a temporary
solution and WPA2 is a very solid and long term solution.
This paper is a mixture of wireless security weaknesses and counter measures to the problems faced until
recently. After reading this paper the non specialist reader will have complete review and awareness about
the wireless security and vulnerabilities involved with it.
Performance Analysis of Routing Metrics in Manetpijans
Mobile Ad-hoc Network has become popular in recent years by many researchers. The objective of this paper is to implement the Multi Order Polynomial (MOP) in MANET. According to this paper , it is hypothesized that to work in MANET field , a novel approach can be used for computing routing metrics (like Packet Delivery Ratio, Normalized Routing Load, Average End To End Delay and many others). Although simulation is performed on number of routing protocols but in this paper only two routing protocols AODV(Ad-hoc On Demand Distance Vector) and DSR( Dynamic Source Routing) are tested through Network Simulator and results are obtained under different scenarios. The results obtained from simulation are validated using MOP( Multi order polynomial) expressions for the same and also computed some results and observed that the some expressions some facts are observed according to which order of polynomial performs better with minimum error rate, in this paper ninth order of polynomial expression generate the result, which is found to be satisfactory with maximum fitness value (1.0) for various routing metrics
UTCARP: Urban Traffic Control Aware Routing Protocolpijans
Vehicular Ad hoc networks (VANETs) are being advocated as a means to increase road safety and driving
comfort, as well as to facilitate traffic control. Road congestion and traffic-related pollution have a large
negative social and economic impact on several economies worldwide. Due to the high dynamic nature of
the network topology in VANETs, finding and maintaining the routes for data forwarding is still more
challenging. In this paper, we propose a urban traffic control aware routing protocol for VANETs that is
called UTCARP. It considers two modules of (i) the traffic control aware selection of vertices through
which a packet is passed toward its destination and (ii) the greedy forwarding strategy by which a packet
is forwarded between two adjacent vertices. The simulation results illustrate that the proposed
approach outperforms conventional protocols in terms of packet delivery ratio, end-to-end delay and
routing overhead.
Performance Evaluation of Vehicular Ad Hoc Network (Vanet) Using Clustering A...pijans
Vehicular ad hoc networks (VANETS) have actually attracted a lot of attention over the last few years as
being used to improve road safety. In this paper, cluster based technique has been introduced in VANET.
As VANET is a new form of MANET, so with this cluster based technique in VANET, several handoff
problems have been removed, which were actually difficult to remove in MANET. For this traffic
infrastructure cluster based routing has been used, with two routing protocols i.e. AODV and AODV+. The
network simulator NS2 has been used for removing unpredictable movements that may arise in the network.
An Optimized Mechanism for Adaptive and Dynamic Policy Based Handover in Clus...pijans
On-going revolution in ever-improving wireless communication enforces the necessity of a self configuring,
rapidly deployable and infrastructure less network. MANET is such an autonomous wireless network that
meets the requirements. At the same time MANET’s random behavior and absence of any central
intelligence to gather unambiguous knowledge about user contexts complexes QoS maintenance and
hampers proper utilization of network resources resulting into unnecessary handovers. In past, few policy
driven handover approaches have been proposed for MANET but none of them explores a comprehensive
policy design. Therefore in this paper we propose an adaptive and optimized policy based handover
mechanism which is based on explicitly designed policies like load balancing, service discovery and next
hop selection .Efficient procedures for these policies are also explored .This work predicts the high time of
handover need on the basis of application specific needs of individual freely roaming mobile nodes,
avoiding unnecessary handovers and provides efficient handover procedure with optimized resource
consumption, reduced latency and interruption time.
An Efficient Routing Protocol for Mobile Ad Hoc Network for Secured Communica...pijans
Security and reliable communication is challenging task in mobile Ad Hoc network. Through mobility of network device compromised with attack and loss of data. For the prevention of attack and reliable communication, various authors proposed a method of secured routing protocol such as SAODV and SBRP (secured backup routing protocol). The process of these methods work along with route discovery and route maintains, discovery and route maintained needed more power consumption for that process. The power of devices is decrease during such process and network lifetimes expire. In this paper, we modified the secured stateless protocol for secured routing and minimized the utilization of power during path discovering and establishment. For the authentication of group node used group signature technique and sleep mode threshold concept for power minimization. Our proposed technique is simulated in ns-2 and compare to other routing protocol gives a better performance in comparison to energy consumption and throughput of network.
As-Puma : Anycast Semantics In Parking Using Metaheuristic Approachpijans
The number of vehicle used in the world are increasing day by day resulting in the obvious problem of
parking of these vehicle’s in residential and vocational areas. We perceive the problem of vehicles parking
in vocational establishments / malls. Today majority of parking systems are manual parking systems where
in, on the spot, parking of the vehicle is done and a parking slip is generated and handed over to customer.
This is cumbersome technique wherein various parking attendants in the parking areas manually keeps on
informing the Parking inspector on how many free parking slots available so that only that many number of
parking slips/tickets are generated as the number of free parking slots. We address the problem of parking
in Delay Tolerant Network (DTN) by proposing metaheuristic driven approach of Ant Colony optimization
(ACO) technique with anycast semantics models . Here we propose the parking architecture to solve the
problem of parking especially in commercial areas with their design diagrams . In this architecture we
apply the delivery model to deliver the packet correctly to the intended receiver. Using this we can book
various parking’s through remote areas so that the customer can get the information about availability of
various parking’s inside an area and the parking fare for each category of the automobile. Using this
architecture the customer can get the prior knowledge about various vacant parking slots inside a parking
area and he can book the corresponding parking from his location.
Black Hole Attack Prevention Using Random Dispersive Routing for Mobile Adhoc...pijans
Mobile Adhoc Networks is a wireless network and it has become an important technology in current years
in which security has become an important problem. Black hole Attack is one of the promising and severe
security attacks in mobile ad hoc networks which block the communication of secret data during packet
delivery. Black hole attack directly attacks the node’s data traffic on the path and with intent drops, alters
or delays the data traffic passing through that node. In other type of black hole attack which misleadingly
replies for the route request which comes from the node which initiates the route discovery process that it
has as much as necessary routes to the destination even it does not have path to the destination. This paper
deals with prevention of black hole attacks using Shamir’s secret sharing and Random Multipath Routing
Algorithm
Performance Analysis of Mtpr Routing Protocol in Power Deficient Nodepijans
Power conservation in Mobile Ad hoc Network (MANET) is a major challenge even today for researchers.
To conserve it various power aware routing protocols have been proposed. These protocols do not take into
consideration the residual power left in nodes. To find the impact of the same a simulator was designed in
MATLAB-7.01. The routing protocol used in our simulation is Minimum Total Power Routing (MTPR) and
different performance metrics such as path optimality, throughput and hop count were recorded in
presence and absence of power scarce node. The result shows significant impact of power scarce node on
MANET performance.
Path Duration Analysis in Vehicular Ad Hoc Networkpijans
In Vehicular Ad hoc Networks (VANETs) the mobility of the nodes is the main concern. This mobility of
nodes makes the route unstable and unreliable for the information exchange and communication between
two nodes in the network. To enhance the performance and throughput of the VANETs, routes between
nodes must be reliable and stable. In this paper, we study the significance of path duration and link
duration in Vehicular Ad hoc Networks (VANETs). Because of this mobility, connectivity graphs changes
very frequently and it affects the performance of VANETs. Therefore, path duration can be used to predict
the behaviour of the mobile nodes in the network. Estimation of the path duration in VANETs can be a key
factor to improve the performance of the routing protocol. Estimation of path duration is a challenging task
to perform as it depends on many parameters including node density, transmission range, numbers of hops,
and velocity of nodes. This paper will provide a comprehensive study for estimating the path duration in
VANETs.
Study of Various Schemes for Link Recovery in Wireless Mesh Networkpijans
As there is a growing need for the cost effective and highly dynamic large-bandwidth networks over large
coverage area , the Wireless Mesh Network provide first step towards effective communication. A Wireless
Mesh Network is one of the most advanced wireless network used for communication. During their
operating period , the wireless mesh network may suffer from frequent link failure which results in poor
performance of network. Link failure detection plays crucial role in performance of WMN. The proposed
paper presents the review of various techniques used for detection of link failure and the techniques used
for recovery of wireless mesh network.
A Survey on Security Issues to Detect Wormhole Attack in Wireless Sensor Networkpijans
Sensor nodes, when deployed to form Wireless sensor network operating under control of central authority
i.e. Base station are capable of exhibiting interesting applications due to their ability to be deployed
ubiquitously in hostile & pervasive environments. But due to same reason security is becoming a major
concern for these networks. Wireless sensor networks are vulnerable against various types of external and
internal attacks being limited by computation resources, smaller memory capacity, limited battery life,
processing power & lack of tamper resistant packaging. This survey paper is an attempt to analyze threats
to Wireless sensor networks and to report various research efforts in studying variety of routing attacks
which target the network layer. Particularly devastating attack is Wormhole attack- a Denial of Service
attack, where attackers create a low-latency link between two points in the network. With focus on survey of
existing methods of detecting Wormhole attacks, researchers are in process to identify and demarcate the
key research challenges for detection of Wormhole attacks in network layer.
This document is Intended for the purpose of Enabling the power of social media to Empower Ridesharing.
this entails the creation of an ad-ridesharing Initiative with a view to tackling real-world problems such as
traffic congestion and the ever-increasing fuel prices. The main objectives include creating applications,
both web and mobile based, to seamlessly integrate the app’s functionality into and everyday user’s
routine.
Performance Analysis of Improved Autonomous Power Control Mac Protocol (IAPCM...pijans
Power Control in Mobile Ad Hoc networks is a critical issue, since nodes are powered by batteries.The
main idea of power control schemes is to use different power levels for RTS/CTS and DATA/ACK. These
schemes may degrade network throughput and reduce energy efficiency of the network. In this paper we
have evaluated the performance of Improved Autonomous Power Control MAC Protocol (IAPCMP),that
allows nodes to dynamically adjust power levels for transmission of DATA/ACK according to the distance
between the transmitter and its neighbors.In IAPCMP power level for transmission of RTS/CTS is also
adjustable. This also used maximum power level for transmitting DATA/ACK periodically to make
neighboring nodes aware about ongoing transmission. The performance of IAPCMP is evaluated through
the metrics namely, packet delivery ratio and rate of energy efficiency.The simulation results show
significant improvement in protocol.
A Survey of Using Directional Antennas in Ad Hoc Networkspijans
In this paper, we present a comprehensive overview on Ad hoc networking by directional antennas. Use of
Directional antennas can largely reduce the interference, increase the spatial reuse and due to their longer
range we can have routes with fewer hop for two distant nodes. However the main problem of using
directional antennas in Ad hoc networks is due to the dynamic nature of the network. Neighbour discovery,
maintenance the track of moving neighbours, exploitation of the benefit of long range and directional MAC
protocols are the most challenging issues. We present three Directional MAC protocols and two
combinational protocols and system which give solutions to MAC and Neighbour discovery and compare
the throughput of them with 802.11 with omnidirectional antennas.
Wireless Evolution: IEEE 802.11N, 802.11AC, and 802.11AX Performance Comparisonpijans
The widespread adoption of IEEE 802.11 WLANs is attributed to their inherent mobility, flexibility, and
cost-effectiveness. Within the IEEE 802 working group, a dedicated task group is diligently advancing
WLAN technologies, particularly tailored for dense network scenarios. Amidst these advancements, the
802.11ac protocols have emerged as a preferred choice, delivering superior data transfer rates compared
to the preceding 802.11n standard. Significantly, the sixth-generation wireless protocol, IEEE 802.11ax,
has been introduced, showcasing enhanced performance capabilities that outpace its fifth-generation
predecessor, 802.11ac.In this pioneering investigation, we engage in an in-depth simulation-based scrutiny
of prominentWLAN protocols—namely, IEEE 802.11n, IEEE 802.11ac, and the cutting-edge IEEE
802.11ax. Our exhaustive analyses traverse a spectrum of critical metrics, encompassing throughput,
coverage, spectral efficiency, Tx/Rx gain, and Tx/Rx power.In a single-user and SISO scenario, both
802.11ac and 802.11ax outperform 802.11n. Significantly, 802.11ax surpasses the previous 802.11n/ac
standards, highlighting substantial advancements in wireless performance.
Performance Improvement of Multiple Connections in AODV with the Concern of N...pijans
Mobile Ad-hoc Networks (MANETS) consists of a collection of mobile nodes without having a central
coordination. In MANET, node mobility and dynamic topology play an important role in the performance.
MANET provide a solution for network connection at anywhere and at any time. The major features of
MANET are quick set up, self organization and self maintenance. Routing is a major challenge in MANET
due to it’s dynamic topology and high mobility. Several routing algorithms have been developed for
routing. This paper studies the AODV protocol and how AODV is performed under multiple connections in
the network. Several issues have been identified. The bandwidth is recognized as the prominent factor
reducing the performance of the network. This paper gives an improvement of normal AODV for
simultaneous multiple connections under the consideration of bandwidth of node.
An Efficient Call Admission Control Scheme for Handling Handoffs in Wireless ...pijans
Personal Communication Network (PCN) is an emerging wireless network that promises many new
services for the telecommunication industry. The proliferation of demands for extending wireless services
to integrated services, which supports the transmission of data and multimedia information, has resulted in
the need for broadband wireless systems that are able to provide service capabilities similar to those of
wire line networks. The ATM cell - relay paradigm is one possible approach to provide broadband wireless
transmission with PCN’s using the ATM switching networks for interconnection of PCN cells. As traffic in
these mobile cellular networks increases, Handoffs will become an increasingly important issue. As cell
sizes shrink to accommodate an increasingly large demand of services, newer more efficient handoff
schemes need to be used. In this paper, the authors describe the use of novel and efficient data structure
which dynamically allocates guard channel for handoffs and introduces the concept of channel borrowing
strategy. The proposed scheme allocates the guard channels for handoff requests dynamically, based on the
traffic load for certain time period. A new originating call in the cell coverage area also uses these guard
channels if they are unused. Our basic idea is to allow Guard channels to be shared between new calls and
handoff calls. This approach maximizes the channel utilization. The simulation results prove that the
channel borrowing scheme improves the overall throughput.
Design and Implementation of Low-Cost Electric Vehicles (EVs) Supercharger: A...pijans
This article presents a probabilistic modeling method utilizing smart meter data and an innovative agentbased simulator for electric vehicles (EVs). The aim is to assess the effects of different cost-driven EV charging strategies on the power distribution network (PDN). We investigate the effects of a 40% EV adoption on three parts of Frederiksberg's low voltage distribution network (LVDN), a densely urbanized municipality in Denmark. Our findings indicate that cable and transformer overloading especially pose a challenge. However, the impact of EVs varies significantly between each LVDN area and charging scenario. Across scenarios and LVDNs, the share of cables facing congestion ranges between 5% and 60%. It is also revealed that time-of-use (ToU)-based and single-day cost-minimized charging could be beneficial for LVDNs with moderate EV adoption rates. In contrast, multiple-day optimization will likely lead to severe congestion, as such strategies concentrate demand on a single day that would otherwise be distributed over several days, thus raising concerns about how to prevent it. The broader implications of our research suggest that, despite initial worries primarily centered on congestion due to unregulated charging during peak hours, a transition to cost-based smart charging, propelled by an increasing awareness of time-dependent electricity prices, may lead to a significant rise in charging synchronization, bringing about undesirable consequences for the power distribution network (PDN).
Design and Implementation of Low-Cost Electric Vehicles (EVs) Supercharger: A...pijans
This article presents a probabilistic modeling method utilizing smart meter data and an innovative agentbased simulator for electric vehicles (EVs). The aim is to assess the effects of different cost-driven EV
charging strategies on the power distribution network (PDN). We investigate the effects of a 40% EV
adoption on three parts of Frederiksberg's low voltage distribution network (LVDN), a densely urbanized
municipality in Denmark. Our findings indicate that cable and transformer overloading especially pose a
challenge. However, the impact of EVs varies significantly between each LVDN area and charging
scenario. Across scenarios and LVDNs, the share of cables facing congestion ranges between 5% and
60%. It is also revealed that time-of-use (ToU)-based and single-day cost-minimized charging could be
beneficial for LVDNs with moderate EV adoption rates. In contrast, multiple-day optimization will likely
lead to severe congestion, as such strategies concentrate demand on a single day that would otherwise be
distributed over several days, thus raising concerns about how to prevent it. The broader implications of
our research suggest that, despite initial worries primarily centered on congestion due to unregulated
charging during peak hours, a transition to cost-based smart charging, propelled by an increasing
awareness of time-dependent electricity prices, may lead to a significant rise in charging synchronization,
bringing about undesirable consequences for the power distribution network (PDN).
In May 2024, globally renowned natural diamond crafting company Shree Ramkrishna Exports Pvt. Ltd. (SRK) became the first company in the world to achieve GNFZ’s final net zero certification for existing buildings, for its two two flagship crafting facilities SRK House and SRK Empire. Initially targeting 2030 to reach net zero, SRK joined forces with the Global Network for Zero (GNFZ) to accelerate its target to 2024 — a trailblazing achievement toward emissions elimination.
Enhancing Security with Multi-Factor Authentication in Privileged Access Mana...Bert Blevins
In the constantly evolving field of cybersecurity, ensuring robust protection for sensitive data and critical systems has never been more vital. As cyber threats grow more sophisticated, organizations continually seek innovative ways to bolster their defenses. One of the most effective tools in the security arsenal is Multi-Factor Authentication (MFA), particularly when integrated with Privileged Access Management (PAM).
Privileged Access Management encompasses the methods, procedures, and tools used to regulate and monitor access to privileged accounts within an organization. Users with privileged accounts possess elevated rights, enabling them to perform essential operations such as system configuration, access to sensitive data, and management of network infrastructure. However, these elevated privileges also pose a significant security risk if they fall into the wrong hands.
By combining MFA with PAM, organizations can significantly enhance their security posture. MFA adds an additional layer of verification, ensuring that even if privileged account credentials are compromised, unauthorized access can be thwarted. This integration of MFA and PAM provides a robust defense mechanism, protecting critical systems and sensitive data from increasingly sophisticated cyber threats.
Response & Safe AI at Summer School of AI at IIITHIIIT Hyderabad
Talk covering Guardrails , Jailbreak, What is an alignment problem? RLHF, EU AI Act, Machine & Graph unlearning, Bias, Inconsistency, Probing, Interpretability, Bias
FD FAN.pdf forced draft fan for boiler operation and run its very important f...MDHabiburRhaman1
FD fan or forced draft fan, draws air from the atmosphere and forces it into the furnace through a preheater. These fans are located at the inlet of the boiler to push high pressure fresh air into combustion chamber, where it mixes with the fuel to produce positive pressure. and A forced draft fan (FD fan) is a fan that is used to push air into a boiler or other combustion chamber. It is located at the inlet of the boiler and creates a positive pressure in the combustion chamber, which helps to ensure that the fuel burns properly.
The working principle of a forced draft fan is based on the Bernoulli principle, which states that the pressure of a fluid decreases as its velocity increases. The fan blades rotate and impart momentum to the air, which causes the air to accelerate. This acceleration of the air creates a lower pressure at the outlet of the fan, which draws air in from the inlet.
The amount of air that is pushed into the boiler by the FD fan is determined by the fan’s capacity and the pressure differential between the inlet and outlet of the fan. The fan’s capacity is the amount of air that it can move per unit of time, and the pressure differential is the difference in pressure between the inlet and outlet of the fan.
The FD fan is an essential component of any boiler system. It helps to ensure that the fuel burns properly and that the boiler operates efficiently.
Here are some of the benefits of using a forced draft fan:Improved combustion efficiency: The FD fan helps to ensure that the fuel burns completely, which results in improved combustion efficiency.
Reduced emissions: The FD fan helps to reduce emissions by ensuring that the fuel burns completely.
Increased boiler capacity: The FD fan can increase the capacity of the boiler by providing more air for combustion.
Improved safety: The FD fan helps to improve safety by preventing the buildup of flammable gases in the boiler.
Forced Draft Fan ( Full form of FD Fan) is a type of fan supplying pressurized air to a system. In the case of a Steam Boiler Assembly, this FD fan is of great importance. The Forced Draft Fan (FD Fan) plays a crucial role in supplying the necessary combustion air to the steam boiler assembly, ensuring efficient and optimal combustion processes. Its pressurized airflow promotes the complete and controlled burning of fuel, enhancing the overall performance of the system.What is the FD fan in a boiler?
In a boiler system, the FD fan, or Forced Draft Fan, plays a crucial role in ensuring efficient combustion and proper air circulation within the boiler. Its primary function is to supply the combustion air needed for the combustion process.
The FD fan works by drawing in ambient air and then forcing it into the combustion chamber, creating the necessary air-fuel mixture for the combustion process. This controlled air supply ensures that the fuel burns efficiently, leading to optimal heat transfer and energy production.
In summary, the FD fan i
Best Practices for Password Rotation and Tools to Streamline the ProcessBert Blevins
Securing sensitive data is crucial for both individuals and enterprises in the digital era. Password rotation, or regularly changing passwords, has long been a standard security practice. Despite some debate over its effectiveness, password rotation remains an important part of comprehensive security strategies. This guide will explore best practices for password rotation and highlight tools to streamline the process.
The history of rotating passwords dates back to early computer security guidelines, which aimed to reduce the time attackers could exploit stolen credentials by frequently changing passwords. This practice helps mitigate risks associated with credential stuffing, password reuse, and prolonged exposure of compromised passwords. By regularly changing passwords, the time a compromised password can be used is limited, old passwords exposed in breaches are rendered invalid, and regulatory compliance is maintained. Furthermore, frequent changes encourage security awareness among users, reminding them to stay vigilant against phishing and other threats.
To streamline the process of password rotation, various tools and techniques can be employed. Automated password management solutions can schedule and enforce password changes, ensuring compliance with security policies. Additionally, password managers can securely store and generate complex passwords, making it easier for users to adhere to rotation practices without compromising convenience. Implementing multi-factor authentication (MFA) alongside password rotation can further enhance security by adding an extra layer of protection against unauthorized access. By adopting these best practices and utilizing appropriate tools, organizations and individuals can effectively strengthen their cybersecurity posture and safeguard sensitive information.
Best Practices for Password Rotation and Tools to Streamline the Process
A Survey of Enhanced Routing Protocols for Manets
1. International Journal on AdHoc Networking Systems (IJANS) Vol. 3, No. 3, July 2013
DOI : 10.5121/ijans.2013.3301 1
A SURVEY OF ENHANCED ROUTING
PROTOCOLS FOR MANETs
Vivek Arya and Charu
Department of Computer Science and Engineering,
Jaypee Institute of Information Technology
Sector 128, Noida
88vivekarya@gmail.com,
charu.kumar@jiit.ac.in.
ABSTRACT
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 self-
configuring 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.
KEYWORDS
Wireless, Mobile Ad Hoc networks, Routing protocols
1. INTRODUCTION
Mobile Ad Hoc Networks are wireless networks where nodes communicate with each other using
multi-hop links. There is no stationary infrastructure or base station for communication. Each
node itself acts as a router for forwarding and receiving packets to/from other nodes. Routing in
ad hoc networks has been challenging ever since wireless networks came into existence. The
major reason for this is the constant change in the network topology because of the high degree of
node mobility. A number of routing protocols have been established or proposed for efficient
routing in Mobile Ad Hoc networks.
The traditional routing protocols developed for wired networks do not meet the demands of
routing in mobile ad hoc networks due to frequent change in topology of mobile nodes and power
constraint. Existing distance-vector and link-state based routing protocols are unable to catch up
with frequent link changes in ad hoc wireless networks, resulting in poor route convergence and
very low communication throughput. Therefore new routing protocols have been developed or
proposed to address the concerns of routing in mobile ad hoc networks.
The paper is organized as follows. Section 2, explains the routing concept in MANETs and
classifies them according to path searching strategies. Section 3, discusses various existing
proactive and reactive routing protocols. In Section 4, we review new routing protocols that have
2. International Journal on AdHoc Networking Systems (IJANS) Vol. 3, No. 3, July 2013
2
been proposed to enhance and overcome shortcomings that exist in these existing protocols. We
study them in detail discussing the techniques used, their advantages and disadvantages. In
Section 5, we conclude our paper.
2. ROUTING IN MANETs
Routing protocols for Ad Hoc networks can be classified into two main categories: proactive and
reactive routing. Hybrid protocols also exist which use a combination of both proactive and
reactive. Proactive protocols are directly inspired by routing protocols deployed in the internet
and are thus adaptations of link state routing and distance vector routing protocols. Their common
characteristic is that each ad hoc network node locally maintains a routing table for sending data
to any node in the network. With these protocols, terminals periodically exchange information
beyond their direct neighborhood for permanently maintaining routing tables describing network
topology. They are also called table-driven ad hoc routing protocols. The disadvantage of
proactive protocols is the excessive consumption of bandwidth by passing a large number of
control messages due to frequent topology changes. Ad hoc reactive routing algorithms minimize
the use of control messages to a minimum to save bandwidth. The information vital to the
calculation of a route between two network nodes is only researched when a request for this route
is created. The major drawback of this type of protocols is the important delay between a request
for message transmission and the actual transmission when the route has not yet been created.
Hybrid MANET routing protocols combines the best features of both proactive and reactive
routing protocols. However, several routing protocols have been developed for ad hoc networks,
still efficient routing which takes into consideration energy, bandwidth, mobility, multipath,
Quality of Service (QoS), security etc is an area of research.
3. PROACTIVE, REACTIVE AND HYBRID ROUTING
PROTOCOLS
Routing is the act of moving information from a source to destination in an inter-network. Ad
Hoc Routing protocols can be categorized as proactive (table-driven) and reactive (source-
initiated). We discuss the most widely used traditional proactive and reactive routing protocols.
Destination Sequenced Distance Vector (DSDV) [1] is a proactive routing protocol which is a
modification of the conventional Bellman Ford routing algorithm. This protocol adds a new
attribute, sequence number, to each route table entry at each node. Each node in the network
maintains a routing table for transmission of packets and also for connectivity to different stations
in the network. The routing entry is tagged with a sequence number which is originated by the
destination station. The usage of sequence numbers provides loop freedom. In order to maintain
consistency each station transmits and updates its routing tables periodically. DSDV protocol
requires that each mobile station in the network, must constantly advertise to each of its neighbor,
its own routing table. DSDV provides an option of route updates using the full or incremental
update strategies. However, it becomes difficult to maintain routing table’s advertisements for
large networks using this technique.
Optimized Link State Routing (OLSR) [2] is a proactive (table driven) protocol which can be
considered as an adaptation to the ad hoc network world of the OSPF (Open Shortest Path First)
protocol deployed in wired internet. AODV employs periodic exchange of messages to maintain
topology information of the network at each node. OLSR is an optimization over a pure link state
3. International Journal on AdHoc Networking Systems (IJANS) Vol. 3, No. 3, July 2013
3
protocol optimizing the global broadcast operation or flooding. The OLSR protocol defines the
multipoint relay concept (MPR) [3] to limit the number of message retransmissions during the
necessary flooding operations. OLSR works best for large and dense ad hoc networks. However,
OLSR being a a reactive routing protocol suffers from excessive routing overhead.
Temporally Ordered Routing Algorithm (TORA) [4] is a highly adaptive, loop-free, distributed
routing algorithm based on the concept of link reversal. TORA is designed to operate in highly
dynamic mobile networking environment. It is source initiated and provides multiple routes for
any source/destination pair. The key design concept of TORA is the localization of control
messages to a very small set of nodes near the occurrence of a topological change. To accomplish
this, nodes need to maintain routing information about adjacent (one-hop) nodes. During the route
creation and maintenance phases, nodes use a height metric to establish a DAG (directed acyclic
graph) rooted at the destination. Thereafter links are assigned a direction (upstream or
downstream) based on the relative height metric of neighboring nodes. Information may flow
from nodes with higher height to nodes with lower height. By maintaining a set of totally-ordered
heights at all times, TORA achieves loop free multipath routing, as information cannot flow
upstream and so cross back on itself.
Dynamic Source Routing (DSR) [5] protocol is one of the most efficient reactive routing
protocols in mobile ad hoc networks. The DSR protocol uses a process of route discovery
between two network nodes when it is necessary for a specific communication. When a node
wants to send a data message to another node, it searches for a route in its local cache. If no route
for this terminal is found, a process of route discovery is activated in order to find the path to the
destination node. The node wanting route discovery generates a route request (RREQ) control
message. This control message is broadcast to all its neighbors. This message contains the
identity of the initiating node, destination node and a unique sequence number determined by the
initiating node. When a node receives a RREQ message, it generates a response message, a route
reply (RREP), if it is the recipient of the route request; if not, it adds its identity at the end of the
intermediate nodes list and rebroadcasts this modified message over the radio interface.
Ad Hoc On Demand Distance Vector (AODV) [6] protocol is a reactive protocol in which the
routes are created only when required. It uses traditional routing tables, one entry per destination,
and sequence numbers to determine whether routing information is up-to-date and to prevent
routing hops. AODV attempts to improve on DSR by maintaining routing tables at the nodes, so
that data packets do not have to contain routes. However, AODV retains the desirable features of
DSR, that routes are maintained only between nodes which need to communicate. Route Requests
are forwarded in manner similar to DSR. When a node re-broadcasts a route request (RREQ) it
sets up a reverse path pointing towards the source. AODV assumes symmetric (bi-directional)
links. When the intended destination receives a Route Request, it replies by sending a route reply
(RREP). Route reply travels along the reverse path set-up when route request (RREQ) is
forwarded.
Zone Routing Protocol (ZRP) [7] provides a hybrid proactive/reactive routing framework in an
attempt to achieve scalability. In ZRP, the network is divided into zones. A proactive table driven
strategy is used for establishment and maintenance of routes between nodes of the same zone, and
a reactive on demand strategy is used for communication between nodes of different zones. When
a destination is out of the zone, on-demand routing search is initiated. In this situation, control
4. International Journal on AdHoc Networking Systems (IJANS) Vol. 3, No. 3, July 2013
4
overhead is reduced, compared to both the route request flooding mechanism employed in on
demand protocols and periodic flooding of routing information packet in table driven protocol.
The above discussed routing protocols have certain disadvantages such as in DSDV wastage of
bandwidth occurs due to unnecessary routing. DSDV is not suitable for large networks. In DSR
the packet header length grows with route length due to source routing. Increased contention
occurs if too many route replies come back due to nodes replying using their local cache. This is
also known as the Route Reply Storm Problem. Stale caches also lead to increased overhead.
Although AODV being an efficient protocol than DSR has a few disadvantages. Intermediate
nodes can lead to inconsistent routes if the source sequence number is very old and the
intermediate nodes have a higher but not the latest destination sequence numbers, thereby having
state entries. Also, multiple RouteReply packets in response to a single RouteRequest packet can
lead to heavy control overhead. Unnecessary bandwidth consumption is also prevalent in AODV
due to periodic beaconing. OLSR protocol also suffers certain disadvantages such as lack of
security, routing overhead and no support for multicast. ZRP being a hybrid also requires proper
query control, without which ZRP can actually perform worse than most flooding based
protocols.
However although efficient in transporting packets from source to destination these routing
protocols do not address issues like security, trust/reputation of neighbor nodes, energy
constraints, bandwidth, congestion in the network etc. The new routing protocols we study in this
paper take into consideration certain above factors and try to improve these existing routing
protocols.
4. IMPROVEMENTS TO EXISTING ROUTING PROTOCOLS
Various new routing protocols have been developed and proposed that try to overcome certain but
not all limitations that exist in previous routing protocols. The new protocols are an improved
extension of the standard MANET routing protocols. In this section we discuss few of these
routing protocols.
Bandwidth Aware Weight Based DSR Protocol for Mobile Ad Hoc Networks (BAWB-DSR) [8]
is an improvement to the existing DSR protocol and the weight based DSR. The weight based
DSR (WBDSR) [9] is an improvement to the existing DSR protocol. This protocol solves the
problem of energy efficiency in DSR. It also takes into account the stability of nodes. It does not
consider the bandwidth of links between nodes and each node inserts its node weight in RREQ
packet thus increasing the packet size resulting in overhead to each intermediate node. The
BAWB-DSR solves the routing problem by taking bandwidth into account along with stability
and battery power of routing nodes. The bandwidth parameter is calculated using the link
utilization factor and the throughput. The stability parameter is decided based on the frequent
changes in the relative position of a node with its neighborhood. The BAWB-DSR protocol
solves partly the energy efficiency routing problem in mobile ad hoc networks. It incorporates
bandwidth in its routing algorithm which is necessary to satisfy the quality of service (QOS)
demands such as in multimedia applications and video conferencing.
Cumulative Congestion State Routing Protocol (CCSR) [10] is an improvement of existing DSR
protocol which takes congestion into account. Congestion is the main reason for packet loss in
mobile ad hoc networks. The CCSR protocol performs routing by distributing load between
5. International Journal on AdHoc Networking Systems (IJANS) Vol. 3, No. 3, July 2013
5
multiple paths according to the congestion status of the whole path. It also tries to prevent
congestion occurring in the first place. CCSR uses congestion status of whole path (congestion
status of all the participating in the route path) and the source node maintains a table called the
Congestion Status Table (CST) that contains the congestion status of every path from source node
to destination node. The protocol assigns threshold values to the congestion status parameter. And
the source node distributes more packets towards the path with less congestion status while
sending less or no packets to a path with more congestion status. It calculates congestion status of
a particular node using its available buffer size or queue length and no of packets. CCSR protocol
thus solves the congestion routing problem in mobile ad hoc networks and outperforms both
AODV and DSR based on performance.
Reputation-Aware Multi-Hop Routing Protocol (RAMP) [11] performs routing in a mobile ad
hoc network based on DSR protocol and takes advantage of congestion control in TCP for
reputation/trust management. In multi-hop routing protocols in mobile ad hoc networks, all the
nodes are assumed to be cooperative. However, this assumption does not hold when the nodes
selfishly behave to reduce their own resource to utilization. This severely hinders the routing
process. Therefore, RAMP tries to enforce node cooperation by quantifying the reputation/trust
value of each node. RAMP is the first protocol to employ the Additive Increase Multiplicative
Decrease (AIMD) algorithm to evaluate each node’s routing behaviors and integrity on the
evaluation of other nodes. RAMP significantly performs better than its closest counterpart
CONFIDANT [12] which uses a complex Bayesian estimate to compute the reputation values in
each node. RAMP performs better than existing schemes since the monitored behavior are
detected and discouraged in RAMP more efficiently and with less communication overhead.
AODV with Sufficient Bandwidth Aware Routing Protocol (AODV-SBA) [13] is an
advancement of AODV routing protocol that improves the performance of on-demand routing
protocols by discovering better routes to avoid congestion and reducing excessive routing
overheads. The protocol uses a light weight mechanism to determine network congestion. It
measures local network congestion using information from the MAC layer. Hence, preventing the
discovery of routes over which it is undesirable to carry additional data and routing traffic over
those hops that are already busy. It uses Channel Free Time as a metric in route establishment
phase. The channel free time is determined using the status flags in IEEE 802.11. The CFT is
assigned a threshold value and the packet forward or drop status is decided on its basis. AODV-
SBA thus retains the essential features of AODV while significantly increasing the performance
in networks with high congestion by selecting routes by avoiding the congested area. It also
reduces the routing overhead as well as the battery power consumption to enhance the network
lifetime.
Robust Cluster Based Routing Protocol (CBRP-R) [14] is a self-repair cluster based routing
protocol based on ad hoc on demand distance vector (AODV) routing. It also uses a Third Party
Route Reply thus benefitting the overall network performance. In CBRP-R nodes are organized
into hierarchical structure of multi hop clusters. Each cluster comprises of a distinguished node
called the cluster head, several gateway nodes which are located between multiple clusters and a
number of ordinary nodes. Intra cluster routing is performed using reactive routing protocol while
inter cluster routing is performed via proactive routing protocols. The protocol tries to repair a
broken route rather than sending error messages. The intermediate nodes start performing route
repair as soon as a link break is detected. The route repair process is performed within a threshold
time-to-live (TTL) period. On failing a route repair fail (RPF) message is send to the previous
6. International Journal on AdHoc Networking Systems (IJANS) Vol. 3, No. 3, July 2013
6
hop. The process is repeated for every node up till the source till a repair is not performed hence
acting as a self-repair technique. The protocol thus provides an efficient routing technique that
saves considerable amount of network bandwidth for larger mobile ad hoc networks.
Cluster-Based Trust-Aware Routing Protocol (CBTRP) [15] is a wireless routing protocol that
protects forwarded packets from intermediary malicious nodes. It is a significant improvement
over cluster based routing protocol and the 2 ACK based trust scheme [16]. CBTRP ensures
trustworthiness of cluster-heads by replacing them as soon as they become malicious and
dynamically updates the packet path to avoid malicious routes. It calculates trust based on vital
information regarding other nodes such as by analyzing the received, forwarded and overheard
packets. It uses a simple concept of positive and negative events to calculate trustworthiness of a
node. A positive event for a node is measured based on certain information such as timely
forwarding of packets, generation of successful replies, generation of successful
acknowledgements etc. A negative event can be generated if a node refuses to forward a packet to
save its energy or out of malicious behavior, forwarding route requests or route replies
abnormally, modifying data etc. Thus CBTRP provides improved connectivity in MANETs in the
presence of malicious nodes. It ensures the passage of packets through trusted routes only by
making nodes monitor the behavior of neighbor nodes.
Energy-Aware Optimized Link State Routing (EOLSR) [17] is an energy efficient version of the
optimized link state routing protocol. It aims in reducing the energy spent in the transmission of
packets from source to destination. EOLSR uses an energy consumption model for path selection.
It uses efficient algorithms to select energy aware multipoint relays, compute energy efficient
routes and to optimize broadcasts. The main feature of EOLSR is that, instead of using the
number of hops metric between source to destination to select the shortest route, as done in
OLSR, it uses a certain COST(flow) as the criterion to choose the best path. COST(flow) is
calculated using sum of all energies spent in transmitting packets plus all sum of all energies
spent in receiving packets. It defines the notion of energy aware multipoint relays (EMPRs)
which are selected on the basis of energy threshold levels. Thus, EOLSR is able to reduce the
problem of energy efficiency bei=ng faced in crucial wireless ad hoc and sensor networks and
further maximizing network performance.
Secure Efficient AODV Routing (SEAODV) [18] is a reactive routing protocol based upon
AODV routing algorithm. It provides secure routing and protection of packets. SEAODV requires
one-way hash function in each node and HEAP [19] authentication scheme for protecting
sequence number and hop count and authenticating routing packets of AODV such as RREQ,
RREP and RERR. SEAODV is the first protocol that uses the HEAP mechanism. HEAP is an
effective authentication mechanism based on the HMAC algorithm [20]. In HEAP intermediate
node can authenticate received packets and decide whether to forward or drop. SEAODV uses
symmetric cryptography and addresses attacks like packet forgery and denial of service (DoS).
Trust Aware Routing Protocol (TARP) [21] is a reactive routing protocol that provides secure
routing in mobile ad hoc networks. It uses DSR protocol for finding the shortest path to the
destination. TARP
Classificat
ion
Parameter
Routing Protocols Studied
BAWB- CCSR RAMP AODV- CBRP- CBTRP EOLS SEAOD TARP EPA AD
7. International Journal on AdHoc Networking Systems (IJANS) Vol. 3, No. 3, July 2013
7
s DSR SBA R R V OM
DV
SR
Class Reacti
ve
Reacti
ve
Reacti
ve
Reacti
ve
Reacti
ve
Reacti
ve
Pro
Activ
e
Reacti
ve
Reacti
ve
Rea
ctiv
e
Re
acti
ve
Extension
of
Routing
Protocol
DSR DSR DSR AODV AODV
+
CBRP
CBRP OLSR AODV DSR AO
DV
DS
R
Bandwidt
h Aware
Energy
Aware
Congestio
n Control
Reputatio
n/Trust
Aware
Secure
Multipath
Table 1: Classification of Protocols based on routing parameters
selects routes to the destination based on certain security parameters. These security parameters
are the software configuration, hardware configuration, battery power, exposure and
organizational hierarchy. Each node evaluates the trust level of its neighbors based on above
parameters and includes it in computing the next hop node in the overall shortest path
computation. In TARP, power and software configuration are the main contributing features
towards routing. It modifies the RREQ packet fields to incorporate node power levels and type of
encryption technique used. It denotes power value as low, medium, high and very high.
Encryption techniques can be any one of the following: RSA, DES/3DES, BLOWFISH, IDEA,
SEAL RC2/RC4/ RC5/RC6). TARP is thus able to improve security as well as reduce routing
traffic in a mobile ad hoc network.
Enhanced Power Based Multipath Protocol (EPAOMDV) [22] is an improved version of AODV.
It allows AODV to store multiple paths which are node disjoint (i.e. no nodes are same for a
given path) from source to destination. However the multiple paths stored in EPAOMDV are
decided based on signal strength between intermediate nodes on the path. While performing route
discovery (i.e dissemination of Route Request-RREQ packets) an intermediate node computes the
power loss experienced at it after the reception of the RREQ packet. If the power loss is less than
a specified threshold value only then the RREQ packet is broadcasted. This mechanism ensures
that the route computed does not contain links that are unstable. EPAOMDV allows preemptive
link breakage as for an ongoing transmission over a certain selected path; an intermediate node
sends power loss calculated by it to the previous upstream node in an acknowledgement packet. If
in case the specified value of power loss is below the threshold the source is notified and
communication is transferred on the next stable link thus decreasing the process of route
discovery and maintenance. EPAOMDV is shown to be better than AODV and AOMDV [23] (a
multipath version of AODV) in terms of delay, throughput and routing overhead involved.
Advanced Dynamic Source Routing (ADSR) [24] is an extension to the DSR routing protocol.
ADSR selects routes based on calculating the link state and dynamic delay detection. It calculates
8. International Journal on AdHoc Networking Systems (IJANS) Vol. 3, No. 3, July 2013
8
the link stability between two nodes based on node velocities and distance among nodes. In
ADSR when a source node floods RREQ packets, it appends its location, speed and direction in
the control packet. It also sets a maximum expiration time to a corresponding field. When a relay
node receives a RREQ, it predicts the link expiration time between itself and the previous hop
and insert it in RREQ while further forwarding the packet. When a relay node receives multiple
packets with different link expiration times, it selects the minimum among them and sends its
own routing table with the chosen link expiration time attached. The ADSR routing protocol
achieves better packet delivery ratios and lesser end-to-end delay while routing packets.
5. CONCLUSION
In this paper, we discussed new advancements and improvements being made in existing efficient
routing protocols to make them more efficient and to meet the challenges being faced in routing
in ad hoc networks. Most of the routing protocols studied such as BAWB-DSR, CCSR, EOLSR,
TARP etc. take into consideration network bandwidth and congestion control which are important
factors in efficient routing. However, they do not consider energy and security while performing
dynamic routing which cannot be neglected in case of routing in mobile ad hoc networks. Only
few protocols such as RAMP, CBTRP, SEAODV etc were found to be secure but they lacked
multipath feature and energy unaware. Hence we come to the conclusion that still no silver bullet
exists for routing in mobile ad hoc networks that deals with every particular concern. The security
aspect which is most crucial for communication in ad hoc networks is found missing in most of
the routing protocols being proposed. Therefore new efficient, multipath, QoS aware and energy
aware routing protocols that address security concerns need to be developed.
REFERENCES
[1] Charles E. Perkins and PBhagwat, “A Highly Dynamic Destination-Sequenced Distance-Vector Routing
(DSDV) for Mobile Computers,” In Proceedings of the SIGCOMM’94 Conference on Communication
Architectures, Protocols and Applications, pg. 234-244, Aug 1994.
[2] C.Adjih, T.Clausen, P.Jacquet, A.Laouiti, P.Minet, P Muhlethaler, A.Qayyum, L.Viennot, “Optimized Link
State Routing Protocol,” RFC 3626, IETF, 2003.
[3] ETSI STC-RES 10 Committee, Radio Equipment and Systems: High Performance Radio Local Area
Network (HIPERLAN) Type 1, Functional Specifications, June 1996, ETS 300-652.
[4] V.Park and M. Scott Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless
Networks,” In Proceedings of IEEE INFOCOM’97, March 1996.
[5] David B. Johnson and David A. Maltz, “Dynamic Source Routing in Ad-hoc Wireless Network,” The
Kluwer Series in Engineering and Computer Science, 1996, Volume 353, 153-181, DOI:10.1007/978-0-585-
29603-6_5.
[6] C. Perkins, E.Belding-Royer, and S.Das, “Ad Hoc On-Demand Distance Vector (AODV) Routing,” IETF
RFC 3561, 2005.
[7] Z. J, Haas and M. R. Pearlman, “The Zone Routing Protocol (ZRP) for Ad Hoc Networks,” Internet Draft
draft-zone-routing-protocol-01.txt, Aug 1998.
[8] H. Tiwari, A. Vajpayee, A. Singh, “A Bandwidth Aware Weight Based DSR Protocol for Mobile Ad Hoc
Networks,” COMPUTE’11: Proceedings of the Fourth Annual ACM Bangalore Conference, MARCH 2011.
[9] B. Kadri, M. Feham and A. M’Hamed, “Weight Based DSR for Mobile Ad Hoc Networks,” in 3rd
International Conference on Information and Communication Technologies: From Theory to Applications,
2008 ICITTA pp 1-6, 7-11 April 2008.
[10] R. Yerajana, A.K Sarje, “An Adaptive Multipath Source Routing Protocol for Congestion Control and
Load Balancing in MANETs,”.ICAC3’09: Proceedings of the International Conference on Advances in
Computing, Communication and Control, pg 456-459.
[11] H. Tan, “RAMP – A Reputation – Aware Multi-Hop Routing Protocol in Wireless Ad Hoc Networks,”
ISABEL’11: Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and
Communication Technologies, Article No.60.
[12] S. Buchegger and Jean Y.Le Boudec, “Performance Analysis of the CONFIDANT protocol,” in
Proceedings of MobiHoc ’02, pages 226-236., New York, USA, 2002, ACM.
9. International Journal on AdHoc Networking Systems (IJANS) Vol. 3, No. 3, July 2013
9
[13] P. Wannawilai, C. Sathitwiriyawong, “AODV with Sufficient Bandwidth AwareRouting Protocol,”
IWCMC’10: Proceedings of the 6th International Wireless Communications and Mobile Computing
Conference, pg 281-285.
[14] S. Sethi, A. Rout, D. Mishra, Satabdinalini, “A Robust Cluster Based Routing Protocol for MANET,”
ICCCS’11 Proceedings of the 2011 International Conference on Communication, Computing and Security,
pg 26-31.
[15] H. Safa, H. Artail, D. Tabet, “A Cluster Based Trust-Aware Routing Protocol for Mobile Ad Hoc
Networks,” Journal of Wireless Networks, Volume 16 Issue 4, May 2010, pg 969-984.
[16] Liu, K. Dey, J., Varshney, P.K., Balakrishnan, K. (2007, May), “An Acknowledgement Based Approach
for the Detection of Routing Misbehavior in MANETs,”.IEEE Transactions on Mobile Computing, 6, 536-
550.
[17] S. Mahfoudh, P. Minet, “Energy Aware Routing in Wireless Ad Hoc Networks and Sensor Networks,”
IWCMC’10: Proceedings of the 6th International Wireless Communications and Mobile Computing
Conference, pg 1126-1130.
[18] M. Mohammadizadeh, A. Movaghar, Seyad M. Safi, “SEAODV: Secure Efficient AODV Routing Protocol
for MANETs Networks,” ICIS’09: Proceedings of the 2nd International Conference on Interaction
Sciences: Information Technology, Culture and Human, pg 940-944.
[19] R.Akbani, T Korkamaz, G.V.S Raju, “HEAP: A Packet Authentication Scheme for Mobile Ad Hoc
Networks,” Ad Hoc Networks, Volume 6, No. 7, pg 1134-1150, 2005.
[20] M.Bellare, R Canetti, H Krawczyk, “Keying Hash Functions for message authentication,” Annual
International Cryptology Conference on Advances in Cryptology, Vol. 1109, pages 1-15, 1996.
[21] L.Abusalah, A Khokhar, G. BenBrahim, W. Elhajj, “TARP: Trust Aware Routing Protocol,” IWCMC’06
Proceedings of the 2006 International Conference on Wireless Communications and Mobile Computing, pg
135-140.
[22] Sujatha P.Terdal, V.D. Mytri, A. Damodaran, “A Preemptive Multipath Routing Protocol for Mobile Ad
Hoc Networks,” International Journal of Computing Science and Communication Technologies, Vol. 2,
No. 1, July 2009.
[23] M. K. Marina, S.R. Das, “On Demand Multipath Distance Vector Routing in Ad Hoc Networks,”
Proceedings of the Ninth International Conference on Network Protocols (ICNP) 2001, IEEE Computer
Society, pp. 14-23.
[24] Youyuan Liu, “Advanced Dynamic Source Routing with QoS Guarantee,” Proceedings of the Second
Symposium International Computer Science and Computational Technology (ICSCT’09), pp. 504-506.
AUTHORS
Dr. Charu Gandhi is a Ph.D in Computer Science from Kurukshetra University, Haryana,
India. She has more than 6 years of teaching experience. She is currently Assistant Professor
at Jaypee Institute of Information Technology, Noida, India. She has published several
papers in national and international conferences and journals. Her areas of interest include
wireless networks, mobile ad hoc networks, QoS routing in MANETs, clustering
techniques, energy efficiency and secure routing for MANETs, distributed and parallel computing.
Vivek Arya received his B.Tech in CSE in 2010 from USIT, GGSIPU, India. He completed
his M.Tech in CSE from Centre of Development of Advanced Computing (CDAC),
GGSIPU, Noida, India in 2012. He is currently a research scholar and pursuing his Ph.D
from Jaypee Institute of Information Technology. He has presented several papers in
various international and national conferences. His research areas include cybercrime,
cyber-security, wireless mobile ad hoc networks, energy efficiency and scalable routing in
MANETs.