120 research outputs found
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
Exploiting the power of multiplicity: a holistic survey of network-layer multipath
The Internet is inherently a multipath network: For an underlying network with only a single path, connecting various nodes would have been debilitatingly fragile. Unfortunately, traditional Internet technologies have been designed around the restrictive assumption of a single working path between a source and a destination. The lack of native multipath support constrains network performance even as the underlying network is richly connected and has redundant multiple paths. Computer networks can exploit the power of multiplicity, through which a diverse collection of paths is resource pooled as a single resource, to unlock the inherent redundancy of the Internet. This opens up a new vista of opportunities, promising increased throughput (through concurrent usage of multiple paths) and increased reliability and fault tolerance (through the use of multiple paths in backup/redundant arrangements). There are many emerging trends in networking that signify that the Internet's future will be multipath, including the use of multipath technology in data center computing; the ready availability of multiple heterogeneous radio interfaces in wireless (such as Wi-Fi and cellular) in wireless devices; ubiquity of mobile devices that are multihomed with heterogeneous access networks; and the development and standardization of multipath transport protocols such as multipath TCP. The aim of this paper is to provide a comprehensive survey of the literature on network-layer multipath solutions. We will present a detailed investigation of two important design issues, namely, the control plane problem of how to compute and select the routes and the data plane problem of how to split the flow on the computed paths. The main contribution of this paper is a systematic articulation of the main design issues in network-layer multipath routing along with a broad-ranging survey of the vast literature on network-layer multipathing. We also highlight open issues and identify directions for future work
Multipath Routing over Wireless Mesh Networks
Master'sMASTER OF SCIENC
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
A multipath energy-conserving routing protocol for wireless ad hoc networks lifetime improvement
Ad hoc networks are wireless mobile networks that can operate without
infrastructure and without centralized network management. Traditional
techniques of routing are not well adapted. Indeed, their lack of reactivity
with respect to the variability of network changes makes them difficult to use.
Moreover, conserving energy is a critical concern in the design of routing
protocols for ad hoc networks, because most mobile nodes operate with limited
battery capacity, and the energy depletion of a node affects not only the node
itself but also the overall network lifetime. In all proposed single-path
routing schemes a new path-discovery process is required once a path failure is
detected, and this process causes delay and wastage of node resources. A
multipath routing scheme is an alternative to maximize the network lifetime. In
this paper, we propose an energy-efficient multipath routing protocol, called
AOMR-LM (Ad hoc On-demand Multipath Routing with Lifetime Maximization), which
preserves the residual energy of nodes and balances the consumed energy to
increase the network lifetime. To achieve this goal, we used the residual
energy of nodes for calculating the node energy level. The multipath selection
mechanism uses this energy level to classify the paths. Two parameters are
analyzed: the energy threshold beta and the coefficient alpha. These parameters
are required to classify the nodes and to ensure the preservation of node
energy. Our protocol improves the performance of mobile ad hoc networks by
prolonging the lifetime of the network. This novel protocol has been compared
with other protocols: AOMDV and ZD-AOMDV. The protocol performance has been
evaluated in terms of network lifetime, energy consumption, and end-to-end
delay
- âŠ