A Cluster-based Approach for Routing in Dynamic Networks* P. K r i s h n a High Performance Networking Digital E q u i p m e n t Corporation L i t t l e t o n , M A 01460 pkrishna@hpn.lkg.dec.com N. H. V a i d y a , M. C h a t t e r j e e , D. K. P r a d h a n D e p a r t m e n t of C o m p u t e r Science Texas A & M U n i v e r s i t y College S t a t i o n , T X 77843 {vaidya,mitrajit,pradhan}@cs.tamu.edu Abstract The design and analysis of routing protocols is an important issue in dynamic networks such as packet radio and ad-hoc wireless networks. Most conventional protocols emhibit their least desirable behavior for highly dynamic interconnection topologies. We propose a new methodology for routing and topology information maintenance in dynamic networks. The basic idea behind the protocol is to divide the graph into a number of overlapping clusters. A change in the network topology corresponds to a change
/lp/association-for-computing-machinery/a-cluster-based-approach-for-routing-in-dynamic-networks-4cv0Weyhal