The Ant-Colony Based Routig Algorithm to Find paratrooper in military environment
Publish place: 11th Iranian Student Conference on Electrical Engieering
Publish Year: 1387
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,685
This Paper With 5 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ISCEE11_068
تاریخ نمایه سازی: 15 اسفند 1386
Abstract:
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.
Keywords:
Authors
Azam Salampour
Department of computer engineering Zanjan university
Mehdi Salampour
College of technical Zanjan Alghadir
Ali Salampour
Department of computer engineering Qazvin Azad university
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :