CollectivesortComa08
Matteo Casadei, Mirko Viroli, Marco Santarelli
A crucial aspect of the management of data-centric and pervasive networks is the design of proper self-organizing data-distribution approaches, including aggregation, collection, diffusion, and so on. In this paper we introduce the collective sort problem for network environments that aims at collecting and segregating data by similarity. Data is collected and segregated in localized areas of the network selected by an emergent process. A solution to the problem is analyzed for a coordination scenario featuring a grid-like distributed set of Linda tuple spaces and a set of sorting agents executing a probabilistic protocol resembling brood collection in ant colonies. Based on simulation, we show how patterns of data collection emerge in spite of the very basic observation and computation abilities of sorting agents.
Lyndon J. B. Nixon, Manfred Bortenschlager, Elena Simperl, Robert Tolksdorf (eds.)
@inproceedings{collectivesort-coma08,
venue = {Rome, Italy},
title = {Collective Sort and Emergent Patterns of Tuple Distribution in Grid-Like Networks},
booktitle = {17th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises. Workshop on Coordination Models and Applications (CoMA 2008)},
Editor = {Nixon, Lyndon J. B. and Bortenschlager, Manfred and Simperl, Elena and Tolksdorf, Robert},
Isbn={978-0-7695-3315-5},
Month = {23--25~} # jun,
Pages = {70--75},
Publisher = {IEEE Computer Society},
year = 2008,
author = {Casadei, Matteo and Viroli, Mirko and Santarelli, Marco}}