Research On Data Search Algorithm For Heterogeneous Networks

With the development of heterogeneous network, mobile users can access theheterogeneous wireless networks. How to make good use of heterogeneous networkcan affect searching efficiency. Meanwhile, interest network also has a rapiddevelopment in search field. Therefore, studying on search technique of heterogeneousinterest network has important significance.This paper puts forward the δ aggregation search of the heterogeneous interestnetwork. Firstly, analyze the topology of interest network, puts forward the parameter δto describe congregate feature of the network, and proved that the performance isbetter when δ is matching with search radius. And then by analyzing the heterogeneousinterest network, proposed δ aggregation search algorithm. This algorithm by therecourse which is searched chooses different search range. If the resource is not thegoal one, nodes choose subnet by estimating network delay to search resource.Different network has different search method. The simulation result indicates that thisalgorithm has better performance than current flooding search.Then this paper puts forward δ aggregation search based on the game theory.Nodes first choose the network with the profit function which is obtained by the gamestrategy. The network chooses nodes by the optimal profit. According to game theoryto get the optimal profit, and then the profit is used to allocate bandwidth for nodes.This strategy can reduce congestion of the network. The simulation result indicates thatthe algorithm can rationally utilize the heterogeneous network and reducing packet lossrate.