Novel Extension of Binary Constraint Method for Automated Frequency Assignment: Application to Military Battlefield Environment

Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 264)


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 [1] 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.


Cost Function Binary Constraint Battlefield Frequency Assignment Radio Nets 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 2.
    Beuter, R.: Frequency Assignment and Network Planning for Digital Terrestrial Broadcasting Systems. Kluwer Academic Publishers Springer (2004)Google Scholar
  3. 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. 4.
    Metzger, B.H.: Spectrum management technique. Presentation at 38th National ORSA Meeting, Detroit (1970)Google Scholar
  5. 5.
    Hale, W.K.: Frequency Assignment: Theory and Applications. Proceedings of IEEE 68(12), 1497–1514 (1980)CrossRefGoogle Scholar
  6. 6.
    Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E.: Equations of state calculations by fast computing machines. Journal of Chemical Physics 21(6), 1087–1092 (1953)CrossRefGoogle Scholar
  7. 7.
    Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing Science 220 (4598), pp. 671–680 (1983)Google Scholar
  8. 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
  9. 9.
    Montemanni, R., Smith, D.H., Allen, S.M.: An ANTS algorithm for the minimum-span frequency assignment problem with multiple interference. IEEE Transactions on Vehicular Technology 51(5), 949–953 (2002)CrossRefGoogle Scholar
  10. 10.
    Graham, J.S., Montemanni, R., Moon, J.N.J., Smith, D.H.: Frequency Assignment. Multiple Interference and Binary Constraints Wireless Networks Springer 14, 449–464 (2008)CrossRefGoogle Scholar
  11. 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. 12.
    Salaril, E., Eshghi, K.: An ACO algorithm for graph coloring problem. Int. J. Contemp. Math. Sciences 3(6), 293–304 (2008)Google Scholar
  13. 13.
    Wu, S., Yang, G., Xu, J., Li, X.: SCH-EGA: An Efficient Hybrid Algorithm for the Frequency Assignment Problem. Engineering Applications of Neural Networks Communications in Computer and Information Science 383, 32–41 (2013)CrossRefGoogle Scholar
  14. 14.
    Yang, G., Wu, S., Xu, J., Li, X.: A Novel Hybrid SCH-ABC Approach for the Frequency Assignment Problem. In: Lee, M., Hirose, A., Hou, Z.-G., Kil, R.M. (eds.) ICONIP 2013, Part II. LNCS, vol. 8227, pp. 522–529. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  15. 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
  16. 16.
    Audhya, G.K., Sinha, K., Mandal, K., Dattagupta, R., Ghosh, S.C., Sinha, B.P.: A New Approach to Fast Near-Optimal Channel Assignment in Cellular Mobile Networks. IEEE Trans. on Mobile Computing 12(9), 1814–1827 (2013)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Central Research LabBharat Electronics Ltd.GhaziabadIndia

Personalised recommendations