Abstract
We present a new kind of mobile ad hoc application, which we call Mobile Profile based Distributed Grouping (MPDG), which is a combination of mobile clustering and data clustering. In MPDG 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 group is formed. The members of a group are able to cooperate or attain a goal together.
In this paper MPDG is defined and it is compared with related approaches. Furthermore, a modular architecture and algorithms are presented to build arbitrary MPDG applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Badache, N., Hurfun, M., Macedo, R.: Solving the consensus problem in a mobile environment. Technical report, IRISA, Rennes (1997)
Banerjee, S., Khuller, S.: A clustering scheme for hierarchical control in multihop wireless networks. Technical report, University of Maryland (2000)
Basagni, S.: Distributed clustering for ad hoc networks. In: Proceedings of the IEEE International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN), Perth, pp. 310–315 (1999)
Chang, E.J.H.: Echo algorithms: Depth parallel operations on general graphs. IEEE Transactions on Software Engineering SE-8(4), 391–401 (1982)
Diestel, R.: Graph Theory, 2nd edn., February 2000. Graduate Texts in Mathematics, vol. 173. Springer, New York (2000)
Fasulo, D.: An analysis of recent work on clustering algorithms. Technical report, University of Washington (1999)
Fraley, C., Raftery, A.E.: How many clusters? Which clustering method? Answers via model-based cluster analysis. The Computer Journal 41(8) (1998)
Gafni, E.M., Bertsekas, D.P.: Distributed algorithms for generating loopfree routes in networks with frequently changing topology. IEEE Transactions on Communications COM-29(1), 11–18 (1981)
Hatzis, K.P., Pentaris, G.P., Spirakis, P.G., Tampakas, V.T., Tan, R.B.: Fundamental control algorithms in mobile networks. In: ACM Symposium on Parallel Algorithms and Architectures, pp. 251–260 (1999)
Kolatch, E.: Clustering algorithms for spatial databases: A survey. Technical report, Department of Computer Science, University of Maryland, College Park (2001)
Maitra, R.: Clustering massive datasets. In: statistical computing at the 1998 joint statistical meetings (1998)
Malpani, N., Welch, J., Vaidya, N.: Leader election algorithms for mobile ad hoc networks. In: Proceedings of the Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (2000)
Roman, G.-C., Huang, Q., Hazemi, A.: Consistent group membership in ad hoc networks. In: International Conference on Software Engineering (2001)
Seitz, C., Berger, M.: Towards an approach for mobile profile based distributed clustering. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 1109–1117. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seitz, C., Berger, M. (2004). Towards a General Approach to Mobile Profile Based Distributed Grouping. In: Müller-Schloer, C., Ungerer, T., Bauer, B. (eds) Organic and Pervasive Computing – ARCS 2004. ARCS 2004. Lecture Notes in Computer Science, vol 2981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24714-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-24714-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21238-6
Online ISBN: 978-3-540-24714-2
eBook Packages: Springer Book Archive