Research On Group Intelligent Optimization Algorithm In Wireless Ad Hoc Network Protocol Design

Wireless ad hoc Network is a wireless communication network which consist by lots of nodes with transceivers.It does not require a fixed communication infrastructure to support the communications of whole network,thus it is easy and fast to set up an ad hoc network.Because every node in network can leave or join at will,therefore,ad hoc network combine into a strong scalability structure of network.However,the characteristics of without central control node and dynamic network topology of ad hoc network have brought great challenges to design routing protocol,time slot assignment protocol and time synchronization protocol of ad hoc network.The group intelligent optimization algorithm which simulates the intelligent behavior of natural biological groups is one kind of optimization algorithm.It has the characteristics of distributed computing which can adapt to the characteristics of non-center node and cooperative operation of each network node in ad hoc networks.Based on the above considerations,in our paper,we have studied the routing protocol,time slot allocation algorithm and time synchronization algorithm of Ad Hoc network.We have proposed the corresponding algorithm based on the characteristic of ad hoc network and group intelligent optimization algorithm.The main works of this paper is as follows:(1)This paper studies the design of wireless ad hoc network routing protocol based on ant colony optimization algorithm(ACO).The existing ant colony routing algorithm mostly neglects the influence of channel quality on the performance of routing algorithm,so the influence of channel quality on routing protocol based on ACO is considered,and an improved routing algorithm of Ad Hoc network is proposed.In our paper we consider the influence of SNR and the change of SNR on Selection Probability in AntHocNet.Besides the proposed improved Ad Hoc network routing algorithm in this paper sets a minimum SNR to prevent the node from choosing the link with poor quality,thus affecting the performance of the routing algorithm.At last The simulation results demonstrate that the improved routing algorithm can improve the delivery rate of data packets without increasing too much delay.(2)We study the slot assignment algorithm of wireless ad hoc networks based on binary particle swarm optimization(BPSO).A modified BPSO algorithm which is based on the characteristics of time slot sharing of wireless Ad Hoc network nodes is proposed,and a slot assignment algorithm based on this modified BPSO algorithm is studied.In our paper,the sigmoid function and the location updating strategy of the BPSO algorithm are modified for the slot assignment problem of wireless Ad Hoc networks.The simulation results indicate that the slot allocation algorithm proposed in our paper can improve the slot utilization rate and reduce the average time delay compared with the IHNN algorithm,while ensuring the probability of successful assignment.(3)A time slot synchronization algorithm based on glowworm swarm optimization(GSO)is studied.The time synchronization algorithm based on GSO is proposed for the problem of the low convergence speed of the existing distributed time synchronization algorithm.In our paper,the time synchronization problem of wireless Ad Hoc network is modeled to find an optimal clock problem,and then we use the GSO algorithm to find this optimal clock.Finally,the simulation results indicate that the convergence speed of the algorithm proposed by this paper is faster than consensus algorithm.