Search in P2P triangular mesh by space filling trees

We introduce a new P2P exploration strategy based on an extension of space filling curve principles. This strategy is exhaustive and do not generates redundant messages. Initiated at the source node of a search query, a walker is sent to explore the neighborhood of this node. This walker is carrying an increasing list of visited nodes as an Ariadne-sequence, building at the same time an uncrossable fence. When encountering a fence, this walker splits and its offspring continue the scanning of the close neighborhood. The set of walkers creates a tree-like covering structure that ensures that all nodes are visited once and only once. We describe the support overlay and introduce a low cost node heterogeneity management. We conclude with a discussion on experimental validation results.