A Quality of Service Routing and Distributed Clustering Framework in Mobile Ad Hoc Networks

In this document, we present a completely distributed algorithm for partitioning a given set of mobile nodes into clusters. The proposed algorithm tries to reduce the amount of computational and information overhead while maintaining a stable cluster formation. The algo- rithm is a distributed version of the Basic Leader-Follower Algorithm used in pattern recognition. Our algorithm does not require maintaining a cluster head. We also propose a modified Quality of Service routing algorithm for a partitioned (clustered) set of mobile nodes in an ad-hoc network. The proposed algorithm works on the basis of an acquaintance based approach in which temporary contacts enable fast inter-cluster routing.

[1]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[2]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[3]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[4]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

[5]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[6]  David G. Stork,et al.  Pattern Classification (2nd ed.) , 1999 .

[7]  Dapeng Wu,et al.  Effective capacity: a wireless link model for support of quality of service , 2003, IEEE Trans. Wirel. Commun..

[8]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[9]  Dhiraj K. Pradhan,et al.  A cluster-based approach for routing in dynamic networks , 1997, CCRV.

[10]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[11]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[12]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[13]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[14]  Chi-Hsiang Yeh,et al.  Ad hoc MPLS for virtual-connection-oriented mobile ad hoc networks , 2002, Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367).

[15]  David G. Stork,et al.  Pattern Classification , 1973 .

[16]  Mario Gerla,et al.  Asynchronous multimedia multihop wireless networks , 1997, Proceedings of INFOCOM '97.

[17]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[18]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.