By Topic

An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Montemanni, R. ; Div. of Math., Univ. of Glamorgan, Mid Glamorgan, UK ; Smith, D.H. ; Allen, S.M.

The frequency-assignment problem is concerned with the assignment of discrete channels to the transmitters of a radio network. Separation of the frequencies assigned to transmitters is necessary to avoid interference. However, unnecessary separation causes an excess requirement for spectrum, the cost of which may be very high. The aim of the work is to minimize the frequency spectrum required for a given level of reception quality over the network. In contrast to the majority of the work presented in the literature, the model chosen to formalize the problem takes multiple interference into consideration. This should provide a better approximation of reality. The method proposed to solve this problem is an approximate nondeterministic tree search (ANTS) algorithm, which is a metaheuristic algorithm based on a computational paradigm inspired by the way real ant colonies function.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:51 ,  Issue: 5 )