چکیده مقاله
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
کلیدواژهها
نویسندگان
Solmaz Kamalifar
Department of Computer Engineering, Science and Research Branch, Islamic Azad university, Germi, Iran
شیوه ارجاع
Kamalifar, Solmaz,1399,Comparing DLA-GF Algorithm with Ant Colony Algorithm in Order to form backbone for Wireless Ad Hoc Networks,6th International Conference on Science and Technology with Sustainable Development Approach
ارائهشده در
مجموعه مقالات ششمین همایش بین المللی علوم و تکنولوژی با رویکرد توسعه پایدار20 اسفند 1399