A Self-Adaptive Ant Colony System for Semantic Query Routing Problem in P2P Networks

in this paper, we present a new algorithm to route text queries within a p2p network, called neighboring-ant search (nas) algorithm. the algorithm is based on the ant colony system metaheuristic and the semant algorithm. more so, nas is hybridized with local environment strategies of learning, characterization, and exploration. two learning rules (lr) are used to learn from past performance, these rules are modified by three new learning functions (lf). a degree-dispersion-coefficient (ddc) as a local topological metric is used for the structural characterization. a variant of the well-known one-step lookahead exploration is used to search the nearby environment. these local strategies make nas self-adaptive and improve the performance of the distributed search. our results show the contribution of each proposed strategy to the performance of the nas algorithm. the results reveal that nas algorithm outperforms methods proposed in the literature, such as random-walk and semant.