The Ant-Colony Based Routig Algorithm to Find paratrooper in military environment

Today computer science has many Application in military targets. And a lot of routing Algorithm can be used in order finds best Routs in military environment . Assume there are network of soldier in military environment. The foal network’s soldiers is that every soldier can be like one node in a computer network. These nodes (soldier) can move in this region and they don’t have fixed place. For security reasons in this structure node can just make relation with their neighbours and transmit necessary in formation and their request. The objective in this structure is finding enemy’s paratroopers in the end and taking those to military base. We use ant colony Algorithm to solve this problem, because ant colony can find food in a very short time. So it can take that to its nest in this structure, every soldier is like an ant and paratroopers are like the food and military base in the nest in witch paratroopers can be transmitted . also we presented a scenario of this network that uses ant colony of find paratroopers and an overall framework for it.

کلیدواژه ها:

Ant Algorithms ، Routing ، Paratroopers