Adhoc wireless multi-hop Networks (AHWMNs) are buil
t with wireless nodes arranged in an adhoc manner.
Every node can forward packets and also acts as a s
ource. AODV establishes a path to receiver when it
is
needed by the sender and is on the standardization
process of Internet engineering task force.
AntHocNetwhich is based on ants foraging behavior,
includes reactive and proactive mechanisms.
AntHocNet builds the path as per the requirement of
source and maintains until the end of communicatio
n
session. In this paper performance of AODV and AntH
ocNetare analyzed at different parameters like data
rates, pause times, and speed. Metrics Packet deliv
ery ratio, Loss rate, End to End delay, jitter, and
throughput are evaluated at different simulation ti
mes. Simulation is performed using network simulat
or
NS-2.34 and 802.11b is the MAC protoco
C OMPARISON OF AODV AND ANTHOCNET IN S TATIC W IRELESS N ETWORKIJCI JOURNAL
This document compares the performance of the AODV and AntHocNet routing protocols in static wireless networks. It presents simulation results for packet delivery ratio, end-to-end delay, loss rate, throughput, and jitter using the Network Simulator 2 (NS2) and both 802.11 and 802.11b protocols. The results show that AODV generally outperforms AntHocNet across the metrics, having lower delay, higher throughput and packet delivery at various data rates. However, AntHocNet's performance improves relative to AODV at higher data rates and numbers of nodes.
This document proposes a new fuzzy logic-based routing protocol for mobile ad-hoc networks (MANETs) that considers path stability, residual energy of nodes, and bandwidth for optimal path selection at the source node. It also proposes adjusting the transmission rate at the source node based on end-to-end delay and packet loss ratio measured at the destination node. This cross-layer approach uses two fuzzy logic systems - one for path selection based on stability and bandwidth, and another for transmission rate adjustment based on delay and packet loss. The goal is to select stable paths and prevent congestion for more efficient data transmission in MANETs.
A black-hole attack in the Mobile Ad-hoc NETwork (MANET) is an attack occurs due to malicious nodes,
which attracts the data packets by falsely advertising a fresh route to the destination. In this paper, we
present a clustering approach in Ad-hoc On-demand Distance Vector (AODV) routing protocol for the
detection and prevention of black-hole attack in MANETs. In this approach every member of the cluster will
ping once to the cluster head, to detect the peculiar difference between the number of data packets received
and forwarded by the node. If anomalousness is perceived, all the nodes will obscure the malicious nodes
from the network.
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
This document compares the performance of four routing protocols (AODV, DSR, OLSR, GRP) under the security attack of node misbehavior in mobile ad hoc networks (MANETs). The document presents background information on MANETs and the four routing protocols. It then discusses two types of misbehaving nodes (partially selfish and fully selfish) that are modeled in simulations. The simulations vary the percentage of misbehaving nodes and measure performance metrics like packet delivery ratio, end-to-end delay, data dropped, and load. The results show that packet delivery ratio decreases and data dropped increases as the percentage of misbehaving nodes increases for all protocols. OLSR generally has the lowest delay while
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
Black Hole Detection in AODV Using Hexagonal Encryption in Manet’sIJMER
In MANETs (mobile ad hoc network), security is common problem and lack of issues in
MANET network. When comparing to wired network, MANETs are harmed to security attacks due to the
scarcity of a trusted centralized enforce authority and limited resources. This paper proposed a technique
to avoid Blackhole node behaviour in AODV (Ad Hoc On-Demand Distance Vector) using Hexagonal
Encryption inNS2. Hexagonal Encryption has been chosen for low cost and high computation speed up.
Compared to existing blackhole detection technique, this proposed technique obtains better result by
stimulating in NS2.
PERFORMANCE ANALYSIS OF ANTHOCNET ROUTING PROTOCOL FOR HYBRID AD HOC NETWORKKhushbooGupta145
This document summarizes a research paper that analyzes the performance of the AntHocNet routing protocol for hybrid ad hoc networks. AntHocNet is a bio-inspired routing protocol based on ant colony optimization. It is an adaptive hybrid algorithm that combines reactive and proactive routing. The document provides background on mobile ad hoc networks and routing protocols. It describes how AntHocNet works, comparing it to other routing protocols like AODV and DSR. The paper then discusses the network simulation setup used to evaluate and compare the performance of AntHocNet, AODV and DSR based on metrics like packet delivery ratio, end-to-end delay, and throughput. The simulation was conducted in NS2 with
This document evaluates the performance of the AODV and DSR routing protocols under black hole attacks in a mobile ad hoc network (MANET). It conducts simulations using the network simulator NS-2 to compare the protocols' throughput, packet delivery ratio, and end-to-end delay both with and without black hole attacks from malicious nodes. The results show that under black hole attacks, the throughput and packet delivery ratio of both protocols decreases as the number of malicious nodes increases. However, AODV is shown to be more resistant to the effects of black hole attacks compared to DSR, experiencing smaller decreases in performance under black hole attacks.
C OMPARISON OF AODV AND ANTHOCNET IN S TATIC W IRELESS N ETWORKIJCI JOURNAL
This document compares the performance of the AODV and AntHocNet routing protocols in static wireless networks. It presents simulation results for packet delivery ratio, end-to-end delay, loss rate, throughput, and jitter using the Network Simulator 2 (NS2) and both 802.11 and 802.11b protocols. The results show that AODV generally outperforms AntHocNet across the metrics, having lower delay, higher throughput and packet delivery at various data rates. However, AntHocNet's performance improves relative to AODV at higher data rates and numbers of nodes.
This document proposes a new fuzzy logic-based routing protocol for mobile ad-hoc networks (MANETs) that considers path stability, residual energy of nodes, and bandwidth for optimal path selection at the source node. It also proposes adjusting the transmission rate at the source node based on end-to-end delay and packet loss ratio measured at the destination node. This cross-layer approach uses two fuzzy logic systems - one for path selection based on stability and bandwidth, and another for transmission rate adjustment based on delay and packet loss. The goal is to select stable paths and prevent congestion for more efficient data transmission in MANETs.
A black-hole attack in the Mobile Ad-hoc NETwork (MANET) is an attack occurs due to malicious nodes,
which attracts the data packets by falsely advertising a fresh route to the destination. In this paper, we
present a clustering approach in Ad-hoc On-demand Distance Vector (AODV) routing protocol for the
detection and prevention of black-hole attack in MANETs. In this approach every member of the cluster will
ping once to the cluster head, to detect the peculiar difference between the number of data packets received
and forwarded by the node. If anomalousness is perceived, all the nodes will obscure the malicious nodes
from the network.
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
This document compares the performance of four routing protocols (AODV, DSR, OLSR, GRP) under the security attack of node misbehavior in mobile ad hoc networks (MANETs). The document presents background information on MANETs and the four routing protocols. It then discusses two types of misbehaving nodes (partially selfish and fully selfish) that are modeled in simulations. The simulations vary the percentage of misbehaving nodes and measure performance metrics like packet delivery ratio, end-to-end delay, data dropped, and load. The results show that packet delivery ratio decreases and data dropped increases as the percentage of misbehaving nodes increases for all protocols. OLSR generally has the lowest delay while
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
Black Hole Detection in AODV Using Hexagonal Encryption in Manet’sIJMER
In MANETs (mobile ad hoc network), security is common problem and lack of issues in
MANET network. When comparing to wired network, MANETs are harmed to security attacks due to the
scarcity of a trusted centralized enforce authority and limited resources. This paper proposed a technique
to avoid Blackhole node behaviour in AODV (Ad Hoc On-Demand Distance Vector) using Hexagonal
Encryption inNS2. Hexagonal Encryption has been chosen for low cost and high computation speed up.
Compared to existing blackhole detection technique, this proposed technique obtains better result by
stimulating in NS2.
PERFORMANCE ANALYSIS OF ANTHOCNET ROUTING PROTOCOL FOR HYBRID AD HOC NETWORKKhushbooGupta145
This document summarizes a research paper that analyzes the performance of the AntHocNet routing protocol for hybrid ad hoc networks. AntHocNet is a bio-inspired routing protocol based on ant colony optimization. It is an adaptive hybrid algorithm that combines reactive and proactive routing. The document provides background on mobile ad hoc networks and routing protocols. It describes how AntHocNet works, comparing it to other routing protocols like AODV and DSR. The paper then discusses the network simulation setup used to evaluate and compare the performance of AntHocNet, AODV and DSR based on metrics like packet delivery ratio, end-to-end delay, and throughput. The simulation was conducted in NS2 with
This document evaluates the performance of the AODV and DSR routing protocols under black hole attacks in a mobile ad hoc network (MANET). It conducts simulations using the network simulator NS-2 to compare the protocols' throughput, packet delivery ratio, and end-to-end delay both with and without black hole attacks from malicious nodes. The results show that under black hole attacks, the throughput and packet delivery ratio of both protocols decreases as the number of malicious nodes increases. However, AODV is shown to be more resistant to the effects of black hole attacks compared to DSR, experiencing smaller decreases in performance under black hole attacks.
A novel defence scheme against selfish Node attack in manetijcsa
This document proposes a new intrusion detection system (IDS) algorithm to defend against selfish node attacks in mobile ad hoc networks (MANETs). Selfish nodes flood the network with false information and drop packets from other nodes. The proposed IDS identifies selfish node behavior and blocks their activities. Simulation results show the IDS enhances network performance from negligible to 92% and prevents infection from attacks. The IDS is integrated with the AODV routing protocol to detect and eliminate selfish nodes within its transmission range.
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
This document summarizes a research paper that proposes a new hybrid multipath routing protocol for mobile ad hoc networks called Hybrid Multipath Progressive Routing Protocol (HMPRP). It improves upon existing routing protocols like AODV and OLSR by utilizing multiple paths based on received signal strength to increase packet delivery and reduce overhead. Simulation results showed the proposed protocol achieved better performance than AODV, OLSR and ZRP in terms of packet delivery ratio, throughput, energy consumption and delay.
Performance Evalution of MANET Routing Protocols using Reference Point Group ...ijasuc
An ad hoc network is often defined as an “infrastructureless” network, meaning a network without the
usual routing infrastructure like fixed routers and routing backbones. Typically, the ad hoc nodes are
mobile and the underlying communication medium is wireless. Each ad hoc node may be capable of acting
as a router.it’s charactrizied by multihop wireless connection and frequently changing networks.we
compare the performance of on-demand routing protocols for mobile ad-hoc networks are distributed
cache updating for the dynamic source routing protocol(DSR) and ad hoc on-demand distance vector
routing (AODV).the simulation model of the medium access control(MAC) layer is evaluting the
performance of MANET protocols.DSR and AODV protocols share similar behavours.we evalute the
both on demand protocols DSR and AODV based on packet delivery ratio , packet delivery latency,mobility
variation with total number of errors, packet and normalized routing overhead,end-to-end delay by varying
in node density.the performance and characterictics are explained by the graph models.
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACEScscpconf
Opportunistic networks are usually formed spontaneously by mobile devices equipped with
short range wireless communication interfaces. The idea is that an end-to-end connection may
never be present. Designing and implementing a routing protocol to support both service
discovery and delivery in such kinds of networks is a challenging problem on account of
frequent disconnections and topology changes. In these networks one of the most important
issues relies on the selection of the best intermediate node to forward the messages towards the
destination. This paper presents a mobile trace based routing protocol that uses the location
information of the nodes in the network. Using the trace information, next hop is selected to forward the packets to destination. Data forwarding is done via the selected nodes. The effectiveness is shown using simulation
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANETijasuc
This document summarizes and compares two extended versions of the AODV routing protocol for mobile ad hoc networks (MANETs): Reverse AODV (RAODV) and Multicast AODV (MAODV). RAODV aims to improve routing performance by allowing multiple route reply messages, while MAODV allows nodes to send multicast data packets through a multicast group tree. The document outlines the key features and operations of each protocol, including route discovery processes. It then evaluates and compares the performance of RAODV and MAODV using metrics like end-to-end delay and overhead while varying the number of nodes.
MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRMIOSR Journals
This document proposes a modification to the Dynamic Source Routing (DSR) protocol called Modified DSR (MDSR) to reduce routing overhead caused by frequent link breakages in mobile ad hoc networks. MDSR adds a link breakage prediction algorithm that uses signal strength measurements to predict when a link may break. Intermediate nodes monitor signal strength and warn the source node if a link may soon break. This allows the source to proactively rebuild the route or switch to a backup route to avoid disconnection. Simulation results showed MDSR can reduce the number of dropped packets by at least 25% compared to standard DSR. The document also discusses how DSR works and the proposed proactive route maintenance concept in M
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...Editor IJCATR
In this paper, we design and formulate a trust-based routing protocol for secure transactions, such as military and disaster
relief operations, banking in mobile ad hoc networks (MANETs). The proposed approach is showing the idea of a trust model in the
network layer of MANET.AODV is ad hoc on demand distance vector, this protocol starts the route specially when some node claims
to send data. In AODV whenever a link breaks an error message is sent indicating the link and packet sending is dropped. In our
proposed scheme a packet is sent through alternative path. In this approach a trust node is made with neighbors. Simulation results
shows that proposed scheme has less packet loss and packet ratio delivered is more.
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
A survey of real-time routing protocols For wireless sensor networksijcses
This document summarizes a survey of real-time routing protocols for wireless sensor networks. It discusses several existing real-time routing protocols, including AODV, DSR, RAP, SPEED, and MMSPEED. For each protocol, it describes the key mechanisms, advantages, and disadvantages. It focuses on factors like end-to-end delay, energy consumption, mobility, scalability, and challenges for future research in real-time routing protocols for wireless sensor networks. The document provides a comparative analysis of the protocols to highlight their strengths and weaknesses in meeting the demands of real-time applications.
Design A Congestion Aware Routing Algorithm for Synchronous Cam Designijtsrd
The effect of process variation (PV) on delay is a major reason to decay the performance in advanced technologies. The performance of front routing algorithms is determined with or without PV for different traffic patterns. The saturation throughput and average message delay are used as performance metrics to evaluate the throughput. PV decreases the saturation throughput and increases the average message delay. Adaptive routing algorithm should be manipulated with the PV. A novel PV delay and congestion aware routing (PDCR) algorithm is presented for asynchronous network-on-chip (NOC) design. The routing algorithm performs various adaptive routing algorithms in the average delay and saturation throughput for different traffic patterns. A low-power content-addressable memory (CAM) by a new algorithm is proposed for associativity between the input tag and the corresponding address of the output data. The proposed architecture is depends on a recently developed sparse clustered network by utilizing binary connections that on-average eliminates most of the parallel comparisons performed during a search. P. Mounica | R. Umamaheswari | R. Madhavi | R. Nischala | N. Ramesh Babu"Design A Congestion Aware Routing Algorithm for Synchronous Cam Design" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: http://www.ijtsrd.com/papers/ijtsrd11547.pdf http://www.ijtsrd.com/engineering/electronics-and-communication-engineering/11547/design-a-congestion-aware-routing-algorithm-for-synchronous-cam-design/p-mounica
A MANET is a continuously self-configuring, infrastructure-less type network, which consists of number of mobile nodes
with wireless network interfaces. In order to make communication among nodes, the nodes demoniacally establish paths among
neighbouring nodes. Security in mobile adhoc network is a big challenge because many nodes perform many kinds of misbehaviour.
In this paper, the main focus is on collaborative attacks in MANET using CBDS approach. CBDS is a approach which consolidate
asset of proactive and reactive defense method in reverse tracing. In reverse tracing method we compare performance of CBDS
approach with DSR and AOMDV routing protocols.
Impact of energy and link quality indicator with link quality estimators in w...graphhoc
The Link Quality Indicator (LQI) and Residual Energy have a fundamental impact on the network
performance in Wireless Sensor Networks (WSNs) and affects as well in the life time of nodes. This paper
will provide a comparative of Link Quality Estimator, the Link Quality Estimator with Link Quality
Indicator and Link Quality Estimator with Residual Energy. In this paper we develop a Collect Tree
Protocol (CTP) and compare the performance of LQI and Residual Energy, and show their effect on the
packet delivery ratio and throughput, covering the characteristics of low-power links, and their
performance to the best of our knowledge, we believe that our efforts would have implementations on
embedded application.
Performance Evaluation of Artificial Ant Colony using Zone Based Routing Appr...IRJET Journal
This document discusses performance evaluation of an artificial ant colony routing approach called AntNet for mobile ad hoc networks (MANETs). It begins with an introduction to AntNet, which uses "artificial ants" that travel through the network collecting traffic information to direct data packets towards their destination. The document then summarizes zone-based routing protocols and compares AntNet to other ant colony optimization routing algorithms. It evaluates the performance of AntNet using different zone sizes and routing approaches through simulation experiments. Key metrics like packet delivery ratio and end-to-end delay are compared between AntNet and traditional routing protocols.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Performance Analysis of Routing Metrics for Wireless Sensor NetworksIJMER
This document summarizes and compares various routing metrics that have been proposed for wireless sensor networks. It categorizes the routing metrics into five groups: topology based, signal strength based, active probing based, mobility aware, and energy aware. Topology based metrics like hop count consider only connectivity information without additional measurements. Signal strength and active probing based metrics directly measure link quality through signal strength or probe packets. The document provides detailed descriptions of several popular routing metrics, such as expected transmission time (ETT), medium time metric (MTM), round-trip time (RTT), and packet pair delay. It analyzes the characteristics of different routing metrics and compares their performance.
This document proposes a modified ant colony optimization (ACO) routing protocol for mobile ad hoc networks (MANETs). The key points are:
1) The protocol is based on swarm intelligence principles and uses mobile software agents like ants to intelligently route packets from node to node.
2) It modifies the standard ACO algorithm to make it power-balanced and achieve faster packet delivery rates by making the pheromone decay dependent on nodes' battery levels.
3) The routing process involves forward and backward ants establishing and maintaining routes between source and destination via probabilistic path selection based on accumulated pheromone levels.
This document compares the AODV and DSR MANET routing protocols. It provides background on MANETs and categories of routing protocols. It then describes the key features of the AODV and DSR reactive protocols. The document outlines a methodology to simulate scenarios using these two protocols in NS2 and compare their performance based on throughput and packet delivery ratio. It proposes improving AODV security using cryptography for future work.
The document discusses ad hoc networks and wireless sensor networks. It defines an ad hoc network as a temporary network composed of mobile nodes without preexisting infrastructure that is self-organizing. Wireless sensor networks are introduced as a collection of sensor nodes densely deployed to monitor conditions and cooperatively pass data back to central nodes. The document outlines key characteristics of both networks including their temporary and adaptive nature, multi-hop routing, and challenges of mobility, power constraints, and dynamic topology changes.
The document discusses ad-hoc networks and their key characteristics. It describes several challenges in ad-hoc networks including limited battery power, dynamic network topology, and scalability issues. It also summarizes several ad-hoc network routing protocols (e.g. DSDV, AODV, DSR), addressing both table-driven and on-demand approaches. Additionally, it outlines some ad-hoc MAC protocols like MACA and PAMAS that aim to manage shared wireless medium access.
Este documento contiene una lista de 30 personas con sus nombres, fechas de nacimiento y actividades favoritas. Cada persona tiene asignada una fecha de nacimiento, correo electrónico y actividad preferida como tocar guitarra, jugar fútbol, escuchar música u otras actividades de ocio.
A novel defence scheme against selfish Node attack in manetijcsa
This document proposes a new intrusion detection system (IDS) algorithm to defend against selfish node attacks in mobile ad hoc networks (MANETs). Selfish nodes flood the network with false information and drop packets from other nodes. The proposed IDS identifies selfish node behavior and blocks their activities. Simulation results show the IDS enhances network performance from negligible to 92% and prevents infection from attacks. The IDS is integrated with the AODV routing protocol to detect and eliminate selfish nodes within its transmission range.
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
This document summarizes a research paper that proposes a new hybrid multipath routing protocol for mobile ad hoc networks called Hybrid Multipath Progressive Routing Protocol (HMPRP). It improves upon existing routing protocols like AODV and OLSR by utilizing multiple paths based on received signal strength to increase packet delivery and reduce overhead. Simulation results showed the proposed protocol achieved better performance than AODV, OLSR and ZRP in terms of packet delivery ratio, throughput, energy consumption and delay.
Performance Evalution of MANET Routing Protocols using Reference Point Group ...ijasuc
An ad hoc network is often defined as an “infrastructureless” network, meaning a network without the
usual routing infrastructure like fixed routers and routing backbones. Typically, the ad hoc nodes are
mobile and the underlying communication medium is wireless. Each ad hoc node may be capable of acting
as a router.it’s charactrizied by multihop wireless connection and frequently changing networks.we
compare the performance of on-demand routing protocols for mobile ad-hoc networks are distributed
cache updating for the dynamic source routing protocol(DSR) and ad hoc on-demand distance vector
routing (AODV).the simulation model of the medium access control(MAC) layer is evaluting the
performance of MANET protocols.DSR and AODV protocols share similar behavours.we evalute the
both on demand protocols DSR and AODV based on packet delivery ratio , packet delivery latency,mobility
variation with total number of errors, packet and normalized routing overhead,end-to-end delay by varying
in node density.the performance and characterictics are explained by the graph models.
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACEScscpconf
Opportunistic networks are usually formed spontaneously by mobile devices equipped with
short range wireless communication interfaces. The idea is that an end-to-end connection may
never be present. Designing and implementing a routing protocol to support both service
discovery and delivery in such kinds of networks is a challenging problem on account of
frequent disconnections and topology changes. In these networks one of the most important
issues relies on the selection of the best intermediate node to forward the messages towards the
destination. This paper presents a mobile trace based routing protocol that uses the location
information of the nodes in the network. Using the trace information, next hop is selected to forward the packets to destination. Data forwarding is done via the selected nodes. The effectiveness is shown using simulation
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANETijasuc
This document summarizes and compares two extended versions of the AODV routing protocol for mobile ad hoc networks (MANETs): Reverse AODV (RAODV) and Multicast AODV (MAODV). RAODV aims to improve routing performance by allowing multiple route reply messages, while MAODV allows nodes to send multicast data packets through a multicast group tree. The document outlines the key features and operations of each protocol, including route discovery processes. It then evaluates and compares the performance of RAODV and MAODV using metrics like end-to-end delay and overhead while varying the number of nodes.
MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRMIOSR Journals
This document proposes a modification to the Dynamic Source Routing (DSR) protocol called Modified DSR (MDSR) to reduce routing overhead caused by frequent link breakages in mobile ad hoc networks. MDSR adds a link breakage prediction algorithm that uses signal strength measurements to predict when a link may break. Intermediate nodes monitor signal strength and warn the source node if a link may soon break. This allows the source to proactively rebuild the route or switch to a backup route to avoid disconnection. Simulation results showed MDSR can reduce the number of dropped packets by at least 25% compared to standard DSR. The document also discusses how DSR works and the proposed proactive route maintenance concept in M
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...Editor IJCATR
In this paper, we design and formulate a trust-based routing protocol for secure transactions, such as military and disaster
relief operations, banking in mobile ad hoc networks (MANETs). The proposed approach is showing the idea of a trust model in the
network layer of MANET.AODV is ad hoc on demand distance vector, this protocol starts the route specially when some node claims
to send data. In AODV whenever a link breaks an error message is sent indicating the link and packet sending is dropped. In our
proposed scheme a packet is sent through alternative path. In this approach a trust node is made with neighbors. Simulation results
shows that proposed scheme has less packet loss and packet ratio delivered is more.
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
A survey of real-time routing protocols For wireless sensor networksijcses
This document summarizes a survey of real-time routing protocols for wireless sensor networks. It discusses several existing real-time routing protocols, including AODV, DSR, RAP, SPEED, and MMSPEED. For each protocol, it describes the key mechanisms, advantages, and disadvantages. It focuses on factors like end-to-end delay, energy consumption, mobility, scalability, and challenges for future research in real-time routing protocols for wireless sensor networks. The document provides a comparative analysis of the protocols to highlight their strengths and weaknesses in meeting the demands of real-time applications.
Design A Congestion Aware Routing Algorithm for Synchronous Cam Designijtsrd
The effect of process variation (PV) on delay is a major reason to decay the performance in advanced technologies. The performance of front routing algorithms is determined with or without PV for different traffic patterns. The saturation throughput and average message delay are used as performance metrics to evaluate the throughput. PV decreases the saturation throughput and increases the average message delay. Adaptive routing algorithm should be manipulated with the PV. A novel PV delay and congestion aware routing (PDCR) algorithm is presented for asynchronous network-on-chip (NOC) design. The routing algorithm performs various adaptive routing algorithms in the average delay and saturation throughput for different traffic patterns. A low-power content-addressable memory (CAM) by a new algorithm is proposed for associativity between the input tag and the corresponding address of the output data. The proposed architecture is depends on a recently developed sparse clustered network by utilizing binary connections that on-average eliminates most of the parallel comparisons performed during a search. P. Mounica | R. Umamaheswari | R. Madhavi | R. Nischala | N. Ramesh Babu"Design A Congestion Aware Routing Algorithm for Synchronous Cam Design" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: http://www.ijtsrd.com/papers/ijtsrd11547.pdf http://www.ijtsrd.com/engineering/electronics-and-communication-engineering/11547/design-a-congestion-aware-routing-algorithm-for-synchronous-cam-design/p-mounica
A MANET is a continuously self-configuring, infrastructure-less type network, which consists of number of mobile nodes
with wireless network interfaces. In order to make communication among nodes, the nodes demoniacally establish paths among
neighbouring nodes. Security in mobile adhoc network is a big challenge because many nodes perform many kinds of misbehaviour.
In this paper, the main focus is on collaborative attacks in MANET using CBDS approach. CBDS is a approach which consolidate
asset of proactive and reactive defense method in reverse tracing. In reverse tracing method we compare performance of CBDS
approach with DSR and AOMDV routing protocols.
Impact of energy and link quality indicator with link quality estimators in w...graphhoc
The Link Quality Indicator (LQI) and Residual Energy have a fundamental impact on the network
performance in Wireless Sensor Networks (WSNs) and affects as well in the life time of nodes. This paper
will provide a comparative of Link Quality Estimator, the Link Quality Estimator with Link Quality
Indicator and Link Quality Estimator with Residual Energy. In this paper we develop a Collect Tree
Protocol (CTP) and compare the performance of LQI and Residual Energy, and show their effect on the
packet delivery ratio and throughput, covering the characteristics of low-power links, and their
performance to the best of our knowledge, we believe that our efforts would have implementations on
embedded application.
Performance Evaluation of Artificial Ant Colony using Zone Based Routing Appr...IRJET Journal
This document discusses performance evaluation of an artificial ant colony routing approach called AntNet for mobile ad hoc networks (MANETs). It begins with an introduction to AntNet, which uses "artificial ants" that travel through the network collecting traffic information to direct data packets towards their destination. The document then summarizes zone-based routing protocols and compares AntNet to other ant colony optimization routing algorithms. It evaluates the performance of AntNet using different zone sizes and routing approaches through simulation experiments. Key metrics like packet delivery ratio and end-to-end delay are compared between AntNet and traditional routing protocols.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Performance Analysis of Routing Metrics for Wireless Sensor NetworksIJMER
This document summarizes and compares various routing metrics that have been proposed for wireless sensor networks. It categorizes the routing metrics into five groups: topology based, signal strength based, active probing based, mobility aware, and energy aware. Topology based metrics like hop count consider only connectivity information without additional measurements. Signal strength and active probing based metrics directly measure link quality through signal strength or probe packets. The document provides detailed descriptions of several popular routing metrics, such as expected transmission time (ETT), medium time metric (MTM), round-trip time (RTT), and packet pair delay. It analyzes the characteristics of different routing metrics and compares their performance.
This document proposes a modified ant colony optimization (ACO) routing protocol for mobile ad hoc networks (MANETs). The key points are:
1) The protocol is based on swarm intelligence principles and uses mobile software agents like ants to intelligently route packets from node to node.
2) It modifies the standard ACO algorithm to make it power-balanced and achieve faster packet delivery rates by making the pheromone decay dependent on nodes' battery levels.
3) The routing process involves forward and backward ants establishing and maintaining routes between source and destination via probabilistic path selection based on accumulated pheromone levels.
This document compares the AODV and DSR MANET routing protocols. It provides background on MANETs and categories of routing protocols. It then describes the key features of the AODV and DSR reactive protocols. The document outlines a methodology to simulate scenarios using these two protocols in NS2 and compare their performance based on throughput and packet delivery ratio. It proposes improving AODV security using cryptography for future work.
The document discusses ad hoc networks and wireless sensor networks. It defines an ad hoc network as a temporary network composed of mobile nodes without preexisting infrastructure that is self-organizing. Wireless sensor networks are introduced as a collection of sensor nodes densely deployed to monitor conditions and cooperatively pass data back to central nodes. The document outlines key characteristics of both networks including their temporary and adaptive nature, multi-hop routing, and challenges of mobility, power constraints, and dynamic topology changes.
The document discusses ad-hoc networks and their key characteristics. It describes several challenges in ad-hoc networks including limited battery power, dynamic network topology, and scalability issues. It also summarizes several ad-hoc network routing protocols (e.g. DSDV, AODV, DSR), addressing both table-driven and on-demand approaches. Additionally, it outlines some ad-hoc MAC protocols like MACA and PAMAS that aim to manage shared wireless medium access.
Este documento contiene una lista de 30 personas con sus nombres, fechas de nacimiento y actividades favoritas. Cada persona tiene asignada una fecha de nacimiento, correo electrónico y actividad preferida como tocar guitarra, jugar fútbol, escuchar música u otras actividades de ocio.
Este documento parece ser um teste para um slideshow para iniciantes em Poie. Ele provavelmente inclui instruções básicas ou uma lista de verificação para criar um slideshow simples usando o software Poie para iniciantes.
The diary entry describes the diary writer's morning routine of waking up at 7:30am, getting ready for school, having breakfast, packing lunch, and cycling to school by 8:30am. It then discusses the afternoon activities of relaxing after school until doing homework from 4pm. The evening involves picking up two Danes from school, having dinner together, learning and playing games with the Danes until going to bed at 10pm in preparation for the next day of school.
The document discusses the evolution of media from traditional forms like radio and television to newer digital and social media. It describes how media has converged across multiple platforms and become more mobile. Key points covered include the structure and measurement of traditional broadcast media, advantages and disadvantages of different channels, and concepts like the MAC triad for crafting effective communications. The document stresses the role of public relations in disseminating truthful information to the right audiences at the appropriate times and places.
Maestria Siendo CuáL Es Su Estilo De AprendizajeAdalberto
El documento describe cuatro tipos de personas en situaciones de aprendizaje: teórico, activista reflexivo, pragmático y práctico. Explica las preferencias de cada tipo en términos de estructura, procesos de pensamiento, nivel de detalle y enfoque teórico versus práctico. El autor es Álvaro Ortiz, psicólogo.
The document discusses Scotland's history with urban planning from King David I in the 12th century who established law and order and promoted trade, to the modern Scottish Sustainable Communities Initiative. It notes planning's reputation as a technical world obscured from laymen and challenges with building consensus to tackle big problems. The conclusion reflects on Scotland's urban tradition providing inspiration for meeting new environmental and economic challenges through innovative solutions like the Scottish Sustainable Communities Initiative, but cautions the line between vision and hallucination is fine.
The document summarizes green affordable housing projects developed by the Low Income Housing Institute (LIHI) in the Puget Sound region. It describes several housing developments built by LIHI that incorporate sustainable design and green building practices like maximizing daylight, managing stormwater on-site, using recycled and low-VOC materials, and including green roofs and native landscaping. The projects provide affordable housing to low-income individuals, families, seniors and homeless veterans in accordance with LIHI's mission since 1991.
The document outlines a new brand identity and marketing campaign for a company that includes introducing an original logo, social media content promoting a "Get Fresh With Us" slogan, and in-store displays to encourage customer interaction.
This document summarizes an innovative routing algorithm called AntHocNet for mobile ad hoc networks. AntHocNet combines aspects of ant colony optimization and information bootstrapping to address the challenges of routing in dynamic mobile networks. Key elements of AntHocNet include the use of both reactive and proactive routing components, combining ant-based path sampling with a lightweight bootstrapping process to update routing information, and using a composite pheromone metric to guide path selection. The document evaluates the performance impacts of these different design components through simulation studies.
AntNet is an ant colony optimization (ACO) based routing algorithm that uses two types of mobile agents called forward ants and backward ants. Forward ants explore the network concurrently and examine traffic patterns along paths to exchange information with backward ants. Backward ants then use this information to update routing tables, directing data packets towards their destinations in a traffic-adaptive and multipath manner. The algorithm maintains pheromone values, routing tables, link queue observations, and statistical models at each node to probabilistically route packets based on collected network information.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Implementation of Optimized Ant Based Routing Algorithm for ManetIRJET Journal
This document presents an implementation and evaluation of the Ant-Based Routing Algorithm (ARA) for mobile ad hoc networks (MANETs).
It first provides background on swarm intelligence and ant colony optimization techniques. It then surveys various existing ant-based routing protocols. The ARA protocol uses forward and backward ants to discover and maintain multiple paths between nodes.
The document describes simulating ARA in NS2 for different network sizes and times. It evaluates ARA's performance based on throughput, packet delivery ratio, routing overhead, and energy consumption. The results show that ARA achieves high throughput and packet delivery ratio for all network conditions. It also significantly reduces routing overhead compared to other protocols. ARA also performs well in terms of
An Effective and Scalable AODV for Wireless Ad hoc Sensor Networksijcnes
Appropriate routing protocol in data transfer is a challenging problem of network in terms of lower end-to-end delay in delivery of data packets with improving packet delivery ratio and lower overhead as well. In this paper we explain an effective and scalable AODV (called as AODV-ES) for Wireless Ad hoc Sensor Networks (WASN) by using third party reply model, n-hop local ring and time-to-live based local recovery. Our goal is to reduce time delay for delivery of the data packets, routing overhead and improve the data packet delivery ratio. The resulting algorithm AODV-ES is then simulated by NS-2 under Linux operating system. The performance of routing protocol is evaluated under various mobility rates and found that the proposed routing protocol is better than AODV.
During route discovery of mobile ad hoc network, broadcasting of route request and route reply packets
are the essential operations for finding the path between two ends. In such situations, intermediate node
which may or may not belongs will participate in route discovery process, update routing table and
rebroadcast the route discovery packets again to its neighboring nodes. Finally optimal path is found with
minimum hops. This simply upsurges overhead and deteriorates the performance of routing. The proposed
Petal Ant Routing (PAR) algorithm offers a low overhead by optimizing FANT and BANT transmissions in
route discover process. The algorithm is an improved version of SARA and has features extracted from
petal routing. The algorithm is simulated on NS2, compared with ACO frame work called SARA and
classical routing protocols such as AODV and AOMDV. The simulation results shows that PAR further
reduces overhead by eliminating redundant FANT transmission compared to other routing algorithm.
i. The document describes an ant colony optimization (ACO) based routing algorithm for mobile ad hoc networks (MANETs). ACO algorithms are inspired by how real ants find the shortest path between their colony and food sources.
ii. In the algorithm, artificial "ants" are generated at nodes and collect information about path lengths and quality as they travel between nodes. They deposit and follow "pheromone trails" to probabilistically route along better paths. This allows the protocol to discover paths and adapt to dynamic topologies.
iii. The algorithm is analyzed in simulation. Results show it constructs probabilistic routing tables where better paths have higher pheromone values and are preferred. It can find next
This document compares the performance of three mobile ad hoc network (MANET) routing protocols: AODV, FSR, and IERP. It uses the QualNet network simulator to evaluate these protocols based on various metrics like throughput, average jitter, average end-to-end delay, and packet delivery ratio. The protocols are evaluated under different node speeds on a grid topology network with 90 nodes over an area of 1500x1500 meters. Simulation results show that AODV generally performs best in terms of throughput and packet delivery ratio across varying node speeds, while FSR performs worst for these metrics. IERP shows the worst performance for average end-to-end delay and average jitter as node speed increases.
Detection and Removal of Blackhole Attack Using Handshake Mechanism in MANET ...IOSR Journals
This document summarizes a research paper that proposes a solution called a "handshake mechanism" to detect and prevent blackhole attacks in mobile ad-hoc networks (MANETs) and vehicular ad-hoc networks (VANETs). The solution involves each node generating a periodic dynamic ID value. When a route request is sent, the requesting node verifies the dynamic ID of the responding node before adding it to the routing table. Only if the IDs match is the node considered valid and added to the route. This aims to identify malicious nodes that do not have the correct dynamic ID value. The paper evaluates the solution through simulations of MANETs using the random waypoint mobility model and VANETs using the city section mobility
TRIDNT: THE TRUST-BASED ROUTING PROTOCOL WITH CONTROLLED DEGREE OF NODE SELFI...IJNSA Journal
In Mobile ad-hoc network, nodes must cooperate to achieve the routing purposes. Node misbehaviour due to selfish or malicious intention could significantly degrade the performance of MANET because most existing routing protocols in MANET are aiming at finding most efficiency path. In this paper, we propose a Two node-disjoint Routes protocol for Isolating Dropper Node in MANET (TRIDNT) to deal with misbehaviour in MANET. TRIDNT allows some degree of selfishness to give an incentive to the selfish nodes to declare itself to its neighbours, which reduce the misbehaving nodes searching time. In TRIDNT two node-disjoint routes between the source and destination are selected based on their trust values. We use both DLL-ACK and end-to-end TCP-ACK to monitor the behaviour of routing path nodes: if a malicious behaviour is detected then the path searching tool starts to identify the malicious nodes and isolate them. Finally by using a mathematical analysis we find that our proposed protocol reduces the searching time of malicious nodes comparing to the route expected life time, and avoids the isolated misbehaving node from sharing in all future routes, which improve the overall network throughput.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
T HE I MPACT OF TCP C ONGESTION W INDOW S IZE ON THE P ERFORMANCE E VA...ijwmn
A mobile ad hoc network (MANET) is a temporary coll
ection of mobile nodes randomly moved within a
limited terrain area. The nodes are connected to fo
rm a wireless network without use any communication
infrastructure. Because of the limiting resources o
f MANET nodes, multiple hops
scheme is proposed for
data exchange
across the network. Varieties of mobile ad hoc rout
ing protocols have been developed to
support the multi-hop scheme of ad hoc networks. A
popular Transmission Control Protocol (TCP)
provides a reliable connection in a computer networ
k environment; it sets its congestion window size i
n
response to the behavior of the network to achieve
the best performance. This work aims to investigate
and
compare the MANET protocol
performance, such as DSDV, AODV and DSR in terms of
network
throughput, average routing load, the packet delive
ry ratio (PDR), and average end-to-end delay by
varying the maximum congestion window size. Our si
mulation has been implemented using a well-known
NS-2.35 network simulator. The simulated results sh
ow that the demonstrates of the concepts of MANET
routing protocols with respect to TCP congestion wi
ndow size in MANET environment
International Journal of Pharmaceutical Science Invention (IJPSI)inventionjournals
International Journal of Pharmaceutical Science Invention (IJPSI) is an international journal intended for professionals and researchers in all fields of Pahrmaceutical Science. IJPSI publishes research articles and reviews within the whole field Pharmacy and Pharmaceutical Science, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
A New Theoretical Approach to Location Based Power Aware RoutingIOSR Journals
This document proposes a new theoretical approach to location based power aware routing in mobile ad hoc networks (MANETs). It aims to extend the network lifetime by improving power utilization during routing. The approach uses nodes' location information, remaining battery power, and bandwidth status to assign link stability and select routes with lower "uptime values" and minimum bandwidth over time. This is hypothesized to better utilize nodes' power sources and bandwidth. The document outlines calculating a root up time factor for each node based on its power backup and required power, and only using nodes with maximum backup. It concludes future work will design and validate a new protocol based on this approach.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
This document summarizes a simulation-based performance analysis of three routing protocols (CBRP, DSR, AODV) for mobile ad hoc networks (MANETs) under different node densities. The analysis varies the number of data sources and evaluates the protocols based on packet delivery ratio, average end-to-end delay, and normalized routing load. The simulation is conducted using the NS-2 network simulator for dense and sparse network topologies with 50 nodes each, varying node speeds and transmission ranges. Results show that CBRP performs better than DSR and AODV in terms of normalized routing load for more than 15 sources in both dense and sparse topologies, while AODV has lower delay than CBR
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
Simulation of Route Optimization with load balancing Using AntNet SystemIOSR Journals
This document summarizes a research paper that simulates route optimization and load balancing in computer networks using the AntNet routing algorithm. The AntNet algorithm is based on the behavior of ants and uses forward and backward ants to collect information and update routing tables. The simulation tested the AntNet algorithm against a generic algorithm without AntNet. The results showed that AntNet performed better in terms of throughput, average packet delivery, distance, delay, and failed packets. Specifically, when the simulation speed was 1000 and total packets were 100, AntNet delivered all packets with less delay and distance compared to the generic algorithm which failed 2 packets. This demonstrates that the AntNet algorithm can effectively optimize routes and balance network load.
Analyzing the Effect of Varying CBR on AODV, DSR, IERP Routing Protocols in M...IOSR Journals
This document analyzes the performance of the AODV, DSR, and IERP routing protocols in a mobile ad hoc network (MANET) with varying constant bit rate (CBR) traffic loads. It conducts simulations in QualNet 6.1 and evaluates the protocols based on average end-to-end delay, throughput, average jitter, and packet delivery ratio under different CBR values. The results show that AODV generally performs best with low and stable delay, jitter and high throughput and delivery ratio. DSR has better performance than IERP for throughput and delivery ratio. IERP shows the worst performance for delay and jitter as CBR increases. The document concludes by stating AODV is best overall but
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Route optimization in manets with aco and ga eSAT Journals
This document summarizes a research paper that proposes a hybrid optimization algorithm called GA-API for route optimization in mobile ad hoc networks (MANETs). The GA-API algorithm combines ant colony optimization (ACO), specifically the artificial prey inspired (API) algorithm, with a genetic algorithm (GA). API is used first to find multiple feasible paths between source and destination nodes in the MANET. These paths are then input to the GA, which forms a population of routing solutions. The GA explores this solution space using genetic operators like crossover and mutation to find new paths. Promising solutions from the GA are then fed back to API to avoid it getting stuck in local optima. The goal of the hybrid GA-API algorithm is
Similar to A NALYSIS OF ANTHOCNET AND AODV P ERFORMANCE USING NS2 (20)
Home security is of paramount importance in today's world, where we rely more on technology, home
security is crucial. Using technology to make homes safer and easier to control from anywhere is
important. Home security is important for the occupant’s safety. In this paper, we came up with a low cost,
AI based model home security system. The system has a user-friendly interface, allowing users to start
model training and face detection with simple keyboard commands. Our goal is to introduce an innovative
home security system using facial recognition technology. Unlike traditional systems, this system trains
and saves images of friends and family members. The system scans this folder to recognize familiar faces
and provides real-time monitoring. If an unfamiliar face is detected, it promptly sends an email alert,
ensuring a proactive response to potential security threats.
Build the Next Generation of Apps with the Einstein 1 Platform.
Rejoignez Philippe Ozil pour une session de workshops qui vous guidera à travers les détails de la plateforme Einstein 1, l'importance des données pour la création d'applications d'intelligence artificielle et les différents outils et technologies que Salesforce propose pour vous apporter tous les bénéfices de l'IA.
Prediction of Electrical Energy Efficiency Using Information on Consumer's Ac...PriyankaKilaniya
Energy efficiency has been important since the latter part of the last century. The main object of this survey is to determine the energy efficiency knowledge among consumers. Two separate districts in Bangladesh are selected to conduct the survey on households and showrooms about the energy and seller also. The survey uses the data to find some regression equations from which it is easy to predict energy efficiency knowledge. The data is analyzed and calculated based on five important criteria. The initial target was to find some factors that help predict a person's energy efficiency knowledge. From the survey, it is found that the energy efficiency awareness among the people of our country is very low. Relationships between household energy use behaviors are estimated using a unique dataset of about 40 households and 20 showrooms in Bangladesh's Chapainawabganj and Bagerhat districts. Knowledge of energy consumption and energy efficiency technology options is found to be associated with household use of energy conservation practices. Household characteristics also influence household energy use behavior. Younger household cohorts are more likely to adopt energy-efficient technologies and energy conservation practices and place primary importance on energy saving for environmental reasons. Education also influences attitudes toward energy conservation in Bangladesh. Low-education households indicate they primarily save electricity for the environment while high-education households indicate they are motivated by environmental concerns.
Accident detection system project report.pdfKamal Acharya
The Rapid growth of technology and infrastructure has made our lives easier. The
advent of technology has also increased the traffic hazards and the road accidents take place
frequently which causes huge loss of life and property because of the poor emergency facilities.
Many lives could have been saved if emergency service could get accident information and
reach in time. Our project will provide an optimum solution to this draw back. A piezo electric
sensor can be used as a crash or rollover detector of the vehicle during and after a crash. With
signals from a piezo electric sensor, a severe accident can be recognized. According to this
project when a vehicle meets with an accident immediately piezo electric sensor will detect the
signal or if a car rolls over. Then with the help of GSM module and GPS module, the location
will be sent to the emergency contact. Then after conforming the location necessary action will
be taken. If the person meets with a small accident or if there is no serious threat to anyone’s
life, then the alert message can be terminated by the driver by a switch provided in order to
avoid wasting the valuable time of the medical rescue team.
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELijaia
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
Supermarket Management System Project Report.pdfKamal Acharya
Supermarket management is a stand-alone J2EE using Eclipse Juno program.
This project contains all the necessary required information about maintaining
the supermarket billing system.
The core idea of this project to minimize the paper work and centralize the
data. Here all the communication is taken in secure manner. That is, in this
application the information will be stored in client itself. For further security the
data base is stored in the back-end oracle and so no intruders can access it.
Mechatronics is a multidisciplinary field that refers to the skill sets needed in the contemporary, advanced automated manufacturing industry. At the intersection of mechanics, electronics, and computing, mechatronics specialists create simpler, smarter systems. Mechatronics is an essential foundation for the expected growth in automation and manufacturing.
Mechatronics deals with robotics, control systems, and electro-mechanical systems.
Digital Twins Computer Networking Paper Presentation.pptxaryanpankaj78
A Digital Twin in computer networking is a virtual representation of a physical network, used to simulate, analyze, and optimize network performance and reliability. It leverages real-time data to enhance network management, predict issues, and improve decision-making processes.
Digital Twins Computer Networking Paper Presentation.pptx
A NALYSIS OF ANTHOCNET AND AODV P ERFORMANCE USING NS2
1. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 2, April 2015
DOI: 10.5121/ijci.2015.4209 89
ANALYSIS OF ANTHOCNET AND AODV
PERFORMANCE USING NS2
Y. Lakshmi Prasanna1
and Dr. P. Chenna Reddy2
1
Department of Computer Science and Engineering, JNTUACEP, Pulivendula
2
Professor of CSE Department, JNTUACEP, Pulivendula
ABSTRACT
Adhoc wireless multi-hop Networks (AHWMNs) are built with wireless nodes arranged in an adhoc manner.
Every node can forward packets and also acts as a source. AODV establishes a path to receiver when it is
needed by the sender and is on the standardization process of Internet engineering task force.
AntHocNetwhich is based on ants foraging behavior, includes reactive and proactive mechanisms.
AntHocNet builds the path as per the requirement of source and maintains until the end of communication
session. In this paper performance of AODV and AntHocNetare analyzed at different parameters like data
rates, pause times, and speed. Metrics Packet delivery ratio, Loss rate, End to End delay, jitter, and
throughput are evaluated at different simulation times. Simulation is performed using network simulator
NS-2.34 and 802.11b is the MAC protocol.
KEYWORDS
Performance, Analysis, AHWMN, AODV, AntHocNet.
1. INTRODUCTION
An Adhoc wireless multi-hop networks (AHWMNs) [1] don't have any fixed infrastructure. Node
can act as a source or destination or a router. Every node is independent and doesn't have any
central coordinator. Nodes can leave the network at any time. In AHWMNS routing protocols are
classified into reactive, proactive and hybrid routing protocols.Reactive routing protocols find the
route when source needs to send data to destination. The route establishment is done by flooding
the packets throughout the network. Proactive routingprotocols maintain the latest routing
information at each node. AntHocNet is bio-inspired routing protocol which is a hybrid routing
protocol. It follows reactive route setup and proactive path maintenance.
Bio-inspired routing protocols solve the routing problem in AHWMNs. They are based on Ant
colony optimization (ACO). During the ants search for food when ants found the source of food
they return to the place where they have started. Ants release a chemical called as pheromone on
the path. By using different routes many ants will travel to the same food source. The ants which
travel the minimum distant path will lay more pheromone in that path to help the other ants to
move in that path. More ants are influenced by this pheromone. Ants communicate indirectly
using a phenomenon known as stigmergy. In this an agent will leave signals for others and other
agents sense them. This mode of communication is local where in simple agents interact locally
without global information.
AntHocNet is a hybrid algorithm [3]that contains both reactive and proactive elements.
AntHocNet gathers the routing information only when the source and destination are involved in
2. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 2, April 2015
90
a communication session and it is proactive means, it tries to maintain and improve information
about existing paths while the session is going on. Routing information is stored in pheromone
tables.The control packets and data packets are sent in a stochastic way using these tables.
In reactive route setup process when source node wants to connect with destination node, it
checks it's routing table for the address of destination node. If it is not available then broadcast
messages are flooded through the whole network. These are called as reactive forward ants. The
intermediate node that receives the broadcast message will broadcast that if it is unaware of
destination node otherwise it will unicast the message. The reactive forward ants will keep the list
of nodes through which they have passed. When they are received by the destination then they
will be converted into reactive backward ant. It follows the same path which the forward ant has
been used and it also collects the quality information about each link of the path and updates at
every intermediate node and source.
In proactive path maintenance two phases are there. They are pheromone diffusion and proactive
ant sampling. In pheromone diffusion nodes periodically broadcasts best quality information.
Using this information all nodes will calculate new pheromone tables and further forward it in
their broadcasts. This pheromone is called as Virtual pheromone. In proactive ant sampling all
source nodes of communication session will periodically broadcast the proactive forward ants.
These ants chooses a next node randomly and builds a new path. For choosing the next node they
consider both regular and virtual pheromone and they leave the previous routes and follows the
routes which were derived in pheromone diffusion phase. After reaching the destination proactive
forward ant becomes proactive backward ant and returns to the source.
Failures are managed by using some reactive mechanisms, such as local route repair and warning
messages. In local route repair mechanism repair forward ants are sent from the failed node to
source node of communication session. They are limited up to particular number of hops. When
the number of hops limit is reached then these ants will be discarded. Unicast warning messages
are sent from the failed node to the source node. After broadcasting the repair ants also if packets
arrive at the broken link then these messages are used for providing the link failure notification.
AODV [2] is a on-demand routing algorithm used in adhoc networks. When it is needed to
establish a new route it broadcasts Route Request message (RREQ). On the way RREQ message
creates temporary routing table entries and if the receiver or a optimal route is found then that
path is made available and a unicast route reply (RREP) message is sent to sender. RREP
message creates routing table entries in the intermediate nodes along its path to source node.
2.LITERATURE SURVEY
Annapurna P Patil, K Rajanikant, Rakshith H P [4] have compared AntHocNet and AODV using
metrics Packet Delivery Ratio, jitter, average end to end delay, throughput, queuing delay,
convergence time. They have chosen QualNet-5.0 for simulation. Average End to End delay has
increased for AODV with the increasing speeds and number of nodes. For huge number of nodes
and high speeds AntHocNet outperformed AODV in case of jitter because it is a multi path
routing protocol. Convergence time also increased at high speeds and node densities. AntHocNet
outperforms AODV in average packet delivery ratio because AntHocNet uses different ants and
for decreasing the packet drops many shorter distant routes are calculated. AntHocNet does not
work well for throughput. The average queuing delay is less for AntHocNet with varying pause
time. They suggested that for improving AntHocNet the protocol has to be enhanced by fine-
tuning the control packet overhead and by introducing the priority concept.
MaahiAmit, Khemchandani, B. W. Balkhandeanalyzed the performance of AntHocNet with DSR,
and AODV. At different pause times and speeds lost packet ratio and normalized routing
3. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 2, April 2015
91
overhead are calculated by varying number of nodes for different pause times and speeds [5].
AntHocNet is consistent and stable when compared with DSR and AODV because AntHocNet is
having high normalized routing overhead. AntHocNet performs well at high data rates, speeds
and more number of nodes when considering the Packet loss ratio. DSR and AODV are not
suitable for large networks with high mobility of nodes.
S. S. Vasekar, Neelam S. Labhade [6] have evaluated routing algorithms performance for video
signal transmission based on ant colony optimization for adhoc networks. Evaluation of video
transmission is done using AntHocNet and the results are compared with AODV and DSDV
protocols. According to them due to having high throughput and packet delivery ratio AntHocNet
is better for video transmission. AntHocNet uses a proper route maintenance mechanism, so when
compared with AODV and DSDV end to end delay is less for AntHocNet. AntHocNet is better
than AODV and DSDV in terms of Peak signal to noise ratio(PSNR) and Latency.
S.B. Wankhade and M.S. Ali investigated Ant based routing research trends. They have identified
Quality of service and routing issues [7]. Because of the dynamic nodes and limited resources
current routing algorithms are not sufficient. Ant based algorithms use Fuzzy rule-based systems
for reducing these problems. Fuzzy rule-based systems does not exhibit the unstability in a
dynamic environment, they also manage the link failures in an efficient way.
Ant-E [8] is a on demand routing protocol and it uses Blocking Expanding Ring Search
(Blocking-ERS) for improving the reliability.Reliability is increased by reducing the overhead
and resending the data locally. If destination node is not encountered then Blocking-ERS does not
approach source node for broadcasting again, intermediate node will take care about the
rebroadcasting. This algorithm is used for solving the optimization problems which are complex.
Ant colony based Multi-path QoSaware Routing (AMQR) protocol establishes a number of
disjoint paths [9]. Source node establishes a topology by grouping the information of the paths
followed by ants. Depending on this information source calculates various link disjoint paths.
Using these paths it will send the data. Pheromone information is renewed by data packets.
Swarm-based Distance Vector Routing (SDVR) [10] is an implementation of AntNet. SDVR uses
many pheromone tables, each table is allocated for a QOS parameter and all tables are grouped
when it is the time for taking a decision. SDVR is suitable for small networks than AODV.
FuzzyAntNet follows optimized fuzzy systems and swarm intelligence. It is scalable to
modifications in network and it can identify the best route from sender to receiver which avoids
the traffic and minimum delay with high bandwidth.
Adaptive Fuzzy Ant-based Routing(AFAR) algorithm [11] builds links between the nodes. Nodes
exchange the path information for updating the pheromone tables. By taking the existing network
state into account and the previous information new paths are established considering fuzzy logic
techniques.
Ant-AODV is a hybrid routing protocol. Ant-AODV can minimize the end to end delay than
AODV [12]. AODV is used for reactive mechanism where as Ant algorithms performs the
proactive part. Aim of ant routing algorithm is to identify the routes in a minimum time there by
reducing end to end delay. Ant-AODV is appropriate for real time applications because
minimization of latency in identifying the route is done in Ant-AODV. This protocol uses route
error messages to tell the remaining nodes about the path break.HELLO messages tells about the
neighbor's presence.
Ant-DSR [13] is a on demand routing protocol in which paths are continuously checked using a
cache. The routes are continuously modified when new routes are encountered. Ant-DSR is
4. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 2, April 2015
92
having two phases, discovering the route and maintaining the route. Forward ants discover the
new routes, backward ants will inform source node about the information that is gathered by
forward ants.
Ant colony optimized routing protocol(ACOR)[14] is based on swarm intelligence. In this
protocol to obtain the best route path maintenance is done periodically. Refreshing of the path is
done regularly for adapting the topological changes.
3. SIMULATION
3.1. Simulation Environment
In this work for analyzing the performance of AntHocNet protocol, network simulator NS-2.34 is
used. Number of nodes considered is 50, Maximum number of connections is 8, simulation time
is 200 sec and the area of simulation is 500 x 500(m x m).The nodes are mobile and the links are
wireless. Each node considered as communication end-point is host. Throughput is calculated at
different simulation times from 20 to 200, at data rates 3Mbps, 5Mbps, 10Mbps and the metrics
packet delivery ratio, average end to end delay, loss rate, average jitter are calculated by
considering the data rates as 3, 5,10 Mbps and varying the speeds as 5, 10, 20 m/sec at pausetimes
30, 100 sec.
3.2. Metrics
The following metrics are calculated.
• Throughput :Throughput is the number of packets that are received in a particular time,
i.e. the rate at which a network receives data.
• Packet Delivery Ratio :Packet delivery ratio is the ratio of number of received data
packets to number of sent packets.
• Loss rate :Ratio of dropped packets to number of sent packets is known as Packet loss
rate.
• Jitter :The difference of time between the packets arrival is called as jitter.
• End to End delay :Time involved in delivery of data packets from source node to
destination node is the End to End delay.
3.3. Simulation Results and Analysis
Number of nodes - 50, Pause time - 0 sec, Speed - 20 m/sec
5. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 2, April 2015
93
3.3.1. Graphs for Throughput
Fig 1:AODV and AntHocNetThroughput at 3Mbps
Fig 2 : AODV and AntHocNet Throughput at 5 Mbps
0
500000
1000000
1500000
2000000
2500000
3000000
0 50 100 150 200 250
Throughput(bits/sec)
Simulationtime(sec)
AODV
AntHocNet
6. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 2, April 2015
94
Fig 3 :AODV and AntHocNetThroughput at 10 Mbps
Number of nodes - 50, Data rate - 3 Mbps
Table 1 : Packet delivery ratio at different pausetimes and speeds
Pause time
(sec)
Speed
(m/sec)
Packet delivery ratio
AODV AntHocNet
30 5 0.11299 0.10499
10 0.14142 0.0702
20 0.14531 0.0529
100 5 0.12211 0.0828
10 0.13409 0.0517
20 0.13472 0.1017
Number of nodes - 50, Data rate - 5 Mbps
Table 2: Packet delivery ratio at different pausetimes and speeds
Pause time
(sec)
Speed
(m/sec)
Packet delivery ratio
AODV AntHocNet
30 5 0.0956 0.0705
10 0.0889 0.0451
20 0.0848 0.0297
100 5 0.0812 0.0727
10 0.0796 0.0376
20 0.0894 0.0556
Number of nodes - 50, Data rate - 10 Mbps
0
200000
400000
600000
800000
1000000
1200000
0 50 100 150 200 250
Throughput(bits/sec)
Simulationtime(sec)
AODV
AntHocNet
7. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 2, April 2015
95
Table 3 : Packet delivery ratio at different pausetimes and speeds
Pause time
(sec)
Speed
(m/sec)
Packet delivery ratio
AODV AntHocNet
30 5 0.0476 0.0191
10 0.0541 0.03
20 0.0547 0.02
100 5 0.0472 0.026
10 0.0628 0.0264
20 0.0312 0.0133
Number of nodes-50, Data rate-3 Mbps
Table 4 : Loss Rate at different pausetimes and speeds
Pause time
(sec)
Speed
(m/sec)
Loss Rate
AODV AntHocNet
30 5 0.88701 0.89501
10 0.85857 0.9298
20 0.85469 0.94713
100 5 0.87789 0.91721
10 0.8659 0.94482
20 0.86527 0.89832
Number of nodes-50, Data rate-5 Mbps
Table 5 : Loss Rate at different pausetimes and speeds
Pause time
(sec)
Speed
(m/sec)
Loss Rate
AODV AntHocNet
30 5 0.9044 0.92949
10 0.9111 0.95491
20 0.9151 0.97026
100 5 0.9187 0.9272
10 0.9204 0.9624
20 0.9106 0.9444
Number of nodes-50, Data rate-10Mbps
Table 6 : Loss Rate at different pausetimes and speeds
Pause time
(sec)
Speed
(m/sec)
Loss Rate
AODV AntHocNet
30 5 0.9524 0.9809
10 0.9458 0.9699
20 0.9453 0.9799
100 5 0.9528 0.9739
10 0.9372 0.9736
20 0.9688 0.9867
Number of nodes-50, Data rate-3 Mbps
8. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 2, April 2015
96
Table 7 : Jitter at different pausetimes and speeds
Pause time
(sec)
Speed
(m/sec)
Jitter (sec)
AODV AntHocNet
30 5 4.96264 10.5431
10 5.24198 43.9245
20 4.48386 34.861
100 5 4.65202 19.18796
10 4.42073 23.74592
20 7.3956 8.07373
Number of nodes-50, Data rate-5 Mbps
Table 8 : Jitter at different pausetimes and speeds
Pause time
(sec)
Speed
(m/sec)
Jitter (sec)
AODV AntHocNet
30 5 2.8363 6.729
10 2.482 5.996
20 2.0025 7.1995
100 5 20.1815 10.9104
10 16.7789 25.8462
20 14.9251 11.756
Number of nodes-50, Data rate-10 Mbps
Table 9 : Jitter at different pausetimes and speeds
Pause time
(sec)
Speed
(m/sec)
Jitter (sec)
AODV AntHocNet
30 5 4.5214 13.4077
10 2.4054 11.7007
20 3.1299 9.9545
100 5 9.1517 13.6613
10 4.6306 13.5595
20 3.5012 10.4929
Number of nodes-50, Data rate-3 Mbps
Table 10 : End to End delay at different pausetimes and speeds
Pause time
(sec)
Speed
(m/sec)
End to End delay (sec)
AODV AntHocNet
30 5 1.2499 1.11352
10 0.97092 1.9159
20 0.96282 1.58094
100 5 1.18112 1.61025
10 0.96052 1.61548
20 0.98551 1.25188
Number of nodes-50, Data rate-5 Mbps
9. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 2, April 2015
97
Table 11 : End to End delay at different pausetimes and speeds
Pause time
(sec)
Speed
(m/sec)
End to End delay (sec)
AODV AntHocNet
30 5 0.7754 1.0546
10 0.9511 1.4881
20 0.9907 2.0098
100 5 1.0778 1.291
10 1.0596 2.1014
20 0.8492 1.395
Number of nodes-50, Data rate-10 Mbps
Table 12 : End to End delay at different pausetimes and speeds
Pause time
(sec)
Speed
(m/sec)
End to End delay (sec)
AODV AntHocNet
30 5 0.9826 1.5264
10 0.8417 1.5507
20 0.8532 1.4273
100 5 1.007 1.87051
10 0.7162 1.8072
20 1.6187 2.0927
4. DISCUSSION
Figures 1, 2 and 3 represents the evaluation of throughput at different data rates, speed 20 m/sec,
pausetime 0 sec. Figure 1 illustrates that AODV's throughput is higher than AntHocNet at 3 Mbps.
At data rate 5 Mbps AntHocNet's throughput is less than AODV as shown in Figure 2. From
Figure 3 it is concluded that AODV throughput has outperformed AntHocNet at 10 Mbps.
Packet delivery ratio, Loss rate, End to End delay and jitter are calculated at data rates 3, 5, 10
Mbps, speed is varied as 5, 10, 20 m/sec and pause time is taken as 30, 100 sec. From Tables 1, 4,
7, 10 it is inferred that at data rate 3 Mbps AODV performs better than AntHocNet in terms of
packet delivery ratio and AntHocNet exhibits higher loss rate, jitter and, end to end delay.
AODV packet delivery ratio is better than AntHocNet and AntHocNet is having more loss rate,
jitter, and end to end delay at data rate 5 Mbps as shown in Tables 2, 5, 8, 11.
At data rate 10 Mbps AntHocNet packet delivery ratio is less than AODV and loss rate, end to
end delay, jitter are more than AODV and are presented in Tables 3, 6, 9, 12.
5. CONCLUSION
In this work two routing protocols are compared namely Adhoc On demand Distance Vector
Routing protocol and AntHocNet. The parameters pause time and speed are kept constant and
they are set to 0 sec and 20 m/sec respectively and the data rates are considered as 3 Mbps, 5
Mbps and 10 Mbps respectively. We have calculated the throughput at different simulation times
and it is observed that AODV outperforms AntHocNet at 3, 5 and 10 Mbps. At data rates 3, 5, 10
Mbps by varying pause time as 30, 100 sec and speed as 5, 10, 20 m/sec AODV performs better
than AntHocNet in terms of packet delivery ratio, throughput and AntHocNet is having high loss
10. International Journal on Cybernetics & Informatics (IJCI) Vol. 4, No. 2, April 2015
98
rate, end to end delay and jitter. So, it is concluded that AODV is performance is better than
AntHocNet in the simulations considered.
REFERENCES
[1] Frederic Ducatelle, (2007) “Adaptive Routing in Wireless Adhoc Multi Hop Networks", Switzerland.
[2] C. E. Perkins, E. M. Belding Royer and S. Das, (2003) "Adhoc On Demand Distance Vector Routing",
RFC 3561, Available at :www.ietf.org/rfc/rfc3561.txt.
[3] Gianni Di Caro, Frederick Ducatelle and Luca Maria Gambardella, (2005) " An Adaptive natutre-
inspired algorithm for routing in Mobile Adhoc networks", European Transaction on
Telecommunications, pp. 16:443 - 455.
[4] Annapurna P Patil, K Rajanikant, Rakshith H P, (2012) "Analyzing the performance of AntHocNet
protocol forMANETS", International Journal of Computer Applications(0975-8887), Vol. 57, No. 5,
pp. 20-25.
[5] MaahiAmitKhemchandani, Prof. B. W. Balkhande, (2014) "Comparitive analysis of AntHocNet,
AODV, DSRRoutingProtocols for improving Loss Packet Delivery Factor", International Journal of
Computer Science andInformation Technologies, Vol. 5 (5), pp.6478-6482.
[6] Neelam S. Labhade, S. S. Vasekar, (2014) "Performance evaluation of AODV, DSDV and
AntHocNet in videotransmission", IJARCET - International Journal of Advanced Research in
Computer Engineering & Technology,Vol. 3, Issue 5, pp. 1934-1939.
[7] S. B. Wankhade and M. S. Ali, (2012) "Recent Trends in Ant Based Routing Protocols for MANET",
InternationalJournal of Advances in Engineering & Technology, Vol. 4, Issue 1, pp. 405-413.
[8] SrinivasSethi&SibaK.Udgata, (2002) "The Efficient Ant Routing Protocol for MANET", In
International Journal onComputer Science and Engineering, Vol. 2, No.7, pp. 2414-2420.
[9] L. Liu & G. Feng, (2005) "A Novel ant colony based QoS aware routing algorithm for MANETS", In
proceedings ofFirst International Conference on advances in Natural Computation, Changsha(China),
Volume 3612, pp. 457-466.
[10] R. Ashokan, A. M. Natarajan& C. Venkatesh, (2008) "Ant based Dynamic Source Routing Protocol
to SupportMultiple Quality of Service Metrics in Mobile Adhoc Networks", In International Journal
of Computer Scienceand Security, Volume 2, No.3, pp.48-56.
[11] S. J. Mirabedini, M. Teshnehlab, M. H. Shenasa, Ali Moraghar& A. M. Rahmani,(2008) "AFAR -
Adaptive fuzzyant based routing for communication networks", In Journal of Zhejiang University
Science, Volume 9, No. 12,pp.1666-1675.
[12] S. Marwaha, C. Khong and T. Srinivasan,(2002) "Ant-AODV : Mobile agents based routing protocol
for mobileadhocnetworks", In Proceedings of IEEE Global Telecommunications Conference,
GLOBECOM,Taipei(Taiwan), Vol. 1, pp. 163-167.
[13] M. Aissani, M. Fenouche, H. Sadour and A. Mellouk, (2007) "Ant-DSR: cache maintainence based
routing protocolfor mobileadhocnetworks", AICT 2007- The Third Advanced International
Conference inTelecommunications,Morne, pp. 35-35.
[14] Dweepnagarg, Parthgohil, (2012) "Ant Colony Optimized Routing For Mobile Adhoc Networks",
International Journal of Smart Sensors and Adhoc Networks, Vol 2.