Modelling of reconfigurable antenna using graph techniques

The analysis of reconfigurable antennas using graph techniques is presented in this paper. Since reconfigurable antennas can be viewed as group of self-organized components, graph theory rules were used to establish the relationships between the possible topologies and some corresponding electromagnetic property of the antenna such as frequency of operation, polarization and impedance. Reconfigurable antennas were classified into groups based on mechanism that alter their configurations. Optimization algorithms such as Dijkstras and Bellman-Ford were applied to determine the solution for the shortest path problem. The two algorithms were compared and results show that Bellman-Ford algorithm performed better for graph with less than 100 vertices.