Methods for in-network joins of sensing data with tuples, in partitioned condition tables stored in sensor nodes, have been studied for efficient event detection. A recently proposed method performs the join operation after distributing the tuples of a condition table evenly among homogeneous sensor nodes with the same storage capacity. In the method, the condition table is horizontally partitioned, and each partition is allocated to the corresponding node, along the path from the highest level to the leaf level. If the path length is larger than the number of partitions, the second round distribution of the partitions resumes from the node at the next level, and so on. Thus, the last node at each round can be assigned the partition that is smaller than the others, which would otherwise cause wasted internal fragmentation. Further, little research has been conducted on methods for the cases of heterogeneous sensor nodes with different available spaces, as well as the vertical partitioning of condition table. In this study, we propose a method of partitioning a condition table that utilizes the internal fragmentation, by treating the tuples of a condition table as a circular list. The proposed method is applicable to the case in which nodes have different available spaces. Furthermore, a new method for vertically partitioning a condition table is suggested. Experiments verify the reduction in the data transmission amount offered by the proposed methods, as compared to existing methods.