SUBOPTIMAL ALGORITHMS FOR RADAR JAMMING RESOURCE ASSIGNMENT

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ALI MOHAMMADI HAMZEH; MOSAVI SEYED MOHAMMAD REZA

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2013 | Volume:1 | Issue:3 (3) Page(s): 33-41

Download Full-Text

Persian Verion

View:

938

Download:

Cites:

Information Journal Paper

Title

SUBOPTIMAL ALGORITHMS FOR RADAR JAMMING RESOURCE ASSIGNMENT

Author(s)

ALI MOHAMMADI HAMZEH | MOSAVI SEYED MOHAMMAD REZA | Issue Writer Certificate

Keywords

DECISION SUPPORTQ2

ELECTRONIC WARFAREQ2

GAME THEORYQ1

RADAR JAMMINGQ2

OPTIMIZATION OF ALOGORITHMQ2

RESOURCES ASSIGNMENTQ1

Abstract

The optimal control is very important in ELECTRONIC WARFARE, and has a critical role to achieve military successes. In this paper, we have tried to help DECISION SUPPORT for this part by focusing on some important issues in the management of ELECTRONIC WARFARE. We introduce and improve three efficient algorithms including based on "Random", "Auction" and "Game Theory-Based" for RADAR JAMMING resource assignment. and, we want to know whichof our jammers have to allocate to which enemy radars to create maximum jamming in them? We use principles of dynamic GAME THEORY to develop Auction algorithm and introduce Random algorithm to illustrate the performance of two other algorithms by making possibility to compare. In other effort, we improve the algorithms by cost-based and time-based algorithms for non real time and real time combats. Eventually, we have supposed some scenarios to demonstrate that our efforts are operational through simulations such as our jammers located on vehicles. Therefore they can move in the battlefield to increase the effectiveness of group jamming, and also in the other scenario we have enough jammers. Hence, we can switch them on and off to achieve the best jamming condition with regard to economic considerations.

Cites

No record.

References

No record.

Cite

APA: Copy

ALI MOHAMMADI, HAMZEH, & MOSAVI, SEYED MOHAMMAD REZA. (2013). SUBOPTIMAL ALGORITHMS FOR RADAR JAMMING RESOURCE ASSIGNMENT. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 1(3 (3)), 33-41. SID. https://sid.ir/paper/243212/en

Vancouver: Copy

ALI MOHAMMADI HAMZEH, MOSAVI SEYED MOHAMMAD REZA. SUBOPTIMAL ALGORITHMS FOR RADAR JAMMING RESOURCE ASSIGNMENT. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2013;1(3 (3)):33-41. Available from: https://sid.ir/paper/243212/en

IEEE: Copy

HAMZEH ALI MOHAMMADI, and SEYED MOHAMMAD REZA MOSAVI, “SUBOPTIMAL ALGORITHMS FOR RADAR JAMMING RESOURCE ASSIGNMENT,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 1, no. 3 (3), pp. 33–41, 2013, [Online]. Available: https://sid.ir/paper/243212/en

Related Journal Papers