The Iterative Algorithm of Mobile Big Data Network Search Based on Matching Difference Adjustment Mechanism
In order to solve the problems of low search fluency and weak node discrimination in current mo-bile big data network search iterative algorithm,a iterative algorithm of mobile big data network search based on the matching difference adjustment mechanism is proposed.Firstly,network initialization is a-chieved through the difference between hotspots and free nodes,which improves the clustering speed corre-sponding to free nodes and enables differentiated matching between free nodes and existing hotspots,en-hancing the screening efficiency of the algorithm for free nodes.Subsequently,the merging speed of free nodes is further improved through interactive mechanisms,achieving precise screening of free nodes.Simu-lation experiments show that the proposed algorithm can effectively improve the success rate of node search,with the characteristics of short initial search completion time,and has good practical deployment value.
mobile big datamatch difference adjustmentfree nodecluster screening
万方数据
维普
