Efficient and scalable merging algorithms for wireless traces

Abstract : Analysis of wireless experimentation results is a complex task to achieve. As multiple probes are needed in order to get a global view of a wireless experimentation, the resulting packet traces may be very large. In this paper we propose an algorithm that realizes trace synchronization and merging in a scalable way. The algorithm generates a database that only stores the information marked as relevant for post-processing analysis by the experimenter. Initial performance results are promising.