Using ant colony optimisation to improve the efficiency of small meander line RFID antennas

Marcus Randall; Andrew Lewis; Amir Galehdar; David V. Thiel

doi:10.1109/E-SCIENCE.2007.82

Using ant colony optimisation to improve the efficiency of small meander line RFID antennas

Marcus Randall^*, Andrew Lewis, Amir Galehdar, David V. Thiel

^*Corresponding author for this work

Bond Business School

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

19 Citations (Scopus)

Abstract

Increasing the efficiency of meander line antennas is an important real-world problem within radio frequency identification (RFID). Meta-heuristic search algorithms, such as ant colony optimisation, are very efficient at solving problems that require paths to be constructed. This search technique is adapted to solve the grid based path problem for meander line antennas and incorporates the NEC evaluation suite. The results for grid sizes up to 10 × 10 grid indicates that ant colony optimisation is extremely effective at this real-world problem.

Original language	English
Title of host publication	Proceedings - e-Science 2007, 3rd IEEE International Conference on e-Science and Grid Computing
Pages	345-351
Number of pages	7
DOIs	https://doi.org/10.1109/E-SCIENCE.2007.82
Publication status	Published - 2007
Event	E-Science 2007, 3rd IEEE International Conference on E-Science and Grid Computing - Bangalore, India Duration: 10 Dec 2007 → 13 Dec 2007

Conference

Conference	E-Science 2007, 3rd IEEE International Conference on E-Science and Grid Computing
Country/Territory	India
City	Bangalore
Period	10/12/07 → 13/12/07

Access to Document

10.1109/E-SCIENCE.2007.82

Cite this

@inproceedings{724deb38aa584c80aa751288b96692d0,

title = "Using ant colony optimisation to improve the efficiency of small meander line RFID antennas",

abstract = "Increasing the efficiency of meander line antennas is an important real-world problem within radio frequency identification (RFID). Meta-heuristic search algorithms, such as ant colony optimisation, are very efficient at solving problems that require paths to be constructed. This search technique is adapted to solve the grid based path problem for meander line antennas and incorporates the NEC evaluation suite. The results for grid sizes up to 10 × 10 grid indicates that ant colony optimisation is extremely effective at this real-world problem.",

author = "Marcus Randall and Andrew Lewis and Amir Galehdar and Thiel, {David V.}",

year = "2007",

doi = "10.1109/E-SCIENCE.2007.82",

language = "English",

isbn = "0769530648",

pages = "345--351",

booktitle = "Proceedings - e-Science 2007, 3rd IEEE International Conference on e-Science and Grid Computing",

note = "E-Science 2007, 3rd IEEE International Conference on E-Science and Grid Computing ; Conference date: 10-12-2007 Through 13-12-2007",

}

Randall, M, Lewis, A, Galehdar, A & Thiel, DV 2007, Using ant colony optimisation to improve the efficiency of small meander line RFID antennas. in Proceedings - e-Science 2007, 3rd IEEE International Conference on e-Science and Grid Computing., 4426906, pp. 345-351, E-Science 2007, 3rd IEEE International Conference on E-Science and Grid Computing, Bangalore, India, 10/12/07. https://doi.org/10.1109/E-SCIENCE.2007.82

Using ant colony optimisation to improve the efficiency of small meander line RFID antennas. / Randall, Marcus; Lewis, Andrew; Galehdar, Amir et al.
Proceedings - e-Science 2007, 3rd IEEE International Conference on e-Science and Grid Computing. 2007. p. 345-351 4426906.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

TY - GEN

T1 - Using ant colony optimisation to improve the efficiency of small meander line RFID antennas

AU - Randall, Marcus

AU - Lewis, Andrew

AU - Galehdar, Amir

AU - Thiel, David V.

PY - 2007

Y1 - 2007

N2 - Increasing the efficiency of meander line antennas is an important real-world problem within radio frequency identification (RFID). Meta-heuristic search algorithms, such as ant colony optimisation, are very efficient at solving problems that require paths to be constructed. This search technique is adapted to solve the grid based path problem for meander line antennas and incorporates the NEC evaluation suite. The results for grid sizes up to 10 × 10 grid indicates that ant colony optimisation is extremely effective at this real-world problem.

AB - Increasing the efficiency of meander line antennas is an important real-world problem within radio frequency identification (RFID). Meta-heuristic search algorithms, such as ant colony optimisation, are very efficient at solving problems that require paths to be constructed. This search technique is adapted to solve the grid based path problem for meander line antennas and incorporates the NEC evaluation suite. The results for grid sizes up to 10 × 10 grid indicates that ant colony optimisation is extremely effective at this real-world problem.

UR - http://www.scopus.com/inward/record.url?scp=44949100209&partnerID=8YFLogxK

U2 - 10.1109/E-SCIENCE.2007.82

DO - 10.1109/E-SCIENCE.2007.82

M3 - Conference contribution

AN - SCOPUS:44949100209

SN - 0769530648

SN - 9780769530642

SP - 345

EP - 351

BT - Proceedings - e-Science 2007, 3rd IEEE International Conference on e-Science and Grid Computing

T2 - E-Science 2007, 3rd IEEE International Conference on E-Science and Grid Computing

Y2 - 10 December 2007 through 13 December 2007

ER -

Using ant colony optimisation to improve the efficiency of small meander line RFID antennas

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this