Towards an Approach for Mobile Profile Based Distributed Clustering

We present a new application for mobile ad hoc networks, which we call Mobile Profile based Distributed Clustering(MPDC), which is a combination of mobile clustering and data clustering. In MPDC each mobile host is endowed with a user profile and while the users move around, hosts with similar profiles are to be found and a robust mobile cluster is formed. The participants of a cluster are able to cooperate or attain a goal together. We adapt MPDC to a taxi sharing application, in which people with similar destinations form a cluster and could share a taxi or other public transportation resources.

[1]  Gruia-Catalin Roman,et al.  Consistent group membership in ad hoc networks , 2001, Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001.

[2]  Adrian E. Raftery,et al.  How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis , 1998, Comput. J..

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

[4]  Erica Kolatch,et al.  Clustering Algorithms for Spatial Databases: A Survey , 2001 .

[5]  Dimitri P. Bertsekas,et al.  Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology , 1981, IEEE Trans. Commun..

[6]  Edward J. Wegman,et al.  Clustering massive datasets , 2004 .

[7]  Nitin H. Vaidya,et al.  Leader election algorithms for mobile ad hoc networks , 2000, DIALM '00.