Mobile Internet Service Discovery Algorithm Based On Ant Colony Algorithm Is Studied

The development of microelectronics and wireless access technologies enablemobile terminals to be able to connect to different kinds of networks. Consequently,mobile terminals can acquire many services in heterogeneous networks. The MobileInternet is the mutual penetration development of the mobile communicationtechnology and the Internet technology. With the expansion of the network scale and theincreasing of the services types in the network, how to manage and control the massservices is one of the tasks desiderated to be solved. Service discovery, which is a keytechnology to discovery and recognize the available services in the network, willbecome an indispensable important function for both users and service providers.Firstly, this thesis gives a description of the development status of the MobileInternet and the Service Discovery Protocol (SDP). The thesis introduces the existingSDP and partitions them into different sorts. Secondly, this thesis depicts theinteroperation system and the mashup structure under the Mobile Internet environment.In allusion to solve the problems in Service Discovery Protocols, the thesis imports theAnt Colony Algorithm into service discovery process and designs the ACA4SDalgorithm, which uses the pheromone information on the path to guide the service querypacket to route. This thesis abstracts the whole network as different network domains,there is a Domain Service Node (DSN) in every network area and the other nodes of thenetwork send service query requests to the DSN for service information. When the DSNdoes not found any related information about the service requested in local servicedirectory, the DSN sends service query packets (the ants) to lookup the demand serviceamong different network areas. The service query packets use the dynamic routingmechanism and the positive feedback mechanism of the pheromone in the Ant ColonyAlgorithm.In the ACA4SD algorithm, the thesis focuses on the initialization and the updatemechanism of the pheromone on the link. At the same time the thesis analyses theparameters used in the ACA4SD algorithm. By changing the values of the parameter atdifferent phases of the algorithm can improve the performance of the algorithm. After taking the potential network congestion in the process of service discovery process formultiservice discovery and service mashup into account, the thesis puts forward theLBACA4SD algorithm, in which the concentration of pheromone on every link islimited to a scope and the same kind of pheromones mutually attract while theheterogeneous pheromone mutually exclusive.After designing the ACA4SD algorithm and the LBACA4SD algorithm, this thesisconstructs the simulation scene to validate and test these algorithms. At last are asummary of this thesis and an outlook of our future work.