iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/s11276-006-0730-x
Frequency assignment, multiple interference and binary constraints | Wireless Networks Skip to main content
Springer Nature Link
Log in

Frequency assignment, multiple interference and binary constraints

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

The most accurate approaches to frequency assignment problems minimize a cost function based on signal-to-interference ratios at points where reception is required. The merits of this approach are counterbalanced by much greater requirements for computational resources than for the traditional approach using binary frequency separation constraints. This can make run times unrealistic for the largest problems. In this paper the merits of the signal-to-interference based cost function are confirmed, but it is shown that algorithms are faster and give better quality results if this cost function is combined with the binary constraint approach. Two types of algorithm are used to illustrate the combined approach, simulated annealing and a new ant colony system algorithm. The combined approach studied is applicable to all the main classes of frequency assignment problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K.I. Aardal, C.P.M. van Hoesel, A.M.C.A. Koster, C. Mannino and A. Sassano, Models and solution techniques for the frequency assignment problem, 4OR 1(4) (2003) 261–317.

  2. D.H. Smith, S.M. Allen, S. Hurley and W.J. Watkins, Frequency assignment: methods and algorithms, in: Proceedings of the NATO RTA SET/ISET Symposium on Frequency Assignment, Sharing and Conservation in Systems (Aerospace), Aalborg, Denmark, October 1998, NATO RTO-MP-13 (1999) pp. K1–K18.

  3. S. Hurley, R.M. Whitaker and D.H. Smith, Channel assignment in cellular networks without channel separation constraints, in: Proceeding IEEE Vehicular Tech. Conf. Boston, MA, (Fall 2000) pp. 1714–1718.

  4. N.W. Dunkin and P.G. Jeavons, Expressiveness of binary constraints for the frequency assignment problem, in: DIAL-M Workshop, 3rd Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM’97), Budapest (October 1997).

  5. S. Hurley, R.M. Whitaker and D.H. Smith, Analysing multiple interference in radio networks, in: 9th International Conference on Telecommunications Systems, Modelling and Analysis, Dallas, Texas, USA (March 2001) pp. 623–628.

  6. A. Capone and M. Trubian, Channel assignment problem in cellular systems: a new model and a tabu search algorithm, IEEE Transactions on Vehicular Technology VT-48(4) (1999) 1252–1260.

    Google Scholar 

  7. R. Montemanni, D.H. Smith and S.M. Allen, An ANTS algorithm for the minimum-span frequency assignment problem with multiple interference, IEEE Transactions on Vehicular Technology VT-51(5) (2002) 949–953.

    Google Scholar 

  8. J.S. Graham, Definition of a common formulation of military frequency assignment problems and the application of meta-heuristic algorithms, PhD thesis, University of Glamorgan, Wales, U.K., April 2005.

  9. L. Westbrook, Private communication.

  10. D.H. Smith, R.K. Taplin and S. Hurley, Frequency assignment with complex co-site constraints, IEEE Transactions on Electromagnetic Compatibility 43(2) (May 2001) 210–218.

    Article  Google Scholar 

  11. M. Duque-Anton, D. Kunz and B. Ruber, Channel assignment for cellular radio using simulated annealing, IEEE Transactions on Vehicular Technology VT-42(1) (1993) 14–21.

    Google Scholar 

  12. S. Hurley, D.H. Smith and S.U. Thiel, FASoft: A system for discrete channel frequency assignment, Radio Science 32(5) (1997) 1921–1939.

    Article  Google Scholar 

  13. L.M. Gambardella and M. Dorigo, Solving symmetric and asymmetric TSPs by ant colonies, in: IEEE Conference on Evolutionary Computation (ICEC96), Nagoya, Japan (1996) pp. 622– 627.

  14. M. Dorigo and G. Di Caro and L.M. Gambardella, Ant algorithms for discrete optimization, Artificial Life 5 (1999) 137– 172.

    Article  Google Scholar 

  15. S. Goss, S. Aron, J.-L. Doneubourg and J.M. Pasteels, Self-organized shortcuts in the Argentine ants, Naturwissenschaften 76 (1989) 579–581.

    Article  Google Scholar 

  16. W.J. Watkins, S. Hurley and D.H. Smith, Evaluation of models for area coverage, Tech. Rep. No. 98003, Cardiff University, Cardiff, Wales, U.K., December 1998.

  17. F. Glover, Heuristics for integer programming using surrogate constraints, Decision Sciences 8 (1977) 156–166.

    Article  Google Scholar 

  18. F. Glover, E. Taillard and D. de Werra, A user’s guide to tabu search, Annals of Operations Research 41 (1993) 3–28.

    Article  MATH  Google Scholar 

  19. R. Montemanni, J.N.J. Moon and D.H. Smith, An improved tabu search algorithm for the fixed spectrum frequency assignment problem, IEEE Transactions on Vehicular Technology VT-52(4) (2003) 891–901.

    Google Scholar 

  20. S.-W. Wang and S.S. Rappaport, Signal-to-interference calculations for balanced channel assignment patterns in cellular communications systems, IEEE Transactions on Communications COM-37(10) (1989) 1077–1087.

    Google Scholar 

  21. F.S. Roberts, T-colourings of graphs: recent results and open problems, Discrete Mathematics 93 (1991) 229–245.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Mathematics and Statistics, University of Glamorgan, Pontypridd, Mid Glamorgan, CF37 1DL, UK

    J. S. Graham & D. H. Smith

  2. Istituto Dalle Molle di Studi sull’Intelligenza Artificiale (IDSIA), Galleria 2, CH-6928, Manno, Switzerland

    R. Montemanni

  3. School of Computing, University of Glamorgan, Pontypridd, Mid Glamorgan, CF37 1DL, UK

    J. N. J. Moon

Authors
  1. J. S. Graham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Montemanni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. N. J. Moon
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. D. H. Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. H. Smith.

Additional information

James Graham has B.Sc. and Ph.D. degrees in Computing Mathematics from the University of Glamorgan, UK. His Ph.D. thesis is entitled “Definition of a Common Formulation of Military Frequency Assignment Problems and the Application of Meta-Heuristic Algorithms”.

Roberto Montemanni was born in Ravenna, Italy, in 1975. He received the “Laurea” degree in Computer Science from the University of Bologna, Italy, in 1999 and the Ph.D. in Mathematics from the University of Glamorgan, UK in 2002. Since November 2001 he has been a researcher at Istituto Dalle Molle di Studi sull’Intelligenza Artificiale (IDSIA), Lugano, Switzerland. His research activity covers optimization problems arising in radio frequency assignment, transportation and ad-hoc networks.

Jim Moon is a Senior Lecturer in Software Engineering at the University of Glamorgan. He has a B.Sc. in Computer Studies and a Ph.D. in Multi-Agent Systems in Marine Simulation, both from the University of Glamorgan. He also qualified as a Master Mariner in an earlier career, at sea. His research interests include radio frequency assignment, software engineering, Multi-Agent Systems and marine simulation.

Derek Smith is Professor of Mathematics at the University of Glamorgan, where he has worked since 1971. He has B.Sc. and Ph.D. degrees from the University of Southampton, UK and in October 2006 was awarded a D.Sc. degree from the University of Glamorgan, UK for his work on Combinatorial Mathematics applied to Radio Frequency Planning. His research interests include radio frequency assignment, graph theory, coding theory, data compression and network reliability studies.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Graham, J.S., Montemanni, R., Moon, J.N.J. et al. Frequency assignment, multiple interference and binary constraints. Wireless Netw 14, 449–464 (2008). https://doi.org/10.1007/s11276-006-0730-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-006-0730-x

Keywords

Search

Navigation