Novel Extension of Binary Constraint Method for Automated Frequency Assignment: Application to Military Battlefield Environment
Wireless communication plays an important role in mission plan activities of various military and battlefield situations. In each of these situations, a frequency assignment problem arises with application specific characteristics. This paper presents a novel extension to binary constraint  method for automation of frequency assignment in battlefield scenarios. The proposed method calculates the cost function considering each node of the radio net in battlefield equally important. Two cases for calculation of cost function are considered; in the first case the average of the signal (from intra radio nodes) and interference (from inter radio nodes) is considered whereas in the second case the intra radio nodes causing minimum signal and inter radio nodes producing maximum interference are taken into consideration for cost calculation. A simulation exercise in lab environment has been done for validation of proposed methods by creating a battlefield scenario with three radio nets each consisting three-radio nodes.
KeywordsCost Function Binary Constraint Battlefield Frequency Assignment Radio Nets
Unable to display preview. Download preview PDF.
- 1.Smith, D.H., Allen, S.M., Hurley, S., Watkins, W.J.: Frequency Assignment: Methods and Algorithms. In: Symposium, R.I. (ed.) RTO IST Symposium on Frequency Assignment, Sharing and Conservation in Systems (Aerospace), Aalborg, Denmark (1998)Google Scholar
- 2.Beuter, R.: Frequency Assignment and Network Planning for Digital Terrestrial Broadcasting Systems. Kluwer Academic Publishers Springer (2004)Google Scholar
- 3.Bradbeer, R.: Application of New Techniques to Military Frequency Assignment. In: RTO IST Symposium on Frequency Assignment, Sharing and Conservation in Systems (Aerospace), Aalborg, Denmark (1998)Google Scholar
- 4.Metzger, B.H.: Spectrum management technique. Presentation at 38th National ORSA Meeting, Detroit (1970)Google Scholar
- 7.Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing Science 220 (4598), pp. 671–680 (1983)Google Scholar
- 8.Bouju, A., Boyce, J.F., Dimitropoulos, C.H.D., vom Scheidt, G., Taylor, J.G.: Tabu search for radio links frequency assignment problem Conference on Applied Decision Technologies: Modern Heuristic Methods, England, pp. 233–250. Brunel University, Uxbridge (1995)Google Scholar
- 11.Watkins, W.J., Hurley, S., Smith, D.H.: Evaluation of Models for Area Coverage Radio communications Agency Agreement, RCCM070, Final Report (1998)Google Scholar
- 12.Salaril, E., Eshghi, K.: An ACO algorithm for graph coloring problem. Int. J. Contemp. Math. Sciences 3(6), 293–304 (2008)Google Scholar
- 15.Kateros, D.A., Georgallis, P.G., Katsigiannis, C.I., Prezerakos, G.N., Venieris, I.S.: An Algorithm for the Frequency Assignment Problem in the Case of DVB-T Allotments. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds.) LSSC 2007. LNCS, vol. 4818, pp. 561–568. Springer, Heidelberg (2008)CrossRefGoogle Scholar