A WSN involves an ordinarily enormous number of sensor center points, in like manner called bits, passed on in the application circumstance. Bits are equipped with the specific sensors mentioned by the application, and gather information about nature, which is transmitted towards no less than one sink centers (in like manner called base stations). The aim of this research paper is the implementation of simulation models and the simulation of energy-efficient network initialization algorithms. First of all, it is presented a survey of state-of-the-art strategies for network initialization and exploration in wireless ad-hoc networks. Among the routing approaches presented in the survey it has been chosen the clustering-based approach due to it is the most suitable for ad-hoc sensor networks. Following are explained the features and properties of the clustering-based routing algorithms that have been selected for their implementation on this work. These implemented routing protocols are LEACH, TEEN, MODTEEN and APTEEN. On the other hand, all these routing protocols have been implemented and simulated using MATLAB Subsequently, all the protocols have been simulated with different parameters like Number of CHs, Number of Alive Nodes, Number of Dead Nodes, Number of packets to BS, packets to CH and conditions to prove their functionality and to find out their behavior in different sorts of sensor networks.