• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Optimal Placement of CRNs in Manned/ Unmanned Aerial Vehicle Cooperative Engagement System


Abstract

Aiming at the optimal placement of communication relay nodes (OPCRN) problem in manned/unmanned aerial vehicle cooperative engagement system, this paper designed a kind of fully connected broadband backbone communication topology. Firstly, problem description of OPCRN was given. Secondly, based on problem analysis, the element attributes and decision variables were defined, and a bi-level programming model including physical layer and logical layer was established. Thirdly, a hierarchical artificial bee colony (HABC) algorithm was adopted to solve the model. Finally, multiple sets of simulation experiments were carried out to prove the effectiveness and superiority of the algorithm.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Y. Zhong, P. Yao, L. Wan, Y. Xiong, "Optimal Placement of CRNs in Manned/ Unmanned Aerial Vehicle Cooperative Engagement System," KSII Transactions on Internet and Information Systems, vol. 13, no. 1, pp. 52-68, 2019. DOI: 10.3837/tiis.2019.01.004.

[ACM Style]
Yun Zhong, Peiyang Yao, Lujun Wan, and Yeming Xiong. 2019. Optimal Placement of CRNs in Manned/ Unmanned Aerial Vehicle Cooperative Engagement System. KSII Transactions on Internet and Information Systems, 13, 1, (2019), 52-68. DOI: 10.3837/tiis.2019.01.004.

[BibTeX Style]
@article{tiis:21969, title="Optimal Placement of CRNs in Manned/ Unmanned Aerial Vehicle Cooperative Engagement System", author="Yun Zhong and Peiyang Yao and Lujun Wan and Yeming Xiong and ", journal="KSII Transactions on Internet and Information Systems", DOI={10.3837/tiis.2019.01.004}, volume={13}, number={1}, year="2019", month={January}, pages={52-68}}