PRESENTATION INCLUDES:

What are Ad hoc networks

Why Ad hoc Networks Operating principle Routing Algorithms requirement Various Routing methods

Ad hoc networks ?
Def: A ad hoc network basically wireless network is a collection of autonomous nodes or terminals that communicate with each other by forming a multi hop radio network and maintaining connectivity in a decentralized manner.

Why Ad Hoc Networks?

Ease of deployment Speed of deployment Decreased dependence on infrastructure

Ad Hoc Network Configurations: 1. Network size 2. Network connectivity 3. Topological rate of change 4. Link capacity 5. Traffic patterns

Ad Hoc Wireless Network: Operating Principles

An ad hoc network begins with at least two nodes, broadcasting their presence (beaconing) with their respective address information. When a third node joins the network with its beacon signal, two scenarios are possible. The first is where both the existing node recognize the newly entered node and hence establishes single-hop communication with new node. The second is where only one of the nodes recognizes the beacon signal from new node and establishes direct communication with new node.

(Example of an ad hoc network) As more nodes join the network, or some of the existing nodes leave, the topology updates become more numerous, complex, and more frequent. Finding a loop-free path between a source-destination pair may therefore become impossible if the changes in network topology occur too frequently. Thus the ability to communicate degrades with increasing mobility

Desirable properties of an efficient routing algorithm:

Loop free Distributed control Fast routing Multiplicity of routes Secure QoS aware

Broad Classification of Routing algorithms for Ad hoc networks:

These distributed routing protocols can be classified broadly First by how they intend to determine the Topology of the network, and Second by when they make a decision to find a Route to a destination. The first category of topology intended routing can further be classified into Hierarchical and Flat routing, and The second category can further be divided into Proactive and Reactive routing.

Hierarchical Routing:

Nodes is divided into clusters. Each cluster has a node, which is designated as the cluster- head. Node adjacent to more than one clusters act as Gateway. Cluster head maintains the information about the network Two ways the information can be transferred . Connectionless- route is determined on fly for every packet . Connection Oriented- streams of packets are sent to the established path and route updating and the path reestablishment takes place if in case of the topology change.

(An example of clustering) Flat Routing: In case of flat routing algorithms all nodes act as routers and share the responsibility of forwarding packets destined to other nodes. Thus, there is no need to elect cluster heads and periodically reorganize the network. Most flat routing algorithms try to implement a distributed version of the shortest path algorithm or flooding.

Proactive Routing: In proactive routing algorithms, each node maintains a routing table containing the next hop information for every other node in the network. Thus a route between the source node and the destination node is always available. Reactive Routing: In reactive routing algorithms, a path discovery process determines the path to the destination only when the node has a packet to forward. These types of routing algorithms are also referred to as ondemand routing protocols.

THANK YOU