engleski

Algorithm for Equal Distribution of Identical Elements on One Dimensional Field

This paper describes an algorithm for an equal distribution for m identical elements on one-dimensional field of size n with m<n. During the development of the discrete event simulation of MANET (Mobile Ad-Hoc Network), the need for equal distribution of special node roles (e.g. servers, clients or directories) on the nodes had occured. The solution using some of existing random number generators was out of the question because we wanted to know to hich node had the role been assigned to so we needed an algorithmic solution in order to predict on which node which types of roles will be placed, if any. In the proposed algorithm, two specific cases are regarded: trivial case with distribution (n mod m)=0, where every (n div m) element of n is selected, and (n mod m) <> 0, when we implement our algorithm. We show that using the proposed algorithm the m elements are equally distributed over size n one-dimensional field. The algorithm is given in pseudo-code and thorougly commented.

one-dimensional field; algortihmic solution

nije evidentirano