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.
A novel approach of hybrid multipath routing protocol for manets using receiv...eSAT Publishing House
This document summarizes a research paper that proposes a new hybrid multipath routing protocol called HMPRP for mobile ad hoc networks. HMPRP aims to improve performance metrics like packet delivery ratio, end-to-end delay, energy consumption and throughput. It applies concepts from AODV like route discovery and incorporates received signal strength and node-disjoint multipath routing. Simulation results show HMPRP outperforms AODV, OLSR and ZRP protocols across various node speeds for 150 node networks.
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
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.
This document compares the performance of the AODV and DSR routing protocols under various network conditions through simulation. It finds that AODV performs better than DSR in terms of packet delivery ratio, with fewer packets lost over time. While DSR initially loses more packets, it is able to reduce packet loss over the course of the longer 20-second simulation compared to AODV.
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.
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.
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 novel approach of hybrid multipath routing protocol for manets using receiv...eSAT Publishing House
This document summarizes a research paper that proposes a new hybrid multipath routing protocol called HMPRP for mobile ad hoc networks. HMPRP aims to improve performance metrics like packet delivery ratio, end-to-end delay, energy consumption and throughput. It applies concepts from AODV like route discovery and incorporates received signal strength and node-disjoint multipath routing. Simulation results show HMPRP outperforms AODV, OLSR and ZRP protocols across various node speeds for 150 node networks.
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
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.
This document compares the performance of the AODV and DSR routing protocols under various network conditions through simulation. It finds that AODV performs better than DSR in terms of packet delivery ratio, with fewer packets lost over time. While DSR initially loses more packets, it is able to reduce packet loss over the course of the longer 20-second simulation compared to AODV.
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.
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.
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
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
This document summarizes a study that evaluates the performance of four routing protocols - FSR, STAR-LORA, DYMO, and DSR - in a mobile ad hoc network (MANET) simulation using QualNet. Two scenarios were tested: one with constant bit rate (CBR) client traffic and one with CBR server traffic. Performance metrics like throughput, average end-to-end delay, and average jitter were measured for 2, 4, 6, 8, and 12 nodes. The results showed that reactive protocols DYMO and DSR generally had lower delay but higher jitter than proactive protocols FSR and STAR-LORA. This study aims to help identify the most efficient routing
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
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETspijans
This document summarizes and surveys several enhanced routing protocols that have been developed for mobile ad hoc networks (MANETs). It begins by providing background on routing challenges in MANETs and classifications of routing protocols. It then describes several traditional and widely used routing protocols, including DSDV, OLSR, TORA, DSR, and AODV. The document focuses on summarizing several new routing protocols that have been proposed to improve upon existing protocols. It discusses protocols such as BAWB-DSR, CCSR, RAMP, AODV-SBA, CBRP-R, and CBTRP - noting techniques, advantages, and disadvantages of each. The overall purpose is to review
Analysis of FSR, LANMAR and DYMO under MANETidescitation
A movable ad hoc system (MANET) is a self-configuring communications set of
connections of mobile procedure associated by wireless. Each mechanism in a MANET is
free to move independently in some way, and will therefore modify its relations to other
devices frequently [2]. The primary purpose of any ad-hoc network routing protocol is to
meet the challenges of the dynamically changing topology and establish an efficient route
connecting every two nodes. In this paper three protocols FSR, LANMAR and DYMO are
compared by using random waypoint mobility in few nodes with varying packet sizes in
CBR traffic. The parameters or metrics are used to assess the performance of protocols with
and without Black Hole attack, that are data Packet Delivery ratio and Average Jitter with
varying data traffic CBR (Constant Bit Ratio) using Qual Net 5.0.2 simulator.
This document analyzes the performance of three routing protocols - AODV, DSDV, and OLSR - in a mobile ad hoc network simulation using the NS-3 simulator. It describes the key characteristics of each protocol and the simulation setup, which involved 50 nodes moving according to a random waypoint model. The performance metric studied was packet delivery ratio. The results showed that OLSR achieved the highest packet delivery ratio, performing better than AODV and DSDV in delivering packets from source to destination nodes over the 600 second simulation.
Survey of Modified Routing Protocols for Mobile Ad-hoc Networkijsrd.com
In last few years extensive research work has been done in the field of routing protocols for Ad-hoc Network. Various routing protocols have been evaluated in different network conditions using different performance metrics. A lot of research has been done how to modify standard routing protocol in ad-hoc network to improve its performance. The hop count is not only metric that gives efficient routing path. There are various modified protocols which make the use of other parameters along with hop count to select the best routing path to the destination. In standard Ad-hoc On-demand Distance Vector (AODV) routing protocol only hop count is used for selecting the routing path. In this paper we have studied variants of AODV protocols with modified routing metric.
ENERGY AND PERFORMANCE EVALUATION OF REACTIVE, PROACTIVE, AND HYBRID ROUTING ...ijwmn
This paper evaluates the energy consumption of well-known routing protocols, along with other metrics
such as throughput, packet delivery ratio (PDR), and delay in different scenarios. We consider two other
metrics in order to capture the efficiency of the energy consumption: e-throughput which is the ratio
between the consumed energy and the throughput; and the e-PDR which is the ratio between the
consumed energy and the PDR. We compare four routing protocols: AODV, OLSR, and HWMP in
Reactive and Proactive modes. The number of nodes is varying between 25 and 81 nodes, with different
mobility models. Simulations are conducted using NS3 and the parameters of a real network interface
card. From the results, AODV presents the lowest energy consumption and a better e-Throughput. OLSR
provides a better e-PDR in mobile scenarios. With a smaller e-PDR and e-Throughput, the proactive
mode of HWMP is more energy efficient than the reactive mode.
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
International Journal of Engineering 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.
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.
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.
Performance comparison of routing protocols in mobile ad hoc networksijujournal
Routing protocols have an important role in any Mobile Ad Hoc Network (MANET). Researchers have elaborated several routing protocols that possess different performance levels. In this paper we give a performance evaluation of AODV, DSR, DSDV, OLSR and DYMO routing protocols in Mobile Ad Hoc
Networks (MANETS) to determine the best in different scenarios. We analyse these MANET routing protocols by using NS-2 simulator. We specify how the Number of Nodes parameter influences their performance. In this study, performance is calculated in terms of Packet Delivery Ratio, Average End to End Delay, Normalised Routing Load and Average Throughput.
P ERFORMANCE C OMPARISON OF R OUTING P ROTOCOLS IN M OBILE A D H OC N E...ijujournal
Routing protocols have
an important
role in any
Mobile Ad Hoc Network
(MANET).
Researchers
have
elaborated several routing protocols that possess different performance levels
. In this
p
aper
we
give a
performance evaluation of
AODV,
DSR,
DSDV
, OLSR and DYMO
routing protocol
s
in
Mobile Ad Hoc
Networks
(MANETS)
to
determine
the best
in different scenarios
. We
analyse
these
MANET
routing
protocols by
using
NS
-
2 simulator
. We specify how
the
Number of No
d
es
parameter influences
their
performance. In this study
,
performance is
calculated
in terms
of Packet Delivery Ratio,
Average
End to
End Delay, Normalised Routing Load and Average 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.
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.
Network Surveillance Based Data Transference in Cognitive Radio Network with ...IRJET Journal
This document compares different wireless routing protocols to find the most energy efficient for creating a cognitive radio network model with attacker nodes. It analyzes reactive, proactive, and hybrid routing protocols including AODV, DSR, DSDV, OLSR, and a hybrid protocol. Simulation results show the hybrid protocol consumes the least energy compared to other protocols, making it well-suited for an energy efficient cognitive radio network model.
A Survey of Enhanced Routing Protocols for Manetspijans
Mobile Ad Hoc Networks (MANETs) form a class of dynamic multi-hop networks consisting of a set of
mobile nodes that intercommunicate on shared wireless channels. MANETs are self-organizing and selfconfiguring multi-hop wireless networks, where the network structure changes dynamically due to the node
mobility. There exists no fixed topology due to the mobility of nodes, interference, multipath propagation
and path loss. Hence efficient dynamic routing protocols are required for these networks to function
properly. Many routing protocols have been developed to accomplish this task. In this paper we survey
various new routing protocols that have been developed as extensions or advanced versions of previously
existing routing protocols for MANETs such as DSR, AODV, OLSR etc.
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
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 by varying speed of nodes, traffic sources and mobility.
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 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.
Survey comparison estimation of various routing protocols in mobile ad hoc ne...ijdpsjournal
This document summarizes and compares various routing protocols for mobile ad-hoc networks (MANETs). It first describes the characteristics and challenges of MANETs. It then classifies routing protocols for MANETs into three main categories: table-driven (proactive), on-demand (reactive), and hybrid protocols. Examples of protocols from each category are described in detail, including DSDV, AODV, DSR, and ZRP. Key features such as route discovery, table maintenance, and use of proactive and reactive approaches are discussed for each example protocol. Finally, the document compares different protocols based on parameters like scalability, latency, bandwidth overhead, and mobility impact.
Survey 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
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
This document summarizes a study that evaluates the performance of four routing protocols - FSR, STAR-LORA, DYMO, and DSR - in a mobile ad hoc network (MANET) simulation using QualNet. Two scenarios were tested: one with constant bit rate (CBR) client traffic and one with CBR server traffic. Performance metrics like throughput, average end-to-end delay, and average jitter were measured for 2, 4, 6, 8, and 12 nodes. The results showed that reactive protocols DYMO and DSR generally had lower delay but higher jitter than proactive protocols FSR and STAR-LORA. This study aims to help identify the most efficient routing
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
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETspijans
This document summarizes and surveys several enhanced routing protocols that have been developed for mobile ad hoc networks (MANETs). It begins by providing background on routing challenges in MANETs and classifications of routing protocols. It then describes several traditional and widely used routing protocols, including DSDV, OLSR, TORA, DSR, and AODV. The document focuses on summarizing several new routing protocols that have been proposed to improve upon existing protocols. It discusses protocols such as BAWB-DSR, CCSR, RAMP, AODV-SBA, CBRP-R, and CBTRP - noting techniques, advantages, and disadvantages of each. The overall purpose is to review
Analysis of FSR, LANMAR and DYMO under MANETidescitation
A movable ad hoc system (MANET) is a self-configuring communications set of
connections of mobile procedure associated by wireless. Each mechanism in a MANET is
free to move independently in some way, and will therefore modify its relations to other
devices frequently [2]. The primary purpose of any ad-hoc network routing protocol is to
meet the challenges of the dynamically changing topology and establish an efficient route
connecting every two nodes. In this paper three protocols FSR, LANMAR and DYMO are
compared by using random waypoint mobility in few nodes with varying packet sizes in
CBR traffic. The parameters or metrics are used to assess the performance of protocols with
and without Black Hole attack, that are data Packet Delivery ratio and Average Jitter with
varying data traffic CBR (Constant Bit Ratio) using Qual Net 5.0.2 simulator.
This document analyzes the performance of three routing protocols - AODV, DSDV, and OLSR - in a mobile ad hoc network simulation using the NS-3 simulator. It describes the key characteristics of each protocol and the simulation setup, which involved 50 nodes moving according to a random waypoint model. The performance metric studied was packet delivery ratio. The results showed that OLSR achieved the highest packet delivery ratio, performing better than AODV and DSDV in delivering packets from source to destination nodes over the 600 second simulation.
Survey of Modified Routing Protocols for Mobile Ad-hoc Networkijsrd.com
In last few years extensive research work has been done in the field of routing protocols for Ad-hoc Network. Various routing protocols have been evaluated in different network conditions using different performance metrics. A lot of research has been done how to modify standard routing protocol in ad-hoc network to improve its performance. The hop count is not only metric that gives efficient routing path. There are various modified protocols which make the use of other parameters along with hop count to select the best routing path to the destination. In standard Ad-hoc On-demand Distance Vector (AODV) routing protocol only hop count is used for selecting the routing path. In this paper we have studied variants of AODV protocols with modified routing metric.
ENERGY AND PERFORMANCE EVALUATION OF REACTIVE, PROACTIVE, AND HYBRID ROUTING ...ijwmn
This paper evaluates the energy consumption of well-known routing protocols, along with other metrics
such as throughput, packet delivery ratio (PDR), and delay in different scenarios. We consider two other
metrics in order to capture the efficiency of the energy consumption: e-throughput which is the ratio
between the consumed energy and the throughput; and the e-PDR which is the ratio between the
consumed energy and the PDR. We compare four routing protocols: AODV, OLSR, and HWMP in
Reactive and Proactive modes. The number of nodes is varying between 25 and 81 nodes, with different
mobility models. Simulations are conducted using NS3 and the parameters of a real network interface
card. From the results, AODV presents the lowest energy consumption and a better e-Throughput. OLSR
provides a better e-PDR in mobile scenarios. With a smaller e-PDR and e-Throughput, the proactive
mode of HWMP is more energy efficient than the reactive mode.
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
International Journal of Engineering 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.
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.
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.
Performance comparison of routing protocols in mobile ad hoc networksijujournal
Routing protocols have an important role in any Mobile Ad Hoc Network (MANET). Researchers have elaborated several routing protocols that possess different performance levels. In this paper we give a performance evaluation of AODV, DSR, DSDV, OLSR and DYMO routing protocols in Mobile Ad Hoc
Networks (MANETS) to determine the best in different scenarios. We analyse these MANET routing protocols by using NS-2 simulator. We specify how the Number of Nodes parameter influences their performance. In this study, performance is calculated in terms of Packet Delivery Ratio, Average End to End Delay, Normalised Routing Load and Average Throughput.
P ERFORMANCE C OMPARISON OF R OUTING P ROTOCOLS IN M OBILE A D H OC N E...ijujournal
Routing protocols have
an important
role in any
Mobile Ad Hoc Network
(MANET).
Researchers
have
elaborated several routing protocols that possess different performance levels
. In this
p
aper
we
give a
performance evaluation of
AODV,
DSR,
DSDV
, OLSR and DYMO
routing protocol
s
in
Mobile Ad Hoc
Networks
(MANETS)
to
determine
the best
in different scenarios
. We
analyse
these
MANET
routing
protocols by
using
NS
-
2 simulator
. We specify how
the
Number of No
d
es
parameter influences
their
performance. In this study
,
performance is
calculated
in terms
of Packet Delivery Ratio,
Average
End to
End Delay, Normalised Routing Load and Average 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.
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.
Network Surveillance Based Data Transference in Cognitive Radio Network with ...IRJET Journal
This document compares different wireless routing protocols to find the most energy efficient for creating a cognitive radio network model with attacker nodes. It analyzes reactive, proactive, and hybrid routing protocols including AODV, DSR, DSDV, OLSR, and a hybrid protocol. Simulation results show the hybrid protocol consumes the least energy compared to other protocols, making it well-suited for an energy efficient cognitive radio network model.
A Survey of Enhanced Routing Protocols for Manetspijans
Mobile Ad Hoc Networks (MANETs) form a class of dynamic multi-hop networks consisting of a set of
mobile nodes that intercommunicate on shared wireless channels. MANETs are self-organizing and selfconfiguring multi-hop wireless networks, where the network structure changes dynamically due to the node
mobility. There exists no fixed topology due to the mobility of nodes, interference, multipath propagation
and path loss. Hence efficient dynamic routing protocols are required for these networks to function
properly. Many routing protocols have been developed to accomplish this task. In this paper we survey
various new routing protocols that have been developed as extensions or advanced versions of previously
existing routing protocols for MANETs such as DSR, AODV, OLSR etc.
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
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 by varying speed of nodes, traffic sources and mobility.
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 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.
Survey comparison estimation of various routing protocols in mobile ad hoc ne...ijdpsjournal
This document summarizes and compares various routing protocols for mobile ad-hoc networks (MANETs). It first describes the characteristics and challenges of MANETs. It then classifies routing protocols for MANETs into three main categories: table-driven (proactive), on-demand (reactive), and hybrid protocols. Examples of protocols from each category are described in detail, including DSDV, AODV, DSR, and ZRP. Key features such as route discovery, table maintenance, and use of proactive and reactive approaches are discussed for each example protocol. Finally, the document compares different protocols based on parameters like scalability, latency, bandwidth overhead, and mobility impact.
Survey 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
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.
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.
Network Surveillance Based Data Transference in Cognitive Radio Network with ...IRJET Journal
The document compares different wireless routing protocols to find the most energy efficient for creating a cognitive radio network model with attacker nodes. It first describes cognitive radio networks and their ability to dynamically access unused radio spectrum. It then summarizes the characteristics of reactive, proactive, and hybrid routing protocols. Reactive protocols determine routes on demand through flooding, while proactive protocols constantly update routing tables. The document analyzes the ad hoc on-demand distance vector (AODV) and dynamic source routing (DSR) reactive protocols as well as the destination sequenced distance vector (DSDV) and optimized link state (OLSR) proactive protocols. It aims to compare these protocols and determine the most energy efficient for the cognitive radio network model.
A Review of Ad hoc on demand distance vector routing and proposed AR-AODVEditor IJMTER
Mobile Ad-hoc networks are a key in the evolution of wireless networks. In mobile
ad hoc networks, there is no centralized infrastructure to monitor or allocate the resources
used by the mobile nodes. The absence of any central coordinator makes the routing a
complex one compared to cellular networks. The Ad hoc On Demand Distance Vector
(AODV) routing algorithm is a routing protocol designed for ad hoc mobile devices. AODV
uses an on demand approach for finding routes .A class of routing protocols called ondemand protocols has recently found attention because of their low routing overhead. The ondemand protocols depend on query floods to discover routes whenever a new route is needed.
Such floods take up a substantial portion of network bandwidth. The routing in Mobile ad hoc
network is difficult and number of reactive routing protocols like AODV, DSR, and DSDV
has been implemented. In this paper, an attempt has been made to thoroughly study all
AODVs and a new AODV is proposed called AR-AODV
Review paper on performance analysis of AODV, DSDV, OLSR on the basis of pack...IOSR Journals
This document analyzes the performance of three routing protocols - AODV, DSDV, and OLSR - in mobile ad hoc networks based on packet delivery ratio. It simulates the protocols using NS-3 simulator over 600 seconds with 50 nodes moving randomly. The results show that OLSR has the best performance with high and stable packet delivery ratio, while DSDV has the worst performance with many dropped packets. AODV shows average performance throughout the simulation.
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.
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.
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.
Network Lifetime Analysis of Routing Protocols of Short Network in QualnetIOSR Journals
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
Issues in designing a routing and Transport Layer protocol for Ad hoc networks- proactive
routing, reactive routing (on-demand), hybrid routing- Classification of Transport Layer
solutions-TCP over Ad hoc wireless Networks
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.
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.
Similar to Progressive Routing Protocol using Hybrid Analysis for MANETs (20)
This document summarizes a research paper that proposes using an artificial neural network tuned by a simulated annealing algorithm for real-time credit card fraud detection. The paper describes how simulated annealing can be used to train the weights of a neural network model to classify credit card transactions as fraudulent or non-fraudulent based on attributes of past transactions. The algorithm is tested on a real-world credit card transaction dataset and is found to effectively classify most transactions correctly, though some misclassifications still occur.
Wireless sensor networks (WSN) have been widely used in various applications.
In these networks nodes collect data from the attached sensors and send their data to a base
station. However, nodes in WSN have limited power supply in form of battery so the nodes
are expected to minimize energy consumption in order to maximize the lifetime of WSN. A
number of techniques have been proposed in the literature to reduce the energy
consumption significantly. In this paper, we propose a new clustering based technique
which is a modification of the popular LEACH algorithm. In this technique, first cluster
heads are elected using the improved LEACH algorithm as usual, and then a cluster of
nodes is formed based on the distance between node and cluster head. Finally, data from
node is transferred to cluster head. Cluster heads forward data, after applying aggregation,
to the cluster head that is closer to it than sink in forward direction or directly to the sink.
This reduction in distance travelled improves the performance over LEACH algorithm
significantly.
This document provides an overview of vertical handover decision strategies in heterogeneous wireless networks. It begins with an introduction to always best connectivity requirements in next generation networks that allow users to move between different network technologies. It then discusses the key aspects of handover management, including the three phases of initiation, decision, and execution. Various criteria for the handover decision process are described, such as received signal strength, network connection time, available bandwidth, power consumption, cost, security, and user preferences. Different types of handover decision strategies are categorized, including those based on network conditions, user preferences, multiple attributes, fuzzy logic/neural networks, and context awareness. The strategies are analyzed and their advantages/disadvantages compared.
This paper presents the design and performance comparison of a two stage
operational amplifier topology using CMOS and BiCMOS technology. This conventional op
amp circuit was designed by using RF model of BSIM3V3 in 0.6 μm CMOS technology and
0.35 μm BiCMOS technology. Both the op amp circuits were designed and simulated,
analyzed and performance parameters are compared. The performance parameters such as
gain, phase margin, CMRR, PSRR, power consumption etc achieved are compared. Finally,
we conclude the suitability of CMOS technology over BiCMOS technology for low power
RF design.
In Cognitive Radio Networks (CRN), Cooperative Spectrum Sensing (CSS) is
used to improve performance of spectrum sensing techniques used for detection of licensed
(Primary) user’s signal. In CSS, the spectrum sensing information from multiple unlicensed
(Secondary) users are combined to take final decision about presence of primary signal. The
mixing techniques used to generate final decision about presence of PU’s signal are also
called as Fusion techniques / rules. The fusion techniques are further classified as data
fusion and decision fusion techniques. In data fusion technique all the secondary users
(SUs) share their raw information of spectrum detection like detected energy or other
statistical information, while in decision fusion technique all the SUs take their local
decisions and share the decision by sending ‘0’ or ‘1’ corresponding to absence and presence
of PU’s signal respectively. The rules used in decision fusion techniques are OR rule, AND
rule and K-out-of-N rule. The CSS is further classified as distributed CSS and centralized
CSS. In distributed CSS all the SUs share the spectrum detection information with each
other and by mixing the shared information; all the SUs take final decision individually. In
centralized CSS all the SUs send their detected information to a secondary base station /
central unit which combines the shared information and takes final decision. The secondary
base station shares the final decision with all the SUs in the CRN. This paper covers
overview of information fusion methods used for CSS and analysis of decision fusion rules
with simulation results.
This paper analyzes the impact of network scalability on various physical attributes of Zigbee networks. Simulations were conducted using Qualnet to evaluate the performance of the Zigbee physical layer based on energy consumption and throughput. Energy consumption was analyzed for different modulation schemes (ASK, BPSK, OQPSK), network sizes (2-50 nodes), and clear channel assessment modes. The results showed that OQPSK and ASK had lower energy consumption than BPSK. Throughput was highest for OQPSK. While carrier sense had slightly higher throughput than other CCA modes, the energy consumption differences between CCA modes were minor.
This paper gives a brief idea of the moving objects tracking and its application.
In sport it is challenging to track and detect motion of players in video frames. Task
represents optical flow analysis to do motion detection and particle filter to track players
and taking consideration of regions with movement of players in sports video. Optical flow
vector calculation gives motion of players in video frame. This paper presents improved
Luacs Kanade algorithm explained for optical flow computation for large displacement and
more accuracy in motion estimation.
A rapid progress is seen in the field of robotics both in educational and industrial
automation sectors. The Robotics education in particular is gaining technological advances
and providing more learning opportunities. In automotive sector, there is a necessity and
demand to automate daily human activities by robot. With such an advancement and
demand for robotics, the realization of a popular computer game will help students to learn
and acquire skills in the field of robotics. The computer game such as Pacman offers
challenges on both software and hardware fronts. In software, it provides challenges in
developing algorithms for a robot to escape from the pool of attacking robots and to develop
algorithms for multiple ghost robots to attack the Pacman. On the hardware front, it
provides a challenge to integrate various systems to realize the game. This project aims to
demonstrate the pacman game in real world as well as in simulation. For simulation
purpose Player/Stage is used to develop single-client and multi-client architectures. The
multi- client architecture in player/stage uses one global simulation proxy to which all the
robot models are connected. This reduces the overhead to manage multiple robots proxy.
The single-client architecture enables only two robot models to connect to the simulation
proxy. Multi-client approach offers flexibility to add sensors to each port which will be used
distinctly by the client attached to the respective robot. The robots are named as Pacman
and Ghosts, which try to escape and attack respectively. Use of Network Camera has been
done to detect the global positions of the robots and data is shared through inter-process
communication.
In Content-Based Image Retrieval (CBIR) systems, the visual contents of the
images in the database are took out and represented by multi-dimensional characteristic
vectors. A well known CBIR system that retrieves images by unsupervised method known
as cluster based image retrieval system. For enhancing the performance and retrieval rate
of CBIR system, we fuse the visual contents of an image. Recently, we developed two
cluster-based CBIR systems by fusing the scores of two visual contents of an image. In this
paper, we analyzed the performance of the two recommended CBIR systems at different
levels of precision using images of varying sizes and resolutions. We also compared the
performance of the recommended systems with that of the other two existing CBIR systems
namely UFM and CLUE. Experimentally, we find that the recommended systems
outperform the other two existing systems and one recommended system also comparatively
performed better in every resolution of image.
Information Systems and Networks are subjected to electronic attacks. When
network attacks hit, organizations are thrown into crisis mode. From the IT department to
call centers, to the board room and beyond, all are fraught with danger until the situation is
under control. Traditional methods which are used to overcome these threats (e.g. firewall,
antivirus software, password protection etc.) do not provide complete security to the system.
This encourages the researchers to develop an Intrusion Detection System which is capable
of detecting and responding to such events. This review paper presents a comprehensive
study of Genetic Algorithm (GA) based Intrusion Detection System (IDS). It provides a
brief overview of rule-based IDS, elaborates the implementation issues of Genetic Algorithm
and also presents a comparative analysis of existing studies.
Step by step operations by which we make a group of objects in which attributes
of all the objects are nearly similar, known as clustering. So, a cluster is a collection of
objects that acquire nearly same attribute values. The property of an object in a cluster is
similar to other objects in same cluster but different with objects of other clusters.
Clustering is used in wide range of applications like pattern recognition, image processing,
data analysis, machine learning etc. Nowadays, more attention has been put on categorical
data rather than numerical data. Where, the range of numerical attributes organizes in a
class like small, medium, high, and so on. There is wide range of algorithm that used to
make clusters of given categorical data. Our approach is to enhance the working on well-
known clustering algorithm k-modes to improve accuracy of algorithm. We proposed a new
approach named “High Accuracy Clustering Algorithm for Categorical datasets”.
Brain tumor is a malformed growth of cells within brain which may be
cancerous or non-cancerous. The term ‘malformed’ indicates the existence of tumor. The
tumor may be benign or malignant and it needs medical support for further classification.
Brain tumor must be detected, diagnosed and evaluated in earliest stage. The medical
problems become grave if tumor is detected at the later stage. Out of various technologies
available for diagnosis of brain tumor, MRI is the preferred technology which enables the
diagnosis and evaluation of brain tumor. The current work presents various clustering
techniques that are employed to detect brain tumor. The classification involves classification
of images into normal and malformed (if detected the tumor). The algorithm deals with
steps such as preprocessing, segmentation, feature extraction and classification of MR brain
images. Finally, the confirmatory step is specifying the tumor area by technique called
region of interest.
A Proxy signature scheme enables a proxy signer to sign a message on behalf of
the original signer. In this paper, we propose ECDLP based solution for chen et. al [1]
scheme. We describe efficient and secure Proxy multi signature scheme that satisfy all the
proxy requirements and require only elliptic curve multiplication and elliptic curve addition
which needs less computation overhead compared to modular exponentiations also our
scheme is withstand against original signer forgery and public key substitution attack.
This document proposes a digital watermarking technique using LSB replacement with secret key insertion for enhanced data security. The technique works by inserting a watermark into the least significant bits of pixels in an image. A secret key is also inserted during transmission for additional security. The watermarked image is generated without noticeably impacting image quality. The proposed method was tested on sample images and successfully embedded watermarks while maintaining visual quality. The technique aims to provide copyright protection and authentication of digital images and documents.
Today among various medium of data transmission or storage our sensitive data
are not secured with a third-party, that we used to take help of. Cryptography plays an
important role in securing our data from malicious attack. This paper present a partial
image encryption based on bit-planes permutation using Peter De Jong chaotic map for
secure image transmission and storage. The proposed partial image encryption is a raw data
encryption method where bits of some bit-planes are shuffled among other bit-planes based
on chaotic maps proposed by Peter De Jong. By using the chaotic behavior of the Peter De
Jong map the position of all the bit-planes are permuted. The result of the several
experimental, correlation analysis and sensitivity test shows that the proposed image
encryption scheme provides an efficient and secure way for real-time image encryption and
decryption.
This paper presents a survey of Dependency Analysis of Service Oriented
Architecture (SOA) based systems. SOA presents newer aspects of dependency analysis due
to its different architectural style and programming paradigm. This paper surveys the
previous work taken on dependency analysis of service oriented systems. This study shows
the strengths and weaknesses of current approaches and tools available for dependency
analysis task in context of SOA. The main motivation of this work is to summarize the
recent approaches in this field of research, identify major issue and challenges in
dependency analysis of SOA based systems and motivate further research on this topic.
In this paper, proposed a novel implementation of a Soft-Core system using
micro-blaze processor with virtex-5 FPGA. Till now Hard-Core processors are used in
FPGA processor cores. Hard cores are a fixed gate-level IP functions within the FPGA
fabrics. Now the proposed processor is Soft-Core Processor, this is a microprocessor fully
described in software, usually in an HDL. This can be implemented by using EDK tool. In
this paper, developed a system which is having a micro-blaze processor is the combination
of both hardware & Software. By using this system, user can control and communicate all
the peripherals which are in the supported board by using Xilinx platform to develop an
embedded system. Implementing of Soft-Core process system with different peripherals like
UART interface, SPA flash interface, SRAM interface has to be designed using Xilinx
Embedded Development Kit (EDK) tools.
The article presents a simple algorithm to construct minimum spanning tree and
to find shortest path between pair of vertices in a graph. Our illustration includes the proof
of termination. The complexity analysis and simulation results have also been included.
Wimax technology has reshaped the framework of broadband wireless internet
service. It provides the internet service to unconnected or detached areas such as east South
Africa, rural areas of America and Asia region. Full duplex helpers employed with one of
the relay stations selection and indexing method that is Randomized Distributed Space Time
are used to expand the coverage area of primary Wimax station. The basic problem was
identified at cell edge due to weather conditions (rain, fog), insertion of destruction because
of multiple paths in the same communication channel and due to interference created by
other users in that communication. It is impractical task for the receiver station to decode
the transmitted signal successfully at the cell edges, which increases the high packet loss and
retransmissions. But Wimax is a outstanding technology which is used for improving the
quality of internet service and also it offers various services like Voice over Internet
Protocol, Video conferencing and Multimedia broadcast etc where a little delay in packet
transmission can cause a big loss in the communication. Even setup and initialization of
another Wimax station nearer to each other is not a good alternate, where any mobile
station can easily handover to another base station if it gets a strong signal from other one.
But in rural areas, for few numbers of customers, installation of base station nearer to each
other is costlier task. In this review article, we present a scheme using R-DSTC technique to
choose and select helpers (relay nodes) randomly to expand the coverage area and help to
mobile station as a helper to provide secure communication with base station. In this work,
we use full duplex helpers for better utilization of bandwidth.
Radio Frequency identification (RFID) technology has become emerging
technique for tracking and items identification. Depend upon the function; various RFID
technologies could be used. Drawback of passive RFID technology, associated to the range
of reading tags and assurance in difficult environmental condition, puts boundaries on
performance in the real life situation [1]. To improve the range of reading tags and
assurance, we consider implementing active backscattering tag technology. For making
mobiles of multiple radio standards in 4G network; the Software Defined Radio (SDR)
technology is used. Restrictions in Existing RFID technologies and SDR technology, can be
eliminated by the development and implementation of the Software Defined Radio (SDR)
active backscattering tag compatible with the EPC global UHF Class 1 Generation 2 (Gen2)
RFID standard. Such technology can be used for many of applications and services.
How to Download & Install Module From the Odoo App Store in Odoo 17Celine George
Custom modules offer the flexibility to extend Odoo's capabilities, address unique requirements, and optimize workflows to align seamlessly with your organization's processes. By leveraging custom modules, businesses can unlock greater efficiency, productivity, and innovation, empowering them to stay competitive in today's dynamic market landscape. In this tutorial, we'll guide you step by step on how to easily download and install modules from the Odoo App Store.
CapTechTalks Webinar Slides June 2024 Donovan Wright.pptxCapitolTechU
Slides from a Capitol Technology University webinar held June 20, 2024. The webinar featured Dr. Donovan Wright, presenting on the Department of Defense Digital Transformation.
Post init hook in the odoo 17 ERP ModuleCeline George
In Odoo, hooks are functions that are presented as a string in the __init__ file of a module. They are the functions that can execute before and after the existing code.
The Science of Learning: implications for modern teachingDerek Wenmoth
Keynote presentation to the Educational Leaders hui Kōkiritia Marautanga held in Auckland on 26 June 2024. Provides a high level overview of the history and development of the science of learning, and implications for the design of learning in our modern schools and classrooms.
A Free 200-Page eBook ~ Brain and Mind Exercise.pptxOH TEIK BIN
(A Free eBook comprising 3 Sets of Presentation of a selection of Puzzles, Brain Teasers and Thinking Problems to exercise both the mind and the Right and Left Brain. To help keep the mind and brain fit and healthy. Good for both the young and old alike.
Answers are given for all the puzzles and problems.)
With Metta,
Bro. Oh Teik Bin 🙏🤓🤔🥰
8+8+8 Rule Of Time Management For Better ProductivityRuchiRathor2
This is a great way to be more productive but a few things to
Keep in mind:
- The 8+8+8 rule offers a general guideline. You may need to adjust the schedule depending on your individual needs and commitments.
- Some days may require more work or less sleep, demanding flexibility in your approach.
- The key is to be mindful of your time allocation and strive for a healthy balance across the three categories.
2. from each node to every other node in the network. The OLSR protocol is belongs to proactive category.
Reactive routing protocol [5] creates routes only when desired by the source node. Once a route has been
established, it is maintained by a route maintenance procedure until either the destination becomes
inaccessible along every path from the source or until the route is no longer desired. The Ad hoc On-demand
Distance Vector (AODV) and Dynamic Source Routing (DSR) [7] protocols belong to the category of
reactive routing protocol. And Hybrid routing protocol commonly referred to as balanced-hybrid routing, is a
combination of the advantages of both distance vector and link state protocols and merges them into a new
protocol. Normally, hybrid protocols are based on a distance vector protocol but contain many of the features
and advantages of link state protocols. The ZRP protocol belongs to the category of hybrid routing protocol.
That has received the most attention; however, they do not utilize multiple paths. This paper proposes a
hybrid node disjoint multipath routing protocol which is based on the on-demand distance vector routing [1].
In this research paper we have proposed an approach for mobile ad-hoc networks routing called Hybrid
Multipath Progressive Routing Protocol which performed significant improvement based on Received Signal
Strength [8].
II. BACKGROUND AND RELATED W ORK
MANET Routing Protocols: The Routing in networking can be defined as the process of moving packet of
information from a source to a destination. In this mechanism, a packet may travel through a number of
network points with routers before arriving at its destination. Researchers in the field of MANET have
investigated many routing protocols including various aspects of the MANETs and their properties. There are
some protocols for proactive, reactive and hybrid routing in MANET. Ad-hoc On-demand Distance Vector
(AODV) [6], Dynamic Source Routing (DSR), Zone Routing Protocol (ZRP) and the Optimized Link State
Routing (OLSR) are some name out of them.
Reactive routing is also known as on-demand routing protocol is a popular routing protocols for wireless ad
hoc routing because they do not maintain routing information or routing process at the network nodes if there
is no communication. If a node wants to send a packet to another node then this protocol searches for the
route in an on-demand scheme and establishes the connection in order to transmit and receive the packet. The
route discovery occurs by broadcasting the route request packets throughout the network [2]. In proactive
routing protocols, each node maintains a table with the routing information, and perform periodic updates
and/or if the network topology changes to keep it consistent. Hybrid routing protocols are a new advanced
protocol, which are having both feature proactive and reactive in nature. The motive to design these protocols
is to increase scalability and reliability.
A. The Ad-hoc On-demand Distance Vector (AODV)
The Ad hoc On-demand Distance Vector (AODV) [6], [14] protocol is one in each of them on-demand
routing algorithms that has received the most attention, however, it does not utilize multiple routes. It
basically joins the mechanisms of DSDV and DSR algorithm. In AODV the periodic beacons, hop-by-hop
routing and the sequence numbers of DSDV and pure on-demand mechanism of Route Discovery and also
the Route Maintenance of DSR are combined [9].
In AODV protocol at each instance, route discovery is done for fresh communication which consumes more
bandwidth and generates more routing over-head. The source creates RREQ packet which is broadcast to it's
neighbor nodes. When destination receives the RREQ packet, it sends RREP packet on received path. This
RREP packet is unicast to the next node on RREP path. The intermediate node on receiving the RREP packet
creates reversal of path set by the RREQ packet along with RREP packet is received by the source, it starts
send data transmission on the forward path set by RREP packet. While data transmission is continue and path
break occurs due to mobility of node or out of coverage area of nodes on the active path, data packets will be
lost due to this reason multi route is better then unipath [10] [11].
B. Optimized Link State Routing (OLSR)
It belongs to proactive routing protocol category where the routes are always ready when required. OLSR is
an optimized mechanism of a pure link state protocol. The key concept used in the protocol is that of
multipoint relays (MPRs). MPRs are selected nodes which forward broadcast messages during the flooding
process. To reduce the possible overhead in the network protocol multipoint relays (MPR) are used. To
reducing the time interval for the control messages transmission brings more reactivity to the topological
changes [12].
146
3. OLSR uses two types of the control messages first hello and second topology control. Hello messages are
used for searching the information about the link status and the host’s neighbours whereas topology control
messages are used for broadcasting information about its own advertised neighbours, which includes at least
the one MPR selector list [22].
C. Zone Routing Protocol (ZRP)
Zone routing protocol is belongs to the hybrid routing protocol category which basically combines the best
features of proactive and reactive routing protocol [13]. The key concept is to use a proactive routing scheme
within a limited zone in the r-hop neighbourhood of every node, and use reactive routing scheme for nodes
beyond this zone. An Intra-zone routing protocol (IARP) is used in the zone where particular node employs
proactive routing whereas inter-zone routing protocol (IERP) is used outside the zone. The routing zone of a
given nodes is a subset of the network, within all nodes are reachable which are less than or equal to the zone
radius hops. The IERP is responsible for finding paths to the nodes which are not within the routing zone.
When a node A wants to send data to node B, it checks that node B is within its zone. If exist packet is
delivered directly using IARP. If not exist then it broadcasts (uses unicast to deliver the packet directly to
border nodes) the RREQ packet to its peripherals nodes. If any peripheral nodes find B in its zone, it sends
RREP packet; otherwise the node re- broadcasts the RREQ packet to the peripherals nodes. This procedure is
repeated until node B is located [21].
III. DESCRIPTION OF PROPOSED PROTOCOL
In this research paper, we have use AODV protocol as the base routing protocol therefore, the basic
functionality of the proposed protocol, Hybrid Multipath Progressive Routing Protocol (HMPRP) with nodedisjoint is similar to AODV protocol. We have modified AODV protocol on the basis of Received Signal
Strength.
In this protocol at the time of route creation we compared RSS of every routing packet with threshold value
at every neighbouring node. We apply node disjoint, multipath and load balancing technique using hybrid
approach [15]. Our goal is to propose an algorithm that has a high Packet delivery ratio and throughput with
low end-to-end delay and energy consumed.
IV. PERFORMANCE PARAMETER & METRICS
a.
b.
c.
d.
Packet delivery Ratio: It shows the ratio of total packets received at destination nodes, to total packets
which are sent by source nodes. Figure 2 shows Packet Delivery Ratio [19].
Energy Consumption: Energy consumption is defined as the amount of energy consumed by nodes in the
networks through radio communication and processing during transmission and receiving. Figure 3
shows Energy Consumptions.
Throughput: Throughput is the average rate of successful data packets received at destination. It is
usually measured in bits per second (bit/s or bps), and sometimes in data packets per second and rarely in
packets per second or packets per time slot. Figure 4 shows the average rate of successful message
delivery over a communication channel [19].
Average end to end delay of data packets: Delay or latency could be defined as the time taken by the
packets to reach from source to destination. This includes all possible delays from the moment the packet
is generated to the moment it is received by the destination node [19]. Here we have calculated end to
end delay. Figure 5 shows End-to-end delay.
V. SIMULATION ENVIRONMENT
Using the Exata Cyber simulation tool, we run several simulations with these routing schemes examining the
influence of the traffic load on the routing performances. The following parameters are shown in table 1 used
in our simulations.
Simulator EXata Cyber 1.1 is used to create a simulation environment to develop and analyze the newly
developed HMPRP protocol and compare its performance with the already existing ad hoc routing protocol
AODV, ZRP and OLSR figure 1 show the simulation of 200 nodes with 5 source nodes.
The random waypoint model is used to model mobility of nodes. This model was first used by Johnson and
Maltz in the evaluation of DSR, and was later refined by the same research group.
147
4. TABLE: I SIMULATION SETTINGS
Parameter
Simulator
Studied Protocol
Area
No. of nodes
No. of Applications
Type of sources
MAC protocol
Packet size
Traffic Rate
Mobility model
Simulation time
Channel type
Antenna model
Energy model
Access Model
Value
EXata CYBER 1.1 Emulator
AODV
1500m x 1500m
50,100,150,200,250 nodes
5
CBR
802.11
512 bytes
1 packet per second
Random waypoint
100 seconds
Wireless Channel
Omni Directional
MicaZ
DCF (Distributed Coordinated Function) with CSMA/CA
VI. RESULTS AND D ISCUSSIONS
The EXata CYBER 1.1 Emulator has been used to analyze the parametric performance of Hybrid Multipath
Progressive Routing Protocol (HMPRP), Ad-hoc On-demand Distance Vector Routing Protocol (AODV),
OLSR and Zone Routing Protocol (ZRP). The metric based analysis is shown in figure 2 to figure 5. We have
done simulation on 50, 100, 150, 200 and 250 nodes using 5 CBR (source nodes) applications.
A. Packet Delivery Ratio
HMPRP shows high increase in its delivery ratio with increasing load as shown in the figure and it is also
performing better than AODV, OLSR and ZRP. For highly active networks AODV, OLSR and ZRP have
variable PDR but HMPRP maintain consistency with increase network size [18]. There is a good
improvement in PDR for HMPRP due to hybrid nature. It can be seen in the figure 2 that packet delivery
ratio for HMPRP has much better performance than of OLSR and ZRP with the increase in the number of
nodes. When the number of nodes increases, OLSR and ZRP drop a larger ratio of the packets than HMPRP,
AODV. The performance of HMPRP protocol is better than other protocols.
B. Energy Consumed
We can understand from figure 3 that HMPRP consume less energy than AODV, OLSR and ZRP. The
Energy Consumptions of the four protocols is shown in figure 3. The Figure depicts the variation of energy
consumption as a function of the number of nodes. HMPRP although uses multi routing [17]. It is observed
that HMPRP has much lower energy consumption than AODV, OLSR and ZRP in all possible numbers of
nodes.
C. Throughput
The throughput is analyzed with varying CBR data traffic. According to our simulation results better
performance is shown by HMPRP and it is performing uniformly in the all case. Throughput of ZRP is
decreasing as the network size is increasing but HMPRP performs well in large sized networks. It is evident
from the figure 4 that while comparing throughput of HMPRP, AODV, OLSR, and ZRP with 50, 100, 150,
200 and 250 nodes with 5 numbers of connections it is not much reduced for all protocols. For ZRP it is
highest drop. It is better going up in case of HMPRP than OLSR and AODV when no. of nodes varied 50250 nodes.
D. End-to-End Delay
In figure 5 we see that the average packet delay increases with number of nodes while routing protocols try to
find valid route to the destination. Besides the actual delivery of data packets, the delay time is also affected
by route discovery, which is the first step to begin a communication session .In this analysis it is observed as
expected the delays are more for ZRP in comparison to HMPRP and AODV. Delays are incurred by ZRP’S
IARP and IERP methods. The end-to-end delay of HMPRP is also less than to AODV and OLSR because it
148
5. has reduced routing overhead and queuing delay whereas OLSR are proactive protocol it has already routing
table.
Figure 1: Simulation of 200 nodes
1) Packet Delivery Ratio
Figure 2: Packet Delivery Ratio Vs No. of Nodes
2) Energy Consumptions
Figure 3: Energy Consumed in transmission and receiving Vs No. of Nodes
149
6. 3) Throughput
Figure 4: Throughput Vs No. of Nodes
4) Avg. End-to-end Delay
Figure 5: Avg. End-to-End Delay Vs No. of Nodes
VII. HOW EXATA IS DIFFERENT FROM OTHER SIMULATOR ?
HPMRP has been implemented using Exata Cyber 1.1 Emulator. The choice of the simulator which is most
appropriate to our work based on compare some of the popular simulators, (GlomoSim, Exata Cyber ,
QualNet and NS-2++).
Exata Cyber 1.1 Emulator [16] is a commercial version of GloMoSim [20] but it dramatically expands its
capabilities, in terms of contributed models and protocols coding, graphical tools for experiment planning,
analysis and visualization, as well as in terms of available documentation, demo and technical support. Exata
supports also some from of network emulation and allows designing realistic 3D environment. While it
compiles using a standard C/C++ compiler, support is directly provided by the manufacturer.
Exata Cyber 1.1 Emulator appears as the best compromise, in terms of number of pre-built components,
modularity and scalability. In this sense, we see Exata as an effective simulation framework, on which we
can build the complete Hybrid Progressive Multipath Routing Protocol for mobile ad hoc networks.
The advanced capabilities of Exata, among network simulators, are the powerful Graphical User Interface
(GUI) for custom code development and reporting options, the instant playback of simulation results to
minimize unnecessary model executions, the fast simulation results for thorough exploration of model
150
7. parameters and the scalable up to tens of thousands of nodes the real time simulation and multi platform
support.
Exata’s analysis capabilities allow the modeler to analyze the quantitative performance of protocols that can
be measured, in terms of packet delivery ratio, average end-to-end delay time and throughput. It can also
provide statistical data on protocol performance when subject to increasing node density, network load,
number of sources and increasing mobility.
VIII. CONCLUSIONS
In this work we have select two well known MANET routing protocols (AODV and OLSR) and has
considered their most popular properties in routing messages towards their destinations and have combined
these most popular properties to formulate a Hybrid MANET routing protocol through simulation and
analysis Packet delivery ratio, throughput, energy consumed and average end to end delay.
We have designed, implemented and have run simulation based studies to measure the performance merits of
this proposed HMPRP routing protocol. The performance evaluation of new proposed hybrid routing
protocol with proactive (OLSR), reactive (AODV) and hybrid (ZRP) routing protocols for stationary and
mobile nodes are studied by varying the node density ( 50, 100, 150, 200 and 250) using Exata Cyber 1.1
simulator. From the results it can be observed that the proposed protocol outperforms the other three
protocols in the considered performance metrics, this proposed protocol achieves this performance increase
by the elimination unwanted message exchanges and route requests and route replies. Our future work
includes testing this protocol under various testing scenarios in order to optimize the performance of it. We
are also planning to implement it in one of the MANET network testbeds and to validate the performance
excellence of this protocol.
REFERENCES
[1] P.M. Jawandhiya, R.S. Mangrulkar, Mohammad Atique and M. S. Ali, “ A Novel Hybrid Routing Protocol for
Mobile Adhoc Network”, International Journal of Advancements in Technology http://ijict.org/ , Vol 1, No 2
(October 2010), pp 185-196.
[2] Thabotharan Kathiravelu and Sivamayam Sivasuthan, “A Hybrid Reactive Routing Protocol for Mobile Ad-hoc
Networks”, 6th International Conference on Industrial and Information Systems, ICIIS 2011, (Aug. 16-19, 2011), Sri
Lanka, pp 1-6.
[3] http://wifi.cs.standrews.ac.uk/wifistandard.html
[4] Mostefa Fatima zohra, Mekkakia Maaza zoulikha and Khelifa Said “ Techniques Of Detection Of The Hidden Node
In Wireless Ad Hoc Network”, Proceedings of the World Congress on Engineering 2011 Vol II WCE 2011, (July 6 8, 2011), London, U.K.
[5] Vahdad and D. Becker, “Epidemic routing for partially connected ad hoc networks,” Duke University, Tech. Rep.,
(April 2000).
[6] C. E. Perkins and E. Royer, Ad-hoc on-demand distance vector routing, in Proceedings of the 2nd IEEE Workshop
on Mobile Computing Systems and Applications (WMCSA), (1999), pp 90–100.
[7] Y. Zhang V. Kawadia and B. Gupta, “System Services for Implementing Ad hoc Routing: Architecture,
Implementation & Experiments,” Proceeding of First International Conference on Mobile System, Application and
Services (Mobisys), San Francisco, CA. (June 2003), pp 99-114.
[8] Ruay-Shiung Chang and Shing-Jiuan Leu, “Long-lived Path Routing With Received SignalStrength for Ad Hoc
Networks”, IEEE (2006).
[9] Mehran Abolhasan, Tadeusz Wysocki and Eryk Dutkiewicz, “A review of routing protocols for mobile ad hoc
networks”,www.ElsevierComputerScience.com, Ad Hoc Networks 2 (2004), pp 1–22.
[10] Li Yuanzhou and Hu Weihua, “Optimization Strategy for Mobile Ad Hoc Network Based on AODV Routing
Protocol”, IEEE (23-25 Sept. 2010), pp 1-4.
[11] http://en.wikipedia.org/wiki/Ad_hoc_OnDemand_Distance_Vector_Routing#Advantages_and_disadvantages.
[12] Philippe Jaquet, Paul Muhlethaler and Amir Qayyum, 2001. “Optimized Link State Routing Protocol”, IETF Draft,
http://www.ietf.org/internet-drafts/draft-ietf-manetolsr- 06.txt.
[13] E. Topalis S. Giannoulis, C. Antonopoulos and S. Koubias. ZRP Versus DSR and TORA: A Compressive Survey on
ZRP Performance. 10th IEEE Conference ,ETFA 2005, 1(ISBN:0-7803-9401-1), Sept 2005.
[14] Rendong Bai and M. Singhal. DOA: DSR over AODV protocol for mobile ad hoc network. IEEE Transaction on
Mobile Computing, 5:1403-1416, Oct 2006.
[15] Mahesh K. Marina and Samir R. Das, “Ad hoc on-demand multipath distance vector routing”, WIRELESS
COMMUNICATIONS AND MOBILE COMPUTING. (2006), pp 969–988.
[16] EXata/Cyber 1.1 User’s Guide, “Scalable Network Technologies”, Inc., http://www.scalable-networks.com
151
8. [17] Sanjay Sharma and Pushpinder Singh Patheja, “Improving AODV Routing Protocol with Priority and Power
Efficiency in Mobile Ad hoc WiMAX Heterogeneous and Ad hoc Homogeneous Networks” Journal of Modeling
and Simulation in Design and Manufacturing, Vol. 2 No. 2 (December 2011), pp 129-136.
[18] R. K. Kapoor, M.A. Rizvi, Sanjay Sharma and M. M. Malik, “A Node Disjoint Multipath Routing Protocol in
Mobile Adhoc Network” IJMIE, Vol. 1. Issue 7, (Dec.2011), pp 269-285.
[19] Vikram Mehta and Dr. Neena Gupta, “Performance Analysis of QoS Parameters for Wimax Networks”,
International Journal of Engineering and Innovative Technology (IJEIT) Volume 1, Issue 5, (May 2012), pp 105110.
[20] GloMoSim Scalable Mobile Network Simulator, Software Package. http://pcl.cs.ucla.edu/projects/glomosim/
[21] Jogendra Kumar “Comparative Performance Analysis Of AODV, DSR,DYMO,OLSR And ZRP Routing Protocols
In MANET Using Varying Pause Time” International Journal of Computer Communications and Networks
(IJCCN),2(3), pp 43–51 ,2012.
[22] Makarand R. Shahade and D. N. Choudhari “Simulation Result of Hybrid Routing Protocol for Mobile Ad hoc
Network” International Journal of Computer Science and Information Technologies, Vol. 3 (1) , 2012, pp 2969 –
2974.
152