A set
S of vertices in a graph
G is a dominating set of
G if every vertex not in
S is adjacent to a vertex in~
S. An independent dominating set in
G is a dominating set of
G with the additional property that it is an independent set. The domination number,
γ(G), and the independent domination number,
i(G), are the minimum cardinalities among all dominating sets and independent dominating sets in
G, respectively. By definition,
γ(G)≤i(G) for all graphs
G. Let
G be a connected cubic graph of order~
n. In 1996 Reed [Combin.\ Probab.\ Comput.\ 5 (1996), 277--295] proved a breakthrough result that
γ(G)≤83n. We prove the stronger result that if
G is different from
K3,3 and the
5-prism
C5□K2, then
i(G)≤83n. This proves a known conjecture. The bound is tight in the sense that there are infinite families of connected cubic graphs that achieve equality in this bound.