In this paper, the performance of different localization algorithms are compared in the context of the sequential Wireless Sensor Network (WSN) discovery problem. Here, all sensor nodes are at unknown locations except for a very small number of so called anchor nodes at known locations. The locations of nodes are sequentially estimated such that when the location of a given node is found, it may be used to localize others. The underlying performance of such an approach is largely dependent upon the localization technique employed. In this paper, several well-known localization techniques are presented using a unified notation. These methods are time of arrival (TOA), time difference of arrival (TDOA), received signal strength (RSS), direction of arrival (DOA) and large aperture array (LAA) localization. The performance of a sequential network discovery process is then compared when using each of these localization algorithms. These algorithms are implemented in the Java-DSP software package as part of a localization toolbox.