This document analyzes the performance of two reactive MANET routing protocols, DSR and DSDV, under TCP Vegas and TCP Newreno variants through simulations. The simulations measured packet delivery ratio, average end-to-end delay, and total packets dropped. The results showed that DSDV generally had a higher packet delivery ratio but also higher end-to-end delay and more packet drops compared to DSR. DSR performed better in terms of delay and drops due to its on-demand route discovery, while DSDV maintained more consistent routes leading to better packet delivery.
The growth in wireless communication technologies has resulted in a considerable amount of
attention given to mobile adhoc networks. All mobile hosts in an adhoc network are embedded with
packet forwarding capabilities. It is decentralized and is independent of infrastructure. Since mobile
hosts in an adhoc network usually move freely, the topology of the network changes dynamically and
disconnection occurs frequently. These characteristics require the routing protocols to find an
alternative path towards the destination for data transfer. The existing on-demand routing protocols
does the alternative path establishment only after the disconnection of links in the existing path. The
data sent by the source during alternate path establishment period will be lost leading to incomplete
data transfer. The network traffic will therefore increase considerably. This problem can be overcome
by establishing an alternative path when the existing path is more likely to be broken, by sending a
warning message to the source indicating the likelihood of disconnection. In this paper an attempt has
been made to analyze a protocol that improves the network connectivity by preempting the alternative
path before the existing link gets failed by monitoring the signal strength and ‘age of the path’.
This document analyzes the effect of node density on different routing protocols under FTP and HTTP applications. It simulates scenarios with varying node densities (20-130 nodes) using routing protocols AODV, DSR, GRP and OLSR. Key quality of service (QoS) metrics - throughput, delay, network load and packet delivery ratio - are evaluated and compared. The results show that OLSR generally performs best in terms of throughput and delay for both FTP and HTTP applications. GRP performs best for network load, while AODV has the highest packet delivery ratio for FTP. In conclusion, OLSR is the best overall routing protocol for supporting FTP and HTTP applications in mobile ad-hoc networks according to
This document discusses a simulation of advanced networking using the GloMoSim simulator. It begins with an introduction by Dr. A. Kathirvel, a professor and head of the department of information technology. The document then covers topics like ad hoc wireless networks, research issues in mobile ad hoc networks, ad hoc wireless internet, and concludes with an outline of the simulator session.
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.
Ad-hoc routing protocols allow nodes in a mobile ad hoc network to discover the network topology and route packets between nodes that may not be directly connected. The key goals of ad-hoc routing protocols are to minimize control overhead and processing overhead, enable multihop routing between nodes not in direct transmission range, dynamically maintain routes as nodes move, and prevent routing loops. There are three main categories of ad-hoc routing protocols: table-driven protocols that maintain up-to-date routing tables via periodic updates, on-demand protocols that find routes only when needed via flooding, and hybrid protocols that use aspects of both table-driven and on-demand routing.
The document discusses routing protocols for ad hoc wireless networks. It outlines several key challenges for these protocols, including mobility, bandwidth constraints, error-prone shared wireless channels, and hidden/exposed terminal problems. It also categorizes routing protocols based on how routing information is updated (proactively, reactively, or through a hybrid approach), whether they use past or future temporal network information, the type of network topology supported (flat or hierarchical), and how they account for specific resources like power.
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
T HE I MPACT OF TCP C ONGESTION W INDOW S IZE ON THE P ERFORMANCE E VA...ijwmn
A mobile ad hoc network (MANET) is a temporary coll
ection of mobile nodes randomly moved within a
limited terrain area. The nodes are connected to fo
rm a wireless network without use any communication
infrastructure. Because of the limiting resources o
f MANET nodes, multiple hops
scheme is proposed for
data exchange
across the network. Varieties of mobile ad hoc rout
ing protocols have been developed to
support the multi-hop scheme of ad hoc networks. A
popular Transmission Control Protocol (TCP)
provides a reliable connection in a computer networ
k environment; it sets its congestion window size i
n
response to the behavior of the network to achieve
the best performance. This work aims to investigate
and
compare the MANET protocol
performance, such as DSDV, AODV and DSR in terms of
network
throughput, average routing load, the packet delive
ry ratio (PDR), and average end-to-end delay by
varying the maximum congestion window size. Our si
mulation has been implemented using a well-known
NS-2.35 network simulator. The simulated results sh
ow that the demonstrates of the concepts of MANET
routing protocols with respect to TCP congestion wi
ndow size in MANET environment
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
IMPROVED NETWORK CONNECTIVITY IN MANETSIJCNCJournal
The growth in wireless communication technologies has resulted in a considerable amount of
attention given to mobile adhoc networks. All mobile hosts in an adhoc network are embedded with
packet forwarding capabilities. It is decentralized and is independent of infrastructure. Since mobile
hosts in an adhoc network usually move freely, the topology of the network changes dynamically and
disconnection occurs frequently. These characteristics require the routing protocols to find an
alternative path towards the destination for data transfer. The existing on-demand routing protocols
does the alternative path establishment only after the disconnection of links in the existing path. The
data sent by the source during alternate path establishment period will be lost leading to incomplete
data transfer. The network traffic will therefore increase considerably. This problem can be overcome
by establishing an alternative path when the existing path is more likely to be broken, by sending a
warning message to the source indicating the likelihood of disconnection. In this paper an attempt has
been made to analyze a protocol that improves the network connectivity by preempting the alternative
path before the existing link gets failed by monitoring the signal strength and ‘age of the path’.
This document analyzes the effect of node density on different routing protocols under FTP and HTTP applications. It simulates scenarios with varying node densities (20-130 nodes) using routing protocols AODV, DSR, GRP and OLSR. Key quality of service (QoS) metrics - throughput, delay, network load and packet delivery ratio - are evaluated and compared. The results show that OLSR generally performs best in terms of throughput and delay for both FTP and HTTP applications. GRP performs best for network load, while AODV has the highest packet delivery ratio for FTP. In conclusion, OLSR is the best overall routing protocol for supporting FTP and HTTP applications in mobile ad-hoc networks according to
This document discusses a simulation of advanced networking using the GloMoSim simulator. It begins with an introduction by Dr. A. Kathirvel, a professor and head of the department of information technology. The document then covers topics like ad hoc wireless networks, research issues in mobile ad hoc networks, ad hoc wireless internet, and concludes with an outline of the simulator session.
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.
Ad-hoc routing protocols allow nodes in a mobile ad hoc network to discover the network topology and route packets between nodes that may not be directly connected. The key goals of ad-hoc routing protocols are to minimize control overhead and processing overhead, enable multihop routing between nodes not in direct transmission range, dynamically maintain routes as nodes move, and prevent routing loops. There are three main categories of ad-hoc routing protocols: table-driven protocols that maintain up-to-date routing tables via periodic updates, on-demand protocols that find routes only when needed via flooding, and hybrid protocols that use aspects of both table-driven and on-demand routing.
Routing protocols for ad hoc wireless networks Divya Tiwari
The document discusses routing protocols for ad hoc wireless networks. It outlines several key challenges for these protocols, including mobility, bandwidth constraints, error-prone shared wireless channels, and hidden/exposed terminal problems. It also categorizes routing protocols based on how routing information is updated (proactively, reactively, or through a hybrid approach), whether they use past or future temporal network information, the type of network topology supported (flat or hierarchical), and how they account for specific resources like power.
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Narendra Singh Yadav
This document compares the performance of two routing protocols for mobile ad hoc networks: Destination Sequenced Distance Vector (DSDV) and Ad Hoc On-Demand Distance Vector (AODV). It presents the results of simulations run using the ns-2 network simulator. The simulations varied the number of nodes, pause time (mobility rate), and number of data sources. The performance metrics measured were packet delivery ratio, average end-to-end delay, and normalized routing load. The results showed that AODV had higher packet delivery ratios and lower routing loads than DSDV. However, AODV experienced higher delays than DSDV due to its on-demand route discovery process. DSDV performed better in low
This document discusses routing protocols for ad hoc wireless networks. It begins by outlining some key issues in designing routing protocols for these networks, such as mobility, bandwidth constraints, and frequent topology changes. It then classifies routing protocols as being either table-driven, on-demand, or hybrid approaches. Table-driven protocols maintain consistent, up-to-date routing information through periodic table updates. On-demand protocols only discover routes when needed, to reduce overhead. The document proceeds to describe several examples of these different routing protocol types.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
This document summarizes a research paper that evaluates the performance of two routing protocols (AODV and DSDV) under different traffic patterns (TCP and CBR) in a mobile ad hoc network (MANET) simulation. The paper describes MANET characteristics and challenges for routing. It provides an overview of reactive (AODV), proactive (DSDV), and hybrid routing protocols. It also defines TCP and CBR traffic patterns. The research aims to analyze and compare the packet delivery ratio and end-to-end delay of AODV and DSDV under different traffic loads using the NS-2 simulator. Preliminary results show that reactive protocols perform better in terms of these metrics.
The document provides an overview of routing protocols for mobile ad hoc networks (MANETs). It discusses that MANETs are self-configuring networks without centralized control where nodes can act as routers to forward packets. The document classifies routing protocols as proactive (table-driven), reactive (on-demand), or hybrid. It describes examples of proactive routing protocols like DSDV, OLSR, and WRP that maintain up-to-date routing tables and share updates periodically or when changes occur. The document also discusses reactive protocols establish routes on demand and hybrid protocols that combine aspects of proactive and reactive approaches.
Mobile ad-hoc networks have frequent host and topology changes with no cellular infrastructure and require multi-hop wireless links for data transmission between nodes. Routing protocols must discover routes between nodes that may not be directly connected. Table-driven protocols like Destination Sequenced Distance Vector (DSDV) and Wireless Routing Protocol (WRP) maintain up-to-date routing tables through periodic broadcasts but generate significant control overhead. DSDV uses sequence numbers to distinguish stale routes and avoid loops while WRP maintains four tables for routing information.
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
Change is the only thing which is constant in this
today’s era. Constant technology updates demand building up
and falling down of infrastructure along with cost involvement.
Today there is a need of adaptive infrastructure called Ad hoc
network.
Ad hoc network is a collection of two or more nodes with
wireless communication having network capability that they can
communicate without centralized manner. So, at any time host
devices may act as a router or as a node. Ad hoc networks can be
erected as wireless technology, comprising of Radio Frequency
(RF) and infrared frequency.
Wireless Ad hoc network is Temporary, Infrastructure less,
Decentralized, self-organized packet switched network. In this
network topology changes dynamically which can results change
in link failure or broken. In this paper we evaluate the
performance parameters like Throughput, End-to-End Delay and
Packet Delivery Ratio of AODV (ad hoc on Demand Vector) and
DSDV (Destination Sequential Distance Vector) protocol. The
simulation tool used is Network Simulator 2 -2.35
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksIJCNCJournal
A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.
This document provides an overview of routing protocols in ad hoc networks. It begins with an abstract describing the objectives of surveying and comparing different classes of ad hoc routing protocols. The document then outlines the topics to be covered, including the characteristics, applications, and types of ad hoc routing protocols. Several representative routing protocols are described in detail, including table-driven, hybrid, source-initiated, location-aware, multipath, hierarchical, multicast, and power-aware protocols. The document concludes by discussing future work related to improving reusability and security of ad hoc routing protocols.
The document discusses ad hoc networks. It defines an ad hoc network as a temporary network connection between devices without fixed infrastructure. Key characteristics of ad hoc networks include dynamic topology, nodes that can freely join and leave, multi-hop routing, and limited bandwidth. The document compares ad hoc networks to wired and managed wireless networks. It also discusses different types of ad hoc networks and routing protocols like DSR and AODV. Applications of ad hoc networks include military operations, conferences, and emergency response situations.
The document summarizes key health metrics and statistics from the Block Bandipora region in India between April 2010 to September 2011, as presented by Altaf Hussain during a review meeting on 12/10/2011. It includes comparisons of outpatient/inpatient services, surgeries, lab tests, immunizations and more between 2010 and 2011. Overall performance was assessed, noting a 103% BCG vaccination coverage rate, 113% DPT-1 coverage and 91% DPT-3 coverage with a 9% dropout rate. Revenue realized was also compared between the two time periods.
This document summarizes key production metrics for Smart Jacket (BD) Ltd. and Shehan Textile Mills Ltd. for the month of January. It discusses productivity, worker utilization, lost time, production numbers, efficiency rates, defects, shipments, turnover, and absenteeism. The main goals were to increase productivity and efficiency rates, reduce lost time and defects, and improve output, shipments, and worker attendance compared to prior months. While some metrics met targets, many others fell short, indicating opportunities for improvement across the production process.
Application Performance Monitoring is a mandatory discipline of any production environment of today. But due to the heterogeneous nature of modern applications, it faces many challenges.
Note: This presentation was made for a 2008 seminar.
Proactive Performance Monitoring for Genesys Call CentersPerficient, Inc.
VitalSuite is a proactive performance monitoring software that provides deep insight into network infrastructure, applications, and Genesys contact center components. It delivers continuous measurement of key performance indicators to identify and resolve issues before they impact users. This allows organizations to shift from a reactive to proactive operations model through meaningful information on normal system behavior and early warnings of potential problems. VitalSuite monitors both the contact center infrastructure and staff/call flow to ensure optimal overall performance.
COMPARING THE IMPACT OF MOBILE NODES ARRIVAL PATTERNS IN MANETS USING POISSON...ijwmn
This paper compares the impact of mobile node arrival patterns in mobile ad hoc networks (MANETs) using Poisson and Pareto distribution models. Through MATLAB simulations, the study investigates how the arrival rate and size of the mobile node population are affected by these distributions. The results indicate that higher arrival rates can influence larger mobile node populations in a given area. Additionally, the Pareto distribution is found to better model mobile node mobility in MANETs compared to the Poisson distribution.
AN EFFICIENT KEY AGREEMENT SCHEME FOR WIRELESSSENSOR NETWORKS USING THIRD PAR...ijasuc
This document summarizes a key agreement scheme for wireless sensor networks that uses third party nodes to assist with pair-wise key establishment between sensor nodes. The proposed scheme has several advantages over existing approaches, including high local connectivity between sensor nodes, low memory usage, and resilience against node capture. It utilizes third party nodes, which are additional nodes deployed only to assist with key establishment and do not perform other network functions like sensing or routing. The scheme distributes secret shares to sensor nodes, allows nodes to discover local neighbors, and establishes secure channels in a way that improves performance metrics like connectivity, security, memory efficiency, and computational overhead compared to other key agreement methods.
Public wireless LAN services have been increasing recently. These are convenient services for carrier
companies particularly. And carrier companies and the user can disperse traffic. However in order to
improve the convenience, the services do not often use the encryption key or do not change the encryption
key that has already been set. Therefore, the services have a problem in safety. This paper solves this
problem using the visible light communication.
The visible light communication sends a signal by blinking the light. One of the visible light communication
features is that we can see the transmission area. The visible light communication can use lighting
equipments as the transmitter unlike infrared or conventional radio communications. Further, visible light
communication can separate to clarify the transmission range by using light.
We propose the distribution of the encryption key and the SSID using visible light communication. Visible
light communication can easily prepare a small network, such as a partition or per a room basis. For
malicious users connecting to the network is necessary to enter in the service provided area. Thus the
administrator is able to easily manage legitimate users. In addition, it is possible to update the SSID and
the encryption key by visible light communication easily for an administrator. Thus if malicious users get
the SSID and the encryption key, they cannot use the SSID and the encryption key immediately. Normal
users may only need to run the shell script for receiving information from the receiver. Therefore,
convenience is good.
In order to confirm the improved convenience, we measured the time it takes for a user to connect to the
network. Conventional methods are methods that use or do not use the encryption key. As a result, users
can connect to the network in a short time compared with the conventional methods. The system becomes
stronger than conventional methods because it is possible to update the encryption key and SSID
automatically in the security aspect.
The four basic Radio Resource Management (RRM) measurements in Long Term Evolution (LTE) system
are Channel Quality Indicator (CQI), Reference Signal Received Power (RSRP), Reference Signal
Received Quality (RSRQ), and Carrier Received Signal Strength Indicator (RSSI). A measurement of channel quality represented by Signal to Interference plus Noise Ratio (SINR) is used for link adaptation along with packet scheduling, whereas RSRP and RSRQ are needed for making handover decision during intra-eUTRAN (evolved Universal Terrestrial Random Access Network) handover in LTE. In this paper,
some practical measurement results recorded from a live LTE network of Australia using a commercial measurement tool namely NEMO Handy are analysed to verify the possible relationships among SINR, RSRP, RSSI and RSRQ as well as to evaluate the effects of SNR on throughput. In addition, the intraeUTRAN handover events occurred during the test period within the test area are studied. The analysis
yields some useful information such as: if the SINR is good for a measurement slot, higher throughput is
achieved; RSRP and SNR are proportional to each other on average; and lesser is the difference between
RSSI and RSRP, better is the RSRQ – each of which is consistent with theory. All the measurement results
are evaluated using computer programs built on MATLAB platform.
Analyses and performance of techniques papr reduction for stbc mimo ofdm syst...ijwmn
An OFDM system is combined with multiple-input mult
iple-output (MIMO) in order to increase the
diversity gain and system capacity over the time va
riant frequency-selective channels. However, a maj
or
drawback of MIMO-OFDM system is that the transmitte
d signals on different antennas might exhibit high
peak-to-average power ratio (PAPR).In this paper, w
e present a PAPR analysis reduction of space-time-
block-coded (STBC) MIMO-OFDM system for 4G wireless
networks. Several techniques have been used to
reduce the PAPR of the (STBC) MIMOOFDM system: clip
ping and filtering, partial transmit sequence
(PTS) and selected mapping (SLM). Simulation result
s show that clipping and filtering provides a bette
r
PAPR reduction than the others methods and only SLM
technique conserve the PAPR reduction in
reception part of signal.
K dag based lifetime aware data collection in wireless sensor networksijwmn
Wireless Sensor Networks need to be organized for efficient data collection and lifetime maximization. In
this paper, we propose a novel routing structure, namely k-DAG, to balance the load of the base station's
neighbours while providing the worst-case latency guarantee for data collection, and a distributed
algorithm for construction a k-DAG based on a SPD (Shortest Path DAG). In a k-DAG, the lengths of the
longest path and the shortest path of each sensor node to the base station differ by at most k. By adding
sibling edges to a SPD, our distributed algorithm allows critical nodes to have more routing choices. The
simulation results show that our approach significantly outperforms the SPD-based data collection
approach in both network lifetime and load balance.
ON THE SUPPORT OF MULTIMEDIA APPLICATIONS OVER WIRELESS MESH NETWORKS ijwmn
This document summarizes research on supporting multimedia applications over wireless mesh networks. It proposes an efficient routing algorithm and a QoS approach at the MAC layer. The routing algorithm aims to transport multimedia traffic with QoS requirements. The MAC layer approach improves 802.11e to better facilitate video transport over the mesh network. Related work on routing protocols, QoS solutions at the network and MAC layers, and clustering approaches are also reviewed.
Magnify Network Lifetime in WSN by Reducing Data Aggregation Distance of Weak...ijwmn
Energy efficient protocols have always played a vital role in conservation of energy in Wireless Sensor
Network. One of the major introduced protocols is LEACH a cluster based protocol. To improve its
performance, an algorithm named as Maximizing the Network Lifetime of Clustered-based WSN Using
Probability of Residual Energy is introduced. This protocol improved the Cluster Head selection process of
LEACH by using the concept of residual energy. In the proposed paper, further improvement is done by
enhancing the data transmission process. This process heightens the lifetime of the nodes having very less
energy left by reducing their data transmission distance. Implemented results in MATLAB shows increase
in the stability and lifetime of the network..
GROUP SESSION KEY EXCHANGE MULTILAYER PERCEPTRON BASED SIMULATED ANNEALING GU...ijwmn
This document describes a new technique called GSMLPSA for secure group key exchange and encryption in wireless communication. It uses a multilayer perceptron neural network to generate a session key shared between parties. Plaintext is encrypted in multiple levels using a metamorphosed code table, comparison-based encryption, and a keystream generated by simulated annealing. The keystream is further encrypted using a finite state automaton before being XORed with the session key and sent. This allows secure key exchange among a group of parties with only logarithmic complexity. Experimental results show the technique provides comparable security to existing methods.
SENSOR SELECTION SCHEME IN TEMPERATURE WIRELESS SENSOR NETWORKijwmn
In this paper, we propose a novel energy efficient environment monitoring scheme for wireless sensor
networks, based on data mining formulation. The proposed adapting routing scheme for sensors for
achieving energy efficiency from temperature wireless sensor network data set. The experimental
validation of the proposed approach using publicly available Intel Berkeley lab Wireless Sensor Network
dataset shows that it is possible to achieve energy efficient environment monitoring for wireless sensor
networks, with a trade-off between accuracy and life time extension factor of sensors, using the proposed
approach.
This presentation provides details on the available dashboards, charts and graphs in ENMAT V2.1
See: http://kb.en-mat.com/knowledgebase.php?category=6 for more information.
Multiple optimal path identification using ant colony optimisation in wireles...ijwmn
This document summarizes a research paper that proposes using an ant colony optimization (ACO) algorithm to identify multiple optimal paths for data transmission in wireless sensor networks (WSNs). The algorithm is base-station driven, meaning the base station computes the optimal paths using ACO and communicates them to the sensor nodes. This approach overcomes limitations of traditional ACO routing by reducing communication overhead and identifying multiple optimal paths rather than just one. Simulation results show the proposed ACO approach finds shorter optimal paths compared to traditional ACO routing in WSNs.
PERFORMANCE IMPROVEMENT OF PAPR REDUCTION FOR OFDM SIGNAL IN LTE SYSTEMijwmn
This document discusses performance improvement of peak-to-average power ratio (PAPR) reduction for orthogonal frequency division multiplexing (OFDM) signals in long-term evolution (LTE) systems. It proposes an improved amplitude clipping and filtering method for PAPR reduction that shows significant improvement over existing methods, with a slight increase in bit error rate. The document provides background on OFDM, PAPR issues in OFDM, and motivations for reducing PAPR such as improving power amplifier efficiency.
ENERGY CONSUMPTION IN WIRELESS SENSOR NETWORKS USING DATA FUSION ASSURANCEijwmn
Data fusion techniques reduce total network traffic in a wireless sensor network, since data fusion can
integrate multiple raw data sets into one fused data set. However, the security or assurance of the data
requires more processing power and is an important issue. Increasing the security of the fusion data
increases factors such as power consumption, and packet overhead. Therefore any data fusion assurance
scheme must be power efficient as well as secure. There are currently several methods of data fusion
assurance that have been proposed. Therefore, this paper looks at the current data fusion assurance
methods and proposes new schemes focused on reducing power consumption. In this paper, several data
fusion assurance schemes are also compared to determine which scheme is the most energy efficient.
Path constrained data gathering scheme for wireless sensor networks with mobi...ijwmn
This document summarizes a research paper on using mobile elements to gather data in wireless sensor networks. The paper proposes a heuristic algorithm called Graph Partitioning (GP) to address the K-Hop tour planning (KH-tour) problem of designing the shortest possible tour for a mobile element to visit a subset of sensor nodes called caching points, such that any node is at most k hops from the tour.
The GP algorithm works by first partitioning the sensor network graph into partitions where the depth of each partition is bounded by k hops. It then identifies the minimum number of caching points needed in each partition. Finally, it constructs the mobile element's tour to visit all the identified caching points.
Impact of client antenna’s rotation angle and height of 5g wi fi access point...ijwmn
This paper investigates the impact of antenna rotation’s angle at the receiver side and antenna height at
transmitter side on radio channel’s amount of fading. Amount of fading is considered as a measure of
severity of fading conditions in radio channels. It indicates how severe the fading level relative to Rayleigh
fading channel. The results give an input to optimize height of 5G Wi-Fi access point for better link
performance for different antenna’s rotation angles at receiver side. The investigation covers three
different indoor environments with different multipath dispersion levels in delay and direction domains;
lecture hall, corridor, and banquet hall.
Performance Analysis of Mobile Adhoc Network Routing Protocols Over Tcppijans
In order to reduce the communication cost and time we are looking forward for successful implementation
of an infrastructure less network like Mobile Ad Hoc Network in all arena of wireless mobile
communication. But still it is a challenge to decide a most appropriate routing protocol for MANET. In
MANET there is no fixed topology due to the mobility of nodes, interference, multipath propagation and
path loss. Since MANET does not use fixed infrastructure rather it always have to find suitable router and
routing path for each communication, existing established routing protocol is not suitable for MANET to
function properly. Different Routing protocols have been proposed to meet the challenges with MANETs.
This paper evaluates the performances of four MANET routing protocols which are DSDV, AODV, DSR
and TORA over TCP, a Transport Layer Protocol. The performance metrics which are considered in this
paper are packet delivery fractions, normalized routing overload, end to end delay and throughput. DSDV
is a proactive protocol and the others are reactive protocols.
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.
This document summarizes a review article about energy efficient routing protocols in mobile ad hoc networks (MANETs). It discusses how MANETs use multi-hop wireless connections between mobile nodes without a fixed infrastructure. It then reviews several prominent routing protocols for MANETs, including reactive protocols like AODV and DSR, proactive protocols like DSDV and OLSR, and a hybrid protocol. Finally, it proposes a new energy-efficient clustering-based routing algorithm that selects cluster heads based on node mobility and battery power to improve path efficiency and stability in MANETs.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Survey comparison estimation of various routing protocols in mobile ad hoc ne...ijdpsjournal
MANET is
an autonomous system of mobile nodes attached by wireless links. It represents
a complex and
dynamic distributed systems that consist of mobile wireless nodes that can freely self organize into
an ad
-
hoc network topology. The devices in the network may hav
e limited transmission
range therefore multiple
hops may be needed by one node to transfer data to another node in network. This leads to the need f
or an
effective routing protocol. In this paper we study various classifications of routing protocols and
th
eir types
for wireless mobile ad
-
hoc networks like DSDV, GSR, AODV, DSR, ZRP, FSR, CGSR, LAR, and Geocast
Protocols. In this paper we also compare different routing proto
cols on based on a given set of
parameters
Scalability, Latency, Bandwidth, Control
-
ov
erhead, Mobility impact
Survey comparison estimation of various routing protocols in mobile ad hoc ne...ijdpsjournal
This document summarizes and compares various routing protocols for mobile ad-hoc networks (MANETs). It first describes the characteristics and challenges of MANETs. It then classifies routing protocols for MANETs into three main categories: table-driven (proactive), on-demand (reactive), and hybrid protocols. Examples of protocols from each category are described in detail, including DSDV, AODV, DSR, and ZRP. Key features such as route discovery, table maintenance, and use of proactive and reactive approaches are discussed for each example protocol. Finally, the document compares different protocols based on parameters like scalability, latency, bandwidth overhead, and mobility impact.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
Performance Evaluation of DSDV and MDSDV Routing Protocol with Varying Node D...IJERA Editor
Mobile Ad Hoc Networks (MANET) is an important and challenging research area. The routing protocol should detect and maintain a good route between source and destination nodes in these dynamic networks. Many routing protocols have been proposed for mobile ad hoc networks, and none can be considered as the best under all conditions. This thesis work consist a systematic comparative evaluation of a new multipath routing protocol for MANETS. The new protocol, called Multipath Destination Sequenced Distance Vector (MDSDV) is based on the well known single path Destination Sequenced Distance Vector (DSDV) is compared with known protocol DSDV. This work containing evaluates the protocols on a range of MANETS with between 50, 75 and 100 nodes, which are static nodes. The protocol comparison metrics are Throughput and Residual Energy.
The document provides an overview of routing protocols for mobile ad hoc networks (MANETs). It discusses the characteristics of MANETs and challenges in routing. It classifies routing protocols into three categories: proactive, reactive, and hybrid. Proactive protocols continuously maintain up-to-date routing information through periodic updates. Reactive protocols find routes on demand via route discovery. Hybrid protocols incorporate aspects of both proactive and reactive routing. Examples of protocols from each category are described and compared, including DSDV, AODV, DSR, ZRP, and CEDAR. The document concludes routing in MANET is an active area of research with the goal of protocols responding rapidly to topological changes.
International Journal of Engineering Research and DevelopmentIJERD Editor
This document analyzes and compares different routing protocols for mobile ad hoc networks (MANETs). It begins with background on MANETs and their characteristics. It then classifies routing protocols into proactive (table-driven) and reactive (on-demand) categories. For each category, several representative protocols are described in detail, including DSDV, WRP, CGSR, DSR, AODV, ABR, SSA, and TORA. Their routing mechanisms and approaches to route discovery and maintenance are outlined. The document aims to provide an overview of major MANET routing protocols to help determine the most suitable ones for different network conditions.
This document analyzes and compares different routing protocols for mobile ad hoc networks (MANETs). It begins with background on MANETs and their characteristics, such as dynamic topology and limited resources. It then classifies routing protocols as either proactive (table-driven) or reactive (on-demand) and describes several examples of each type. Proactive protocols maintain up-to-date routing tables through periodic updates but incur more overhead. Reactive protocols discover routes on demand but add latency. The document provides details on popular protocols like DSDV, AODV, DSR and TORA, explaining their route discovery, maintenance and metrics.
This document summarizes an article that proposes improvements to the Ad hoc On-Demand Distance Vector (AODV) routing protocol for use in Vehicular Ad hoc Networks (VANETs). It first provides background on VANETs and discusses different types of routing protocols used in VANETs, including topology-based, position-based, and hybrid protocols. It then focuses on improvements made to the reactive AODV routing protocol, including adding link layer security checks and a method to reduce packet delay called AODV_BD. The goal of these improvements is to create more stable routes and reduce packet delay for safety communications between vehicles.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
The Effects of Speed on the Performance of Routing Protocols in Mobile Ad-hoc...Narendra Singh Yadav
Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. Researchers have conducted many simulations comparing the performance of these routing protocols under various conditions and constraints. One question that arises is whether speed of nodes affects the relative performance of routing protocols being studied. This paper addresses the question by simulating two routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and speed.
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 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
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field
free for the nodes to move. The most important aspect of this kind of network turns into a great
disadvantage when it comes to commercial applications, take as an example: the automotive
networks that allow communication between a groups of vehicles. The ad hoc on-demand
distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main
functions. First, it enables route establishment between a source and a destination node by
initiating a route discovery process. Second, it maintains the active routes, which means finding
alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and
accurately. In this paper, we focused in the first point to enhance the local decision of each node
in the network by the quantification of the mobility of their neighbours. Quantification is made
around RSSI algorithm a well known distance estimation method.
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.
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.
Similar to ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP VARIANTS (20)
Best Programming Language for Civil EngineersAwais Yaseen
The integration of programming into civil engineering is transforming the industry. We can design complex infrastructure projects and analyse large datasets. Imagine revolutionizing the way we build our cities and infrastructure, all by the power of coding. Programming skills are no longer just a bonus—they’re a game changer in this era.
Technology is revolutionizing civil engineering by integrating advanced tools and techniques. Programming allows for the automation of repetitive tasks, enhancing the accuracy of designs, simulations, and analyses. With the advent of artificial intelligence and machine learning, engineers can now predict structural behaviors under various conditions, optimize material usage, and improve project planning.
How Social Media Hackers Help You to See Your Wife's Message.pdfHackersList
In the modern digital era, social media platforms have become integral to our daily lives. These platforms, including Facebook, Instagram, WhatsApp, and Snapchat, offer countless ways to connect, share, and communicate.
Blockchain technology is transforming industries and reshaping the way we conduct business, manage data, and secure transactions. Whether you're new to blockchain or looking to deepen your knowledge, our guidebook, "Blockchain for Dummies", is your ultimate resource.
Choose our Linux Web Hosting for a seamless and successful online presencerajancomputerfbd
Our Linux Web Hosting plans offer unbeatable performance, security, and scalability, ensuring your website runs smoothly and efficiently.
Visit- https://onliveserver.com/linux-web-hosting/
Kief Morris rethinks the infrastructure code delivery lifecycle, advocating for a shift towards composable infrastructure systems. We should shift to designing around deployable components rather than code modules, use more useful levels of abstraction, and drive design and deployment from applications rather than bottom-up, monolithic architecture and delivery.
Quality Patents: Patents That Stand the Test of TimeAurora Consulting
Is your patent a vanity piece of paper for your office wall? Or is it a reliable, defendable, assertable, property right? The difference is often quality.
Is your patent simply a transactional cost and a large pile of legal bills for your startup? Or is it a leverageable asset worthy of attracting precious investment dollars, worth its cost in multiples of valuation? The difference is often quality.
Is your patent application only good enough to get through the examination process? Or has it been crafted to stand the tests of time and varied audiences if you later need to assert that document against an infringer, find yourself litigating with it in an Article 3 Court at the hands of a judge and jury, God forbid, end up having to defend its validity at the PTAB, or even needing to use it to block pirated imports at the International Trade Commission? The difference is often quality.
Quality will be our focus for a good chunk of the remainder of this season. What goes into a quality patent, and where possible, how do you get it without breaking the bank?
** Episode Overview **
In this first episode of our quality series, Kristen Hansen and the panel discuss:
⦿ What do we mean when we say patent quality?
⦿ Why is patent quality important?
⦿ How to balance quality and budget
⦿ The importance of searching, continuations, and draftsperson domain expertise
⦿ Very practical tips, tricks, examples, and Kristen’s Musts for drafting quality applications
https://www.aurorapatents.com/patently-strategic-podcast.html
7 Most Powerful Solar Storms in the History of Earth.pdfEnterprise Wired
Solar Storms (Geo Magnetic Storms) are the motion of accelerated charged particles in the solar environment with high velocities due to the coronal mass ejection (CME).
Comparison Table of DiskWarrior Alternatives.pdfAndrey Yasko
To help you choose the best DiskWarrior alternative, we've compiled a comparison table summarizing the features, pros, cons, and pricing of six alternatives.
Understanding Insider Security Threats: Types, Examples, Effects, and Mitigat...Bert Blevins
Today’s digitally connected world presents a wide range of security challenges for enterprises. Insider security threats are particularly noteworthy because they have the potential to cause significant harm. Unlike external threats, insider risks originate from within the company, making them more subtle and challenging to identify. This blog aims to provide a comprehensive understanding of insider security threats, including their types, examples, effects, and mitigation techniques.
How RPA Help in the Transportation and Logistics Industry.pptxSynapseIndia
Revolutionize your transportation processes with our cutting-edge RPA software. Automate repetitive tasks, reduce costs, and enhance efficiency in the logistics sector with our advanced solutions.
INDIAN AIR FORCE FIGHTER PLANES LIST.pdfjackson110191
These fighter aircraft have uses outside of traditional combat situations. They are essential in defending India's territorial integrity, averting dangers, and delivering aid to those in need during natural calamities. Additionally, the IAF improves its interoperability and fortifies international military alliances by working together and conducting joint exercises with other air forces.
Fluttercon 2024: Showing that you care about security - OpenSSF Scorecards fo...Chris Swan
Have you noticed the OpenSSF Scorecard badges on the official Dart and Flutter repos? It's Google's way of showing that they care about security. Practices such as pinning dependencies, branch protection, required reviews, continuous integration tests etc. are measured to provide a score and accompanying badge.
You can do the same for your projects, and this presentation will show you how, with an emphasis on the unique challenges that come up when working with Dart and Flutter.
The session will provide a walkthrough of the steps involved in securing a first repository, and then what it takes to repeat that process across an organization with multiple repos. It will also look at the ongoing maintenance involved once scorecards have been implemented, and how aspects of that maintenance can be better automated to minimize toil.
What’s New in Teams Calling, Meetings and Devices May 2024
ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP VARIANTS
1. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
DOI : 10.5121/ijasuc.2013.4402 17
ANALYSIS OF PROACTIVE AND REACTIVE
MANET ROUTING PROTOCOLS UNDER
SELECTED TCP VARIANTS
Iffat Syad1
, Sehrish Abrejo2
and Asma Ansari3
1
Department of Computer Science, Model College for Girls, Islamabad
iffatsheerazi@hotmail.com
2
Department of Computer Science, Isra University, Hyderabad
Sehrish.abrejo@isra.edu.pk
3
Department of Computer Science, Isra University, Hyderabad
asma.ansari@isra.edu.pk
ABSTRACT
A Mobile Ad hoc Network (MANET), with its inherent dynamic and flexible architecture, demonstrates
attractive potential for military applications. It is able to overcome traditional communications limitations
through its automatic relaying and self-healing/forming features. MANET nodes perform the routing
functions themselves. Due to the limited wireless transmission range, the routing generally consists of
multiple hops. Therefore, the nodes depend on one another to forward packets to the destinations. In a
Mobile Ad Hoc Network (MANET), temporary link failures and route changes happen frequently. With the
assumption that all packet losses are due to congestion, Transport Control Protocol (TCP) performs poorly
in such an environment. One problem of TCP in such environments is its inability to distinguish losses
induced by the lossy wireless channel from the ones due to network congestion. Many TCP variants have
been developed for the improved performance of TCP in MANET. In this research, through simulations
that were carried out by using Network Simulator-2 (NS-2) , the selected MANET Routing protocols i.e.
DSR and DSDV were analyzed in accordance with their finest performance of packets delivery rate,
average end-to-end delay, and packet dropping, under TCP Vegas and TCP Newreno with mobility
consideration. The simulation results indicate that DSDV has a better throughput performance but higher
average end-to-end delay and packet drop ratio as compared to DSR
KEYWORDS
Mobile Ad hoc Networks, TCP Variants, Routing Protocols
1. INTRODUCTION
Mobile Ad hoc Network (MANET) is a collection of self-configuring mobile node without any
infrastructure network [1]. In this network, mobile nodes communicate with each other without
any base station. In the absence of base station, mobile nodes use multi-hop path from source to
destination, in which nodes can act as routers to forward data. Each of the nodes contains a
wireless interface. These nodes communicate over either radio or infrared. If a mobile node is
within the range of other mobile, then a route is established as show in Figure 1.
2. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
18
Ad hoc networking can be deployed anywhere where there is no communication or the existing
infrastructure is inconvenient and expensive to use. Typical applications where MANET can be
used are Military Battlefield, Personal Area Network (PAN), Commercial Sector, Emergency
search-and-rescue operations etc. It is featured by dynamic topology (infrastructure-less),
multihop communication, limited resources (bandwidth, CPU, battery, etc.) and limited security
[2]. Due to its dynamic nature, a mobile node can leave or join the network at any time, which
can cause the route to be discovered again. To find and maintain an optimal route, many routing
algorithms have been proposed. These routing algorithms are categorized as Proactive and
Reactive. Proactive routing algorithms are those which maintain routing tables and keep track of
changes in the network, so the route is available at the time of data transmission. On the other
hand, reactive routing algorithms are used to establish a route on-demand, i.e. when one node
wants to send data to other node within the network.
In traditional wired networks, TCP/IP protocol was designed to provide reliable end-to-end
communication between nodes. But in case of ad hoc networks, the packet loss is due to
congestion in the network and due to frequent link failures. TCP performs poor in such
environments. So many variants have been proposed to improve its performance. This research is
carried out to investigate the performance of two MANET routing protocols; namely DSDV and
DSR under TCP Vegas and TCP Newreno on the basis of Packet Delivery Ratio, End-to-end
Delay and Packet Drop.
Figure1. Mobile Ad hoc Network with six wireless nodes
The remainder of the paper is organized as follows: section 2 briefly reviews the two routing
protocols, DSR and DSDV; section 3 covers simulation parameters used for simulations; section
4 is used to describe the simulation performance of two routing protocols; section 5 presents
discussion and section 6 concludes this paper.
2. ROUTING IN MANETS
The routing is the act of moving information (packets) across a network from a source to a
destination.
3. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
19
The routing infrastructure needs to be established in a distributed, self-organized way due to node
mobility. The MANET routing protocols can be divided into three categories [3]. Such protocols
must deal with the typical limitations of these networks, which include high power consumption,
low bandwidth, and high error rates. These routing protocols derived from distance vector or link
state [4] routing algorithms may be generally categories as:
• Proactive protocols or table driven protocols
• Reactive protocols or on-demand protocols
• Hybrid Routing protocols
2.1 Proactive Routing Protocols
Proactive routing protocols are distance-vector [5] and link-state based. These routing protocols
attempt to maintain consistent, up-to-date routing information from each node to every other node
in the network. These protocols require each node to maintain one or more tables to store routing
information, and they respond to changes in network topology by propagating updates throughout
the network in order to maintain a consistent network view. The areas in which they differ are the
number of necessary routing-related tables and the methods by which changes in network
structure are broadcast.
Advantages
In proactive routing protocols, any time when a route is needed, a route is already available in the
table. Proactive or table driven protocols can reduce the average delay per packet.
Disadvantages
However, purely proactive schemes are not appropriate for reconfigurable wireless ad hoc
network environment, as they continuously use a large portion of the network capacity to keep the
routing information current. Since the node movement may be quite fast and the topology
changes may be more frequent than the route requests, most of this routing information may
never be used. This results in a further waste of the network capacity.
The following section describes the DSDV routing protocol in detail because as DSDV is used in
the simulations.
2.1.1 Destination-sequenced Distance-vector Routing Protocol (DSDV)
Distance-Sequenced Distance-Vector (DSDV) [6] is a table driven routing protocol for mobile
ad-hoc networks which is based on the Bellman-Ford algorithm. Each node in the network
maintains a routing table in which is listed every destination and the number of hops required to
reach that destination. In addition each entry in the routing table also includes a sequence number
which is given by the destination node. When a node is starting to send information it will choose
on-first-basis the route to destination with the most recent sequence number. It is more likely that
the most recently discovered route is still active compared to older ones. If there is more than one
route to the same destination with the same sequence number, then the path with the lowest hop
count is chosen.
4. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
20
Each node in the network periodically transmits updates to other nodes about the current routing
table. The update packets can include the whole routing table of the node or just some routing
information. The packets are broadcast to nearby neighbors and upon receiving them each node
updates its own routing table. In the update procedure each node increments the number of hops,
updates the sequence number and possibly updates the address of the next router for each
destination. After the update procedure each node broadcasts its updated routing table forward.
The update packets can contain the addresses either as MAC addresses or as network addresses.
In between timed broadcasts of routing tables there are two different ways to send routing
information to other nodes. First is a full-dump where a node sends all of its routing information
and the second is an incremental where the node only sends information which has changed since
the last full-dump. Routing information is sent in Network Protocol Data Units (NPDU). An
incremental update should be small enough to fit into one NPDU. Full-dump probably takes more
than a single NPDU depending on the size of the ad-hoc network. When there is only small
amounts of movement in the ad-hoc network full-dumps should be quite infrequent, incremental
updates should be enough to keep the routing tables in order. A full-dump should be used instead
of an incremental update if the size of the incremental update approaches the size of the NPDU.
This might happen when there is much movement in a large ad-hoc network and therefore
requires many route updates. When a node receives either an incremental or a full dump routing
table update it will compare the information to its current routing table. If it contains new route
information it will store that route and increment the hop count by one. Nodes always use the
most recent information for every route. After the node has processed all of the route updates in
the NPDU it will send the changed routing table updates to its neighbors.
When nodes move across the ad-hoc network they can cause broken links in the routing tables.
When a node notices that a neighbor node has moved, it will change all of its routing tables hop
counts to infinity where the next router was that particular node and also update the sequence
number of those routes to an odd number. It will then inform its neighbors that it no longer has a
route to that node by sending a route update where the sequence number is an odd number and the
hop count is infinite. An odd sequence number is used to reflect that the path is infinite e.g. no
longer reachable. Even sequence numbers are used to inform of a working route.
2.2 Reactive Routing Protocols
A different approach from table-driven routing is reactive or on-demand routing [7]. This type of
routing creates routes only when desired by the source node. When a node requires a route to a
destination, it initiates a route discovery process within the network. This process is completed
once a route is found or all possible route permutations have been examined. Once a route has
been established, it is maintained by a route maintenance procedure until either the destination
becomes inaccessible along every path from the source or until the route is no longer desired.
The following sections discuss some of the existing on-demand ad hoc routing protocols.
2.2.1. Dynamic Source Routing
DSR is a simple and efficient routing protocol designed specifically for use in multi-hop wireless
ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and
self-configuring, without the need for any existing network infrastructure or administration. The
protocol is composed of the two main mechanisms
5. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
21
• Route Discovery
• Route Maintenance
Which work together to allow nodes to discover and maintain routes to arbitrary destinations in the
ad hoc network. All aspects of the protocol operate entirely on demand, allowing the routing packet
overhead of DSR to scale automatically to only what is needed to react to changes in the routes
currently in use. The protocol allows multiple routes to any destination and allows each sender to
select and control the routes used in routing its packets, for example, for use in load balancing or
for increased robustness. Other advantages of the DSR protocol include easily guaranteed loop-
free routing, operation in networks containing unidirectional links, use of only "soft state" in
routing, and very rapid recovery when routes in the network change. The DSR protocol is designed
mainly for mobile ad hoc networks of up to about two hundred nodes and is designed to work well
even with very high rates of mobility.
3. SIMULATION SETUP
The main objective on this research is to analyze the performance of selected two MANET routing
protocols destination sequenced distance vector routing protocol (DSDV) and Dynamic Source
Routing DSR under two different TCP variants these are TCP-Newreno and TCP-Vegas. The
analysis work is carried out by the means of a NS2-simulator. Table 1 summarizes various
parameters use to setup simulation environment.
Table 1. Simulation Parameters
Variables Value Variables Value
Transmission range 250 m Traffic type TCP
Simulation time 900 s Packet rate 4 packets/sec
Topology size 1000 m x 800 m Packet size 512 bytes
Total nodes 50 Maximum Speed 20 m/s
Mobility model Random Waypoint Number of sources 10
Pause time 10s, 250s, 700s NS-2 Version NS-2.34
4. SIMULATION RESULTS
This section describes the results achieved from the simulations. To analyze the affect of
simulations, 10 mobility scenario files were generated for pause-time 10s, 250s and 700s.
Furthermore, the traffic load is fixed to 10 sources, generating 4 packets per second. The results
generated by simulator in the trace files were analyzed with the help of AWK script. There are
three performance metrics that are measured in these simulations, namely, packet delivery
fraction, average end-to-end delay and Total Packet Dropped.
4.1. Packet Delivery Ratio (PDF)
The PDF is defined as the number of received data divided by the number of packets generated.
For good performance and increased throughput, higher PDF shows the effectiveness of any
protocol in MANET. In these study two protocols namely DSR and DSDV are analyzed under
TCP Vegas and TCP Newreno. On analyzing the graph of Packet Delivery ratio (Figure 2, 3),
6. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
22
results shown that DSDV have good performance and increased throughput, in most of the cases
as compared to DSR.
Figure 2. PDF in TCP Newreno
Figure 3. PDF in TCP Vegas
4.2. Average End-to-End Delay
The End-to-End Delay is defined as the time a data packet takes to travel from source to the
destination. Average End-to-End Delay is the delay perceived by all the packets including route
acquisition delay. Figure 4 and Figure 5 show, the average End-to end delay for two selected
MANET routing protocols namely DSR, and DSDV. It shows variations in the graph, DSDV has
highest End-to-End delay at pause time 10, because DSDV protocol keeps packets in queues
indefinitely until they are delivered to the next hop or the destination node. Therefore, it delivers
the older packets rather than the newer ones, and hence there is an increase in average end- to-
end delay for DSDV protocol, and having lowest End-to-End delay at pause time 250 and in TCP
Newreno highest End-to-delay was at pause time 250.
7. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
23
Figure 4. Average End-to-End Delay in TCP Newreno
Figure 5. Average End-to-End Delay in TCP Vegas
4.3. Total Packet Dropped
Since wireless is a loose environment and especially when there is MANET, connection
formation and deformation is usually present. So packet dropping refers to the loss of packet due
to no connection availability or nodes are not in the range of each other. As mentioned previously
that TCP Vegas is a TCP congestion control, or network congestion avoidance, algorithm that
emphasizes packet delay, rather than packet loss, as a signal to help determine the rate at which to
send packets. As shown in Figure 6 that DSDV has highest packet dropped at pause time 250
because of high mobility as compared to DSR which has lowest packet drop. Same is the case in
TCP Vegas as shown in Figure 7.
8. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
24
Figure 6. Total Packets Dropped in TCP Newreno
Figure 7. Total Packets Dropped in TCP Vegas
5. DISCUSSIONS
Following conclusions were obtained after rigorous simulations through NS-2 for analysis of two
MANET Routing Protocols under two TCP variants:
Since in this study, the major concern is related with TCP type of traffic, so the reception of TCP
packets is involved in the results. On analyzing the graph of Packet delivery rate (Figure 2),
results shows that DSDV has the highest packet delivery ratio and because of the highest PDF its
performance and throughput is better than DSR in both chosen TCP variants, the reason that
DSDV has the highest PDF is that in DSDV, efficacious route cache management is done via a
cache entry timeout that ensures that only active routes are maintained in the route cache. This
prevents the problem of a stale route entry cache. Also the use of sequence numbers prevents the
formation of routing loops; other reason is that DSDV is distance vector routing protocol,
searches for route are done only when needed. In critical analysis, Vegas are giving linear
delivery rate. The other important point to be noted from (Figure 2) is the convergence of DSR
9. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
25
protocol. This convergence fact again leads to the betterment of Vegas in different mobile
scenarios. In Figure 3, Packet delivery ratio is maintained by the DSR as mobility increases from
the (pause time 10).
DSR have difficulties to maintain fresh routing information when nodes are moving fast.
Practically all discarded packets were dropped because a stale routing table entry forwarded
packets over a broken link. DSDV maintains only one route per destination; thus in case of
broken link no alternative route can be found. DSDV seem to have generally better packet
delivery ratio than DSR that reacts heavily to changes in mobility ratios.
At different pause times DSR performance can be considered on the average as compared to
DSDV for average End-to-End Delay, the reason for this average delay is because Vegas has
better estimation approach and also its capacity to detect any congestion in advance. Vegas
attempts to keep the sending rate around a point estimated by the RTT samples. The idea is that if
we increase the sending rate, and the RTT does not increase. However, if the RTT increases as we
increase the sending rate, then we are not getting more bandwidth and instead are just taking up
more space in the queues of intermediate than necessary [9] .DSDV has the highest end-to-end
delay at pause time 10 due to high mobility and another reason is that DSDV protocol keeps
packets in queues indefinitely until they are delivered to the next hop or the destination node.
Therefore, it delivers the older packets rather than newer ones, and hence there is an increase in
average end- to- end delay for DSDV protocol. As shown in graphs (Figure 5) at pause times 10
the DSDV was suffering from the highest end to end Delay as compared to DSR. DSR has
somewhat better technique in this regard, since the destination replies only to the first arriving
RREQ. This automatically favors the least congested route instead of the shortest route.
The reasons for packet dropping may be for example are that a packet is dropped due to
congestion if the packet buffer at MAC layer is full when it arrives. When a collision is detected,
CSMA does an exponential back off, which increases the delay for sending the packet. It makes
the packet buffer to be full quickly. The packet drop ratio is high in DSDV at pause time 10 and
gradually is decreasing and overall performance of both protocols in both TCP variants that are
TCP Vegas and TCP Newreno DSR is performing well.
6. CONCLUSION AND FUTURE WORK
This paper is based on the compression of two well known protocols namely DSR and DSDV
under two TCP variants known as TCP Vegas and TCP Newreno. From the simulation performed
under three parameters i.e. Packet delivery ratio, Average End to End delay and total packets
dropped, it can be concluded that DSDV has higher packet delivery ratio where as DSR in most
cases. When we talk about the Average End to end delay as the above simulations are taken under
TCP Vegas and TCP Newreno which emphasize the packet delay, rather than packet loss, so DSR
has average performance, DSDV has highest end to end delay at pause time 10 due to high
mobility. DSDV performs very poorly if we taken it from the perspective of total packets dropped
at all pause times under both TCP variants.
The future work could be conducted with the analysis of MANET environment under different
quality of service (QoS) issues such as node energy consumption, issues of hidden and exposed
terminals, and constraints in mobility and traffic criteria. Also more MANET protocols like
Hierarchal state routing protocol (HSR), temporarily ordered routing protocol (TORA),
10. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.4, August 2013
26
Preemptive Ad hoc on-demand distance-Vector routing protocol (PAODV). Dynamic MANET
On-Demand (DYMO) can be added for better analysis and comparison of protocols under
different TCP variants. Other TCP variants can also be tested. In future more parameters will be
taken into consideration such as different traffic scenarios, congestion window size, number of
connections etc.
ACKNOWLEDGMENTS
The authors wish to acknowledge Shams Laghari, Assistant Professor, Hamdard University,
Karachi, Pakistan, for his continual support to carry out this work.
REFERENCES
[1] Param and Sharma, (2011), Performance study of Broadcast based Mobile Adhoc Routing Protocols
AODV, DSR and DYMO. In International Journal of Security and its Applications, Vol.5, No. 1, pp
53-64.
[2] Juan, Josep and Miguel, (2005), Energy Efficiency of Load Balancing in MANET Routing Protocols.
In Proceedings of the Sixth International Conference on Software Engineering, Artificial Intelligence,
Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-
Assembling Wireless Networks. pp. 476-483.
[3] Royer and Toh, (1999) A Review of Current Routing Protocols for Ad Hoc Mobile Wireless
Networks, IEEE Personal Communications.
[4] Kurose and Ross, (2004) Computer Networking: A Top Down Approach Featuring the Internet, 3rd
ed., Addison Wesley, 821 pp.
[5] Lu, Wang, Zhong and Bhargava, (2003) Study of Distance Vector Routing Protocols for Mobile Ad
hoc Networks, Proceedings of the First IEEE international conference on Pervasive Computing and
Communications (PerCom’03).
[6] Nehal and Roma, (2013), Performance Evaluation of AODV, DSDV and DSR Routing Protocols
Using NS-2 Simulator. In International Journal of Engineering Research and Applications. Vol. 3,
Issue 2, pp. 1825-1830.
[7] Johnson, Maltz, Hu, and Jetcheva, (2002). The Dynamic Source Routing Protocol for Mobile Ad Hoc
Networks (DSR), Internet Engineering Task Force (IETF).
[8] Mukesh and Kumar, (2013). The Performance Evaluation of AODV and DSR (On-Demand-Driven)
Routing Protocols using QuelNet 5.0 Simulator. In International Journal of Computer Science and
Networks, Vol 2. Issue 2, pp. 29-34.
[9] Jong, Peter, Zhen and limin, (1995) Evaluation of TCP Vegas: Emulation and Experiment. Computer
Science Department, University of Southern California, Los Angeles, CA.