In this paper, we consider exponential synchronization of complex networks. The information diffusions between nodes are driven by properly defined events. By employing the M-matrix theory, algebraic graph theory and the Lyapunov method, two kinds of distributed event-triggering laws are designed, which avoid continuous communications between nodes. Then, several criteria that ensure the event-based exponential synchronization are presented, and the exponential convergence rates are obtained as well. Furthermore, we prove that Zeno behavior of the event-triggering laws can be excluded before synchronization being achieved, that is, the lower bounds of inter-event times are strictly positive. Finally, a simulation example is provided to illustrate the effectiveness of theoretical analysis.