CBRP A Cluster-based Routing Protocol for Mobile Ad hoc ：CBRP基于簇的移动Ad hoc路由协议.ppt

CBRP: A Cluster-based Routing Protocol for Mobile Ad hoc Networks Authors : Mingliang Jiang Jinyang Li Y.C. Tay Presented by: Hiren Shah Presentation Outline Related Works CBRP data structures CBRP cluster formation CBRP route discovery Conclusion and Future Work Related Works Re-active Routing Protocols prohibitive flooding traffic in route discovery route acquisition delay every route breakage causes a new route discovery Works in trying to reduce flooding traffic LAR (GPS for every mobile node?) DSR (aggressive caching) CBRP: Features use clustering approach to minimize on-demand route discovery traffic use “local repair” to reduce route acquisition delay and new route discovery traffic suggest a solution to use uni-directional links CBRP: Protocol Overview SOME TERMINOLOGIES A cluster head must have bi-directional links to all its member nodes. A node will be a member of all those clusters for which it has a bi-directional link to the cluster heads. These are called host clusters for the node. HELLO MESSAGES Every node periodically broadcasts HELLO messages to its neighbors. HELLO messages sent by a node contain the neighborhood information of that node. DATA STRUCTURES Neighbor Table Id, Role , Status of the link Cluster Adjacency Table (CAT) Keeps info. about adjacent clusters Contains Id of neighboring cluster the gateway node (a member) to reach the neighboring cluster head the status of the link DATA STRUCTURES (Contd.) Two-hop Topology Database each node broadcasts its neighbor table information periodically in HELLO packets. Therefore, by examining the neighbor table from its neighbors, a node is able to gather `complete information about the network topology that is at most two-hops away from itself. HELLO MESSAGES  HELLO message from a node contains its neighbor table and its cluster adjacency table (CAT). Nodes update their neighbor tables and CAT when they receive HELLO messages from their neighbors. HELLO MESSAGE