Matching Algorithms is a visual tool for computing visibility graphs and apply bipartite matching algoritms for a set of mobile stations that needs to move from a start position to a destination. In a real situation stations move in a relatively open space where obstacles are present. Obstacles may obstruct the path of the base stations when moving from one position to the next.

This tool has been developed with other Authors as a research project at University of Catania.

Matching Algoritms is supported by StudioPigola on all editions of Windows 10.

REFERENCES

• 2011 S. Cristaldi, A. Ferro, R. Giugno, G. Pigola, A. Pulvirenti, “Obstacles Constrained Group Mobility Models in Event-Driven Wireless Networks with Movable Base Stations”, Ad Hoc Networks 9 (2011), pp. 400-417, DOI information: 10.1016/j.adhoc.2010.07.004
• 2006 A. Ferro, R. Giugno, M. Mongiovi’, G. Pigola, A. Pulvirenti, “Distributed Clustering and Closest-Match Motion Planning Algorithms for Wireless Ad-Hoc Networks with Movable Base Stations”, Med-Hoc-Net 2006, (pp. 53-59). Isbn/Issn: 88-902405-1-2