Existing algorithms using a beaconless strategy for geographic routing in Unit-Disk Graphs offer an approach for improving non-beaconless routing algorithms for Quasi-Unit-Disk Graphs. The majority of the aforementioned non-beaconlessrnrouting algorithms for Quasi-Unit-Disk Graphs are based on collecting 2-hop neighbourhood information. As shown by the Beaconless Clustering Algorithm developed in this thesis, a beaconless strategy can be used to enhance an existing non-beaconless algorithm by reducing message overhead and power consumption. The Beaconless Clustering algorithm is based on geographic clustering and constructs a sparse graph with constant number of vertices per unit area. The thesis at hand contains a detailed description of the algorithm, a proof of correctness and a simulation for presenting reachable improvements.