CSGR(cluster switch gateway routing)

CSGR(cluster switch gateway routing)

• 1.
  By Gaurav Dalvi RollNo:9103 ME(IT) 1
• 2.
   Introduction.  Categorizationof Ad hoc routing protocols.  Table Driven Approach.  On Demand Routing Approach.  CSGR. ◦ Introduction. ◦ Formation of Cluster Network. ◦ LCC (Least Cluster Change Algorithm). ◦ Working. ◦ Table maintained by Each node.  References. 2
• 3.
   Wireless networksis an emerging new technology that will allow users to access information and services electronically, regardless of their geographic position.  Wireless networks can be classified in two types: 1. infrastructured network. 2. infrastructureless (ad hoc) networks. 3
• 4.
  Figure 1: Categorizationof ad hoc routing protocol. 4
• 5.
   Protocols requireeach node to maintain one or more table to store routing information, and they respond to changes in network topology by propagating route updates throughout the network to maintain a consistent network view. 5
• 6.
   These protocolstake a lazy approach to routing. In contrast to table-driven routing protocols all up- to-date routes are not maintained at every node, instead the routes are created as and when required.  When a source wants to send to a destination, it invokes the route discovery mechanisms to find the path to the destination. The route remains valid till the destination is reachable or until the route is no longer needed. 6
• 7.
   Introduction  Table-driven-basedrouting protocol  Uses a hierarchical network topology while previous protocol employ flat topologies.  Mobile nodes are grouped into clusters.  These grouping may be based on a no of criteria, but most commonly they are based on either location, or functionality.  The cluster boundaries are based on transmission range of the cluster leaders known as cluster head(CH). 7
• 8.
   Formation ofCluster network.  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.  A gateway node is a node that is in the communication range of two or more cluster- heads. 8
• 9.
   LCC(Least ClusterChange Algorithm).  In a dynamic network cluster head scheme can cause performance degradation due to frequent cluster-head elections.  Using the LCC algorithm, cluster heads only change ◦ when two cluster heads come into contact ◦ when a node moves out of the range of all other cluster heads. ◦ Tie is broken either using the lowest ID or highest connectivity algorithms. 9
• 10.
  Figure 2: Exampleof CSGR routing from node1 to node12 1 3 2 4 7 10 5 6 8 9 11 12 Cluster Head Internal Node Gateway Node 10
• 11.
   On receivinga packet, a node finds the nearest cluster-head along the route to the destination according to the cluster member table and the routing table.  Table maintained by each node. 1. Cluster member table : It has mapping from each node to its respective cluster-head. 2. 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. 11
• 12.
  Figure 3: Comparisionof DSDV and CSGR. 12
• 13.
   Padmini Misra.“Routing Protocols for Adhoc Mobile Wireless Networks”, Internet: http://www.cse.wustl.edu/~jain/cis788- 99/ftp/adhoc_routing/index.html, Nov 18 1999 [Feb 08 2015].  Chandra Prakesh. “Mobile Ad hoc Routing Protocols Lecture (09-10)”, Internet: http://www.slideshare.net/cprakash2011/lecture- 9-10-mobile-adhoc-routing-protocols, Jul 09 2013[Feb 08 2015]. 13