Wired Networks

These networks are generally connected with the help of wires and cables. Generally the cables
being used in this type of networks are CAT5 or CAT6 cables. The connection is usually established
with the help of physical devices like Switches and Hubs in between to increase the strength of the
connection. These networks are usually more efficient, less expensive and much faster than wireless
networks. Once the connection is set there
is a very little chance of getting disconnected.

Advantages
– A wired network offer connection speeds of 100Mbps to 1000Mbps
– Physical, fixed wired connections are not prone to interference and fluctuations in
available bandwidth, which can affect some wireless networking connections.

Disadvantages over wireless networks

– Expensive to maintain the network due to many cables between computer systems
and even if a failure in the cables occur then it will be very hard to replace that
particular cable as it involved more and more costs.
– When using a laptop which is required to be connected to the network, a wired
network will limit the logical reason of purchasing a laptop in the first place.

Wireless Networks
Wireless networks use some sort of radio frequencies in air to transmit and receive data instead of
using some physical cables. The most admiring fact in these networks is that it eliminate the need for
laying out expensive cables and maintenance costs.

Advantages of Wireless Networks

– Mobile users are provided with access to real-time information even when they are
away from their home or office.
– Setting up a wireless system is easy and fast and it eliminates the need for pulling
out the cables through walls and ceilings.
– Network can be extended to places which can not be wired.
– Wireless networks offer more flexibility and adapt easily to changes in the configuration
of the network.

Disadvantages of Wireless Networks

– Interference due to weather, other radio frequency devices , or obstructions like
walls.

– The total Throughput is affected when multiple connections exists.

Mobile Ad-hoc Networks

An ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the
aid of any stand-alone infrastructure or centralized administration . Mobile Ad-hoc networks are
self-organizing and self-configuring multihop wireless networks where, the structure of the network
changes dynamically. This is mainly due to the mobility of the nodes . Nodes in these networks
utilize the same random access wireless channel, cooperating in a friendly manner to engaging
themselves in multihop forwarding. The nodes in the network not only acts as hosts but also as
routers that route data to/from other nodes in network .

In mobile ad-hoc networks where there is no infrastructure support as is the case with wireless
networks, and since a destination node might be out of range of a source node transmitting packets; a
routing procedure is always needed to find a path so as to forward the packets appropriately between
the source and the destination. Within a cell, a base station can reach all mobile nodes without
routing via broadcast in common wireless networks. In the case of ad-hoc networks, each node must
be able to forward data for other nodes. This creates additional problems along with the problems of
dynamic topology which is unpredictable connectivity changes

AODV

Ad hoc On-Demand Distance Vector (AODV) Routing is a routing protocol for mobile ad hoc
networks (MANETs) and other wireless ad-hoc networks. It is jointly developed in Nokia Research
Center, University of California, Santa Barbara and University of Cincinnati by C. Perkins, E.
Belding-Royer and S. Das

It is a reactive routing protocol, meaning that it establishes a route to a destination only on demand.
In contrast, the most common routing protocols of the Internet are proactive, meaning they find
routing paths independently of the usage of the paths. AODV is, as the name indicates, a distance-
vector routing protocol. AODV avoids the counting-to-infinity problem of other distance-vector
protocols by using sequence numbers on route updates, a technique pioneered by DSDV. AODV is
capable of both unicast and multicast routing.

Workings

In AODV, the network is silent until a connection is needed. At that point the network node that
needs a connection broadcasts a request for connection. Other AODV nodes forward this message,
and record the node that they heard it from, creating an explosion of temporary routes back to the
needy node. When a node receives such a message and already has a route to the desired node, it
sends a message backwards through a temporary route to the requesting node. The needy node then
begins using the route that has the least number of hops through other nodes. Unused entries in the
routing tables are recycled after a time.

When a link fails, a routing error is passed back to a transmitting node, and the process repeats.

Much of the complexity of the protocol is to lower the number of messages to conserve the capacity
of the network. For example, each request for a route has a sequence number. Nodes use this
sequence number so that they do not repeat route requests that they have already passed on. Another
such feature is that the route requests have a "time to live" number that limits how many times they
can be retransmitted. Another such feature is that if a route request fails, another route request may
not be sent until twice as much time has passed as the timeout of the previous route request.

The advantage of AODV is that it creates no extra traffic for communication along existing links.
Also, distance vector routing is simple, and doesn't require much memory or calculation. However
AODV requires more time to establish a connection, and the initial communication to establish a
route is heavier than some other approaches.
Technical description

