4,299 research outputs found
Improving Energy Efficiency in MANETs by Multi-Path Routing
Some multi-path routing algorithm in MANET, simultaneously send information
to the destination through several directions to reduce end-to-end delay. In
all these algorithms, the sent traffic through a path affects the adjacent path
and unintentionally increases the delay due to the use of adjacent paths.
Because, there are repetitive competitions among neighboring nodes, in order to
obtain the joint channel in adjacent paths. The represented algorithm in this
study tries to discover the distinct paths between source and destination nodes
with using Omni directional antennas, to send information through these
simultaneously. For this purpose, the number of active neighbors is counted in
each direction with using a strategy. These criterions are effectively used to
select routes. Proposed algorithm is based on AODV routing algorithm, and in
the end it is compared with AOMDV, AODVM, and IZM-DSR algorithms which are
multi-path routing algorithms based on AODV and DSR. Simulation results show
that using the proposed algorithm creates a significant improvement in energy
efficiency and reducing end-to-end delay
Simulation and Performance Analysis of MP-OLSR for Mobile Ad hoc Networks
Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile
nodes which dynamically exchange data without reliance on a fixed base station
or a wired backbone network, which makes routing a crucial issue for the design
of a ad hoc networks. In this paper we discussed a hybrid multipath routing
protocol named MP-OLSR. It is based on the link state algorithm and employs
periodic exchange of messages to maintain topology information of the networks.
In the mean time, it updates the routing table in an on-demand scheme and
forwards the packets in multiple paths which have been determined at the
source. If a link failure is detected, the algorithm recovers the route
automatically. Concerning the instability of the wireless networks, the
redundancy coding is used to improve the delivery ratio. The simulation in NS2
shows that the new protocol can effectively improve the performance of the
networks
Local heuristic for the refinement of multi-path routing in wireless mesh networks
We consider wireless mesh networks and the problem of routing end-to-end
traffic over multiple paths for the same origin-destination pair with minimal
interference. We introduce a heuristic for path determination with two
distinguishing characteristics. First, it works by refining an extant set of
paths, determined previously by a single- or multi-path routing algorithm.
Second, it is totally local, in the sense that it can be run by each of the
origins on information that is available no farther than the node's immediate
neighborhood. We have conducted extensive computational experiments with the
new heuristic, using AODV and OLSR, as well as their multi-path variants, as
underlying routing methods. For two different CSMA settings (as implemented by
802.11) and one TDMA setting running a path-oriented link scheduling algorithm,
we have demonstrated that the new heuristic is capable of improving the average
throughput network-wide. When working from the paths generated by the
multi-path routing algorithms, the heuristic is also capable to provide a more
evenly distributed traffic pattern
- …