| With the rapid development of wireless communication and the mature of mobiletechnology, a large number of applications, such as military communications, emergencyrescue, disaster relief and interim meetings, are required in temporary networking that have nosupport of fixed infrastructure.Under this demand, a new network structure had been proposedwhich is called Ad Hoc network. The Ad Hoc network consists of a collection of mobiledevices, these devices communicate with each other via wireless technology. The Ad Hocnetwork can form a temporary network. The Ad Hoc network changes dynamically due to themobility of the nodes and the network is self-organize. Since it can communicate in asituation which the infrastructures are broken or have a lower cost in some environment, thiskind of technology has broad application prospects.In order to improve the service quality and the management efficiency of Ad HocNetwork, some people have proposed a new network structure which is called clusteringstructure. The structure improves the scalability of the Ad Hoc network, also it facilitates themanagement and coordination of the mobile node. However, nodes move freely in Ad Hocnetwork and nodes’s energy is not enough and signal is interferenced sometimes.Theseproblems make the resource management and task scheduling of Ad Hoc network morecomplex.How to manage resource and schedule task effectively on the Ad Hoc network hasbecame one of the major hot spots in current research and caused the attention of a growingnumber of researchers.This paper research on clustering structure and task scheduling of Ad Hoc network.First,the paper analyze the basis of the WCA clustering algorithm,and then an improved WCAclustering algorithm is proposed.The improved clustering algorithm considers three factorswhich are the degree of the nodes,the communication time of the nodes and the performanceof the nodes. The novel clustering algorithm improves the stability of the clustering structureand makes it more suitable for task scheduling. Subsequently,we make task scheduling basedon the clustering structure. The algorithm find the cluster which has higher overallperformance to submit the task. The task is submitted to the cluster head node, the clusterhead node uses Particle Swarm Optimization algorithm to make task scheduling, in order toshorten the task completion time as much as possible. In the process of task scheduling, an improved Particle Swarm Optimization algorithm is proposed.The improved algorithmencodes based on the number of tasks and improves the location update formula of particlessearching.It makes the improved algorithm converge rapidly and more effective to get a betterscheduling scheme. Finally,we make simulating experiment and verify the correctness of theproposed method in this paper. |
