Local greedy strategy based on high-performance quorum generation algorithm
Lan Lin · Jisuanji yingyong yanjiu · 2011
Based on the relaxation of cyclic difference sets and the basis of local greedy strategy could be incorporated into the nodes of local demand excellent way generate the request set of algorithms,the algorithm's time complexity decreased a order of magnitude,while the length of generated request sets remained between 2N and 2N,So as to be more useful to communication.