Patent ID: 8316121

Claim:
A method for arranging a plurality of nodes in a cluster, said method comprising the following steps: quantifying the number of nodes in the cluster ‘N’ by computing the summation of N using the formula N=n 2 +n+1, where n=p r and p is a prime number and r is a positive integer other than zero; assigning sequentially unique positive integers to each of said nodes of said cluster ‘N’ between 0, 1, . . . N−1; selecting a Singer Difference set ‘D’ comprising n+1 elements forming the set D={d o , d 1 , . . . , d k , . . . , d n ) where k is a positive integer having values from 0, 1, . . . n+1; and the number d k are one of the above mentioned positive integers between 0 to N−1; and connecting each node i of said cluster to at most n+1 other nodes satisfying the formula j=(C−i+d k ) mod N where d k is an element of the said Singer difference set and i, j are positive integers having values in the range of 0, 1, 2, . . . , N−1 and C being a fixed constant for a particular network and having values in the range of 0, 1, 2, . . . , N−1.