Recently, due to a variety of sensor network applications and the combination of heterogeneous sensor networks, requests for complicated data processing have been increasing. Many studies have also been conducted to efficiently process queries in large-scale sensor networks with multiple base stations. A query allocation scheme is a representative way to support large-scale sensor networks with multiple base stations. The existing schemes consider both the communication gains from sensor nodes that are overlapped with multiple queries and the distance between the region of each query and multiple base stations. It supports only snapshot region-based aggregation queries. However, continuous queries for sensor networks have usually different runtime and interval. Therefore, it is suitable to indentify the communication gains by the number of sensor nodes involved in the intersection region between allocated queries and a new query. In this paper, we propose a novel query allocation scheme that considers time parameters such as runtime and interval for the continuous query in large-scale sensor networks with multiple base stations. Each base station maintains regions, runtimes, and intervals for the allocated continuous queries. When a new continuous query occurs, its allocation is determined by estimating the actual number of shared readings with these information. Therefore, the proposed scheme improves the share of query allocation. The simulation results show that our scheme reduces the communication cost and improves the effectiveness of query allocation as regions and runtimes of queries are increased.