This document summarizes a research paper that proposes a new routing algorithm for mobile ad hoc networks using fuzzy logic. The algorithm considers three input variables - signal power, mobility, and delay. It defines fuzzy sets and membership functions to map crisp normalized values of these variables to linguistic values. Rules are written to relate the input and output linguistic variables. The output represents the optimal route. The algorithm aims to address routing problems related to bandwidth, signal power, mobility, and delay in a distributed manner without relying on centralized control. It is designed to quickly adapt to changes in network topology.
PERFORMANCE COMPARISION OF DSDV, AODV AND DSRFOR MOBILE AD HOC NETWORK BY VAR...Saurabh Mishra
This document compares the performance of three routing protocols - DSDV, AODV, and DSR - for mobile ad hoc networks by simulating networks of varying sizes using the Qualnet simulator. The main findings are that AODV performed most efficiently for network sizes of 30, 40, and 50 nodes, and that performance decreased for all three protocols as the number of nodes increased. For a network of 50 nodes, the three protocols exhibited different performance levels at different node counts.
The document evaluates data drop performance in wireless LANs using Time-to-Live (TTL) and packet fragmentation. It simulates wireless network traffic with and without TTL/fragmentation using OPNET. The results show that using TTL and fragmenting large packets into smaller chunks significantly reduces data dropped compared to not using these techniques. Specifically, data drop is reduced when packets are fragmented into 1024 byte chunks and a TTL is applied, leading to higher throughput and less buffer overflow.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
The document proposes an enhanced version of the Destination Sequenced Distance Vector (DSDV) routing protocol called Multicost Parameter Based DSDV (MPB-DSDV) that incorporates additional cost parameters like interference, residual energy, and transmission power to improve energy efficiency and network performance for wireless ad hoc networks. The MPB-DSDV protocol is simulated and evaluated based on performance metrics like end-to-end delay, packet delivery ratio, routing overhead, and throughput, and shown to outperform the standard DSDV protocol by taking energy constraints into consideration for path selection.
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.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
Comparatively analysis of AODV and DSR in MAC layer for Ad Hoc Environmentijsrd.com
In Wireless Adhoc Network is a group of wireless mobile nodes is an autonomous system of mobile nodes connected by wireless links. Every node operates as an end system and as a router to forward packets. In this paper mainly focused on Mac layer because this layer is most important for the data communication using control the packet loss and we worked on the comparison based performance of wimax802.16 and wireless802.11 networks using Ad hoc on- demand Distance Vector Routing Protocol and Dynamic Source Routing Protocol. In this paper we used the different maximum speed for the network. And this comparison based on unicast On-demand routing procedure and our simulation for mobile ad hoc networks discover and maintain only needed the design and follows the idea that each node by sending routing packets whenever a communication is requested and compared various parameter packet delivery ratio, normalized routing load and e-e delay. These simulations are carried out using the Network simulator version-2. The results presented in this work illustrate the importance in carefully evaluating and implementing routing protocols in an ad hoc environment.
Cross-layer based performance optimization for different mobility and traffic...IOSR Journals
This document summarizes a research paper that proposes and evaluates a cross-layer optimization approach for the Dynamic Source Routing (DSR) protocol and the 802.11 MAC layer in mobile ad hoc networks. The approach tracks signal strengths of neighboring nodes to distinguish between packet losses due to mobility versus congestion. This information is provided to DSR to avoid unnecessary route error and maintenance processes when losses are due to congestion rather than broken links. Simulations evaluate the approach under different static and mobile scenarios and traffic patterns, showing improvements in routing overhead, packet losses and throughput compared to the conventional DSR protocol.
The Extended Clustering Ad Hoc Routing Protocol (Ecrp)IJCNCJournal
Ad hoc networks are a collection of mobile nodes communicating via wireless channels without any fixed
infrastructure. Because of their ease and low cost of building, ad hoc networks have a lot of attractive
applications in different fields. The topology of ad hoc networks changes dynamically, and each node in the
network can act as a host or router. With the increase in the number of wireless devices and large amount
of traffic to be exchanged, the demand for scalable routing protocols has increased. This paper presents a
scalable routing protocol, based on AODV protocol, called the Extended Clustering Ad Hoc Routing
Protocol (ECRP). This is a hybrid protocol, which combines reactive and proactive approaches in routing.
The protocol uses the Global Positioning System to determine the position of certain nodes in the network.
The evaluation methodology and simulation results obtained show that the protocol is efficient and scales
well in large networks
ANALYSIS AND STUDY OF MATHEMATICAL MODELS FOR RWA PROBLEM IN OPTICAL NETWORKSIJEEE
Blocking probability has been one of the key performance to solve Routing and Wavelength Assignment problem (RWA) indexes in the design of wavelength-routed all-optical WDM networks. To evaluate blocking probability different analytical model are introduced.
A detailed study of routing protocols for mobile ad hoc networks usingIAEME Publication
This document discusses and compares several routing protocols for mobile ad hoc networks (MANETs). It evaluates the performance of the Optimized Link State Routing protocol (OLSR), Dynamic Source Routing (DSR), Ad-hoc On-demand Distance Vector routing (AODV), Location Aided Routing (LAR) and Zone Routing Protocol (ZRP) using the Qualnet simulator. The performance is evaluated based on average end-to-end delay, average jitter, and throughput under scenarios with 45 stationary and mobile nodes. The results show that protocols perform differently depending on node mobility, with OLSR and AODV generally having better performance than DSR, LAR and ZRP in terms of lower delay and
This document proposes a modified ant colony optimization (ACO) routing protocol for mobile ad hoc networks (MANETs). The key points are:
1) The protocol is based on swarm intelligence principles and uses mobile software agents like ants to intelligently route packets from node to node.
2) It modifies the standard ACO algorithm to make it power-balanced and achieve faster packet delivery rates by making the pheromone decay dependent on nodes' battery levels.
3) The routing process involves forward and backward ants establishing and maintaining routes between source and destination via probabilistic path selection based on accumulated pheromone levels.
The document reviews different secured routing protocols for mobile ad hoc networks and their vulnerabilities. It discusses three main categories of secured routing protocols:
1. Trust oriented protocols which use node trust values to determine routing, but are still vulnerable to malicious nodes gaining control.
2. Incentive oriented protocols which aim to discourage attacks through incentives like credits, but require online access or tamper-proof hardware.
3. Detection and isolation protocols which identify misbehaving nodes but have issues like high overhead, inability to detect certain attacks, and vulnerability to false accusations.
In conclusion, while existing protocols address some attacks, they remain vulnerable or impractical in many cases. A robust, lightweight approach is still needed to
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK cscpconf
A Mobile Ad-hoc Network (MANET) is a collection of mobile nodes that communicate and collaborate with each other without reliance on any pre-existing infrastructure. In MANETs, wireless links are subject to frequent breakages due to nodes high mobility. While several routing protocols such AODV and DSR have been designed for MANETs, many of operate efficiently under low network mobility conditions and do not adapt well with high mobility conditions. Therefore, considering mobility is a demanding task that should be performed efficiently and accurately. Here, we proposed novel mobility-aware routing protocol based on the well known Ad-hoc On Demand Distance Vector (AODV) routing protocol called: MA-AODV (Mobility Aware Ad-hoc On Demand Distance Vector) in an attempt to improve the handling of high mobility factor in ad-hoc networks. MA-AODV protocols perform periodic quantification of nodes mobility for the sake of establishing more stable paths between source/destination pairs, hence, avoiding the frequent link breakages associated with using unstable paths that contain high mobile nodes.
This document summarizes a research paper that evaluates the performance of two routing protocols, AODV and DSR, in wireless sensor networks. The paper analyzes the protocols based on two metrics: media access delay and network load. Through simulations with 20 nodes in OPNET, the paper finds that DSR has lower network load for mobile and stationary nodes, while AODV has lower media access delay for mobile nodes and initially for stationary nodes. Overall, the superior protocol depends on the scenario and performance metric considered.
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETspijans
This document summarizes and surveys several enhanced routing protocols that have been developed for mobile ad hoc networks (MANETs). It begins by providing background on routing challenges in MANETs and classifications of routing protocols. It then describes several traditional and widely used routing protocols, including DSDV, OLSR, TORA, DSR, and AODV. The document focuses on summarizing several new routing protocols that have been proposed to improve upon existing protocols. It discusses protocols such as BAWB-DSR, CCSR, RAMP, AODV-SBA, CBRP-R, and CBTRP - noting techniques, advantages, and disadvantages of each. The overall purpose is to review
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Performance Analysis of Ad-hoc on Demand Distance Vector Routing (AODV) and D...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
The document provides instructions for installing Zenworks on a Linux server. It describes downloading and installing required software like SUSE Linux, Java, eDirectory, ConsoleOne, and Zenworks. It then provides step-by-step instructions for configuring eDirectory by creating a new tree, server, and administrator. Finally, it notes that Zenworks Server 7.2 can be installed by mounting the ISO, navigating to the folder, and running the installer.
This chapter discusses I/O systems and covers several topics:
1) I/O hardware components like ports, buses, controllers, and device addresses.
2) Application I/O interfaces that abstract device characteristics for programmers.
3) The kernel I/O subsystem that includes device drivers to hide controller differences.
4) Methods for transforming I/O requests to hardware operations like polling, interrupts, and direct memory access.
5) Performance considerations and notes about interrupt schemes and DMA.
My wife, Rosalyn San Antonio, created this powerpoint presentation as a gift to for our 7th Marriage Anniversary. The song is entitled "Forevermore" by the "Side A", a band popular here in the Philippines.
To the owners of the song and/or music that is used, "Copyright Infringement" is not intended, please let us keep the music on our video.
Thanks for the great music.
This course is intended to give an overview of the nature of hash functions, their cryptographic and security properties and time-stamping as a practical usage for hash functions.
The first part of the lecture series gives an overview of what hash functions are. In the second part, we take a look at the cryptographic security requirements for hash functions. The third part of the series deals with the matter of security properties of hash functions.
In the fourth part, we explore hash functions which are provably secure but inefficient and hash functions which can be used practically. The fifth part in the series shows a practical application of hash functions on the example of time-stamping.
In the sixth and seventh part of the lectures, we look at security requirements for hash functions used in time-stamping and ways of proving how specific hash functions meet requirements for hash functions.
Lecturer Ahto Buldas is a professor at Tallinn University of Technology and University of Tartu, specializing in complexity theory, combinatorics, cryptography and data security. He has worked extensively with hash functions and their usage in timestamping and together with Margus Niitsoo in 2010 showed how global scale time-stamping can be used with 256-bit hash functions.
Carbon fiber is a strong yet lightweight material made by processing precursor fibers through stabilization, carbonization, and sometimes graphitization stages. There are two main precursors used: polyacrylonitrile (PAN) and pitch. PAN precursor involves oxidation and pyrolysis heating steps, while pitch precursor involves polymerization, stabilization in oxygen, and carbonization in inert gas. Carbon fiber has very high tensile strength, low density, and good electrical conductivity. Its major applications are in aerospace and aircraft industries, automotive bodies, sports equipment, civil engineering, and wind turbine blades due to its advantages of light weight, high strength, and temperature insensitivity. India's first carbon fiber manufacturing plant was inaugurated in 2010.
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
This document presents a method for enhancing small signal stability in power systems using Flexible AC Transmission System (FACTS) controllers. It develops the mathematical models for modeling synchronous machines and FACTS devices like SVC and TCSC. It then describes the algorithm used for small signal stability analysis of multi-machine systems with FACTS controllers. This involves forming the system state matrix and computing eigen values and participation factors. Case studies are carried out on standard test systems like 3-machine 9-bus and 10-machine 39-bus to demonstrate the effectiveness of FACTS controllers in damping electromechanical oscillations when optimally located using the proposed residue factor method.
This document analyzes the electric field intensity in a three-phase gas insulated bus duct. It finds that the electric field intensity decreases with increasing diameter of the enclosure and is strongly dependent on conductor dimensions and applied voltage. A simulation was conducted to determine the electric field intensity for different enclosure diameters, conductor diameters, and voltages. The results showed that electric field intensity decreases linearly with increasing conductor diameter and is inversely related to the enclosure diameter.
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
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
This document presents a mathematical model to understand the effects of detecting and treating latent hepatitis B infections on the transmission dynamics of hepatitis B. The model divides the population into susceptible, vaccinated, latently infected, actively infected, and removed compartments. Equations are developed to describe changes in each compartment over time based on transmission, vaccination, progression and recovery rates. Stability analysis of the disease-free equilibrium shows that detecting and treating latent infections above a threshold rate (τ) increases stability, while below τ, vaccination increases stability. The model suggests detection and treatment of latent infections can impact hepatitis B transmission dynamics.
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
The document evaluates the performance of routing protocols (AODV and OLSR) in VANETs using different TCP variants (Tahoe, Reno, New Reno) under various network scenarios in the OMNeT++ simulator. Three scenarios are examined based on network size: 20 nodes (small), 60 nodes (medium), and 100 nodes (large). Delay and throughput are measured for each scenario. Results show that both AODV and OLSR achieve acceptable performance, though which protocol performs better depends on factors like the TCP variant, traffic load, and number of nodes. OLSR generally provides better throughput while the effect on delay varies depending on conditions.
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
El documento describe a Box Inc., un servicio en línea para el almacenamiento y gestión de archivos en la nube. Ofrece hasta 10 GB de almacenamiento gratuito para cuentas personales. El núcleo del servicio permite compartir, colaborar y trabajar con archivos subidos a Box. Existen cuentas empresariales, comerciales y personales con diferentes características como almacenamiento ilimitado y controles administrativos. El servicio está disponible a través de la web, dispositivos móviles, ordenadores y una consola de
Network Lifetime Analysis of Routing Protocols of Short Network in QualnetIOSR Journals
Abstract: A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with each other without using any existing infrastructure, access point or centralized administration. Mobile ad-hoc network have the attributes such as wireless connection, continuously changing topology, distributed operation and ease of deployment. In this paper we have compared the energy consumption of reactive, proactive & hybrid routing protocol AODV,DSR,RIP & ZRP by using different mobility model. We have analyzed the Network lifetime of protocols by varying pay load, mobility, pause time and type of traffic (CBR). A detailed simulation has been carried out in qualnet. The metrics used for performance analysis are energy consumed & battery consumption. It has been observed that RIP has better network lifetime than other.
This document provides an overview of mobile ad hoc networks (MANETs). It defines MANETs as wireless networks without fixed infrastructure where nodes are free to move and dynamically self-organize. Key points:
- MANETs are formed spontaneously as nodes connect via wireless links without centralized administration.
- Each node acts as a router, forwarding data for other nodes. Network topology changes frequently as nodes move.
- Examples of MANET applications include military operations, emergency response, classroom environments, and home/office networks.
- Challenges for MANET routing protocols include dynamic topology, limited resources, and network security. Common routing approaches include proactive, reactive, and geographic routing.
This document provides an introduction and overview of mobile ad hoc networks (MANETs). It discusses how MANETs are self-configuring networks formed by mobile nodes without a fixed infrastructure. The key characteristics of MANETs include using wireless communication, nodes acting as both hosts and routers, limited bandwidth and variable capacity links, energy-constrained operation, and dynamic network topology. The document also outlines some common applications of MANETs and provides an overview of different routing protocols used in MANETs, including proactive, reactive, and hybrid protocols. It gives a brief description of distance-vector and link-state routing approaches.
This document summarizes a research paper that analyzes delay performance in multi-hop wireless networks. The paper proposes using a queue grouping technique and interference model to derive a lower bound on average delay. It describes modeling a wireless network as nodes and links, with fixed routes between source-destination pairs. The paper then presents algorithms to partition the network into single-queue systems and greedily compute a delay lower bound. Simulation results are shown for various topologies. The paper also discusses using a back-pressure scheduling policy to improve delay performance close to the derived lower bounds.
A Survey of Enhanced Routing Protocols for Manetspijans
Mobile Ad Hoc Networks (MANETs) form a class of dynamic multi-hop networks consisting of a set of
mobile nodes that intercommunicate on shared wireless channels. MANETs are self-organizing and selfconfiguring multi-hop wireless networks, where the network structure changes dynamically due to the node
mobility. There exists no fixed topology due to the mobility of nodes, interference, multipath propagation
and path loss. Hence efficient dynamic routing protocols are required for these networks to function
properly. Many routing protocols have been developed to accomplish this task. In this paper we survey
various new routing protocols that have been developed as extensions or advanced versions of previously
existing routing protocols for MANETs such as DSR, AODV, OLSR etc.
Review on design of advanced opportunistics routing in manetyatin1988
This document discusses mobile ad hoc networks and opportunistic routing. It provides background on MANETs, including their definition as temporary networks formed without infrastructure between wireless mobile nodes. It also covers applications of MANETs and challenges like mobility and link quality. The document introduces opportunistic routing as a forwarding technique for unpredictable MANET topologies. It reviews related work analyzing opportunistic routing and discusses using fuzzy logic to improve routing stability and availability in MANETs. The proposed work is to implement a fuzzy routing mechanism on the AODV protocol to optimize link availability and evaluate performance metrics like throughput and delay.
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.
The document provides an overview of routing protocols in mobile ad-hoc networks (MANETs) and enhancements to reactive protocols. It discusses the key features of MANETs and challenges like security. It describes different routing strategies including proactive, reactive, and hybrid protocols. It provides details on reactive protocols like DSR and AODV. It focuses on enhancements to DSR including the watchdog and pathrater mechanisms to detect misbehaving nodes and select more reliable routes. The document is a technical paper that evaluates routing protocols and security issues in MANETs.
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
As the network size increases the probability of congestion occurrence at nodes increases. This is
because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result
congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses.
In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce
end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector
routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing
(IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy
adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing
performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput
and packet delivery fraction
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
1. The document proposes a hybrid routing protocol that combines DSDV and IAODV to reduce packet loss due to congestion in MANETs.
2. Under the proposed scheme, DSDV is used initially for path selection. If congestion occurs, nodes switch to using IAODV to find an alternate path to avoid congested areas.
3. Simulation results show that the hybrid protocol improves end-to-end delay, packet delivery fraction, and throughput compared to using only DSDV or IAODV. The hybrid approach balances the advantages of proactive and reactive routing to better handle congestion in mobile ad hoc networks.
This document analyzes and compares the scalability of three mobile ad hoc network (MANET) routing protocols - AODV, TORA, and OLSR - by simulating them using varying numbers of nodes. The key findings are:
1) In terms of end-to-end delay, OLSR consistently performs better than AODV and TORA as the number of nodes increases from 25 to 75.
2) For throughput, OLSR outperforms AODV and TORA across all network sizes tested.
3) The study concludes that OLSR demonstrates better scalability than AODV and TORA based on its performance with increasing numbers of nodes in terms of
ANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORKIJCSIT Journal
There are two methods to improve the performance of routing protocols in wireless mesh networks. One way is to improve the methods used for select the path. Second way is to improve the algorithms to add up the new characteristics of wireless mesh networks. We also propose a new protocol that is used for Multi Interfaces and Multiple Channels (MIMC) named as Hybrid Wireless Mesh Protocol.
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...ijsrd.com
In Mobile Ad hoc network (MANETS), no fixed infrastructure is available. Different wireless hosts are free to move from one location to another without any centralized administration, so, the topology changes rapidly or unpredictably. Every node operates as router as well as an end system. Routing in MANETs has been a challenging task ever since the wireless networks came into existence. The major reason for this is continues changes in network topology because of high degree of node mobility. The MANET routing protocols have mainly two classes: Proactive routing (or table-driven routing) protocols and Reactive routing (or on-demand routing) protocols. In this paper, we have analyzed various Random based mobility models: Random Waypoint model, Random Walk model, Random Direction model and Probabilistic Random Walk model using AODV and DSDV protocols in Network Simulator (NS 2.35). The performance comparison of MANET mobility models have been analyzed by varying number of nodes using traffic TCP. The comparative conclusions are drawn on the basis of various performance metrics such as: Routing Overhead (packets), Packet Delivery Fraction (%), Normalized Routing Load, Average End-to-End Delay (milliseconds) and Packet Loss (%).
Comparative Performance Evaluation of Ad-hoc on Demand Distance Vector Routin...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Wireless networking allows users to access information from any geographic location. This document discusses several routing protocols for wireless ad-hoc networks, where nodes can connect dynamically in an arbitrary manner. It describes protocols like DSDV, AODV, TORA, DSR, and introduces a new protocol called Fisheye Routing, which uses a table-driven approach with variable updating rates to reduce overhead. Performance analysis showed Fisheye Routing provides accurate routing with low control overhead in mobile environments.
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
Disadvantages And Disadvantages Of Wireless Networked And...Kimberly Jones
The document describes an implementation of the Bellman-Ford algorithm to find the shortest path routing from node U in a provided network diagram. The program outputs the routing table for node U after each iteration, showing the destination and number of hops. It runs for V-1 iterations, where V is the total number of vertices. The algorithm uses a relaxation formula to calculate the shortest path between each edge iteratively. By the final iteration, the optimal shortest paths from the source node U to all other nodes are determined. A Word document with screenshots explains how the program incorporates the Bellman-Ford algorithm and determines when the routing table is optimal.
IRJET- Survey on Enhancement of Manet Routing ProtocolIRJET Journal
This document discusses routing protocols for mobile ad hoc networks (MANETs). It provides an overview of several popular routing protocols, including AODV, DSDV, DSR, AOMDV and discusses their advantages and disadvantages. The document aims to analyze how the AOMDV protocol could be improved, for example by considering nodes' remaining battery power. It proposes developing a new routing algorithm based on this to achieve better performance than existing protocols.
This document summarizes the key aspects of routing protocols for mobile ad hoc networks (MANETs). It discusses three categories of routing protocols: proactive, reactive, and hybrid protocols. Proactive protocols maintain routing tables through regular table updates, while reactive protocols find routes on demand through route discovery. Common proactive protocols described include DSDV and OLSR, while reactive protocols like AODV are now more widely used due to lower overhead. Hybrid routing protocols incorporate aspects of both approaches.
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.
COVID-19 and the Level of Cloud Computing Adoption: A Study of Sri Lankan Inf...AimanAthambawa1
The study’s main objective is to analyse the level of cloud computing adoption and usage during COVID-19 in Sri
Lanka, especially in Information Technology (IT) organisations. Using senior IT employees, this study investigates
what extent their organisation adopts with cloud computing, the level of cloud computing usage, current use of
cloud service model, usage of cloud deployment model, preferred cloud service providers and reasons for adopting
and not adopting cloud computing. The study also describes why cloud computing is a solution for new normal
situations and the cloud-enabled services used during and after the COVID-19 pandemic. The finding suggests
that 87.7% of the organisations currently use cloud-enabled services, whereas 12.3% do not and intend to adopt.
Considering the benefits, cloud computing is the solution post COVID-19 pandemic to run the business way
forward.
Integrating Kafka with MuleSoft 4 and usecaseshyamraj55
In this slides, the speaker shares their experiences in the IT industry, focusing on the integration of Apache Kafka with MuleSoft. They start by providing an overview of Kafka, detailing its pub-sub model, its ability to handle large volumes of data, and its role in real-time data pipelines and analytics. The speaker then explains Kafka's architecture, covering topics such as partitions, producers, consumers, brokers, and replication.
The discussion moves on to Kafka connector operations within MuleSoft, including publish, consume, commit, and seek, which are demonstrated in a practical demo. The speaker also emphasizes important design considerations like connector configuration, flow design, topic management, consumer group management, offset management, and logging. The session wraps up with a Q&A segment where various Kafka-related queries are addressed.
Smart mobility refers to the integration of advanced technologies and innovative solutions to create efficient, sustainable, and interconnected transportation systems. It encompasses various aspects of transportation, including public transit, shared mobility services, intelligent transportation systems, electric vehicles, and connected infrastructure. Smart mobility aims to improve the overall mobility experience by leveraging data, connectivity, and automation to enhance safety, reduce congestion, optimize transportation networks, and minimize environmental impacts.
Communications Mining Series - Zero to Hero - Session 3DianaGray10
This is a continuation to previous session focused on Model usage and adapting for Analytics and Automation usecases. We will understand how to use the Model for automation usecase with a demo.
• Model Usage and Maintenance
• Analytics Vs Automation Usecases
• Demo of Model usage
• Q/A
Connector Corner: Leveraging Snowflake Integration for Smarter Decision MakingDianaGray10
The power of Snowflake analytics enables CRM systems to improve operational efficiency, while gaining deeper insights into closed/won opportunities.
In this webinar, learn how infusing Snowflake into your CRM can quickly provide analysis for sales wins by region, product, customer segmentation, customer lifecycle—and more!
Using prebuilt connectors, we’ll show how workflows using Snowflake, Salesforce, and Zendesk tickets can significantly impact future sales.
Sonkoloniya is a web-based realtime code editor with hosting functionality developed by Subham Mandal from ONEprojukti. Sonkoloniya enables users to write and run HTML, CSS, and JavaScript code in real-time. It features a user-friendly interface with separate code editing panes, live preview, console output, and file management capabilities.
Demystifying Neural Networks And Building Cybersecurity ApplicationsPriyanka Aash
In today's rapidly evolving technological landscape, Artificial Neural Networks (ANNs) have emerged as a cornerstone of artificial intelligence, revolutionizing various fields including cybersecurity. Inspired by the intricacies of the human brain, ANNs have a rich history and a complex structure that enables them to learn and make decisions. This blog aims to unravel the mysteries of neural networks, explore their mathematical foundations, and demonstrate their practical applications, particularly in building robust malware detection systems using Convolutional Neural Networks (CNNs).
Types of Weaving loom machine & it's technologyldtexsolbl
Welcome to the presentation on the types of weaving loom machines, brought to you by LD Texsol, a leading manufacturer of electronic Jacquard machines. Weaving looms are pivotal in textile production, enabling the interlacing of warp and weft threads to create diverse fabrics. Our exploration begins with traditional handlooms, which have been in use since ancient times, preserving artisanal craftsmanship. We then move to frame and pit looms, simple yet effective tools for small-scale and traditional weaving.
Advancing to modern industrial applications, we discuss power looms, the backbone of high-speed textile manufacturing. These looms, integral to LD Texsol's product range, offer unmatched productivity and consistent quality, essential for large-scale apparel, home textiles, and technical fabrics. Rapier looms, another modern marvel, use rapier rods for versatile and rapid weaving of complex patterns.
Next, we explore air and water jet looms, known for their efficiency in lightweight fabric production. LD Texsol's state-of-the-art electronic Jacquard machines exemplify technological advancements, enabling intricate designs and patterns with precision control. Lastly, we examine dobby looms, ideal for medium-complexity patterns and versatile fabric production.
This presentation will deepen your understanding of weaving looms, their applications, and the innovations LD Texsol brings to the textile industry. Join us as we weave through the history, technology, and future of textile production. Visit our website www.ldtexsol.com for more information.
Uncharted Together- Navigating AI's New Frontiers in LibrariesBrian Pichman
Journey into the heart of innovation where the collaborative spirit between information professionals, technologists, and researchers illuminates the path forward through AI's uncharted territories. This opening keynote celebrates the unique potential of special libraries to spearhead AI-driven transformations. Join Brian Pichman as we saddle up to ride into the history of Artificial Intelligence, how its evolved over the years, and how its transforming today's frontiers. We will explore a variety of tools and strategies that leverage AI including some new ideas that may enhance cataloging, unlock personalized user experiences, or pioneer new ways to access specialized research. As with any frontier exploration, we will confront shared ethical challenges and explore how joint efforts can not only navigate but also shape AI's impact on equitable access and information integrity in special libraries. For the remainder of the conference, we will equip you with a "digital compass" where you can submit ideas and thoughts of what you've learned in sessions for a final reveal in the closing keynote.
BLOCKCHAIN TECHNOLOGY - Advantages and DisadvantagesSAI KAILASH R
Explore the advantages and disadvantages of blockchain technology in this comprehensive SlideShare presentation. Blockchain, the backbone of cryptocurrencies like Bitcoin, is revolutionizing various industries by offering enhanced security, transparency, and efficiency. However, it also comes with challenges such as scalability issues and energy consumption. This presentation provides an in-depth analysis of the key benefits and drawbacks of blockchain, helping you understand its potential impact on the future of technology and business.
The History of Embeddings & Multimodal EmbeddingsZilliz
Frank Liu will walk through the history of embeddings and how we got to the cool embedding models used today. He'll end with a demo on how multimodal RAG is used.
Premium Girls Call Mumbai 9920725232 Unlimited Short Providing Girls Service ...
011001010 a
1. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications
(IJERA) www.ijera.com Vol. 1, Issue 1, pp.001-010
A Fuzzy Logic Based Network Dependent Routing Algorithm for
Ad hoc Wireless Networks
Dr. Sohan Garg1, Payal Kansal2, Viksit Kumar Sharma3
( 1Department of Computer Applications, Raj Kumar Goel Institute of Technology,
Delhi-Meerut Road, GZB (U.P.)
2
Department of IT, Lord Krishna College of Engineering Ghaziabad
3
Rajeev Academy for Technology and Management, Mathura (UP) )
Abstract: The development of Mobile Ad Hoc G (v, e), with a set of vertices v and a set of edges e.
network advocates self-organized wireless
Each vertex of the set v represents a network node and
interconnection of communication devices that
would either extend or operate in concert with the each edge of the set e represents a wireless link. The
wired networking infrastructure or, possibly, evolve total number of nodes is n = |v|. This key feature of
to autonomous networks. Unlike traditional wireless
networks, ad hoc networks do not rely on any fixed these networks enable them to be employed in places
infrastructure. Instead, hosts rely on each other to where an infrastructure is not available, such as in
keep the network connected. One main challenge in
disaster and on battle grounds, or we can say that the
design of these networks is their vulnerability to
security attacks. Despite the existence of well-known dynamic nature of these networks and the scarcity of
security mechanisms, additional vulnerabilities and
bandwidth in the wireless medium, along with the
features pertinent to this new networking paradigm
might render such traditional solutions limited power in mobile devices (such as PDA’s and
inapplicable. In particular, the absence of a central laptops) make routing in these networks a challenging
authorization facility in an open and distributed
communication environment is a major challenge, task. The topology of an ad hoc network changes due
especially due to the need for cooperative network to the movement of mobile hosts, which may lead to
operation. In MANET, any node may compromise
sudden packet losses and delays. In the mobile ad hoc
the routing protocol functionality by disrupting the
route discovery process. In this paper, we network due to the high mobility, low signal power and
understand the various routing problems related to
limited bandwidth the wireless links are frequently
bandwidth, signal power, mobility and delay. In this
paper we are proposing a new routing algorithm broken and new links are frequently established. Such
that is totally network dependent and will remove dynamic network topology presents a significant
the all routing problems
challenge for the network routing algorithms. Several
Keywords: Delay, Mobility, Mobile Ad hoc routing algorithms, such as shortest path routing
network, topology algorithm like DBF were proposed for ad hoc wireless
networks. But, these algorithms suffer from very slow
1. Introduction
convergence (the “routing to infinity” problem).
Ad hoc networks are made up of a number of nodes, Besides, DBF-like algorithms incur large update
which are capable of performing routing without using message penalties. Protocols that attempted to cure
a dedicated centralized controller as a base station. Ad some of the shortcomings of DBF, such as Destination-
hoc networks can be represented as a connected graph Sequences Distance Vector routing were proposed.
www.ijera.com 01
2. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
However, synchronization and extra processing the algorithm is simple as well as having low
overhead are common in these protocols. Other communication overhead and storage requirements.
protocols that rely on the information from the The algorithm has been simulated in MATLAB 7.2 in
predecessor of the shortest path solve the slow which we have uses the Fuzzy Logic tool kit.
convergence problem of DBF. However, the
processing requirements of these protocols may be The Fuzzy Logic is an innovative approach to help
quite high, because of the way they process the update control non-repeating or unpredictable systems control
message. Realizations of the path findings algorithms, accuracy. It uses a list of rules rather than complicated
like the wireless routing protocol, are able to eliminate mathematical expression. Fuzzy Logic was introduced
the “counting-to-infinity” problem and reduce the by L.A. Zadeh in 1965. Fuzzy Logic is also known as
occurrence of temporary loops, often with less control fuzzy rule based system and this is a non linear
traffic than traditional distance vector schemes. The mapping technique of input data into output. Fuzzy
main disadvantage of WRP is the fact that routing Logic system is composed of five functional blocks.
nodes constantly maintain full routing information in 2. The Proposed Routing Algorithm
each network node, which was obtained as relatively
high cost in wireless resources. In the Temporary Here Fuzzy Logic has been used for routing and
Ordered Routing Algorithm the resulting route replies management of an ad hoc wireless network. The
are also flooded, in a controlled manner, to distribute proposed fuzzy logic based routing algorithm takes into
routes in the form of directed acyclic graphs (DAGs) account of three input variables, signal power and
rooted at the destination. In contrast, protocols such as mobility and delay. The absolute value of each of these
Dynamic Source Routing and ad hoc on demand parameters can take a large range at different points on
distance vector unicast the route reply back to the the network. We have considered the normalized
querying source, along a path specified by a sequence values for each parameter. Now, ‘crisp’ normalized
of node addresses accumulated during the route query values are being converted into fuzzy variables. For
phase. In the case of DSR, the node addresses are this, three fuzzy sets have been defined for each
accumulated in the query packet and are returned to the variable. The sets, low (from 0 to 0.4), medium (from
source, to be used for source routing. AODV, on the 0.2 to 0.8) and high (from 0.6 to 1.0) have been used
other hand, distributes the discovered route in the form for the input variable signal power (figure 1) and the
of next-hop information stored at each node in the sets, poor (from 0 to 0.4), average (from 0.2 to 0.8) and
route. These algorithms do not satisfy the requirements excellent (from 0.6 to 1.0) have been used for input
of an ad hoc wireless network completely and despite variable delay (figure 2) and the sets, low (from 0 to
their shortcomings, these works lay the foundation for 0.4), medium (from 0.2 to 0.8) and high (from 0.6 to
the development of our protocol. In this paper we 1.0) have been used for the input variable mobility
propose a new routing protocol for ad hoc wireless (figure 3). The normalized value of each parameter is
networks, which address some of the problems with the mapped into the fine sets. Each value will have some
existing approaches. In spite of all these improvements, grade of membership function for each set. The
www.ijera.com 02
3. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
memberships that have been defined for each of the protocol is distributed in nature without relying on
fuzzy set for any particular input variable are triangular centralized authorities.
in shape. Next the rules of inference have been written. 4. Entering/Departing nodes: This protocol is able to
Initially total 27 rules were devised. The crisp value of quickly adapt to entering or departing nodes in the
input variable was given and a defuzzified crisp value network, without having to restructure the entire
for selected variable was calculated from the derived network.
algorithm. An output linguistic variable is used to 5. On Demand operation: Since a uniform traffic
represent the route. Proposed optimal routes are based distribution cannot be assumed within the network, the
upon the fuzzy rules for different ranges of the metric routing algorithm must adapt to the traffic pattern on a
availability. The routes (figure 4) are defined as below demand or need basis, thereby utilizing power and
optimal (from 0 to 0.4), suboptimal (from 0.2 to 0.8) bandwidth resources more efficiently.
and optimal (from 0.6 to 1.0) between two mobile Our problem is to find the optimal and suitable route
hosts. The below optimal indicates not optimal path, from source to the destination based on mobility, signal
the sub optimal indicates good path and the optimal power and delay. The system is based on the fuzzy
path indicates the best path. The proposed routing inference system. The major components of the system
algorithm can apply to different routing metrics. These consist of the knowledge base, decision making,
routes have to satisfy the mobility, signal power and fuzzification and defuzzification. Now we will write
delay requirements of the network. The grade of the fuzzy rules based on the mobility, signal power and
membership function can be any where between 0 and delay and try to find out the optimal path or route.
1 for each fuzzy set. The defuzzified crisp value for
selected variable was calculated from the derived
algorithm. The proposed Fuzzy Logic & bandwidth
based routing algorithm for ad-hoc wireless network is
classified as “A Fuzzy Logic Based Network
Dependent Routing Algorithm for Ad hoc Wireless
Networks”. This algorithm contains the following
characteristics:
1. Freedom from loops: In the proposed algorithm the
paths derived from the routing tables of all nodes have
no loops.
2. Fast Route Convergence: The new routing protocol
provides a new and stable route as soon as possible
Figure 1. Input Variable ‘Signal power’
after a topology change.
3. Distributed Implementation: As we know those ad
hoc networks are autonomous and self-organizing, this
www.ijera.com 03
4. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
The Fuzzy Inference rules for the proposed routing
algorithm are following:
1. If (signal power is low) and (mobility is low) and
(delay is poor) then the route will be below optimal.
2. If (signal power is low) and (mobility is low) and
(delay is average) then the route will be below optimal.
3. If (signal power is low) and (mobility is low) and
(delay is excellent) then the route will be sub optimal.
4. If (signal power is low) and (mobility is medium)
and (delay is poor) then the route will be below
Figure 2. Input Variable ‘Delay’
optimal.
5. If (signal power is low) and (mobility is medium)
and (delay is average) then the route will be sub-
optimal.
6. If (signal power is low) and (mobility is medium)
and (delay is excellent) then the route will be sub
optimal.
7. If (signal power is low) and (mobility is high) and
(delay is poor) then the route will be below optimal.
8. If (signal power is low) and (mobility is high) and
(delay is average) then the route will be below optimal.
Figure 3. Input Variable ‘Mobility’ 9. If (signal power is low) and (mobility is high) and
(delay is excellent) then the route will be sub-optimal.
10. If (signal power is medium) and (mobility is low)
and (delay is poor) then the route will be sub- optimal.
11. If (signal power is medium) and (mobility is low)
and (delay is average) then the route will be optimal.
12. If (signal power is medium) and (mobility is low)
and (delay is excellent) then the route will be optimal.
13. If (signal power is medium) and (mobility is
medium) and (delay is poor) then the route will be
below optimal.
14. If (signal power is medium) and (mobility is
medium) and (delay is average) then the route will be
Figure 4. Output Variable ‘Route’
sub optimal.
www.ijera.com 04
5. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
15. If (signal power is medium) and (mobility is
medium) and (delay is excellent) then the route will be
optimal.
16. If (signal power is medium) and (mobility is high)
and (delay is poor) then the route will be below
optimal.
17. If (signal power is medium) and (mobility is high)
and (delay is average) then the route will be sub
optimal.
18. If (signal power is medium) and (mobility is high)
and (delay is excellent) then the route will be optimal.
19. If (signal power is high) and (mobility is low) and
(delay is poor) then the route will be sub-optimal.
20. If (signal power is high) and (mobility is low) and Figure 5. ‘Route’ O/P w.r.t. ‘Mobility’ and
(delay is average ) then the route will be optimal. ‘Signal Power’
21. If (signal power is high) and (mobility is low) and
(delay is excellent) then the route will be optimal. In figure 5 signal power and mobility are the
22. If (signal power is high) and (mobility is medium) fuzzy input variable for the proposed routing
and (delay is poor) then the route will be sub-optimal. algorithm which lies on the horizontal axes and
23. If (signal power is high) and (mobility is medium) route is the output variable which has been shown
and (delay is average) then the route will be sub- on the vertical axis. It is very clear from the figure
optimal. that at constant signal power and low mobility the
24. If (signal power is high) and (mobility is medium) Route is below optimal, but for any value of the
and (delay is excellent) then the route will be optimal. signal power if we increase the mobility then the
25. If (signal power is high) and (mobility is high) and route also increases and becomes sub-optimal.
(delay is poor) then the route will be below - optimal. Finally at high mobility the route will be below
26. If (signal power is high) and (mobility is high) and optimal for constant signal power.
(delay is average) then the route will be sub-optimal.
27. If (signal power is high) and (mobility is high) and
(delay is excellent) then the route will be optimal.
The routes based upon the above rules have been
shown with the help of the following graphs:
www.ijera.com 05
6. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
poor delay. But as the delay becomes high, route
Figure 6 ‘Route’ O/P w.r.t. ‘Signal Power’ and increases up to sub optimality and optimality when the
‘Delay’ mobility is medium and high respectively.
In figure 6 the inputs of the algorithm (signal power
and delay) are on the horizontal axes and the output
(route) is on the vertical axis. According to the figure It
is clear that at constant delay and low signal power the
route is below optimal but if the signal power is
increased up to medium the route is sub optimal for
poor delay. In the same way at high signal power and
poor delay the route becomes below optimal. If delay is
increased up to average at high signal power then the
route is suboptimal but route becomes optimal at
excellent delay and at high signal power.
Figure 8. ‘Route’ O/P w.r.t. Medium ‘Signal Power’,
Low ‘Mobility’ and Excellent ‘Delay’
The figure 8 illustrates that when signal power is
medium (0.504), mobility is low (0.0812) and delay is
excellent (0.885) then in this condition the route is
optimal (0.861). So this algorithm works well when
mobility is low and signal power is medium.
Figure 7. ‘Route’ O/P w.r.t. ‘Mobility’ and ‘Delay’
In figure 7 delay and mobility are the input variables
and route is the output variable. The 3 D decision
surface illustrate that route is below optimal for poor
delay and low mobility. As the mobility is increased up
to medium the route will be sub optimal. Again the
similar process occurs and route is below optimal for
www.ijera.com 06
7. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
Figure 9. ‘Route’ O/P w.r.t. Medium ‘Signal
Power’, Medium ‘Mobility’ and Excellent ‘Delay’ Figure 10. ‘Route’ O/P w.r.t. Medium ‘ Signal
In figure 9 we have seen that route is optimal at low Power’, Low ‘Mobility’ and Average ‘Delay’
mobility, medium signal power and at excellent delay This is very clear from the figure 10 that in this
but against it when we increase the mobility towards protocol the value of the signal power (0.47) and
medium (0.517) at medium signal power (0.504) and mobility (0.115) is same as in figure 6.8 but the
excellent delay (0.919) the route is again optimal. So difference is that when we will decrease the delay up to
this algorithm works well at medium mobility also. average (0.509) then the route is still optimal, but as we
will increase the mobility then the route will be sub
optimal.
3. Simulation Results
In decision surface (figure 5) the input variables signal
power and mobility lie on horizontal axes and the
www.ijera.com 07
8. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
output variable route lies on vertical axis. It shows that again but as we increase the mobility then route
at constant signal power the route is below optimal for becomes suboptimal.
low mobility. But any signal power if we increase the 4. Conclusions
mobility the route also starts increasing and becomes Due to the unprecedented growth in the scale and
sub optimal. Finally when the mobility becomes high, diversity of mobile computing devices, new
the route will be below optimal for constant signal horizons for wireless connectivity has come into
power. Now as we increase the signal power the route view. In this chapter, we have shown the
starts increasing towards optimality and becomes importance of an ad hoc routing protocol and some
optimal for low and medium mobility. In figure 6 the of the previous works. Following that we have
inputs of the algorithm are on the horizontal axes and proposed our new routing protocol based on
the output of the algorithm is on the vertical axis. Here, mobility, signal power and delay, where the
with the help of 3D surface we observe that at constant segmentation of nodes will substantially reduce the
delay and low signal power the route is below optimal overhead of the entire network and speed up the
but if the signal power is increased up to medium the routing process. After fully describing its functions
route is sub optimal for poor delay. Similarly at high and mechanism, we have suggested various
signal power and poor delay the route becomes below optimizations to the protocol and utilized the
optimal. It can also be observed that with average delay concept of stability index. Finally, we have done
and high signal power the route is suboptimal and if we limited trials to show that our protocol is functional
increase delay up to excellent the route is optimal at and effective; we do see the need in further
high signal power. In figure 7 the input variables experimentation in order to accurately access the
mobility and delay lie at horizontal axes and the route practical effectiveness of our protocol in a medium
at vertical axis. Here, we see that for poor delay and to large size network.
low mobility the route is below optimal. As the
References:
mobility increases and arrive up to medium the route
[1] A. James Freebersyser, B. Leiner, “A DoD
will be sub optimal. Again the similar phenomenon
perspective on mobile ad hoc networks”, in:
occurs and route is below optimal for poor delay. But
Charles E. Perkin (Ed.), Ad hoc Networking,
as the delay becomes high, route increases up to sub
Addison Wesley Reading, May 2001, pp.29-51.
optimality and optimality when mobility is medium
[2] J. Macker and S. Corson, “Mobile Ad hoc
and high respectively. In figure 8 we see that at
Networks (MANET)”, IETF WG
medium signal power (0.504), low mobility (0.0812)
Charter.,http://www.ietf.org/html.charters/manetC
and excellent delay(0.885) the route is optimal (0.86)
arter.html,1997.
and as we increase the only mobility towards
[3] IEEE Computer Society LAN MAN Standards
medium(0.517) then the route is again optimal (0.865)
Committee,”Wireless LAN medium access control
which has been shown in the figure 9. In figure 10,
(MAC) and physical layer (PHY) specifications”,
with medium signal power (0.47), low mobility (0.115)
IEEE Std. 802.11, 1997, pp. 11-97.
and average delay (0.509) the route becomes optimal
www.ijera.com 08
9. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
[4] M.S. Corson, J.P. Maker, J.H. Ernicione “Internet [13] J.J. Garcia Aceves,”Distributed routing algorithm
based mobile ad hoc networking”, IEEE Internet using internidal coordination”, Proc. IEEE
Computing, 3 (4), 1999, pp. 63-70. INFOCOM’, New Orleans, LA, 1998, pp.85-96.
[5] E. M. Royer and C. K. Toh, “A review of current [14] E.M. Gafni and D. P. Bertsekas,” Distributed
routing protocols for ad hoc mobile wireless algorithm for generating loop-free routes in networks
networks”, IEEE Personal Communications Magazine, with frequently changing topology”,
April 1999, pp. 46-55. IEEE Transactions on Communications, Vol. Com-29,
[6]I. Chlamtac and A. Lerner, “Link allocation in mobile no. 1, Jan. 1981
radio networks with noisy channel”, In IEEE , pp. 11-18.
INFOCOM, Bar Harbour. [15] M. S. Corson and A. Ephremides, “A distributed
www.openu.ac.il/Personal_sites/anat-lerner.html, FL, routing algorithm for mobile wireless networks”, ACM
April 1986. Journal for Wireless Networks, Feb. 1995, pp. 61-81.
[7] I. Chlamtac and A. Lerner, “Fair algorithms for [16] C.E. Perkins and P. Bhagwat, “Highly dynamic
maximal link activiation in multi-hop radio networks”, destination sequenced distance –vector routing (DSDV)
IEEE Transactions on Communications COM-3, Issue- for mobile computers,” ACM SIGCOMM, Vol.24, no.4,
7, Vol. 35, 1987, pp. 739-746. Oct.1994, pp. 234-244.
[8] A. Adya, P. Bahl, J. Padhye, A. Wolman, and L. Zhou. [17] S. Murthy and J.J. Garcia-Luna-Aceves, “An efficient
“A Multi –radio unification protocol for IEEE routing protocol for wireless networks,” ACM Mobile
802.11 wireless networks”. In IEEE International Networks and App. J., Special issue on Routing in
conference on broadband networks, (BroadNets), 2004. Mobile communication Networks, Oct. 1996, pp. 183-
[9] C. Siva Ram Murthy and B.S. Manoj, “Ad hoc 187.
Wireless Networks Architecture and Protocols”, [18] J.M. McQuillan, I. Richer, E. Rosen, “The new routing
Prentice Hall, 2004. algorithm for ARPANET”, IEEE Transaction of
[10] M.S. Corson, S. Batsel and J. Macker, “Architecture Communication Vol. 28, Issue May 1980, pp. 711-719.
consideration for mobile mesh networking”, [19] D.B. Johnson, D. A. Maltz and Y.C. Hu., “ The
Conference Proceeding, IEEE, Vol.1 21-24 Oct. 1996, dynamic source routing protocol for mobile ad hoc
pp. 225-229. networks (DSR),” IETF Mobile Ad hoc Networks
[11] P. Merlin and A. Segall, “A fail safe distributed routing Working Group, Internet Draft, 16 Apr. 2003.
protocol”, IEEE Transactions on Communications, [20] C. Bettstetter and C. Wagner. (March 2002), The
COM-27 (9), Sep. 1979, pp. 1280-1287. Spatial Node Distribution of the RandomWaypoint
[12] J.M. Jaffe and P.H. Moss, “A responsive distributed Mobility Model. In Proceedings of the German
routing algorithm for computer networks”, IEEE Workshop on Mobile Ad hoc Networks (WMAN),
Transactions on Communications, COM-30 (7): July pages 41–58, Ulm, Germany.
1982, pp. 1758-1762. [21]C. Bettstetter, (2001), “Mobility modeling in wireless
networks: Categorization, smooth movement, and
www.ijera.com 09
10. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
border effects,” ACM Mob. Comput. Commun. Rev., wireless networks,” in Proc. 4th ACM Int. Workshop
vol. 5, no. 3, pp. 55–66. on Modeling Analysis and Simulation of Wireless and
[22] C. Bettstetter, (Sept. 2001),“Smooth is better than Mobile Systems (MSWiM), Rome, pp. 19–27
sharp: a random mobility model for simulation of
www.ijera.com 010