Cluster-Head Gateway Switch Routing

Protocol
Submitted by
Surya Datta Gollapudi
13MCS0024

Cluster head Gateway Switch Routing (CGSR) uses as basis DSDV
Routing algorithm.

The mobile nodes are aggregated into clusters and a cluster-head is
elected.

All nodes that are in the communication range of the cluster-head
belong to its cluster.

In a dynamic network cluster head scheme can cause performance
degradation due to frequent cluster-head elections, so CGSR uses a
Least Cluster Change (LCC) algorithm.
6
7
1
11
12
8
10
9
5
4
3
2
Using LCC algorithm for finding cluster head
Node which is in single hop distance for all the nodes is cluster head .
One cluster head should not be in single hop distance for other cluster head
Cluster head
Cluster head
Determining Clusters
6
7 1
11
12
8
10
9
5
4
3
2
Cluster head
Cluster head
Cluster 1
Cluster 2
6
7
1
11
12
8
10
9
5
4
3
2
Cluster head
Cluster head
Cluster 1
Cluster 2
Nodes appearing in more than one cluster are called Gateways .These are
used for communication between two clusters
Gateway
The cluster routing protocol is used in transferring the packets
between the source and destination .

According to this protocol the node with packets to be
transmitted to destination gets token from its cluster head ,it
obtains its destination cluster head and next hop node from the
cluster member table and routing table .

CSGR improves routing performance by routing packets through
cluster heads and gateways.
6
7
1
11
12
8
10
9
5 4
3
2
Cluster head
Cluster head
Cluster 1
Cluster 2
Gateway
Source
Destination
Node 3 is the source node which contains the packets and Node 10 is the destination node .
Packet transfer follows the path 318610.
Each node broadcasts its cluster member table periodically and
updates its table after receiving other nodes broadcasts using the
DSDV algorithm.

In addition, each node also maintains a routing table that determines
the next hop to reach the destination cluster.

On receiving a packet, a node finds the nearest cluster-head along
the route to the destination according to the cluster member table
and the routing table.

Then it consults its routing table to find the next hop in order to
reach the cluster-head selected in step one and transmits the packet
to that node.
Advantages :

Better bandwidth utilization is possible.

Easy to implement priority scheduling schemes with
token scheduling and gateway code scheduling.



Disadvantages:
Increase in path length and instability in the
system at high mobility when the rate of change
of cluster-heads is high.

More resources are required to avoid gateway
conflicts.

Power consumption of cluster heads is higher
than normal node.