Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year.
This document summarizes research on improving the performance of route caches in the Dynamic Source Routing (DSR) protocol for mobile ad hoc networks. DSR maintains route caches but they have issues like stale entries, incomplete error notification, and insufficient cache size. The paper proposes a reliable and effective cache management technique for DSR. It estimates a combined weight for each cached route based on length, traffic load, energy level, and freshness. Routes are sorted by weight, with lowest weighted routes removed first. As an alternate route, it selects the most reliable route from the sorted cache before a link breaks. This aims to improve DSR performance by reducing delay, packet loss, overhead, and increasing throughput.
Multipath routing protocol for effective local route recoveryIJARBEST JOURNAL
In mobile Ad hoc network, frequent mobility during the data transmission of data
causes route failure which results in route discovery. In this we propose multipath routing protocol
for effective local route recovery in mobile Ad hoc networks. In this protocol each source and
destination pair establishes multiple paths in single route discovery and they are cached in their route
caches. The cached routes are sorted on the basis of their bandwidth availability. In case of route
failure in the primary route, a recovery node which is an over heading neighbor, detects it and
establishes a local recovery path with maximum bandwidth from its route cache. This proposed
technique improves network performance and it prevents frequent collision.
The congestion control within the TCP (Transmission Control Protocol) plays a critical role in
amending data rate to evade congestion from happening possibilities. Based on TCP communication sender
not only guarantees the successful packet delivery, but also maintains the correct sequence of packets by
receiving the frequent acknowledgement from the receiver. In this research we proposed a congestion
control scheme with modified TCP and queue length variation with OLSR routing protocol in MANET. The
TCP protocol performance is modified by forwarding busy channel signals to predecessor nodes through
intermediate nodes in network. The congestion is controlled by that novel method of detecting the node is
busy or ready for communication. If the communication is start in network and the possibility if congestion
is arise, then in that case the queue length is handle the possibility of congestion. The congestion is
minimized due to awaring about the channel busy status and nodes buffer status or queue status. The TCP
protocol is able to handle the congestion situation but i.e. completely based on acknowledgement of receiver
and also not very effective to control it. The proposed TCP congestion control OLSR routing is improves
the network performance by reducing packet loss. The performance of network is measure through
performance metrics like throughput, PDF and Routing overhead in different node density scenarios. The
performance of proposed scheme is provides the better results.
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.
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such
Networks are frequently limited by the network split due to either energy depletion or node mobility of the
mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths
becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path
breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric
system of measurement used to select the paths takes into account the stability of the nodes and the
equivalent links.
This document summarizes research on load balancing techniques for congestion control in mobile ad hoc networks (MANETs). It first provides background on MANETs and issues like limited bandwidth. It then reviews literature on multipath routing and load balancing, categorizing approaches based on metrics like available bandwidth. The document proposes using acknowledgement times to estimate available bandwidth and distribute traffic to avoid congestion across multiple paths. By adapting sending rates based on estimated available bandwidth, this could minimize congestion in the network.
Load aware and load balancing using aomdv routing in manetijctet
This document discusses load aware and load balancing techniques using multipath routing in mobile ad hoc networks (MANETs). It proposes using a location aided routing (LAR) protocol with the Ad-hoc On-demand Multipath Distance Vector (AOMDV) routing protocol to identify multiple routing backbones from the source to destination nodes based on the intermediate nodes' communication and processing capabilities. This helps distribute traffic loads evenly across multiple paths to improve load balancing, reduce congestion, and enhance quality of service in the MANET.
This summarizes an academic paper that proposes an efficient and active data delivery method for highly dynamic mobile ad hoc networks. It introduces the Fish Eye State Routing protocol to overcome limitations of existing position-based opportunistic routing protocols. FSR uses a fisheye technique to reduce routing overhead by maintaining more accurate information about nearby nodes. It also proposes a virtual destination-based void handling scheme to address communication breaks. The paper analyzes FSR's performance and ability to deliver data reliably and securely in large, high-mobility networks.
Dvr based hybrid routing protocols in mobile ad-hoc network application and c...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Multipath routing protocol for effective local route recoveryIJARBEST JOURNAL
In mobile Ad hoc network, frequent mobility during the data transmission of data
causes route failure which results in route discovery. In this we propose multipath routing protocol
for effective local route recovery in mobile Ad hoc networks. In this protocol each source and
destination pair establishes multiple paths in single route discovery and they are cached in their route
caches. The cached routes are sorted on the basis of their bandwidth availability. In case of route
failure in the primary route, a recovery node which is an over heading neighbor, detects it and
establishes a local recovery path with maximum bandwidth from its route cache. This proposed
technique improves network performance and it prevents frequent collision.
The congestion control within the TCP (Transmission Control Protocol) plays a critical role in
amending data rate to evade congestion from happening possibilities. Based on TCP communication sender
not only guarantees the successful packet delivery, but also maintains the correct sequence of packets by
receiving the frequent acknowledgement from the receiver. In this research we proposed a congestion
control scheme with modified TCP and queue length variation with OLSR routing protocol in MANET. The
TCP protocol performance is modified by forwarding busy channel signals to predecessor nodes through
intermediate nodes in network. The congestion is controlled by that novel method of detecting the node is
busy or ready for communication. If the communication is start in network and the possibility if congestion
is arise, then in that case the queue length is handle the possibility of congestion. The congestion is
minimized due to awaring about the channel busy status and nodes buffer status or queue status. The TCP
protocol is able to handle the congestion situation but i.e. completely based on acknowledgement of receiver
and also not very effective to control it. The proposed TCP congestion control OLSR routing is improves
the network performance by reducing packet loss. The performance of network is measure through
performance metrics like throughput, PDF and Routing overhead in different node density scenarios. The
performance of proposed scheme is provides the better results.
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.
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such
Networks are frequently limited by the network split due to either energy depletion or node mobility of the
mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths
becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path
breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric
system of measurement used to select the paths takes into account the stability of the nodes and the
equivalent links.
This document summarizes research on load balancing techniques for congestion control in mobile ad hoc networks (MANETs). It first provides background on MANETs and issues like limited bandwidth. It then reviews literature on multipath routing and load balancing, categorizing approaches based on metrics like available bandwidth. The document proposes using acknowledgement times to estimate available bandwidth and distribute traffic to avoid congestion across multiple paths. By adapting sending rates based on estimated available bandwidth, this could minimize congestion in the network.
Load aware and load balancing using aomdv routing in manetijctet
This document discusses load aware and load balancing techniques using multipath routing in mobile ad hoc networks (MANETs). It proposes using a location aided routing (LAR) protocol with the Ad-hoc On-demand Multipath Distance Vector (AOMDV) routing protocol to identify multiple routing backbones from the source to destination nodes based on the intermediate nodes' communication and processing capabilities. This helps distribute traffic loads evenly across multiple paths to improve load balancing, reduce congestion, and enhance quality of service in the MANET.
This summarizes an academic paper that proposes an efficient and active data delivery method for highly dynamic mobile ad hoc networks. It introduces the Fish Eye State Routing protocol to overcome limitations of existing position-based opportunistic routing protocols. FSR uses a fisheye technique to reduce routing overhead by maintaining more accurate information about nearby nodes. It also proposes a virtual destination-based void handling scheme to address communication breaks. The paper analyzes FSR's performance and ability to deliver data reliably and securely in large, high-mobility networks.
Dvr based hybrid routing protocols in mobile ad-hoc network application and c...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
This document summarizes and compares three routing protocols for mobile ad hoc networks (MANETs): AODV, DSR, and DSDV. It describes that MANETs are infrastructureless wireless networks without centralized administration. Routing in MANETs is complex due to frequent changes in network topology as nodes move. The document then provides an overview of AODV as a reactive routing protocol that establishes routes on demand, DSR as another reactive source-initiated protocol using source routing, and DSDV as a proactive table-driven protocol that maintains routing tables. It notes that AODV routing messages require little processing to minimize overhead and allows quick reaction to link breaks.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of the architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
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.
Active path updation for layered routing (apular) in wirelessAlexander Decker
1) The document proposes an Active Path Updation procedure (APULAR) for layered routing in wireless mesh networks to quickly update broken paths and reduce packet loss.
2) In APULAR, the destination node takes responsibility for local repair restoration instead of the source node initiating a new path discovery when a link breaks, as is typically done.
3) The procedure is simulated and shown to outperform AODV and IWMRA routing protocols, achieving better packet delivery ratio, lower control overhead, higher throughput, and lower end-to-end delay.
A comparative study in wireless sensor networksijwmn
This document summarizes and compares several routing algorithms proposed for wireless sensor networks. It discusses algorithms that aim to improve reliability, power efficiency, lifetime, and fault tolerance. The evaluation section compares how each algorithm addresses challenges like reliability, energy conservation, and adapting to topology changes. While various algorithms achieve improvements in areas like power efficiency and lifetime, most still have limitations and do not fully address all the key challenges for wireless sensor networks.
The document summarizes an Efficient Position-Based Opportunistic Routing (EPOR) protocol proposed for mobile ad hoc networks. EPOR takes advantage of geographic routing and the broadcast nature of wireless transmissions. When a packet is transmitted, overhearing nodes can act as forwarding candidates. The best forwarder is chosen, but if it fails to forward in time, a suboptimal candidate will forward instead to avoid transmission interruptions. Simulation results show EPOR achieves higher packet delivery ratios and lower end-to-end delays than GPSR and AOMDV routing protocols, even under high node 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
Comparative and Behavioral Study on VANET Routing ProtocolsIOSR Journals
This document provides a summary and comparison of various routing protocols for vehicular ad hoc networks (VANETs). It discusses topology-based protocols like CGSR and DSDV, reactive protocols like DSR, and position-based protocols like GSR, A-STAR, GPCR, VADD, CAR, DIR, and B-MFR. The position-based protocols are considered the best for handling issues in VANETs like packet delay, traffic congestion, and throughput. The paper analyzes the characteristics and behaviors of different VANET routing protocols and concludes that position-based protocols are most suitable for the dynamic environment of vehicular networks.
SURVEY AND TAXONOMY OF UNICAST ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKSgraphhoc
The purpose of this paper is to survey the unicast routing protocols for mobile ad hoc networks
(MANETs) and study their primary route selection principle. In this context, we did an exhaustive survey
of unicast MANET routing protocols proposed in the literature. Qualitatively, based on their primary
route selection principle, we show that all these protocols could be placed under one of two broad route
selection categories: routing based on minimum-weight path and routing based on stability. In addition
to the primary route selection principle, we also identify the underlying routing metric and the routing
philosophy (proactive, reactive, flat, hierarchical, location-awareness, power-sensitiveness and multipath
capability) adopted by the different routing protocols. We believe the survey can be a great source of
information for researchers in ad hoc networks.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Novel Routing Protocol Based on Periodic Route Discovery for Mobile Adhoc Net...IJERA Editor
A group of mobile devices called as nodes, without any centralized network, communicates with each other over multi-hop links is called as an Ad-hoc Network (MANET). The military battle-field scenarios, Post-disaster rescue efforts, sensor networks, and entrepreneurs in a conference are some of the examples of mobile ad-hoc networks. Since there is no infrastructure in the network, the routing should be handled at every node. To improve the life time of network different routing protocols are consider. In present routing protocols of ad hoc networks, routing is an act of moving information from a source to destination in an internetwork. Route is selected in the route discovery phase until all the packets are sent out. Due to the continuous flow of packets in a selected route leads to the route failure. In order to reduce this problem we consider PRD-based MMBCR and considering the percentage of the optimum value for periodic route discovery. In our research we are going to analyze the performance of different routing protocols like DSR, MMBCR to get maximum optimum value using Network Simulator Software.
MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRMIOSR Journals
This document proposes a modification to the Dynamic Source Routing (DSR) protocol called Modified DSR (MDSR) to reduce routing overhead caused by frequent link breakages in mobile ad hoc networks. MDSR adds a link breakage prediction algorithm that uses signal strength measurements to predict when a link may break. Intermediate nodes monitor signal strength and warn the source node if a link may soon break. This allows the source to proactively rebuild the route or switch to a backup route to avoid disconnection. Simulation results showed MDSR can reduce the number of dropped packets by at least 25% compared to standard DSR. The document also discusses how DSR works and the proposed proactive route maintenance concept in M
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
Xtc a practical topology control algorithm for ad hoc networks (synopsis)Mumbai Academisc
The XTC algorithm is a simple and scalable topology control algorithm for wireless ad-hoc networks that does not require knowledge of node positions or a unit disk graph. It operates in three steps: (1) each node orders its neighbors by link quality, (2) nodes exchange these rankings, and (3) each node independently selects its neighbors in the topology based on the exchanged rankings. The resulting topology is proven to be symmetric, connected, and low degree while remaining energy-efficient for communication. The algorithm is implemented and simulated in a scalable wireless network simulation using the XTC topology control method.
Architecture and Evaluation on Cooperative Caching In Wireless P2PIOSR Journals
The document summarizes research on cooperative caching in wireless peer-to-peer (P2P) networks. It proposes using an asymmetric cooperative caching approach with Dynamic Source Routing (DSR) to improve performance. DSR routing is chosen over AODV routing because it supports one-way links and source routing. The key aspects of the proposed approach are:
1) Data requests follow the normal routing path but data responses can follow a different path if intermediate nodes need to cache the data. This reduces overhead.
2) Only nodes that need to cache data receive the full data, others just get the routing layer, minimizing copying overhead.
3) Route discovery in DSR works by broadcasting route requests
Research Inventy : International Journal of Engineering and Science is publis...researchinventy
This document summarizes a case study on mapping the water supply and sewage networks in Madurai, India using remote sensing and GIS techniques. Land use/land cover mapping of Madurai was conducted using satellite imagery to identify existing development patterns. The sewage and water distribution networks were then digitized and overlaid on the land use/land cover map. The study found deficiencies in water supply coverage, treatment capacity, and network infrastructure. Remote sensing and GIS provided a method to analyze urban growth and identify needs to improve water and sewage systems according to population increases.
The document provides instructions for using the BCF Board Portal, including how to log in, view shared documents sorted into collections, edit documents by clicking on titles, create new documents by selecting "create new" and start typing, and share documents by clicking "share" and choosing who to share with. Questions can be addressed by visiting the support website.
Research Inventy : International Journal of Engineering and Science is publis...researchinventy
This document summarizes research on characterizing the electrical properties of AlGaN/GaN modulation-doped field-effect transistors (MODFETs). Key findings include:
- A threshold voltage of -3.87V, maximum saturation current of 122.748 mA, and transconductance values were achieved.
- Dependence of two-dimensional electron gas density at the interface on Al mole fraction and AlGaN barrier layer thickness was presented.
- A novel method for studying AlGaN/GaN interface properties by solving the Schrodinger and Poisson equations self-consistently using finite difference methods was developed. This allows calculating electron distributions, energy band structures, and other characteristics of
Research Inventy : International Journal of Engineering and Science is publis...researchinventy
The document analyzes the effect of electrostatic discharge (ESD) on digital data in a digital switching circuit. Indirect ESD was conducted in both horizontal and vertical coupling planes. Results show that data is affected based on where the ESD pulse occurs and coupling plane. Discharge in the vertical plane affects data more. Smaller coupling capacitors make the circuit more susceptible to ESD.
This document summarizes and compares three routing protocols for mobile ad hoc networks (MANETs): AODV, DSR, and DSDV. It describes that MANETs are infrastructureless wireless networks without centralized administration. Routing in MANETs is complex due to frequent changes in network topology as nodes move. The document then provides an overview of AODV as a reactive routing protocol that establishes routes on demand, DSR as another reactive source-initiated protocol using source routing, and DSDV as a proactive table-driven protocol that maintains routing tables. It notes that AODV routing messages require little processing to minimize overhead and allows quick reaction to link breaks.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of the architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
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.
Active path updation for layered routing (apular) in wirelessAlexander Decker
1) The document proposes an Active Path Updation procedure (APULAR) for layered routing in wireless mesh networks to quickly update broken paths and reduce packet loss.
2) In APULAR, the destination node takes responsibility for local repair restoration instead of the source node initiating a new path discovery when a link breaks, as is typically done.
3) The procedure is simulated and shown to outperform AODV and IWMRA routing protocols, achieving better packet delivery ratio, lower control overhead, higher throughput, and lower end-to-end delay.
A comparative study in wireless sensor networksijwmn
This document summarizes and compares several routing algorithms proposed for wireless sensor networks. It discusses algorithms that aim to improve reliability, power efficiency, lifetime, and fault tolerance. The evaluation section compares how each algorithm addresses challenges like reliability, energy conservation, and adapting to topology changes. While various algorithms achieve improvements in areas like power efficiency and lifetime, most still have limitations and do not fully address all the key challenges for wireless sensor networks.
The document summarizes an Efficient Position-Based Opportunistic Routing (EPOR) protocol proposed for mobile ad hoc networks. EPOR takes advantage of geographic routing and the broadcast nature of wireless transmissions. When a packet is transmitted, overhearing nodes can act as forwarding candidates. The best forwarder is chosen, but if it fails to forward in time, a suboptimal candidate will forward instead to avoid transmission interruptions. Simulation results show EPOR achieves higher packet delivery ratios and lower end-to-end delays than GPSR and AOMDV routing protocols, even under high node 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
Comparative and Behavioral Study on VANET Routing ProtocolsIOSR Journals
This document provides a summary and comparison of various routing protocols for vehicular ad hoc networks (VANETs). It discusses topology-based protocols like CGSR and DSDV, reactive protocols like DSR, and position-based protocols like GSR, A-STAR, GPCR, VADD, CAR, DIR, and B-MFR. The position-based protocols are considered the best for handling issues in VANETs like packet delay, traffic congestion, and throughput. The paper analyzes the characteristics and behaviors of different VANET routing protocols and concludes that position-based protocols are most suitable for the dynamic environment of vehicular networks.
SURVEY AND TAXONOMY OF UNICAST ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKSgraphhoc
The purpose of this paper is to survey the unicast routing protocols for mobile ad hoc networks
(MANETs) and study their primary route selection principle. In this context, we did an exhaustive survey
of unicast MANET routing protocols proposed in the literature. Qualitatively, based on their primary
route selection principle, we show that all these protocols could be placed under one of two broad route
selection categories: routing based on minimum-weight path and routing based on stability. In addition
to the primary route selection principle, we also identify the underlying routing metric and the routing
philosophy (proactive, reactive, flat, hierarchical, location-awareness, power-sensitiveness and multipath
capability) adopted by the different routing protocols. We believe the survey can be a great source of
information for researchers in ad hoc networks.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Novel Routing Protocol Based on Periodic Route Discovery for Mobile Adhoc Net...IJERA Editor
A group of mobile devices called as nodes, without any centralized network, communicates with each other over multi-hop links is called as an Ad-hoc Network (MANET). The military battle-field scenarios, Post-disaster rescue efforts, sensor networks, and entrepreneurs in a conference are some of the examples of mobile ad-hoc networks. Since there is no infrastructure in the network, the routing should be handled at every node. To improve the life time of network different routing protocols are consider. In present routing protocols of ad hoc networks, routing is an act of moving information from a source to destination in an internetwork. Route is selected in the route discovery phase until all the packets are sent out. Due to the continuous flow of packets in a selected route leads to the route failure. In order to reduce this problem we consider PRD-based MMBCR and considering the percentage of the optimum value for periodic route discovery. In our research we are going to analyze the performance of different routing protocols like DSR, MMBCR to get maximum optimum value using Network Simulator Software.
MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRMIOSR Journals
This document proposes a modification to the Dynamic Source Routing (DSR) protocol called Modified DSR (MDSR) to reduce routing overhead caused by frequent link breakages in mobile ad hoc networks. MDSR adds a link breakage prediction algorithm that uses signal strength measurements to predict when a link may break. Intermediate nodes monitor signal strength and warn the source node if a link may soon break. This allows the source to proactively rebuild the route or switch to a backup route to avoid disconnection. Simulation results showed MDSR can reduce the number of dropped packets by at least 25% compared to standard DSR. The document also discusses how DSR works and the proposed proactive route maintenance concept in M
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
Xtc a practical topology control algorithm for ad hoc networks (synopsis)Mumbai Academisc
The XTC algorithm is a simple and scalable topology control algorithm for wireless ad-hoc networks that does not require knowledge of node positions or a unit disk graph. It operates in three steps: (1) each node orders its neighbors by link quality, (2) nodes exchange these rankings, and (3) each node independently selects its neighbors in the topology based on the exchanged rankings. The resulting topology is proven to be symmetric, connected, and low degree while remaining energy-efficient for communication. The algorithm is implemented and simulated in a scalable wireless network simulation using the XTC topology control method.
Architecture and Evaluation on Cooperative Caching In Wireless P2PIOSR Journals
The document summarizes research on cooperative caching in wireless peer-to-peer (P2P) networks. It proposes using an asymmetric cooperative caching approach with Dynamic Source Routing (DSR) to improve performance. DSR routing is chosen over AODV routing because it supports one-way links and source routing. The key aspects of the proposed approach are:
1) Data requests follow the normal routing path but data responses can follow a different path if intermediate nodes need to cache the data. This reduces overhead.
2) Only nodes that need to cache data receive the full data, others just get the routing layer, minimizing copying overhead.
3) Route discovery in DSR works by broadcasting route requests
Research Inventy : International Journal of Engineering and Science is publis...researchinventy
This document summarizes a case study on mapping the water supply and sewage networks in Madurai, India using remote sensing and GIS techniques. Land use/land cover mapping of Madurai was conducted using satellite imagery to identify existing development patterns. The sewage and water distribution networks were then digitized and overlaid on the land use/land cover map. The study found deficiencies in water supply coverage, treatment capacity, and network infrastructure. Remote sensing and GIS provided a method to analyze urban growth and identify needs to improve water and sewage systems according to population increases.
The document provides instructions for using the BCF Board Portal, including how to log in, view shared documents sorted into collections, edit documents by clicking on titles, create new documents by selecting "create new" and start typing, and share documents by clicking "share" and choosing who to share with. Questions can be addressed by visiting the support website.
Research Inventy : International Journal of Engineering and Science is publis...researchinventy
This document summarizes research on characterizing the electrical properties of AlGaN/GaN modulation-doped field-effect transistors (MODFETs). Key findings include:
- A threshold voltage of -3.87V, maximum saturation current of 122.748 mA, and transconductance values were achieved.
- Dependence of two-dimensional electron gas density at the interface on Al mole fraction and AlGaN barrier layer thickness was presented.
- A novel method for studying AlGaN/GaN interface properties by solving the Schrodinger and Poisson equations self-consistently using finite difference methods was developed. This allows calculating electron distributions, energy band structures, and other characteristics of
Research Inventy : International Journal of Engineering and Science is publis...researchinventy
The document analyzes the effect of electrostatic discharge (ESD) on digital data in a digital switching circuit. Indirect ESD was conducted in both horizontal and vertical coupling planes. Results show that data is affected based on where the ESD pulse occurs and coupling plane. Discharge in the vertical plane affects data more. Smaller coupling capacitors make the circuit more susceptible to ESD.
International informational portal, which includes an interactive online newspaper, blogosphere and bulletin board.
Portal is comfortable for multilingual people. There is the possibility to publish articles with translation on different languages.
Research Inventy : International Journal of Engineering and Science is publis...researchinventy
This document describes a system for controlling the speed of an AC motor remotely using a mobile phone and DTMF signaling. An embedded controller is used along with a DTMF decoder to receive digit tones from the mobile phone and control the speed of the motor. The system allows the motor to be turned on/off and its speed varied by pressing buttons on the mobile phone. The document discusses the components used, including the DTMF decoder, embedded controller, motor control circuitry, and an LCD display to show the motor status. It provides block diagrams of the system and descriptions of how it operates to remotely control the AC motor speed via DTMF tones sent from a mobile phone.
A new parameter proposed for route selection in routing protocolIAEME Publication
This document proposes a new parameter called Route Selection Parameter (RSP) to improve quality of service in mobile ad hoc network routing. RSP is calculated for each node based on its packet forwarding ratio, mobility, bandwidth, and number of neighbors. The best route is selected as the one with the maximum total RSP value. Conventional routing protocols like AODV and DSR usually use hop count as the only metric, but RSP aims to provide a more comprehensive metric based on multiple node characteristics. The document outlines the RSP calculation and discusses how it could be used to select routes, then lists some quantitative performance metrics for evaluating routing protocols.
An Overview of Mobile Ad hoc Network: Application, Challenges and Comparison ...IOSR Journals
This document provides an overview of mobile ad hoc networks (MANETs), including their applications, challenges, and comparisons of routing protocols. It discusses how MANETs are self-configuring networks of mobile nodes that communicate wirelessly without centralized administration. The document outlines several applications of MANETs, technological challenges in areas like routing, security, and power consumption. It also classifies and compares several popular routing protocols for MANETs like DSDV, AODV, DSR, evaluating them based on parameters like route selection method, topology structure, and ability to avoid loops.
1. The document proposes a wireless sensor network architecture for remote health monitoring of assisted living residents.
2. Sensors embedded in the body and environment continuously monitor vital signs and environmental conditions. Data is transmitted to a central database for access by caregivers.
3. An experimental smart home has been set up with motion, temperature, and other sensors communicating over a wireless network to a central computer. Preliminary results found no false detections over one week.
The document discusses infrastructure-less wireless networks. It provides an overview of relevant literature, motivations for infrastructure-less networks when infrastructure is unavailable or limited, and examples of multi-hop wireless network applications including ad-hoc and sensor networks. It also introduces popular models for representing wireless networks as graphs and discusses issues like broadcasting, mobility models, data gathering, time synchronization, and routing protocols.
WARM WELCOME FROM HCL VELACHERY…….
HCL Learning is part of HCL Info Systems Ltd, India’s Premier information enabling company with an annual turnover of 15000 crores Leveraging on the 34 years of industry experience of HCL, with an objective to develop quality IT professionals to meet this ever expanding requirement of Hardware Networking and Software professionals for the IT sector, HCL has launched HCL Career Development Centre.
For any clarification,
contact Person
Mr.Senthilvel.S
9382207007
HCL Velachery -42
College Projects, Be Projects, B Tech Projects, Me Projects, M Tech Projects,...ncct
final Year Projects, Final Year Projects in Chennai, Software Projects, Embedded Projects, Microcontrollers Projects, DSP Projects, VLSI Projects, Matlab Projects, Java Projects, .NET Projects, IEEE Projects, IEEE 2009 Projects, IEEE 2009 Projects, Software, IEEE 2009 Projects, Embedded, Software IEEE 2009 Projects, Embedded IEEE 2009 Projects, Final Year Project Titles, Final Year Project Reports, Final Year Project Review, Robotics Projects, Mechanical Projects, Electrical Projects, Power Electronics Projects, Power System Projects, Model Projects, Java Projects, J2EE Projects, Engineering Projects, Student Projects, Engineering College Projects, MCA Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, Wireless Networks Projects, Network Security Projects, Networking Projects, final year projects, ieee projects, student projects, college projects, ieee projects in chennai, java projects, software ieee projects, embedded ieee projects, "ieee2009projects", "final year projects", "ieee projects", "Engineering Projects", "Final Year Projects in Chennai", "Final year Projects at Chennai", Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, Final Year Java Projects, Final Year ASP.NET Projects, Final Year VB.NET Projects, Final Year C# Projects, Final Year Visual C++ Projects, Final Year Matlab Projects, Final Year NS2 Projects, Final Year C Projects, Final Year Microcontroller Projects, Final Year ATMEL Projects, Final Year PIC Projects, Final Year ARM Projects, Final Year DSP Projects, Final Year VLSI Projects, Final Year FPGA Projects, Final Year CPLD Projects, Final Year Power Electronics Projects, Final Year Electrical Projects, Final Year Robotics Projects, Final Year Solor Projects, Final Year MEMS Projects, Final Year J2EE Projects, Final Year J2ME Projects, Final Year AJAX Projects, Final Year Structs Projects, Final Year EJB Projects, Final Year Real Time Projects, Final Year Live Projects, Final Year Student Projects, Final Year Engineering Projects, Final Year MCA Projects, Final Year MBA Projects, Final Year College Projects, Final Year BE Projects, Final Year BTech Projects, Final Year ME Projects, Final Year MTech Projects, Final Year M.Sc Projects, IEEE Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, IEEE 2009 Java Projects, IEEE 2009 ASP.NET Projects, IEEE 2009 VB.NET Projects, IEEE 2009 C# Projects, IEEE 2009 Visual C++ Projects, IEEE 2009 Matlab Projects, IEEE 2009 NS2 Projects, IEEE 2009 C Projects, IEEE 2009 Microcontroller Projects, IEEE 2009 ATMEL Projects, IEEE 2009 PIC Projects, IEEE 2009 ARM Projects, IEEE 2009 DSP Projects, IEEE 2009 VLSI Projects, IEEE 2009 FPGA Projects, IEEE 2009 CPLD Projects, IEEE 2009 Power Electronics Projects, IEEE 2009 Electrical Projects, IEEE 2009 Robotics Projects, IEEE 2009 Solor Projects, IEEE 2009 MEMS Projects, IEEE 2009 J2EE P
Information Density Estimation in Wireless Ad Hoc Networks Based on Caching ...IOSR Journals
This document discusses information density estimation strategies in wireless ad hoc networks based on caching. It proposes a caching framework called Hamlet that aims to create content diversity within a node's neighborhood. Hamlet is evaluated through simulations in different scenarios, like a network of vehicles or portable devices. The results show that Hamlet outperforms alternative caching strategies by more uniformly distributing content across caches, improving information survival rates and the ratio of solved queries especially as the number of information items or request rates increase. Hamlet is effective for both large and small cache sizes by devising adaptive caching drop times or content replacement strategies respectively.
final Year Projects, Final Year Projects in Chennai, Software Projects, Embedded Projects, Microcontrollers Projects, DSP Projects, VLSI Projects, Matlab Projects, Java Projects, .NET Projects, IEEE Projects, IEEE 2009 Projects, IEEE 2009 Projects, Software, IEEE 2009 Projects, Embedded, Software IEEE 2009 Projects, Embedded IEEE 2009 Projects, Final Year Project Titles, Final Year Project Reports, Final Year Project Review, Robotics Projects, Mechanical Projects, Electrical Projects, Power Electronics Projects, Power System Projects, Model Projects, Java Projects, J2EE Projects, Engineering Projects, Student Projects, Engineering College Projects, MCA Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, Wireless Networks Projects, Network Security Projects, Networking Projects, final year projects, ieee projects, student projects, college projects, ieee projects in chennai, java projects, software ieee projects, embedded ieee projects, "ieee2009projects", "final year projects", "ieee projects", "Engineering Projects", "Final Year Projects in Chennai", "Final year Projects at Chennai", Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, Final Year Java Projects, Final Year ASP.NET Projects, Final Year VB.NET Projects, Final Year C# Projects, Final Year Visual C++ Projects, Final Year Matlab Projects, Final Year NS2 Projects, Final Year C Projects, Final Year Microcontroller Projects, Final Year ATMEL Projects, Final Year PIC Projects, Final Year ARM Projects, Final Year DSP Projects, Final Year VLSI Projects, Final Year FPGA Projects, Final Year CPLD Projects, Final Year Power Electronics Projects, Final Year Electrical Projects, Final Year Robotics Projects, Final Year Solor Projects, Final Year MEMS Projects, Final Year J2EE Projects, Final Year J2ME Projects, Final Year AJAX Projects, Final Year Structs Projects, Final Year EJB Projects, Final Year Real Time Projects, Final Year Live Projects, Final Year Student Projects, Final Year Engineering Projects, Final Year MCA Projects, Final Year MBA Projects, Final Year College Projects, Final Year BE Projects, Final Year BTech Projects, Final Year ME Projects, Final Year MTech Projects, Final Year M.Sc Projects, IEEE Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, IEEE 2009 Java Projects, IEEE 2009 ASP.NET Projects, IEEE 2009 VB.NET Projects, IEEE 2009 C# Projects, IEEE 2009 Visual C++ Projects, IEEE 2009 Matlab Projects, IEEE 2009 NS2 Projects, IEEE 2009 C Projects, IEEE 2009 Microcontroller Projects, IEEE 2009 ATMEL Projects, IEEE 2009 PIC Projects, IEEE 2009 ARM Projects, IEEE 2009 DSP Projects, IEEE 2009 VLSI Projects, IEEE 2009 FPGA Projects, IEEE 2009 CPLD Projects, IEEE 2009 Power Electronics Projects, IEEE 2009 Electrical Projects, IEEE 2009 Robotics Projects, IEEE 2009 Solor Projects, IEEE 2009 MEMS Projects, IEEE 2009 J2EE P
final Year Projects, Final Year Projects in Chennai, Software Projects, Embedded Projects, Microcontrollers Projects, DSP Projects, VLSI Projects, Matlab Projects, Java Projects, .NET Projects, IEEE Projects, IEEE 2009 Projects, IEEE 2009 Projects, Software, IEEE 2009 Projects, Embedded, Software IEEE 2009 Projects, Embedded IEEE 2009 Projects, Final Year Project Titles, Final Year Project Reports, Final Year Project Review, Robotics Projects, Mechanical Projects, Electrical Projects, Power Electronics Projects, Power System Projects, Model Projects, Java Projects, J2EE Projects, Engineering Projects, Student Projects, Engineering College Projects, MCA Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, Wireless Networks Projects, Network Security Projects, Networking Projects, final year projects, ieee projects, student projects, college projects, ieee projects in chennai, java projects, software ieee projects, embedded ieee projects, "ieee2009projects", "final year projects", "ieee projects", "Engineering Projects", "Final Year Projects in Chennai", "Final year Projects at Chennai", Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, Final Year Java Projects, Final Year ASP.NET Projects, Final Year VB.NET Projects, Final Year C# Projects, Final Year Visual C++ Projects, Final Year Matlab Projects, Final Year NS2 Projects, Final Year C Projects, Final Year Microcontroller Projects, Final Year ATMEL Projects, Final Year PIC Projects, Final Year ARM Projects, Final Year DSP Projects, Final Year VLSI Projects, Final Year FPGA Projects, Final Year CPLD Projects, Final Year Power Electronics Projects, Final Year Electrical Projects, Final Year Robotics Projects, Final Year Solor Projects, Final Year MEMS Projects, Final Year J2EE Projects, Final Year J2ME Projects, Final Year AJAX Projects, Final Year Structs Projects, Final Year EJB Projects, Final Year Real Time Projects, Final Year Live Projects, Final Year Student Projects, Final Year Engineering Projects, Final Year MCA Projects, Final Year MBA Projects, Final Year College Projects, Final Year BE Projects, Final Year BTech Projects, Final Year ME Projects, Final Year MTech Projects, Final Year M.Sc Projects, IEEE Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, IEEE 2009 Java Projects, IEEE 2009 ASP.NET Projects, IEEE 2009 VB.NET Projects, IEEE 2009 C# Projects, IEEE 2009 Visual C++ Projects, IEEE 2009 Matlab Projects, IEEE 2009 NS2 Projects, IEEE 2009 C Projects, IEEE 2009 Microcontroller Projects, IEEE 2009 ATMEL Projects, IEEE 2009 PIC Projects, IEEE 2009 ARM Projects, IEEE 2009 DSP Projects, IEEE 2009 VLSI Projects, IEEE 2009 FPGA Projects, IEEE 2009 CPLD Projects, IEEE 2009 Power Electronics Projects, IEEE 2009 Electrical Projects, IEEE 2009 Robotics Projects, IEEE 2009 Solor Projects, IEEE 2009 MEMS Projects, IEEE 2009 J2EE P
Software Projects A Sp.Net Projects Ieee Projects Domainsncct
final Year Projects, Final Year Projects in Chennai, Software Projects, Embedded Projects, Microcontrollers Projects, DSP Projects, VLSI Projects, Matlab Projects, Java Projects, .NET Projects, IEEE Projects, IEEE 2009 Projects, IEEE 2009 Projects, Software, IEEE 2009 Projects, Embedded, Software IEEE 2009 Projects, Embedded IEEE 2009 Projects, Final Year Project Titles, Final Year Project Reports, Final Year Project Review, Robotics Projects, Mechanical Projects, Electrical Projects, Power Electronics Projects, Power System Projects, Model Projects, Java Projects, J2EE Projects, Engineering Projects, Student Projects, Engineering College Projects, MCA Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, Wireless Networks Projects, Network Security Projects, Networking Projects, final year projects, ieee projects, student projects, college projects, ieee projects in chennai, java projects, software ieee projects, embedded ieee projects, "ieee2009projects", "final year projects", "ieee projects", "Engineering Projects", "Final Year Projects in Chennai", "Final year Projects at Chennai", Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, Final Year Java Projects, Final Year ASP.NET Projects, Final Year VB.NET Projects, Final Year C# Projects, Final Year Visual C++ Projects, Final Year Matlab Projects, Final Year NS2 Projects, Final Year C Projects, Final Year Microcontroller Projects, Final Year ATMEL Projects, Final Year PIC Projects, Final Year ARM Projects, Final Year DSP Projects, Final Year VLSI Projects, Final Year FPGA Projects, Final Year CPLD Projects, Final Year Power Electronics Projects, Final Year Electrical Projects, Final Year Robotics Projects, Final Year Solor Projects, Final Year MEMS Projects, Final Year J2EE Projects, Final Year J2ME Projects, Final Year AJAX Projects, Final Year Structs Projects, Final Year EJB Projects, Final Year Real Time Projects, Final Year Live Projects, Final Year Student Projects, Final Year Engineering Projects, Final Year MCA Projects, Final Year MBA Projects, Final Year College Projects, Final Year BE Projects, Final Year BTech Projects, Final Year ME Projects, Final Year MTech Projects, Final Year M.Sc Projects, IEEE Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, IEEE 2009 Java Projects, IEEE 2009 ASP.NET Projects, IEEE 2009 VB.NET Projects, IEEE 2009 C# Projects, IEEE 2009 Visual C++ Projects, IEEE 2009 Matlab Projects, IEEE 2009 NS2 Projects, IEEE 2009 C Projects, IEEE 2009 Microcontroller Projects, IEEE 2009 ATMEL Projects, IEEE 2009 PIC Projects, IEEE 2009 ARM Projects, IEEE 2009 DSP Projects, IEEE 2009 VLSI Projects, IEEE 2009 FPGA Projects, IEEE 2009 CPLD Projects, IEEE 2009 Power Electronics Projects, IEEE 2009 Electrical Projects, IEEE 2009 Robotics Projects, IEEE 2009 Solor Projects, IEEE 2009 MEMS Projects, IEEE 2009 J2EE P
final Year Projects, Final Year Projects in Chennai, Software Projects, Embedded Projects, Microcontrollers Projects, DSP Projects, VLSI Projects, Matlab Projects, Java Projects, .NET Projects, IEEE Projects, IEEE 2009 Projects, IEEE 2009 Projects, Software, IEEE 2009 Projects, Embedded, Software IEEE 2009 Projects, Embedded IEEE 2009 Projects, Final Year Project Titles, Final Year Project Reports, Final Year Project Review, Robotics Projects, Mechanical Projects, Electrical Projects, Power Electronics Projects, Power System Projects, Model Projects, Java Projects, J2EE Projects, Engineering Projects, Student Projects, Engineering College Projects, MCA Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, Wireless Networks Projects, Network Security Projects, Networking Projects, final year projects, ieee projects, student projects, college projects, ieee projects in chennai, java projects, software ieee projects, embedded ieee projects, "ieee2009projects", "final year projects", "ieee projects", "Engineering Projects", "Final Year Projects in Chennai", "Final year Projects at Chennai", Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, Final Year Java Projects, Final Year ASP.NET Projects, Final Year VB.NET Projects, Final Year C# Projects, Final Year Visual C++ Projects, Final Year Matlab Projects, Final Year NS2 Projects, Final Year C Projects, Final Year Microcontroller Projects, Final Year ATMEL Projects, Final Year PIC Projects, Final Year ARM Projects, Final Year DSP Projects, Final Year VLSI Projects, Final Year FPGA Projects, Final Year CPLD Projects, Final Year Power Electronics Projects, Final Year Electrical Projects, Final Year Robotics Projects, Final Year Solor Projects, Final Year MEMS Projects, Final Year J2EE Projects, Final Year J2ME Projects, Final Year AJAX Projects, Final Year Structs Projects, Final Year EJB Projects, Final Year Real Time Projects, Final Year Live Projects, Final Year Student Projects, Final Year Engineering Projects, Final Year MCA Projects, Final Year MBA Projects, Final Year College Projects, Final Year BE Projects, Final Year BTech Projects, Final Year ME Projects, Final Year MTech Projects, Final Year M.Sc Projects, IEEE Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, IEEE 2009 Java Projects, IEEE 2009 ASP.NET Projects, IEEE 2009 VB.NET Projects, IEEE 2009 C# Projects, IEEE 2009 Visual C++ Projects, IEEE 2009 Matlab Projects, IEEE 2009 NS2 Projects, IEEE 2009 C Projects, IEEE 2009 Microcontroller Projects, IEEE 2009 ATMEL Projects, IEEE 2009 PIC Projects, IEEE 2009 ARM Projects, IEEE 2009 DSP Projects, IEEE 2009 VLSI Projects, IEEE 2009 FPGA Projects, IEEE 2009 CPLD Projects, IEEE 2009 Power Electronics Projects, IEEE 2009 Electrical Projects, IEEE 2009 Robotics Projects, IEEE 2009 Solor Projects, IEEE 2009 MEMS Projects, IEEE 2009 J2EE P
Similar to Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year.
Multipath Fault Tolerant Routing Protocol in MANET pijans
Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically
exchange data among themselves without the reliance on a fixed base station or a wired backbone network
and it the makes the routing a crucial issue to the design of the MANET. Multiple path routing protocols
are shown to be performance-effective alternatives over single-path routing for ad hoc networks and it
represents a promising routing method for wireless mobile ad hoc networks. Multi-path routing achieves
load balancing and is more resilient to route failures..In this paper we propose an energy efficient
multipath fault tolerant routing protocol to improve the reliability of data routing in Mobile ad hoc
networks. The proposed RFTA is a multi objective routing protocol that meets diverse application
requirements by considering the changing conditions of the network. The efficiency of the proposed
protocol has been evaluated on different scenarios and there has been a noticeable improvement in the
packet delivery ratio and also in the reduction of end-to-end delay comparing to SMR,SMS and MDSR.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
Improved AODV based on Load and Delay for Route Discovery in MANETIOSR Journals
This document proposes an improved AODV routing protocol for mobile ad hoc networks (MANETs) that considers both node load and routing delay when selecting routes. It calculates a "route weight" based on the average load and delay of the nodes along each potential path from source to destination. The path with the lowest route weight is then selected for routing to help balance traffic loads across the network and minimize delays. Simulation results showed this approach can dynamically balance traffic allocation between paths and optimize resource utilization in the MANET.
Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANETijsrd.com
It is a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc networks. The existing work presented two self-adaptive on-demand geographic routing schemes to build efficient paths based on the needs of user applications and adapt to various scenarios for provide efficient and reliable routing. To overcome the impact due to inaccurate local topology knowledge, the topology information is updated at a node in the specific time periods. The on-demand routing mechanism reduces to control overhead made on geographic routing. The route optimization scheme adapts routing path according to the topology changes and actual data traffic requirements. Adaptive parameter setting scheme is introduced to allow each node to determine and adjust the protocol parameter values independently. However, existing work did not address resource parameters such as energy, bandwidth and data loss. The proposal presents and Integrated Resource Adaptive on Demand Geographic Routing (IRA-ODGR) for MANET. The node energy resource is optimized with path energy consumption rate and bandwidth utilization of the path is analysed. Loss rate is reduced in geographic routing with dynamic routes. The simulation conducted to demonstrate IRA-ODGR routing protocols.
Study of Attacks and Routing Protocol in Wireless Networkijsrd.com
Wireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (1) proactive, (2) reactive, and (3) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in WMN is mobile but it can fluctuate between being mobile. Wireless mesh networks is an emergent research area, which is becoming important due to the growing amount of nodes in a network.
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.
QoS Issues in MANET: A Comparative Study over Different Routing Protocolsrahulmonikasharma
MANETs are composed of autonomous nodes that are self-managed without any existing of infrastructure and centralized administration. Therefore, each node operates not only as an end system but also as a router to forward packets for other nodes. For these reasons, the network has a dynamic topology, so nodes can easily join or leave the network at any time. Routing information differentiates these networks from other ad-hoc networks. The study of QoS issues in Mobile Ad-hoc Network is done by simulation in MATLAB that can help in better understanding of the behavior of various routing protocols. This paper is intended to compare QoS parameters of various routing protocols.
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.
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such Networks are frequently limited by the network split due to either energy depletion or node mobility of the mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric system of measurement used to select the paths takes into account the stability of the nodes and the equivalent links.
Performance study of adhoc routing protocols for cbr trafficeSAT Journals
Abstract Mobile ad hoc network (MANET) is a dynamic network without fixed infrastructure due to their wireless nature and can be deployed as multi-hop packet networks. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. A Reactive (on-demand) routing strategy is a popular routing category for wireless adhoc routing. The primary objective of this paper is to do comparative study of the performance of routing protocols Destination-Sequenced Distance-Vector (DSDV), Dynamic Source Routing (DSR) and Ad-hoc on demand Distance Vector (AODV) for wireless ad hoc networks in a simulated environment against varying network parameters. The evaluations are done by means of simulations using NS-2 network simulator. The study was done on the basis of performance metrics: throughput, packet delivery function, end-to-end delay, routing overhead and packet lost. Simulation results show that despite in most simulations reactive routing protocols DSR and AODV performed significantly better than proactive routing protocol DSDV for the CBR based traffic. Keywords- component; Mobile Adhoc Network, Routing protocol, DSR, AODV, DSDV
International Journal of Research in Engineering and Science is an open access peer-reviewed international forum for scientists involved in research to publish quality and refereed papers. Papers reporting original research or experimentally proved review work are welcome. Papers for publication are selected through peer review to ensure originality, relevance, and readability.
Application independent based multicast routing protocols in mobile ad hoc ne...Alexander Decker
This document summarizes and compares several application-independent multicast routing protocols for mobile ad hoc networks (MANETs). It discusses the key challenges in designing multicast routing protocols for MANETs, including robustness, efficiency, control overhead, and dependency on unicast routing. It also presents a reference model architecture for multicast routing protocols and classifications based on topology (tree-based vs. mesh-based) and approach (reactive vs. proactive). Several specific multicast routing protocols are described, including AMRoute, AMRIS, and ODMRP, focusing on their mechanisms for group management, tree/mesh construction, and maintenance in dynamic network conditions.
This document summarizes a research paper on load balancing protocols in mobile ad hoc networks (MANETs). It begins with an abstract of the paper and introduces MANETs and the importance of load balancing in them given nodes' limited resources. It then discusses various load metrics and load balancing routing protocols. Specific protocols covered include Ad Hoc On-Demand Distance Vector (AODV), Ad hoc On-Demand Multipath Distance Vector (AOMDV), and Scalable Multipath On-Demand Routing (SMORT). AOMDV and SMORT aim to compute multiple loop-free paths during route discovery to help balance traffic load across multiple paths. The document concludes that load balanced routing protocols use different metrics to select routes
Load aware and load balancing using aomdv routing in manetijctet
1. The document discusses load aware and load balancing techniques using multipath routing in mobile ad hoc networks (MANETs).
2. It notes that effective load balancing is challenging in MANETs due to their dynamic nature and topology changes. Nodes can differ significantly in communication and processing capabilities.
3. The paper proposes identifying multiple routing backbones from source to destination using intermediate nodes with better capabilities, to improve load balancing, quality of service, and congestion control based on network traffic levels and node loads.
Comparative analysis of manet reactive protocolsprjpublications
This document summarizes and compares two reactive routing protocols for mobile ad hoc networks (MANETs): Ad Hoc On-Demand Distance Vector (AODV) routing and Dynamic Source Routing (DSR). It provides an overview of MANETs and discusses the characteristics of reactive routing protocols. It then describes the route discovery and maintenance processes of AODV and DSR. The document analyzes the advantages and disadvantages of each protocol and compares them based on factors like routing approach, performance at different mobility rates, and suitability for different network situations.
QUALITY OF SERVICE ROUTING IN MOBILE AD HOC NETWORKS USING LOCATION AND ENERG...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multi path protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
Quality of Service Routing in Mobile Ad Hoc Networks Using Location and Energ...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multipath protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
This document summarizes a research paper that compares the performance of three on-demand routing protocols (AODV, DSR, DYMO) in mobile ad hoc networks in terms of reliability, power consumption, and number of packets. The paper proposes augmenting the existing protocols to choose more reliable routes during route discovery by giving preference to nodes with high reliability, defined as nodes that forward route requests. It simulates the protocols using the QualNet simulator to evaluate metrics like hop counts, selected routes, route request packets, route reply packets, and energy consumed in transmit, receive, and idle modes. The goal is to form reliable routes that increase network lifetime and improve power utilization while decreasing packet loss.
Performance Evaluation and Comparison of On-Demand Routing Protocols for Ad H...Eswar Publications
Routing in mobile ad-hoc networks is an integral aspect of communication between devices. Routing is considered to
be a challenging task in MANETs due to the drastic and unpredictable changes in network topologies as a result of
the random and frequent movement of the nodes and due to the absence of any centralized control. Several routing protocols have been designed and developed to perform under various network environments. In this work a systematic simulation based performance study of the four prominent routing protocols: Ad hoc on Demand Multipath Routing Distance Vector (AOMDV), Dynamic Source Routing (DSR), Ad Hoc On Demand Distance Vector (AODV) and Temporarily Ordered Routing (TORA) protocols in the simulated networking environment under varying number of nodes in various scenarios is performed. These protocols use on-demand routing and have different protocol mechanisms leading to differences in performance. The performance is analyzed and evaluated based on end to end delay, packet delivery ratio, routing overheads and through-put done by varying network load, and the size of the network. Based on the observations, we make recommendations about the performance of the
protocols.
Survey of Reactive Routing Protocols for MANETIOSR Journals
Abstract : A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. The main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides a scalable solution to relatively large network topologies. The design follows the idea that each node tries to reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is needed. The performance differentials are analyzed using varying performance metrics. These simulations are carried out using the ns-2 network simulator. Keywords – AODV, DSR, MANET, NS-2, Reactive routing protocols, Survey.
Similar to Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. (20)
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year.
1. RESEARCH INVENTY: International Journal of Engineering and Science
ISBN: 2319-6483, ISSN: 2278-4721, Vol. 1, Issue 8 (November 2012), PP 42-48
www.researchinventy.com
Study on a Reliable and Effective Cache Management Technique
for DSR Protocol in Mobile Ad hoc Networks
1 2
Mrs.K.Santhi, Dr.M.Punithavalli,
Assistant Professor, Director-MCA,
Dept of Computer Science, Dept of Computer Application,
Sri Ramakrishna College of Arts Sri Ramakrishna Engineering College
of Arts and Science for Women, Coimbatore-22.
Coimbatore-44.
Abstract: Mobile ad hoc network is a special type of wireless network in wh ich a mobile nodes forming a
temporary network without the aid of any infrastructure or centralized ad min istration. This paper analysis about
improving the performance of route cache in Dynamic Source routing protocol. The Dynamic Source Routing
(DSR) for mob ile ad hoc networks maintains route cach es to store routes that have been found via flooding or
through promiscuous overhearing. But DSR route caches have the disadvantages like stale route cache entries,
incomp lete error notificat ion, and insufficient cache size etc. In this paper, they propose to develop a reliab le and
effective cache management technique for the DSR protocol. In this technique, initially, we estimate a combined
weighted function for each route stored in the cache. Then based on the combined weight function, the routes are
arranged such that routes with minimu m length and traffic load, maximu m energy level and freshness are listed first
in the route cache. The route cache is updated such that routes with least weight functions are removed from the list.
In the route prediction mechanism, when a link is likely to be broken, it will select the most reliable route as an
alternate route from the sorted route cache, before the link breakage. The DSR co mposed of two phases, namely
Route Discovery and Route maintenance, which work together to discover and maintain the source route fro m the
source to the arbitrary destination. Dynamic Source Routing (DSR) for mobile ad hoc networks maintains route
caches to store routes that have been found via discovery or through promiscuous overhearing . But DSR route
caches have the disadvantages like stale route cache entries, incomp lete error notification, and insufficient cache size
etc. So it affect the performance of DSR protocol which cause long delay, increase the packet loss, increase the
overhead, and decrease the performance of protocol. Thus it requires some mechanism to imp rove the route cache
performance in DSR protocol. This paper will discuss the different strategy of the route cache and the drawbacks of
the mechanism.
Keywords: DSR, Load Balance.
I. INTRODUCTION.
Mobile ad hoc network: Unlike trad itional network, mobile ad hoc network consist of mobile nodes which
can join or d isappear dynamically fro m the network.
A) Mobile Ad Hoc Network (MANET)
MANET is a unique type of wireless network in which a set of mobile network interfaces form a transient
network without the support of any well-known infrastructure or centralized management. So me of the applications
of Ad hoc wireless network include decision making in the battlefield, data ac quisition operations in hostile
environment, emergency search-and-rescue operations, etc. The characteristics of MANET include dynamic
topology, limited resources (such as CPU, battery, bandwidth, etc.), mult i-hop communicat ion and limited security.
These characteristics set special challenges in routing protocol design [1].
B). On Demand Routing Protocols
In the case of ad hoc networks, since all the nodes cooperate dynamically, the nodes which are not directly
connected within the transmission range can also communicates with other nodes for establishing, maintaining
routes and forwarding packets. When a sending node originates a data packet addressed to the destination node, an
on demand routing protocol searches for and attempts to determine a route to the destination node. An on-demand
routing protocol must cache routes formerly discovered, in order to avoid the need of performing a route discovery
42
2. Study on a Reliable and Effective Cache Management Technique for DSR Protocol in Mobile…
before each data packet is sent [2]. Several routing protocols have used on -demand mechanis ms including the
following
Ad hoc On-Demand Distance Vector Routing (AODV): Adhoc On Demand Distance Vector Routing is
a novel algorith m for the operation of adhoc networks. Each Mobile Host operates as a specialized router and routes
are obtained as needed (i.e.) on demand with little or no reliance on periodic advertisements [3].
Dynamic Source Routing (DSR): The Dynamic Source Routing protocol (DSR) is a simp le and efficient
routing protocol designed specifically fo r use in mult i-hop wireless ad hoc networks of mobile nodes. DSR allows
the network to be co mpletely self-organizing and self-configuring, without the need for any existing network
infrastructure or ad min istration. [4].
Temporally-Ordered Routing Algorithm (TORA): It uses a “physical or logical clock” to establish the
“temporal order” of topological change events which is used to structure the algorithm’s reaction to topological
changes. The protocol’s reaction is structured as a temporally -ordered sequence of diffusing computations; each
computation consisting of a sequence of directed link reversals. [5].
Location-Ai ded Routing (LAR): It utilizes location informat ion to improve performance of routing
protocols for ad hoc networks. By using location informat ion, Location-Aided Routing protocols limit the search for
a new route to a smaller “request zone” of the ad hoc network [6].
Destinati on Sequenced Distance Vector Routi ng (DSDV): It operates in each mobile host as a
specialized router, which periodically advertises its view of the interconnection topolog y with other Mobile Hosts
within the network [7].
Associati vity -Based Routing (ABR): It is a compro mise between broadcast and point-to-point routing.
ABR only maintain routes for sources that actually desire routes. However, ABR does not employ route re -
construction based on alternate route information [8].
Caching and Multi -Path Routing Protocol (CHAMP): It uses cooperative packet caching and shortest
mu lti-path routing to reduce packet loss due to frequent route breakdowns [9].
C). Caching.
To discover a route whenever required, DSR floods route requests. Because of the high cost of flooding, DSR
maintains route caches to accumulate routes that have been established by means of flooding or through
promiscuous overhearing [9]. In o rder to reduce the routin g overheads with improved route discovery latency, on -
demand routing protocols for mobile ad hoc networks make use of the route caching in different forms. They need to
adjust to frequent topology changes for the route caching to be effective [10].
Path Cache: In the case of path cache, a node stores each route including the route from itself to another node.
Link Cache: In the case of link cache, a node adds a lin k to a topology graph, which represents the node’s view
of the network topology [11].
Issues in Caching: DSR route caches have following disadvantages.
No measures have been taken by DSR, to avoid flooding for a route to a new destination. In order to get the
route, DSR has to flood route and accumulate it in route caches.
In case of high node mobility, entries in route caches rapidly become invalid or ineffective. Data packets suffer
needless delays, when an ineffective route is used. Route failures will generate flooding, creating supplementary
latency for data packets, when an invalid route is followed [9].
Stale routes will be rapidly propagated to caches of other nodes because of the use of responding to the route
REQ with cached routes. Hence, pre-active and post-active routes are the key sources of cache staleness [11].
Incomplete error notificati on: In case of lin k breakages, the routes having an access with the broken link are
not propagated to all caches. As an alternative, the route error is unicast merely to the source, whose data packet
is accountable for identifying the lin k breakage by means of a link layer feedback. Therefore only a limited
number of caches are cleaned. However the breakdown information is propagated by means of piggybacking it
onto the successive route requests fro m the source. Many caches possibly will remain uncle an as the route
requests may not be propagated network-wide because of the replies fro m caches.
Expiry: Presently there is no mechanism to expire stale routes. The stale cache entries will stay permanently in
the cache, if they are not cleaned explicitly by the error mechanis m.
43
3. Study on a Reliable and Effective Cache Management Technique for DSR Protocol in Mobile…
Quick pollution: There is no technique to resolve the freshness of any route information. For instance, even if a
route error remove the stale cache entry, the succeeding routed data packet carrying the same stale route can se t that
entry right back in. As there will be a large number of routed data packets upstream carry ing the stale route to un -
erase the route. The above possibility increases at high data rates. By the moderate use of snooping, this difficulty is
compounded. A few other node overhearing any transmission, pick the stale routes. Therefore, cache pollution can
transmit quite rapidly [10].
II. Related Works.
Sunsook Jung [1] et al., A novel approach to constrain route request broadcast which is based on node
caching. Intuition behind node caching is that the nodes involved in recent data packet forward ing have more
reliable information about its neighbors and have better locations (e.g., on the intersection of several data routs) than
other nodes. The caching nodes which are recently involved in data packet forwarding, and use only them to forward
route requests. Dropping route request forwarding fro m the other nodes considerably reduces routing overhead at the
expense of possible destination missing. The suggested nod e caching techniques can be also viewed as a dynamic
implementation of a connected dominating set (CDS). To overco me the known drawback of CDS – overuse of
dominating (cached) nodes – by a new load-balancing scheme. Their contributions include: (i) a new n ode caching
enhancement of route request broadcast for reactive ad hoc routing protocols; (ii) implementation of AODV-NC, the
node caching enhancement of AODV; (iii) an extensive simulation study of AODV-NC in NS-2 showing (for
stressed MANET’s) 10-fold reduction in overhead, significant improvement of the packet delivery ratio and the end -
to-end delay; (iv) an evaluation of routing load distribution among MANET nodes; and (v) an imp lementation and
simu lation study in NS-2 of forward ing load balancing for AODV-NC sustaining considerable improvement in
overhead and delivery rat io.
Soon Don Kwon [2] et al., An on-demand routing protocol for Mobile Ad hoc Network (MANET) is one
that searches for and tries to discover a route to some destination node only when a sending node generates a data
packet addressed to that node. In order to avoid the need for such a route discovery to be performed before each data
packet is sent, such routing protocols must cache previously discovered routes. But the cache itself may contain stale
informat ion due to nodes mobility. To solve the problem, a new route cache scheme is to improve the performance
of route cache for finding more accurate and faster route to the destination.
Davi d B. Johnson [4] et al, The DSR protocol is composed of the two mechanisms of Route Discovery
and Route Maintenance, which work together to allow nodes to discover and maintain source routes to arbitrary
destinations in the ad hoc network. The use of source routing allows packet routing to be trivially loop-free, avoids
the need for up-to-date routing information in the intermediate nodes through which packets are forwarded, and
allo ws nodes forwarding or overhearing packets to cache the routing information in them for their own future use.
All aspects of the protocol operate entirely on-demand, allo wing the routing packet overhead of DSR to scale
automatically to only that needed to react to changes in the routes currently in use. They have evaluated the
operation of DSR through detailed simulat ion on a variety of movement and communicat ion patterns, and through
implementation and significant experimentation in a physical outdoor ad hoc networking test bed and constructed in
Pittsburgh, and have demonstrated the excellent perfo rmance of the protocol.
Vincent D. Park [5] et al author present a new distributed routing protocol for mobile, mu ltihop, wireless
networks. The protocol is one of a family of protocols which we term “link reversal” algorith ms. The protocol’s
reaction is structured as a temporally-o rdered sequence of diffusing computations; each computation consisting of a
sequence of directed link reversals. The protocol is highly adaptive, efficient and scalable; being best -suited for use
in large, dense, mobile networks. In these networks, the protocol’s reaction to link failu res typically involves only a
localized “single pass” of the distributed algorithm. Th is capability is unique among protocols which are stable in
the face of network partitions, and results in the protocol’s high degree of adaptively. This desirable behavior is
achieved through the novel use of a “physical or logical clock” to establish the “temporal order” of topological
change events which is used to structure (or order) the algorithm’s reaction to topological changes. The y refer to the
protocol as the Temporally -Ordered Routing Algorithm (TORA).
44
4. Study on a Reliable and Effective Cache Management Technique for DSR Protocol in Mobile…
Young-B ae Ko [6] et al., this paper suggests an approach to utilize location information (for instance,
obtained using the global positioning system) to imp rove performance of routing protocols for ad hoc networks. By
using location informat ion, the proposed Location-Aided Routing (LA R) protocols limit the search for a new route
to a smaller “request zone” of the ad hoc network. This results in a significant reduction in the nu mber of routing
messages. They present two algorithms to determine the request zone, and also suggest potential optimizat ions to
our algorith ms.
Charles E. Perkins [7] et al.., In this paper author present an innovative design for the operation of such
ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, wh ich
periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This
amounts to a new sort of routing protocol. They have investigated modifications to the basic Bellman - Ford routing
mechanis ms, as specified by RIP to make it suitable for a dynamic and self-starting network mechanis m as is
required by users wishing to utilize adhoc networks. Their modificatio ns address some of the previous objections to
the use of Bellman-Fo rd, related to the poor looping properties of such algorithms in the face of broken lin ks and the
resulting time dependent nature of the interconnection topology describing the links betwee n the Mobile Hosts.
Finally, they describe the ways in which the basic network-layer routing can be modified to provide MAC-layer
support for ad-hoc networks.
Chai-Keong Toh [8 ] et al., in h is paper author presents a new, simp le and bandwidth -efficient distributed
routing protocol to support mobile co mputing in a conference size ad-hoc mobile network environ ment. Un like the
conventional approaches such as link-state and distance-vector distributed routing algorithms, our protocol does not
attempt to consistently maintain routing information in every node. In an ad-hoc mobile network where mob ile hosts
(MHs) are acting as routers and where routes are made inconsistent by MHs’ movement, they employ an
associativity-based routing scheme where a route is selected based on nodes having associativity states that imp ly
periods of stability. In this manner, the routes selected are likely to be long -lived and hence there is no need to
restart frequently, resulting in higher attainable throughput. Route requests are b roadcast on a per need basis. The
association property also allows the integration of ad-hoc routing into a BS-o riented Wireless LAN (W LAN)
environment, providing the fault tolerancein times of base stations (BSs) failu res. To discover shorter routes and to
shorten the route recovery time when the association property is violated, the localised -query and quick-abort
mechanis ms are respectively incorporated into the protocol. To further increase cell capacity and lower transmission
power requirements, a dynamic cell size adjustment scheme is introduced. The protocol is free from loops, deadlock
and packet duplicates and has scalable memory requirements. Simu lation results obtained reveal that shorter and
better routes can be discovered during route re-constructions.
Al vin Valera [9] et al., in this paper author proposes a new routing protocol called Caching and Multipath
(CHAMP) Routing Protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce
packet loss due to frequent route breakdowns. Simu lation results reveal that by using a five-packet data cache,
CHAMP exh ibits excellent imp rovement in packet delivery, outperforming AODV and DSR by at most 30% in
stressful scenarios. Furthermore, end-to-end delay is significantly reduced while routing overhead is lo wer at high
mobility rates.
Yi h-Chun Hu [10] et al.., In this paper author present a new mechanism which we call epoch numbers, to
reduce this problem o f cache staleness, by preventing the re-learn ing of stale knowledge of a link after having earlier
heard that the link has broken. Their scheme does not rely on ad hoc mechanis ms such as short -lived negative
caching; rather, they allow a node having heard both of a broken link and a discovery of the same link to sequence
the two events in order to determine whether the lin k break or the lin k discovery occurred before the other.
Shobha.K.R [11] et al., in this paper presents an analysis of the effect of intelligent caching in a non
clustered network, using on-demand routing protocols in wireless ad hoc networks. The analysis carried out is based
on the Dynamic Source Routing protocol (DSR), which operates entirely on -demand. DSR uses the cache in every
node to save the paths that are learnt during route discovery procedure. In this imp lementation, caching these paths
only at intermediate nodes and using the paths from these caches when required is tried. This technique helps in
storing more number of routes that are learnt without erasing the entries in the cache, to store a new route that is
learnt. The simu lation results on DSR have shown that this technique drastically increases the available memory for
45
5. Study on a Reliable and Effective Cache Management Technique for DSR Protocol in Mobile…
caching the routes discovered without affecting the performance of the DSR routing protocol in any way, except for
a small increase in end to end delay.
M.Neelakantappa [12] et al., Routing in the MANET is a major challenging problem to solve, because of
its dynamic topology and infrastructure less nature, namely Dynamic Source Routing (DSR) is one of the widely
used routing protocols for MANETS protocol. It was proven that, several of the optimizat ions proposed on the DSR
protocol, tend to hurt the performance especially in the case of high node mobility and low traffic load. In this paper
the performance issues has been studied extensively. Taking DSR with certain optimizations turned off as a base,
three intuitive techniques are proposed to improve the performance of DSR. Using the simu lations, it was shown
that the proposed techniques provide significant performance imp rovements for various network densities and traffic
load.
Xin Yu [13] et al., In this paper, author proposes proactively disseminating the broken link informat ion to
the nodes that have that lin k in their caches. They define a new cache structure called a cache tab le and present a
distributed cache update algorithm. Each node maintains in its cache table the information necessary for cache
updates. When a link failure is detected, the algorithm notifies all reachable nodes that have cached the link in a
distributed manner. The algorith m does not use any ad hoc parameters, thus making route caches fully adaptive to
topology changes. They show that the algorithm outperforms DSR with path caches and with Link-Max Life, an
adaptive timeout mechanism for lin k caches and conclude that proactive cache updating is key to the adaptation of
on-demand routing protocols to mobility.
G. Amoussou [14] et al. in this paper author present an approach for designing routing protocol based on a
new met ric namely the Effect ive Co mmun ication Distance (EFCD). EFCD is derived from the prediction of link
duration which is considered as a stability measure. The prediction algorithm is based on Kalman filtering and
exploited available physical layer informat ion such as mobility model, receive d power and SINR (Signal to
Interference and No ise Ratio ). Unlike other methods which propose nodes position and relative speed predictions,
ours predicts the effective communication distance between nodes according to mobile environments. Moreover,
slow fading is used to evaluate and improve nodes relative speed change. Motivated by the opportunities offered by
interaction between physical and upper layers, this paper investigates the effect of channel aware routing on DSR
performances. We modified the route cache structure which selects a route according to two metrics: EFCD and hop
count. Cross layer integration to DSR is presented and implemented in OPNET.
Md. Gol am Kaosar [15] et al.., in this paper author propose a new method of improving the performance
of Dynamic Source Routing (DSR) protocol. In DSR, as well as other on -demand routing protocols, every
established path is considered as temporary to reflect the mobility effect, therefore, once a path is established, it is
associated with an expiration time. After that expirat ion time the path is deleted from the route cache of the nodes.
In practice the mobility of nodes are not equal all the time and they propose to treat paths differently according to
their stationary, rather than deleting them after every exp irat ion time to improve performance.
D.Loganathan [16] et al., the dynamics of an ad hoc network are a challenge to protocol design because
mobility of nodes leads to unstable routing, and consequently flo ws encounter fluctuations in resource av ailab ility
on various paths during the lifetime o f a session. There are several routing protocols like DSDV, AODV, DSR,
OLSR, Etc… which have been proposed for providing communication among all the nodes in the network. This
paper presents the comparison performance of DSR protocol with enhanced DSR protocol which is combined with
the mult icost algorith m in DSR. In the modified approach of DSR, is to enhance the performance of Packet Delivery
Ratio and throughput of the wireless ad hoc networks.
G.Narasa Re ddy [17] et al., author propose a modificat ion to the existing DSR protocol. In this paper, they
add a link breakage predict ion algorith m to the Dynamic Source Routing (DSR) protocol. The mobile node uses
signal power strength from the received packets to predict the link breakage time, and sends a warning to the source
node of the packet if the link is soon-to-be-broken. The source node can perform a pro-active route rebuild to avoid
disconnection. Intermed iate nodes in the route continuously monitor the s ignal strength at the time of
communicat ion, based on a predefined threshold signal value. Intermed iate node sends a message to the source node
that the route is likely to be disconnected, if signal strength falls below the threshold value. If source receive this
message it starts using backup route and if back route also fails then it finds alternative route. The backup route will
minimize the time consuming process of finding an alternative route to some extent. Experiments demonstrate that
adding link breakage predict ion to DSR can significantly reduce the total number of dropped data packets (by at
46
6. Study on a Reliable and Effective Cache Management Technique for DSR Protocol in Mobile…
least 25%). Simu lation results show that the probability of the commun ication breakage decreases when parallel
routes are used.
Parul Sharma [18] et al., MANET is a self organized and self configurable network where the mobile
nodes move arbitrarily. The mobile nodes can receive and forward packets as a router. Each node operates not only
as an end system, but also as a router to forward packets. The nodes are free to move about and organize themselves
into a network. These nodes change position frequent-ly. For relat ively small networks flat routing protocols may be
sufficient. However, in larger networks either h ierarchical or geographic routing protocols are needed. The protocols
have to be chosen according to network characteristics, such as density, size and the mobility of the nodes. MANET
does not require any fixed infrastructure, such as a base station; therefore, it is an attractive option for connectin g
devices quickly and spontaneously. In this three routing protocols AODV (Ad - Hoc On-Demand Distance Vector),
DSDV (Destination Sequenced Dis -tance-Vector) and DSR (Dynamic Source Routing Protocol) are co mpared. Most
of the previous research on MANET routing protocols have focused on simulation study by varying various
parameters, such as network size, pause times etc. The performance of these routing proto -cols is analyzed in terms
of their Packet Delivery Fract ion, Average End-to-End Delay and their results are shown in graphical forms. The
comparison analysis will be carrying out about these protocols and in the last the conclusion will be presented, that
which routing protocol is the best one for mobile ad -hoc networks.
R. Bhuvanes wari [19] et al., in this work author discuss about reduce the effect of overhearing and avoid
the stale route problems while imp roving the energy efficiency using the Efficient Source Routing Scheme (ESRS)
algorith m. Due to the lack of route cache update, the stale route ent ry and overhearing is originated among the
network. For that, they developed five mechanisms to improve route cache performance in DSR. By simu lation
results the proposed algorithm achieves better performance than the existing methods.
Shiva Prakash [20] et al., the wireless links in this network are highly error prone and can go down
frequently due to mobility of nodes, interference and less infrastructure. Therefore, routing in MANET is a crit ical
task due to highly dynamic environ ment. Many protocols were given for solving the problem of routing in MANET
e.g., DSR, AODV, DSDV etc. Th is paper presents a protocol which eliminates the problem which occur in the DSR
protocol like the inconsistency occur due to routing informat ion in the route cache of stale node. The proposed
protocol also reduces the packet dropped, packet delay time and the message overhead in the network as compared
to DSR by utilizing effect ive path discovery and path maintenance procedure.
Santhi [21] et al., Dynamic Source Routing (DSR) for mob ile ad hoc networks maintains route caches to
store routes that have been found via flooding or through promiscuous overhearing. But DSR route caches have the
disadvantages like stale route cache entries, incomp lete erro r notification, and insufficient cache size etc. In this
paper, we propose to develop a reliab le and effective cache management technique for the DSR protocol. In this
technique, initially, we estimate a combined weighted function for each route stored in the cache . Then based on the
combined weight function, the routes are arranged such that routes with minimu m length and traffic load, maximu m
energy level and freshness are listed first in the route cache. The route cache is updated such that routes with least
weight functions are removed fro m the list. In the route prediction mechanism, when a lin k is likely to be broken, it
will select the most reliable route as an alternate route fro m the sorted route cache, before the link breakage. By NS2
simu lation, we show that the proposed cache management technique for DSR protocol achieves better delivery ratio
with reduced delay, overhead and energy consumption.
III. Conclusion.
In this paper, we have presented an various techniques in improving the route cache performance in DSR
routing protocol by reducing the state information, latency, overhead and increases throughput, packet delivery rat io.
47
7. Study on a Reliable and Effective Cache Management Technique for DSR Protocol in Mobile…
References
[1]. Sunsook Jung, Nisar Hundewale and Alex Zelikovsky, “Node Caching Enhancement of Reactive Ad Hoc Routing Protocols”,
Proceedings IEEE Wireless Communication and Networking Conference (WCNC'0 5), March 2005, Volume 4, 1970- 1975.
[2]. Soon Don Kwon, Jung Shin Park and Jai Yong Lee, “A New Route Cache Scheme in On -Demand Routing Protocols for MANET ”,
International Conference of Information Technology & Application (ICITA), 2002.
[3]. Charles E. Perkins and Elizabeth M. Royer, “Adhoc On Demand Distance Vector Routing”, Proceedings of the 2nd IEEE Workshop on
Mobile Computing Systems and Applications, pp. 90-100, New Orleans, LA, February 1999.
[4]. David B. Johnson, David A. Maltz and Josh Broch, “DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc
Networks”, In Ad Hoc Networking, edited by Charles E. Perkins, Chapter 5 (2001), pp. 139 -172, 2001.
[5]. Vincent D. Park and M. Scott Corson, “A Highly Adaptive Distributed Routing Algorithm f or Mobile Wireless Networks”, Proceedings
IEEE in INFOCOM '97, Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 3 (1997), pp.
1405-1413, 1997.
[6]. Young-Bae Ko and Nitin H. Vaidya, “Location-Aided Routing (LAR) in mobile ad hoc networks”, Wireless Networks, Volume 6, Issue
4, Pages: 307 – 321, July, 2000.
[7]. Charles E. Perkins and Pravin Bhagwat, “Highly Dynamic Destination -Sequenced Distance-Vector Routing (DSDV) for Mobile
Computers”, ACM SIGCOMM Computer Communication Review, Volume 24, Pages: 234 - 244, Issue 4, October, 1994.
[8]. Chai-Keong Toh, “Associativity-Based Routing for Ad-Hoc Mobile Networks”, Wireless Personal Communications: An International
Journal, Volume 4 and Issue-2, Pages: 103 – 139, March 1997.
[9]. Alvin Valera, Winston K.G. Seah and SV Rao, “Cooperative Packet Caching and Shortest Multipath Routing in Mobile Ad hoc
Networks”, In Proceedings of IEEE INFOCOM, , pp. 260-269, March-April, 2003.
[10]. YihChun Hu and David B. Johnson, “Ensuring Cache Freshness in On Demand Ad Hoc Network Routing Protocols”, Proceedings in
Second Workshop Principles of Mobile Computing, pp. 25-30, 2002.
[11]. Shobha.K.R and K. Rajanikanth, “Intelligent Caching in on-demand Routing Protocol for Mobile Adhoc Networks”, World Academy of
Science, Engineering and T echnology 56, 2009.
[12]. Prof. M.Neelakantappa, Dr.B.Satyanarayana and Dr. A.Damodharam, “Performance Improvement Techniques for Dynam ic Source
Routing Protocol in Mobile Ad Hoc Networks”, International Journal of Recent Trends in Engineering, Vol 2, No. 2, November 2009.
[13]. Xin Yu, “Distributed Cache Updating for the Dynamic Source Routing Protocol”, IEEE T ransactions on Mobile Computing, Volume 5,
Issue 6, June 2006.
[14]. G. Amoussou, H.Mohanna, M.Kadoch and Z. Dziong, “Improvement of Route Cache in DSR Protocol by Predicting Effective
Communication Distance between Nodes”, ICSEA 2006 and ICSNC 2006 Tahiti, French Polynesia , October 29 - November 4, 2006.
[15]. Md. Golam Kaosar, Ashraf S. Hasan Mahmoud, Tarek R. Sheltami, “Performance Improvement of Dynamic Source Routing Protocol
Considering the Mobility Effect of Nodes in Cache Management”, IEEE 2006.
[16]. D.Loganathan, P.Ramamoorthy, “Enhanced DSR Protocol with Multicost Algorithm in Wireless Ad hoc Networks.”, International
Journal of Engineering Science and T echnology (IJEST ), ISSN : 0975-5462, Vol. 4, PP- 3773-3778, No.08 August 2012
[17]. G.Narasa Reddy, A.Avanthi, R.Prasanth Reddy, “Enhancing DSR Protocol Performance in Mobile Ad Hoc Networks using Proactive
Route Maintenance (PRM).”International Journal of Advanced Research in Computer Science and Software Engineering, Volume 2,
Issue 5, PP-366-371 May 2012
[18]. Parul Sharma, Arvind Kalia And Jawahar Thakur, “Performance Analysis Of Aodv, Dsr And Dsdv Routing Protocols In Mobile Ad-Hoc
Network (Manet),” Journal of Information Systems and Communication, ISSN: 0976-8742 & E-ISSN: 0976-8750, Volume 3, Issue 1,
2012, pp.-322-326, Feb 2012.
[19]. R. Bhuvaneswari, M. Viswanathan, “ Efficient Source Routing Scheme for Mobile Ad hoc Networks,” International Journal of Computer
Applications (0975 – 888) Volume 48– No.17, PP- 15-20,June 2012
[20]. Shiva Prakash1, Rajeev Kumar2, Brijesh Nayak3, Manindar Kumar Yadav. “A Highly Effective and Efficient Route Discovery &
Maintenance in DSR,” International Journal on Computer Science and Engineering (IJCSE), ISSN : 0975-3397, PP- 1546-1553,Vol. 3
No. 4 Apr 2011.
[21]. K.Santhi , Dr. M.Punithavalli “A Reliable and Effective Cache Management Technique for DSR Protocol in Mobile Ad hoc Networks”,
2011 3 rd International conference on Computer Modeling and Simulation (ICCMS 2011)
Authors
K.Santhi received the B.Sc (Phy) degree from the Department of Physics, M .C.A and M .Phil degree from the Department of
computer science, Bharathiar University, Coimbatore, in 1998, 2001 and 2004 respectively. She is currently pursuing the
Ph.D degree in Anna University, Coimbatore. She is working in the Sri Ramakrishna College of arts and science for
women from 2001 to till date. Her area of interest is Networking.
Dr.M.Punithavalli is the Director and Head of the Department of Computer Application, Sri Ramakrishna Engineering
College. She obtained her Ph.D degree in computer science in the year 2007 from Alagappa University. She has published 50
papers in various journal and conference proceedings. Her research interests are in the area of Data M ining, Networking.
48