In a graph $G$, a vertex dominates itself and its neighbors. A subset $D \subseteq V(G)$ is a double dominating set of $G$ if $D$ dominates every vertex of $G$ at least twice. A signed graph $Σ= (G,σ)$ is a graph $G$ together with an assignment $σ$ of positive or negative signs to all its edges. A cycle in a signed graph is positive if the product of its edge signs is positive. A signed graph is balanced if all its cycles are positive. A subset $D \subseteq V(Σ)$ is a double dominating set of $Σ$ if it satisfies the following conditions: (i) $D$ is a double dominating set of $G$, and (ii) $Σ[D:V \setminus D]$ is balanced, where $Σ[D:V \setminus D]$ is the subgraph of $Σ$ induced by the edges of $Σ$ with one end point in $D$ and the other end point in $V \setminus D$. The cardinality of a minimum double dominating set of $Σ$ is the double domination number $γ_{\times 2}(Σ)$. In this paper, we give bounds for the double domination number of signed cubic graphs. We also obtain some bounds on the double domination number of signed generalized Petersen graphs and signed I-graphs.