Cooperative spectrum sensing plays an important role in cognitive radio networks since it improves the detection performance by exploiting spatial diversity. However, the cooperation among terminals also brings additional communication overhead. In this paper, overhead-throughput tradeoff issues are investigated in four scenarios namely (1) identical sensing channel and perfect reporting channel, (2) identical sensing channel and imperfect reporting channel, (3) different sensing channel and perfect reporting channel, (4) different sensing channel and imperfect reporting channel of each secondary user (SU). Taking the reporting overhead into consideration, a novel frame structure consisting of an initial subframe and M consecutive subframes, is proposed to maximize the achievable throughput of the secondary network. And for each scenario, the overhead-throughput tradeoff is formulated as an optimization problem with respect to the number of reporting SUs. A brute-force approach is then used to resolve such optimization problem. Given the optimal number of reporting SUs, a set of candidate SUs is then selected according to the probability of detection, the probability of false alarm and the probability of reporting error. Numerical results show that an optimal overhead-throughput tradeoff is achieved given the optimal number of reporting SUs. In addition, the probability of false alarm is shown to be the most important factor affecting the performance of achievable throughput within the secondary network because the lower probability of false alarm corresponds to the case that the secondary network can use the channel with a higher chance.