101 research outputs found
Node Disjoint Multipath Routing Approach for Controlling Congestion in MANETs
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Nodedisjoint routing becomes inessential technique in communication of packets among various nodes in networks. Meanwhile AODV (Ad Hoc On-demand Multipath Distance Vector) creates single-path route between a pair of source and destination nodes. Some researches has done so far to make multipath node-disjoint routing based on AODV protocol. But however their overhead and end-to-end delay are relatively high, while the detail of their code is not available too. In an ad hoc network, identification of all node-disjoint paths between a given pair of nodes is a challenging task. The phenomena that a protocol is not able to identify all node-disjoint paths that exist between a given pair of nodes is called path diminution. In this paper, we discuss that path diminution is unavoidable when a protocol discovers multiple node-disjoint paths in a single route discovery and working of node disjoint multipath protocol
An enhanced Multipath Strategy in Mobile Ad hoc Routing Protocols
The various routing protocols in Mobile Ad hoc Networks follow different
strategies to send the information from one node to another. The nodes in the
network are non static and they move randomly and are prone to link failure
which makes always to find new routes to the destination. This research mainly
focused on the study of the characteristics of multipath routing protocols in
MANETS. Two of the multipath routing protocols were investigated and a
comparative study along with simulation using NS2 was done between DSR and AODV
to propose an enhanced approach to reach the destination maintaining the QoS. A
possible optimization to the DSR and AODV routing protocols was proposed to
make no node to be overburdened by distributing the load after finding the
alternate multipath routes which were discovered in the Route discovery
process. The simulation shows that the differences in the protocol highlighted
major differences with the protocol performance. These differences have been
analyzed with various network size, mobility, and network load. A new search
table named Search of Next Node Enquiry Table (SONNET) was proposed to find the
best neighbor node. Using SONNET the node selects the neighbor which can be
reached in less number of hops and with less time delay and maintaining the
QoS
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
Elliptic Curve Cryptography Based Data Transmission against Blackhole Attack in MANET
Mobile nodes roaming around in the hostile environment of mobile adhoc network (MANET) play the role of router as well as terminal. While acting as a router, a node needs to choose a reliable routing protocol. Besides, an encryption algorithm is needed to secure data to be conveyed through the unfriendly atmosphere while acting as a terminal. We have implemented Elliptic Curve Cryptography (ECC) along with Adhoc On Demand Multipath Distance Vector (AOMDV) routing protocol to secure data transmission against blackhole attack in a MANET. ECC, a public key cryptography that works on discrete logarithm problem with a much smaller key size, has been used to encrypt data packets at source node before transmission. We have used AOMDV, a reliable routing protocol compared to its parent protocol, Adhoc On Demand Distance Vector (AODV), with a multipath extension, for routing. The encrypted packets transferring between nodes via AOMDV, has been proved secured against blackhole attack. The performance of the secured protocol has been analyzed in terms of different performance metrics and in terms of varying number of blackhole attacker nodes
Study of Routing Protocols in Telecommunication Networks
In this paper we have discussed the problem of routing in telecommunication networks and the salient characteristics of some of the most popular routing schemes. In particular, we have discussed the characteristics of adaptive and multipath routing solutions versus static and single-path strategies
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
Multipath routing and QoS provisioning in mobile ad hoc networks
PhDA Mobile Ad Hoc Networks (MANET) is a collection of mobile nodes that can
communicate with each other using multihop wireless links without utilizing any
fixed based-station infrastructure and centralized management. Each mobile node
in the network acts as both a host generating flows or being destination of flows
and a router forwarding flows directed to other nodes.
Future applications of MANETs are expected to be based on all-IP
architecture and be capable of carrying multitude real-time multimedia
applications such as voice and video as well as data. It is very necessary for
MANETs to have an efficient routing and quality of service (QoS) mechanism to
support diverse applications.
This thesis proposes an on-demand Node-Disjoint Multipath Routing protocol
(NDMR) with low broadcast redundancy. Multipath routing allows the
establishment of multiple paths between a single source and single destination
node. It is also beneficial to avoid traffic congestion and frequent link breaks in
communication because of the mobility of nodes. The important components of
the protocol, such as path accumulation, decreasing routing overhead and
selecting node-disjoint paths, are explained. Because the new protocol
significantly reduces the total number of Route Request packets, this results in an
increased delivery ratio, smaller end-to-end delays for data packets, lower control
overhead and fewer collisions of packets.
Although NDMR provides node-disjoint multipath routing with low route
overhead in MANETs, it is only a best-effort routing approach, which is not
enough to support QoS. DiffServ is a standard approach for a more scalable way
to achieve QoS in any IP network and could potentially be used to provide QoS
in MANETs because it minimises the need for signalling. However, one of the
biggest drawbacks of DiffServ is that the QoS provisioning is separate from the
routing process. This thesis presents a Multipath QoS Routing protocol for
iv
supporting DiffServ (MQRD), which combines the advantages of NDMR and
DiffServ. The protocol can classify network traffic into different priority levels
and apply priority scheduling and queuing management mechanisms to obtain
QoS guarantees
- âŠ