Algorithms for distributed sorting and prefix computation in static ad hoc mobile networks

Abstract

Distributed processes with message passing strategy, communicate among themselves by exchanging pieces of information to perform exclusive access to achieve the tasks in a distributed fashion. In this paper, we consider sorting and prefix computation problems with n elements distributed over a number of communication processors in a distributed system. The proposed distributed sorting algorithm improves the performance of each processor without creating copies of elements at intermediate processors. Also all processors do not necessarily perform the disjoint comparison exchange operations and the proposed algorithm works with the identity of processors. The proposed algorithms are based on token based message passing strategy for distributed sorting and prefix computation problems on static ad hoc mobile networks. These algorithms could possibly be extended to dynamic ad hoc mobile networks.