561 research outputs found
Cache timeout strategies for on-demand routing in MANETs
Varying the route caching scheme can significantly
change network performance for on-demand routing protocols
in mobile ad hoc networks (MANETs). Initial
route caching schemes retain paths or links until they are
shown to be broken. However, stale routing information
can degrade network performance with latency and extra
routing overhead. Therefore, more recent caching schemes
delete links at some fixed time after they enter the cache.
This paper proposes using either the expected path duration
or the link residual time as the link cache timeout.
These mobility metrics are theoretically calculated for an
appropriate random mobility model. Simulation results in
NS2 show that both of the proposed link caching schemes
can improve network performance in the dynamic source
routing protocol (DSR) by reducing dropped data packets,
latency and routing overhead, with the link residual time
scheme out-performing the path duration scheme.IEEE, South Australian Sectio
Performance evaluation of dynamic source routing protocol with variation in transmission power and speed
Mobile ad-hoc network (MANET) is a set of mobile wireless nodes (devices) which is not rely on a fixed infrastructure. In MANETs, each device is responsible for routing its data according to a specific routing protocol. The three most common MANET routing protocols are: dynamic source routing protocol (DSR), optimized link state routing protocol (OLSR), and ad-hoc on-demand distance vector (AODV). This paper proposes an efficient evaluation of DSR protocol by testing the MANETs routing protocol with variation in transmission power at different speeds. The performance analysis has been given using optimized network engineering tools (OPNET) modeler simulations and evaluated using metrics of average end to end delay and throughput. The results show that the throughput increases as the transmission power increases up to a certain value after which the throughput decreases, also the network work optimally at a certain transmission power which varied at different speed
Performance Analysis of Reactive Routing Protocols AODV, DYMO, DSR, LAR in MANETs
MANETs are one the cutting-edgeevolving wireless technologies. The routing in mobile ad hoc networksplays a vital role and has been researchedwide-range in last decade. The routing protocols are classified as proactive,reactive and hybrid. Reactive routing protocols are considered for its advantages compared to others. In this paper, reactive routing protocols, Ad Hoc On-demand Distance Vector (AODV), Dynamic MANET On-demand (DYMO) protocol, Dynamic Source Routing protocol (DSR), Location Aided Routing protocol have been selected to analyze the performance and compare the routing protocols by varying Network size and Mobility speed to various levels. The performance metrics analyzed were Average Throughput, Average End-to-End Delay, Average Jitter, Energy Consumed in Transmit Mode, Energy Consumed in Receive Mode. The simulations were carried on Exata 5.4 simulator. The analysis of the routing protocols for the configuration setting is presented at the conclusion
On Leveraging Partial Paths in Partially-Connected Networks
Mobile wireless network research focuses on scenarios at the extremes of the
network connectivity continuum where the probability of all nodes being
connected is either close to unity, assuming connected paths between all nodes
(mobile ad hoc networks), or it is close to zero, assuming no multi-hop paths
exist at all (delay-tolerant networks). In this paper, we argue that a sizable
fraction of networks lies between these extremes and is characterized by the
existence of partial paths, i.e. multi-hop path segments that allow forwarding
data closer to the destination even when no end-to-end path is available. A
fundamental issue in such networks is dealing with disruptions of end-to-end
paths. Under a stochastic model, we compare the performance of the established
end-to-end retransmission (ignoring partial paths), against a forwarding
mechanism that leverages partial paths to forward data closer to the
destination even during disruption periods. Perhaps surprisingly, the
alternative mechanism is not necessarily superior. However, under a stochastic
monotonicity condition between current v.s. future path length, which we
demonstrate to hold in typical network models, we manage to prove superiority
of the alternative mechanism in stochastic dominance terms. We believe that
this study could serve as a foundation to design more efficient data transfer
protocols for partially-connected networks, which could potentially help
reducing the gap between applications that can be supported over disconnected
networks and those requiring full connectivity.Comment: Extended version of paper appearing at IEEE INFOCOM 2009, April
20-25, Rio de Janeiro, Brazi
Vector Based Routing Through Dual Sink in Wireless Sensor Network
Wireless sensor network is emerging as powerful technique, There are many protocols are discovered for wireless sensor network. While process of transmitting the data consumes energy of each node so energy consumption is one of the important corner in wireless sensor network .dual sink vector based forwarding(DS-VBF) takes both remaining energy and location information as regarded factor to discover an optimized path to save energy in network. The modified routing protocol place dual sink in to the network which improves the network life time. according to the deployment of dual sink packet delivery ratio and end to end delay are enhanced .the simulation result in comparing with VBF end to end delay are reduced more than 80%,remaing energy increased 10% increment of packet reception ratio was about 70%.
DOI: 10.17762/ijritcc2321-8169.15027
On Energy Efficiency and Delay Minimization in Reactive Protocols in Wireless Multi-hop Networks
In Wireless Multi-hop Networks (WMhNs), routing protocols with energy
efficient and delay reduction techniques are needed to fulfill users demands.
In this paper, we present Linear Programming models (LP_models) to assess and
enhance reactive routing protocols. To practically examine constraints of
respective LP_models over reactive protocols, we select AODV, DSR and DYMO. It
is deduced from analytical simulations of LP_models in MATLAB that quick route
repair reduces routing latency and optimizations of retransmission attempts
results efficient energy utilization. To provide quick repair, we enhance AODV
and DSR. To practically examine the efficiency of enhanced protocols in
different scenarios of WMhNs, we conduct simulations using NS- 2. From
simulation results, enhanced DSR and AODV achieve efficient output by
optimizing routing latencies and routing load in terms of retransmission
attempts
On the Experimental Evaluation of Vehicular Networks: Issues, Requirements and Methodology Applied to a Real Use Case
One of the most challenging fields in vehicular communications has been the
experimental assessment of protocols and novel technologies. Researchers
usually tend to simulate vehicular scenarios and/or partially validate new
contributions in the area by using constrained testbeds and carrying out minor
tests. In this line, the present work reviews the issues that pioneers in the
area of vehicular communications and, in general, in telematics, have to deal
with if they want to perform a good evaluation campaign by real testing. The
key needs for a good experimental evaluation is the use of proper software
tools for gathering testing data, post-processing and generating relevant
figures of merit and, finally, properly showing the most important results. For
this reason, a key contribution of this paper is the presentation of an
evaluation environment called AnaVANET, which covers the previous needs. By
using this tool and presenting a reference case of study, a generic testing
methodology is described and applied. This way, the usage of the IPv6 protocol
over a vehicle-to-vehicle routing protocol, and supporting IETF-based network
mobility, is tested at the same time the main features of the AnaVANET system
are presented. This work contributes in laying the foundations for a proper
experimental evaluation of vehicular networks and will be useful for many
researchers in the area.Comment: in EAI Endorsed Transactions on Industrial Networks and Intelligent
Systems, 201
- …