19-09-2012, 03:08 PM
Efficient Ad-Hoc On-demand Distance Vector Routing Protocol using Link State Algorithm
Efficient Ad-Hoc On-demand.pdf (Size: 253.71 KB / Downloads: 39)
ABSTRACT
We developed a new algorithm for route discovery, nodes
management, and mobility handling for on-demand cache
routing on mobile Ad-Hoc networks (MANET). We used Ad-
Hoc On demand Distance Vector (AODV) protocol as the
better known reactive protocol, as well as using Link State
algorithm of the Optimize Link State Routing (OLSR)
protocol together. We used two levels of caches memory L-1
and L-2 along with link state routing table for each node.
Which maintaining by using the algorithm of OLSR, which
working under the AODV protocol. For mobility handling, we
used link state algorithm working under AODV to manage
node addition, deletion and movement in the network
efficiently. We used the Network simulator NS-2 version 2.29
to show the results comparing with the AODV used just cache
memory, and comparing with AODV without cache memory.
The results shows that our algorithms outperform comparing
with AODV without cache memories, and AODV with two
levels of cache memory on packet delivery rate, where the
link state routing protocol is used to distribute and maintain
routing information among various nodes within a domain by
using two messages which are Hello messages and Topology
Control messages (TC) .
INTRODUCTION
Mobile Ad-Hoc Network (MANET) is a collection of two or
more mobile devices or nodes or terminals with wireless
communications and networking capability that communicate
with each other without preorganization, no centralized
administrator also the wireless nodes that can dynamically
form a network to exchange information without using any
existing fixed Infrastructuresand each node can dynamically
moving in any direction. The absence of fixed
infrastructure in a MANET poses several types of
challenges. The biggest challenge among them is
routing information from source to any available
destination. The most important issue in MANET is the
routing, because more efficient routing causes more utilize
network bandwidth, more power efficiency, also may increase
the secure of an overhead congestion overall the Ad-Hoc
wireless network. There are different protocols in MANET‟s
used many routing strategies depend on networkstructure. The
most important routing protocols used with MANET can be
categorized as Table-driven(proactive), and On-
Demand(reactive).
On-demand routing protocols (Reactive)
These protocols are also called reactive protocols since they
don‟t maintain routing information or routing activity at the
network nodes if there is no communication and there are no
pre calculation of routing table for whole network. If a node
wants to send a packet to another node then this node has to
find path by using on-demand manner and establishes the
connection in order to transmit and receive the packet [3]. The
route discovery usually occurs by broadcasting the route
request packets throughout the network. There are a lot of
protocols using on-demand strategy but different manners
such as AODV, DSR, etc. AODV performs better than DSR
for high mobility cases but faces the problem of high routing
and MAC load as compared to DSR[6],[7]. This is because
DSR resorts to an aggressive use of caching of routes while
AODV does not thus there are many researches for solving
the problems that faced with the AODV by using cache
memory, that making AODV has properties of both DSDV
which is free of loop and properties of DSR after using cache
memory.
THE ON-DEMAND CACHE ROUTING
ALGORITHM USING ALGORITHM OF
OLSR
The AODV routing protocol is responsible on Route
Discovery Algorithm (RDA) by using three control messages
are “rout request” message RREQ , “reply request” message
RREP, and “error request” message RERR . We suggested to
used the algorithm of OLSR protocol working under the
AODV as part of the AODV protocol for handling the
Mobility Handling Algorithm (MHA) by using Hello
message, where each node is responsible on sending Hello
message whenever it joint to a network or changed its
position, also sending Hello message periodically to know
who are its current neighbours, where the neighbour
information are stored in the neighbour set of each node. For
tracking the link state between a node and its neighbours,
using tuple set to store any available information about the
neighbours links such as types of link; synchronized link
(SYN)(e.g. unidirection) and asynchronized link (ASYN) (e.g.
bidirections) and the interface addresses of local node and
neighbour node storing in the link tuple . From these
information each node will select set of its one hopneighbours
as Multi-pint Relay (MPR). The MPR nodes is the
responsible to generate Topology Control Message (TC). TC
is used for Node Functions Management (NFM) by
calculating routing table.
CONCLUSION
In this paper, we proposed an efficient Ad-Hoc On-demand
Distance Vector routing algorithm, using the algorithm of
Optimize link State Protocol. Where AODV protocol is
responsible on Route DiscoveryAlgorithm,and OLSR protocol
is responsible on the Mobility Handling and Node Functions
Management. We got the benefits of both protocols AODV as
reactive protocol and OLSR as proactive protocol. Also we ot
the benefit from applied Two level of cache memory for each
node level one L-1 and level two L-2, which are used to keep
paths from the Route Discovery Algorithm . The most
important control messages are used by AODV are RREQ,
RREP, RERR, and the most important control messages used
by OLSR as part of AODV are TC, Hello messages. We
applied AODV protocol as the best protocol of reactive
protocol because it already has feature of old AODV(old
version without cache memory) which is loop free , and have
features of DSR (which is have cache memory). We test our
design by using the Network Simulator (NS 2.29). The
simulation results show that our On-Demand Cache Routing
with LS algorithm.