The AODV Routing protocol uses an on-demand approach for finding routes, that is, a route is
established only when it is required by a source node for transmitting data packets. It employs
destination sequence numbers to identify the most recent path. The major difference between AODV
and Dynamic Source Routing (DSR) stems out from the fact that DSR uses source routing in which
a data packet carries the complete path to be traversed. However, in AODV, the source node and the
intermediate nodes store the next-hop information corresponding to each flow for data packet
transmission. In an on-demand routing protocol, the source node floods the RouteRequest packet in
the network when a route is not available for the desired destination. It may obtain multiple routes to
different destinations from a single RouteRequest. The major difference between AODV and other
on-demand routing protocols is that it uses a destination sequence number (DestSeqNum) to
determine an up-to-date path to the destination. A node updates its path information only if the
DestSeqNum of the current packet received is greater than the last DestSeqNum stored at the node.

A RouteRequest carries the source identifier (SrcID), the destination identifier (DestID), the source
sequence number (SrcSeqNum), the destination sequence number (DestSeqNum), the broadcast
identifier (BcastID), and the time to live (TTL) field. DestSeqNum indicates the freshness of the
route that is accepted by the source. When an intermediate node receives a RouteRequest, it either
forwards it or prepares a RouteReply if it has a valid route to the destination. The validity of a route
at the intermediate node is determined by comparing the sequence number at the intermediate node
with the destination sequence number in the RouteRequest packet. If a RouteRequest is received
multiple times, which is indicated by the BcastID-SrcID pair, the duplicate copies are discarded. All
intermediate nodes having valid routes to the destination, or the destination node itself, are allowed
to send RouteReply packets to the source. Every intermediate node, while forwarding a
RouteRequest, enters the previous node address and its BcastID. A timer is used to delete this entry
in case a RouteReply is not received before the timer expires. This helps in storing an active path at
the intermediate node as AODV does not employ source routing of data packets. When a node
receives a RouteReply packet, information about the previous node from which the packet was
received is also stored in order to forward the data packet to this next node as the next hop toward
the destination

As RREQ travels from node to node, it automatically sets up the reverse path from
all these nodes back to the source. Each node that receives this packet records the address of the
node from which it was received. This is called Reverse Path Setup. The nodes maintain this info for
enough time for the RREQ to traverse the network and produce a reply to the sender and time
depends on network size.
If an intermediate node has a route entry for the desired destination in its routing table, it compares
the destination sequence number in its routing table with that in the RREQ. If the destination
sequence number in its routing table is less than that in the RREQ, it rebroadcasts the RREQ to its
neighbors. Otherwise, it unicasts a route reply packet to its neighbor from which it was received the
RREQ if the same request was not processed previously (this is identified using the broadcase-id and
source-addr).
Once the RREP is generated, it travels back to the source, based on the reverse path that it has set in
it until traveled to this node. As the RREP travels back to source, each node along this path sets a
forward pointer to the node from where it is receiving the RREP and records the latest destination
sequence number to the request destination.
This is called Forward Path Setup.
If an intermediate node receives another RREP after propagating the first RREP towards
source it checks for destination sequence number of new RREP. The intermediate node updates
routing information and propagates new RREP only,
– If the Destination sequence number is greater, OR
– If the new sequence number is same and hop count is small, OR
Otherwise, it just skips the new RREP. This ensures that algorithm is loop-free and
only the most effective route is used .
The below figure is an example, which shows how the route to the destination is
found by AODV routing protocol.
1. Source ’S’ has to send data to destination.
2. S sends RREQ to its neighbors A, B, C.
3. B finds the path in its routing table (with destn seq-number s1 and hop count c1)
and sends RREP to S.
4. C sets up reverse path.
5. C forwards RREQ to its neighbors D and E.
6. E sets up reverse path.
7. E forwards RREQ to its neighbors F and G.
8. E deletes the reverse path after a time out period as it does not receive any RREPs
from F and G.
9. D finds the path (with dest seq-number s2 which is greater than s1 and hop count
c1) in its routing table and sends RREP to C.

10. C receives RREP from D and sets up forward path and forwards RREP to

Advantages and Disadvantages

The main advantage of this protocol is that routes are established on demand and destination
sequence numbers are used to find the latest route to the destination. The connection setup delay is
lower. One of the disadvantages of this protocol is that intermediate nodes can lead to inconsistent
routes if the source sequence number is very old and the intermediate nodes have a higher but not the
latest destination sequence number, thereby having stale entries. Also multiple RouteReply packets
in response to a single RouteRequest packet can lead to heavy control overhead. Another
disadvantage of AODV is that the periodic beaconing leads to unnecessary bandwidth consumption
 UNIVERSITY INSTITUTE OF TECHNOLOGY
(RGPV)

DEPARTMENT OF COMPUTER SCIENCE

SEMINAR REPORT
ON
MANET ROUTING
8th SEM

Submitted to Submitted by:

Prof. Uday Chourasia Nilesh K
(0101cs071033)