Comparing DLA-GF Algorithm with Ant Colony Algorithm in Order to form backbone for Wireless Ad Hoc Networks

In this research, through using Ant Colony Algorithm, an algorithm for forming backbone in wireless ad hoc networks is introduced. In this algorithm, the ad hoc network is considered as a connected graph. Several ants start moving from the nodes of network. Concurrent with moving, pheromone is secreted. The amount of initial pheromone for each node is determined by the number of nodes being covered. The ant will move towards a node with higher number of neighbors. The results of this algorithm, in comparison to DLA-GF algorithm (one of the recommended algorithms for forming backbone in wireless ad hoc networks), indicate that through this algorithm, the size of formed backbone will be more effective than DLA-GF algorithm, routing overhead will be reduced, and the efficiency of networks will increase.

Keywords:

ad hoc network , connecting dominator set , broadcast , backbone , Ant Colony Algorithm