Full vs Reduced Topology information

Many Routing Protocols transmit topology information, but not all distribute the complete topology information they are aware of. It is difficult to classify the protocols according to this characteristic. Also even if full topology information is maintained in each node, the messages usually only carry sufficient information to react the changes in topology but never the whole topology information, since that would not scale. Full topology is maintained in: DDR, GSR, OLSR.Reduced Topology is maintained in: FSLS, FSR, LANMAR, STAR , WRP, ZRP

Single path vs Multipath routing

Some protocols use a single route from source destination and other protocols will find multiple routes.There are several criteria for comparing single-path routing and multi-path routing in ad hoc networks.

First, the overhead of route discovery in multi-path routing is much more than that of single-path routing. On the other hand, the frequency of route discovery is much less in a network which uses multi-path routing, since the system can still operate even if one or a few of the multiple paths between a source and a destination fail.

Second, it is commonly believed that using multipath routing results in a higher throughput. The reason is that all nodes are assumed to have (and limited) capacity (bandwidth and processing power). Since multi-path routing distributes the load better, the overall throughput would be higher.

Proactive vs Reactive Routing

Proactive Schemes

Determine the routes to various nodes in the network in advance, so that the route is already present whenever needed. Route Discovery overheads are large in such schemes as one has to discover all the routes. Consumes bandwidth to keep routes up-to-date Packet forwarding is faster as the route is already present. Examples of such schemes are the conventional routing schemes, Destination Sequenced Distance Vector (DSDV).

Reactive Schemes

Determine the route when needed .Smaller Route Discovery overheads. Employs flooding(global search) A node trying to transmit a packet may have to wait for route discovery. Examples of such schemes are Dynamic Source Routing, Ad-Hoc On Demand Distance Vector Routing (AODV) etc.

Flooding

Some routing protocols will find a apart form proactive and reactive there is another mechanism called Flooding. In flooding no route is computed or discovered. A packet is broadcasted to all the nodes in the network. Flooding is the easiest routing method, however it generates heavy traffic.

Different proactive, reactive and even hybrid (reactive as well as proactive) schemes e.g. Zone Routing Protocol, have been proposed for Wireless Ad-Hoc networks

Definition

A mobile ad-hoc network (MANET) is a self-configuring network of mobile routers (and associated hosts) connected by wireless links—the union of which form an arbitrary topology. The routers are free to move randomly and organize themselves arbitrarily; thus, the network's wireless topology may change rapidly and unpredictably. MANETs are usually set up in situations of emergency for temporary operations or simply if there are no resources to set up elaborate networks. These types of networks operate in the absence of any fixed infrastructure, which makes them easy to deploy, at the same time however, due to the absence of any fixed infrastructure, it becomes difficult to make use of the existing routing techniques for network services, and this poses a number of challenges in ensuring the security of the communication, something that is not easily done as many of the demands of network security conflict with the demands of mobile networks, mainly due to the nature of the mobile devices (e.g. low power consumption, low processing load).

Hmm..

Here's a start..