This paper introduces the concepts of sufficient and necessary sets for distributed processing of probabilistic top-k queries in wireless sensor networks. It develops three algorithms - sufficient set-based, necessary set-based, and boundary-based - for intercluster query processing with bounded communication rounds to respond to dynamic data changes. It also develops an adaptive algorithm that switches between the three algorithms to minimize transmission costs. Experimental results show the proposed algorithms significantly reduce data transmissions with only small constant communication rounds, and the adaptive algorithm achieves near-optimal performance under various conditions.