Design and investigation of scalable multicast recursive protocols for wired and wireless ad hoc networks



2.5 Discussion

This chapter has surveyed the concepts of wireless ad hoc networks and the different types of
routing protocols related to it, Unicast and Multicast. This section aims to perform a
comparative discussion on those types of ad hoc routing protocols.

Table 2.1 Comparison between different kinds of unicast ad-hoc protocols.

Routing Class

Proactive

Reactive

Hybrid

Routing structure

Flat and hierarchal are
available

Mostly flat

Mostly hierarchal

Availability of
routes

Always available

On-demand

Depends on node location
(in zone or out of zone)

Periodic route
update

Mostly used

Rarely used, sometimes for local
repair

Usually

Handling mobility
effect

Using periodical messages

Different scenarios, AODV uses
local route discovery

More than one path
especially between zones.
No single point of failure.

Storage

High requirements

Lower than proactive, depends on
the number of routes required
stored in cache or small tables.

Depends on the size of the
zone, big zones means
large number of nodes at
the end it is as proactive;
high storage

Delay

Small as the routes are
available (small response
time)

Bigger than proactive, need time
to establish the route (response
time)

Between proactive and
reactive. Small for nodes in
the zone and become
large for nodes outside the
zone

Table 2.1 summarizes a comparison of the three categories of unicast protocols discussed in
this chapter, proactive, reactive and hybrid routing protocols. The tradeoffs between
proactive and reactive is quite complex. To decide which approach are better many factors
should be considered, such as the size of the network, the mobility, the traffic load and so on.
DSDV and OLSR discussed before are proactive routing protocols; which is suitable for
networks that topology change is small. This kind of protocols has an advantage that the
routes are immediately available and stored in tables which will reduce the response time. On
the other hand, they cause large amount of storage and high routing overhead as they use
periodical messages to keep information stored in nodes up to date. OLSR surpasses DSDV

30



More intriguing information

1. Commuting in multinodal urban systems: An empirical comparison of three alternative models
2. On the Existence of the Moments of the Asymptotic Trace Statistic
3. Climate Policy under Sustainable Discounted Utilitarianism
4. Plasmid-Encoded Multidrug Resistance of Salmonella typhi and some Enteric Bacteria in and around Kolkata, India: A Preliminary Study
5. The name is absent
6. The name is absent
7. A novel selective 11b-hydroxysteroid dehydrogenase type 1 inhibitor prevents human adipogenesis
8. Update to a program for saving a model fit as a dataset
9. The name is absent
10. Dendritic Inhibition Enhances Neural Coding Properties