The crossing number of a graph G is the minimum number of crossings of its edges among the drawings of G in the plane and is denoted by cr(G). In this paper we obtain bounds for the crossing number for two different honeycomb tori namely, the honeycomb rectangular torus and the honeycomb rhombic torus which are obtained by adding wraparound edges to honeycomb meshes.