Neighbour discovery is the determination of all nodes in the network that can communicate with a given node. Routing typically begins with neighbour discovery. Discovering neighbours should be both quick as well as energy efficient. Many algorithms which mostly work at a protocol level had been developed for neighbour discovery. Here a new method for neighbour node discovery that maximizes network lifetime is proposed. The basic idea accounts for clustering using Hausdorff distance and selecting wireless links having good link quality for routing packets .The nodes form clusters based on the Hausdorff distance .The clusters are formed only once but the role of cluster head is rotated among the cluster members .After cluster formation , the wireless link quality and minimum Hausdorff distance is checked for inter cluster communication. The link having better reliability is selected which minimizes the retransmissions and manages energy. Re-clustering is done when the energy of cluster head falls below particular threshold energy.